A Nonintersecting Multipath Routing Protocol for Wireless Sensor Networks

Due to constrained resources, stable and reliable routing protocols have always been a research focus in sensor networks. In order to improve network stability, based on the breadth-first search, this paper proposes a non-intersecting multi-path routing algorithm based on the breadth-first search. The proposed algorithm constructs two disjoint paths transmitting the data collected by sensing nodes to sink node to improve the reliability of the routing protocol, which can well solve common-link problem and/or the common-node problem in multipath routing protocols. Moreover, this algorithm can also be easily applied to multi-sink node network and be extended to multi-path routing (more than two non-intersecting paths). The experiments in this study show that the packet loss rate of the algorithm does not increase when the number of network nodes increases. In addition, this algorithm can significantly reduce the average routing length and improve routing reliability in multi-sink node networks.

[1]  Tohru Kikuno,et al.  A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.

[2]  Marwan Krunz,et al.  Linear time distributed construction of colored trees for disjoint multipath routing , 2007, Comput. Networks.

[3]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[4]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

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

[6]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[8]  Preetha Thulasiraman,et al.  WSN18-3: Disjoint Multipath Routing in Dual Homing Networks using Colored Trees , 2006, IEEE Globecom 2006.

[9]  Nachum Shacham,et al.  A distributed algorithm for finding shortest pairs of disjoint paths , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Nachum Shacham,et al.  Distributed algorithms for computing shortest pairs of disjoint paths , 1993, IEEE Trans. Inf. Theory.

[11]  Li Jian-Zhong,et al.  Concepts, Issues and Advance of Sensor Networks and Data Management of Sensor Networks , 2003 .

[12]  Ramesh Bhandari,et al.  Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[13]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[14]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[15]  Abhimanyu Das,et al.  Data acquisition in multiple-sink sensor networks , 2005, MOCO.

[16]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, SIGCOMM '91.

[17]  Shivakant Mishra,et al.  Enhancing Base Station Security in Wireless Sensor Networks , 2003 .

[18]  He Li,et al.  Fault-tolerant topology control for heterogeneous wireless sensor networks using Multi-Routing Tree , 2017, 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM).

[19]  R. Jayanthi,et al.  ENHANCING BASE STATION SECURITY IN WIRELESS SENSOR NETWORKS , 2017 .

[20]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[21]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[22]  Preetha Thulasiraman,et al.  Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.