Matrix Routing -- An Interference Range Insensitive Routing Protocol for Wireless Sensor Networks

Interference ranges can dramatically affect the throughput in wireless sensor networks. While the transmission range defines the maximum physical range of a radio signal the interference range determines the area in which other nodes will be prevented from successful receiving or transmitting signals. In this paper we present an initial self organizing routing protocol for wireless sensor networks, named Matrix Routing, which is maximally insensitive even to high interference disturbances. Matrix routing is predictable, proactive but not table driven, needs minimum hardware and computational power and does not require transmission of routing packets. The protocol is characterized by zero overhearing costs and minimal idle listening. The paper shows a proof of concept, evaluates potential of our algorithm and discusses strength, limitations and application areas.

[1]  Songwu Lu,et al.  A scalable solution to minimum cost forwarding in large sensor networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[2]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[3]  Wendi B. Heinzelman,et al.  Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks , 2002, Wirel. Networks.

[4]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[5]  Chenyang Lu,et al.  SPEED: A Real-Time Routing Protocol for Sensor Networks , 2002 .

[6]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[7]  Minglu Li,et al.  An Interference Graph Based MAC Protocol for Ad Hoc Wireless Networks , 2006, The Sixth IEEE International Conference on Computer and Information Technology (CIT'06).

[8]  Ying Zhang,et al.  Adaptive tree: a learning-based meta-routing strategy for sensor networks , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[9]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[10]  Ying Zhang,et al.  Constrained flooding: a robust and efficient routing framework for wireless sensor networks , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[11]  Yanghee Choi,et al.  Data dissemination over wireless sensor networks , 2004, IEEE Communications Letters.

[12]  N. Sadagopan,et al.  The ACQUIRE mechanism for efficient querying in sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[13]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[14]  Fumiyuki Adachi,et al.  Time division multiple access methods for wireless personal communications , 1995, IEEE Commun. Mag..

[15]  Mario Gerla,et al.  Effectiveness of RTS/CTS handshake in IEEE 802.11 based ad hoc networks , 2003, Ad Hoc Networks.

[16]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[17]  Bharadwaj Veeravalli,et al.  A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments , 2007, IEEE Transactions on Parallel and Distributed Systems.

[18]  Anura P. Jayasumana,et al.  Effect of hidden terminals on the performance of IEEE 802.11 MAC protocol , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[19]  G. Simon,et al.  Simulation-based optimization of communication protocols for large-scale wireless sensor networks , 2003, 2003 IEEE Aerospace Conference Proceedings (Cat. No.03TH8652).

[20]  Holger Karl,et al.  Using energy where it counts: protecting important messages in the link layer , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[21]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.