Chaotic Routing: A Set-based Broadcasting Routing Framework for Wireless Sensor Networks

Data communication in wireless sensor networks (WSNs) exhibits distinctive characteristics. Routing in WSNs still relies on simple variations of traditional distance vector or link state based protocols, thus suffering low throughput and less robustness. Drawing intuitions from the Brownian motions where localized momentum exchanges enable global energy diffusion, we propose an innovative routing protocol, chaotic routing (CR), which achieves efficient information diffusion with seemingly chaotic local information exchanges. Leveraging emerging networking concepts such as potential based routing, opportunistic routing and network coding, CR improves throughput via accurate routing cost estimation, opportunistic data forwarding and localized node scheduling optimizing information propagation in mesh structures. Through extensive simulations, we prove that CR outperforms, in terms of throughput, best deterministic routing scheme (i.e. best path routing) by a factor of around 300% and beats the best opportunistic routing scheme (i.e. MORE) by a factor of around 200%. CR shows stable performance over wide range of network densities, link qualities and batch sizes.

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

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

[3]  Sani R. Nassif,et al.  Power grid analysis using random walks , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[5]  Bhaskar Krishnamachari,et al.  Delay efficient sleep scheduling in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[8]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[9]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[10]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[11]  Relaxation Methods for Boundary Value Problems , 2022 .

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

[13]  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).