kth.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Rapid convergecast on commodity hardware: Performance limits and optimal policies
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
Visa övriga samt affilieringar
2010 (Engelska)Ingår i: SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, 2010, Vol. Mesh and Ad Hoc Communications and NetworksKonferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The increased industrial interest in wireless sensor networks demands a shift from optimizing protocols for reporting sporadic events, to solutions for high-rate data collection and dissemination. We study time-optimal convergecast under the communication constraints of commodity sensor network platforms. We propose a novel convergecast model in which packet copying between the microcontroller and the radio transceiver is separated from packet transmission, thereby improving channel utilization and system throughput. Based on this model, we establish the tight lower bound on the number of time slots for convergecast in networks with tree routing topology, and present both centralized and distributed algorithms for computing time-optimal convergecast schedules. Our scheme is memory-efficient as each node buffers at most one packet at any time. We evaluate our scheme in simulation and on real hardware, and show that our scheme can achieve a throughput of 203 kbit/s (86.4% of the theoretical upper bound): up to 86.24 % improvement compared with traditional TDMA-based convergecast. With an optimal routing tree and the maximum MAC layer payload, convergecast in a network with 20 sensor nodes can be completed in only 100ms.

Ort, förlag, år, upplaga, sidor
2010. Vol. Mesh and Ad Hoc Communications and Networks
Nyckelord [en]
Channel utilization, Commodity hardware, Communication constraints, Computing time, Convergecast, Data collection, Distributed algorithm, High rate, In-network, Lower bounds, MAC layer, Optimal policies, Optimal routing, Packet transmissions, Performance limits, Radio transceivers, System throughput, Time slots, Time-optimal, Tree routing, Upper Bound, Ad hoc networks, Communication, Computation theory, MESH networking, Optimization, Radio broadcasting, Radio transmission, Sensor networks, Sensor nodes, Telecommunication equipment, Time division multiple access, Wireless sensor networks
Nationell ämneskategori
Beräkningsmatematik
Identifikatorer
URN: urn:nbn:se:kth:diva-28493DOI: 10.1109/SECON.2010.5508233Scopus ID: 2-s2.0-77955114854ISBN: 9781424471515 (tryckt)OAI: oai:DiVA.org:kth-28493DiVA, id: diva2:390164
Konferens
7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010; Boston
Anmärkning
QC 20110121Tillgänglig från: 2011-01-21 Skapad: 2011-01-14 Senast uppdaterad: 2024-03-15Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Johansson, Mikael

Sök vidare i DiVA

Av författaren/redaktören
Zhang, HaiboSoldati, PabloJohansson, Mikael
Av organisationen
Reglerteknik
Beräkningsmatematik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 61 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf