Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Authors:
Wen-Zhan Song;Fenghua Yuan;Richard LaHusen;Behrooz Shirazi
Affiliations:
Sensorweb Research Laboratory, Washington State University, Vancouver, WA, USA;Sensorweb Research Laboratory, Washington State University, Vancouver, WA, USA;Cascades Volcano Observatory, US Geological Survey, Vancouver, WA, USA;Sensorweb Research Laboratory, Washington State University, Vancouver, WA, USA
Venue:
International Journal of Parallel, Emergent and Distributed Systems
Year:
2007

Citing 12
Cited 0

Many-to-one packet routing on grids

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Scheduling time-constrained communication in linear networks

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
RNG and internal node based broadcasting algorithms for wireless one-to-one networks

ACM SIGMOBILE Mobile Computing and Communications Review
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria

SIAM Journal on Computing
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)

SIAM Journal on Computing
ESRT: event-to-sink reliable transport in wireless sensor networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Fine-grained network time synchronization using reference broadcasts

ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Lightweight time synchronization for sensor networks

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Timing-sync protocol for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient collision-free medium access control for wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Congestion control and fairness for many-to-one routing in sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Competitive routing of virtual circuits in ATM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted] , N(u0) - 1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.