A scalable solution to minimum cost forwarding in large sensor networks

Abstract

Wireless sensor networks offer a wide range of challenges to networking research, including unconstrained network scale, limited computing, memory and energy resources, and wireless channel errors. In this paper, we study the problem of delivering messages from any sensor to an interested client user along the minimum-cost path in a large sensor network. We propose a new cost field based approach to minimum cost forwarding. In the design, we present a novel backoff-based cost field setup algorithm that finds the optimal costs of all nodes to the sink with one single message overhead at each node. Once the field is established, the message, carrying dynamic cost information, flows along the minimum cost path in the cost field. Each intermediate node forwards the message only if it finds itself to be on the optimal path, based on dynamic cost states. Our design does not require an intermediate node to maintain explicit “forwarding path” states. It requires a few simple operations and scales to any network size. We show the correctness and effectiveness of the design by both simulations and analysis.

DOI: 10.1109/ICCCN.2001.956276

Extracted Key Phrases

7 Figures and Tables

02040'03'05'07'09'11'13'15'17
Citations per Year

393 Citations

Semantic Scholar estimates that this publication has 393 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Ye2001ASS, title={A scalable solution to minimum cost forwarding in large sensor networks}, author={Fan Ye and Alvin Chen and Songwu Lu and Lixia Zhang}, booktitle={ICCCN}, year={2001} }