Change search
ReferencesLink to record
Permanent link

Direct link
Rapid convergecast on commodity hardware: Performance limits and optimal policies
KTH, School of Electrical Engineering (EES), Automatic Control.
KTH, School of Electrical Engineering (EES), Automatic Control.
Show others and affiliations
2010 (English)In: SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, 2010, Vol. Mesh and Ad Hoc Communications and NetworksConference paper (Refereed)
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.

Place, publisher, year, edition, pages
2010. Vol. Mesh and Ad Hoc Communications and Networks
Keyword [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
National Category
Computational Mathematics
URN: urn:nbn:se:kth:diva-28493DOI: 10.1109/SECON.2010.5508233ScopusID: 2-s2.0-77955114854ISBN: 9781424471515OAI: diva2:390164
7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010; Boston
QC 20110121Available from: 2011-01-21 Created: 2011-01-14 Last updated: 2011-01-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Zhang, HaiboSoldati, PabloJohansson, Mikael
By organisation
Automatic Control
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link