Optimal candidate set for opportunistic routing in asynchronous wireless sensor networks

Abstract

In asynchronous wireless sensor networks, finding an optimal candidate set can significantly improve the efficiency of an opportunistic routing protocol by balancing the one-hop cost from a sender to a relay and the remaining cost from the relay to the sink. A larger candidate set indicates smaller one-hop waiting cost to wait for a candidate to wake up… (More)
DOI: 10.1109/ICCCN.2014.6911799

Topics

6 Figures and Tables

Cite this paper

@article{Zhang2014OptimalCS, title={Optimal candidate set for opportunistic routing in asynchronous wireless sensor networks}, author={Xinming Zhang and Fan Yan and Lei Tao and Dan Keun Sung}, journal={2014 23rd International Conference on Computer Communication and Networks (ICCCN)}, year={2014}, pages={1-8} }