Sciweavers

Share
SAINT
2008
IEEE

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

8 years 8 months ago
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.
Monty Beuster, Michael Beigl, Daniel Röhr, Ti
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where SAINT
Authors Monty Beuster, Michael Beigl, Daniel Röhr, Till Riedel, Christian Decker, Martin Berchtold
Comments (0)
books