Delay-Aware routing protocol for time-critical wireless sensor networks
Corressponding author's email:
tandd@hcmute.edu.vnKeywords:
routing protocols, wireless sensor networks, congestion control, network throughput, packet delayAbstract
In this paper, we propose a distributed traffic-balancing routing protocol for large-scale wireless sensor networks to distribute traffic from sources to sinks effectively by utilizing the number of hops and the current queue size at one- and two-hop next neighbors to make routing decisions. Specifically, each node has a gradient field deciding a neighbor node to reach a sink. The gradient index of each node contains the distance cost from a source to a respective sink and traffic information from neighbor nodes. The presented algorithm considers the traffic of surrounding neighbors before forwarding packets to any sink using gradient search for routing in balance between optimal paths and possible congestion on the routes towards those sinks. This method leads to a trade-off between shortest paths and packet delay which is caused by congestion at overloaded nodes. Simulation results show that the proposed scheme effectively reduces the overall packet delay and improves throughput ratio with heavy traffic.
Downloads: 0
References
C. Sergiou, P. Antoniou, and V. Vassiliou, “A comprehensive survey of congestion control protocols in wireless sensor networks,” IEEE Communications Surveys Tutorials, vol. 16, no. 4, pp. 1839–1859, 2014.
K. Singh, K. Singh, L. H. Son, and A. Aziz, “Congestion control in wireless sensor networks by hybrid multi-objective optimization algorithm,” Computer Networks, vol. 138, pp. 90 – 107, 2018.
J. Al-Karaki and A. Kamal, “Routing techniques in wireless sensor networks: a survey,” IEEE Wireless Communications, vol. 11, no. 6, pp. 6 – 28, dec. 2004.
A. Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Boloni, and D. Turgut, “Routing protocols in ad hoc networks: A survey,” Computer Networks, vol. 55, no. 13, pp. 3032 – 3080, 2011.
S. Misra and S. Goswami, Network Routing: Fundamentals, Applica- tions, and Emerging Technologies. John Wiley & Sons Ltd., 2017.
H. Yoo, M. Shim, D. Kim, and K. H. Kim, “Global: A gradient- based routing protocol for load-balancing in large-scale wireless sensor networks with multiple sinks,” in IEEE Symposium on Computers and Communications (ISCC), june 2010, pp. 556 –562.
V. Shah-Mansouri, A.-H. Mohsenian-Rad, and V. Wong, “Lexicographi- cally optimal routing for wireless sensor networks with multiple sinks,” IEEE Transactions on Vehicular Technology, vol. 58, no. 3, pp. 1490–1500, march 2009.
I. Slama, B. Jouaber, and D. Zeghlache, “Energy efficient scheme for large scale wireless sensor networks with multiple sinks,” in Wireless Communications and Networking Conference, april 2008, pp. 2367 – 2372.
N. Q. Dinh, T. D. Hoa, and D.-S. Kim, “Distributed traffic aware routing with multiple sinks in wireless sensor networks,” in 9th IEEE International Conference on Industrial Informatics (INDIN), july 2011, pp. 404 –409.
C. yih Wan and S. B. Eisenman, “CODA: Congestion detection and avoidance in sensor networks.” ACM Press, 2003, pp. 266–279.
S. Chen and N. Yang, “Congestion avoidance based on lightweight buffer management in sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 9, pp. 934 –946, sept. 2006.
A. Basu, A. Lin, and S. Ramanathan, “Routing using potentials: a dynamic traffic-aware routing algorithm,” in Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, ser. SIGCOMM ’03, 2003, pp. 37–48.
F. Ren, T. He, S. Das, and C. Lin, “Traffic-aware dynamic routing to alleviate congestion in wireless sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 9, pp. 1585 –1599, sept. 2011.
C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed diffusion for wireless sensor networking,” IEEE/ACM Trans- actions on Networking, vol. 11, no. 1, pp. 2 – 16, feb 2003.
C. Schurgers and M. Srivastava, “Energy efficient routing in wireless sensor networks,” in IEEE Military Communications Conference, 2001. Communications for Network-Centric Operations: Creating the Information Force, vol. 1, 2001, pp. 357 – 361.
E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959.
Downloads
Published
How to Cite
Issue
Section
Categories
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright © JTE.
