Predict the Multi-hop Reliability for Receiver-Contention Based Routing in Dynamic Link Networks

We consider dynamic link networks(DLN), where nodes are static, but the links are highly dynamic. Reliable multi-hop communication is critical in such networks, which inspires receiver contention routing, which elects relays from actual receivers to overcome link dynamics. However, in previous studies of receiver contention routing protocols, the multi-hop reliability is lack of deep understanding, because the randomness and redundancy in the multi-hop packet forwarding process are hard to model. We propose RECORD protocol to control the randomness and redundant packet for receiver contention, which is carried out by designing sector-shape forwarding zone, prioritized CTS, and contention clearing scheme. For symmetric link DLNs, RECORD can guarantee multi-hop unique-path routing, which enables a Markov Chain model to the multi-hop forwarding process. The multi-hop reliability is predicted by analyzing the stable status of the Markov chain. Particularly, when positions of all sensors are known, the multi-hop reliability of RECORD has close-form formula; when node positions are unknown, recursive upper bound and lower bound are derived. Further, RECORD is implemented distributively by both simulation and in real sensor networks. Extensive evaluations validate the analytical results.

[1]  Michele Zorzi,et al.  Geographic forwarding and adaptive load balancing in wireless sensor networks , 2007, MOCO.

[2]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[3]  Ahmed Helmy,et al.  Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks , 2004, SenSys '04.

[4]  Neal Patwari,et al.  Correlated link shadow fading in multi-hop wireless networks , 2008, IEEE Transactions on Wireless Communications.

[5]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[6]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[7]  David E. Culler,et al.  Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.

[8]  Catherine Rosenberg,et al.  Understanding the key performance issues with MAC protocols for multi-hop wireless networks: Research Articles , 2006 .

[9]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[10]  Sang Hyuk Son,et al.  IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks , 2003 .

[11]  G. Mazzini,et al.  M-GERAF: A reliable random forwarding geographic routing protocol in multisink Ad hoc and sensor networks , 2007, 2007 International Symposium on Intelligent Signal Processing and Communication Systems.

[12]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[13]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..

[14]  Laura Galluccio,et al.  MACRO: an integrated MAC/routing protocol for geographic forwarding in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[16]  Hai Zhao,et al.  A Reliable Multi-path Routing Protocol in Wireless Sensor Network Design and Implementation , 2009, 2009 Ninth International Conference on Hybrid Intelligent Systems.

[17]  Jianliang Xu,et al.  PSGR: priority-based stateless geo-routing in wireless sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..