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.

• Type: Conference
• Year: 2008
• Where: SAINT
• Authors: Monty Beuster, Michael Beigl, Daniel Röhr, Till Riedel, Christian Decker, Martin Berchtold
• Keywords: Interference Range, Internet Technology, Matrix Routing, SAINT 2008, Wireless Sensor Networks