On maximizing the throughput of convergecast in wireless sensor networks

Authors:
Nai-Luen Lai;Chung-Ta King;Chun-Han Lin
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan
Venue:
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Year:
2008

Citing 12
Cited 3

A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Energy-efficient collision-free medium access control for wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Flexible power scheduling for sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Dynamic load balancing for position-based routing

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Z-MAC: a hybrid MAC for wireless sensor networks

Proceedings of the 3rd international conference on Embedded networked sensor systems
Funneling-MAC: a localized, sink-oriented MAC for boosting fidelity in sensor networks

Proceedings of the 4th international conference on Embedded networked sensor systems
Wave scheduling and routing in sensor networks

ACM Transactions on Sensor Networks (TOSN)
A TDMA scheduling scheme for many-to-one communications in wireless sensor networks

Computer Communications
Minimum data aggregation time problem in wireless sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks

Multichannel scheduling and spanning trees: throughput-delay tradeoff for fast data collection in sensor networks

IEEE/ACM Transactions on Networking (TON)
A scalable joint routing and scheduling scheme for large-scale wireless sensor networks

Ad Hoc Networks
Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A primary task of wireless sensor networks is collecting environmental information. In most cases, a sink node is responsible for collecting data from all sensor nodes. The radio congestion around the sink becomes the main bottleneck to maximizing the throughput of the convergecast. A general strategy to alleviating the problem is to schedule the communications among sensors to avoid interference. In this paper, we consider both routing structures and communication schedules for optimizing the scheduling length. We show that the shortest-length conflict-free scheduling is equivalent to finding a minimal vertex coloring. To solve the schedule problem, a virtual-node expansion is proposed to handle the relay operations in convergecast, and then coloring algorithms are used to obtain the communication schedule. However, scheduling only solves part of the problem. Routing structures will also affect the scheduling quality. The disjoint-strips routing is thus proposed to leverage possible parallel transmissions in convergecast. The proposed algorithms are evaluated through simulations.