DISTRIBUTED MULTI-HOP ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORKS

Morteza Mohammadi Zanjireh, Jaafar Gadban

DOI Number
10.2298/FUEE2004617M
First page
617
Last page
630

Abstract


In a Wireless Sensor Network (WSN), routing is the process of finding a cost-effective route in terms of power consumption. As an evaluation criterion for the WSN performance, network lifetime is directly affected by the routing method. In a wide variety of WSNs, different techniques are used as routing methods, such as shortest distance path. In this paper, we propose a novel algorithm, optimizing power consumption in WSN nodes, based on the shortest path algorithm. In this approach, the energy level of nodes and their geographical distance from each other contribute to the weight of the connecting path. The proposed algorithm is used as a data dissemination method in WSNs with randomly scattered nodes. We also apply Dijkstra’s shortest path algorithm to the same networks. The results showed that the proposed algorithm increases the network lifetime up to 30 % by preventing nodes with low charge levels from early disconnection.

Keywords

wireless sensor network, routing, network lifetime, Dijkstra’s algorithm

Full Text:

PDF

References


A. Djedouboum, A. Abba Ari, A. Gueroui, A. Mohamadou, and Z. Aliouat, “Big Data Collection in Large-Scale Wireless Sensor Networks,” Sensors, vol. 18, no. 12, p. 4474, 2018.

V. Mythili, A. Suresh, M. M. Devasagayam, and R. Dhanasekaran, “SEAT-DSR: Spatial and Energy Aware Trusted Dynamic Distance Source Routing Algorithm for Secure Data Communications in Wireless Sensor Networks,” Cogn. Syst. Res., 2019.

B. Xi-Rong, Q. Zhi-Tao, Z. Xue-Feng, and Z. Shi, “An efficient energy cluster-based routing protocol for wireless sensor networks,” In Proceedings of the 2009 Chinese Control and Decision Conference, 2009, pp. 4716–4721.

M. M. Zanjireh and H. Larijani, “Analytical modelling of the A-ANCH clustering algorithm for WSNs,” In Proceedings of the 2015 Seventh International Conference on Ubiquitous and Future Networks, 2015, pp. 429–434.

M. M. Zanjireh and H. Larijani, “A survey on centralised and distributed clustering routing algorithms for WSNs,” In Proceedings of the 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), 2015, pp. 1–6.

M. M. Zanjireh, H. Larijani, and W. O. Popoola, “Energy Based Analytical Modelling of ANCH Clustering Algorithm for Wireless Sensor Networks,” Int. J. Adv. Networks Serv., vol. 7, no. 3/4, 2014.

M. M. Zanjireh, H. Larijani, and W. O. Popoola, “Activity-aware clustering algorithm for wireless sensor networks,” In Proceedings of the 2014 9th International Symposium on Communication Systems, Networks & Digital Sign (CSNDSP), 2014, pp. 122–127.

M. M. Zanjireh, A. Shahrabi, and H. Larijani, “Anch: A new clustering algorithm for wireless sensor networks,” In Proceedings of the 2013 27th International Conference on Advanced Information Networking and Applications Workshops, 2013, pp. 450–455.

A. Kumar, H. Y. Shwe, K. J. Wong, and P. H. Chong, “Location-based routing protocols for wireless sensor networks: A survey,” Wirel. Sens. Netw., vol. 9, no. 1, pp. 25–72, 2017.

S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, “A distance routing effect algorithm for mobility (DREAM),” In Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, 1998, pp. 76–84.

K. Maraiya, K. Kant, and N. Gupta, “Application based study on wireless sensor network,” Int. J. Comput. Appl., vol. 21, no. 8, pp. 9–15, 2011.

M. R. Ahmed, X. Huang, D. Sharma, and H. Cui, “Wireless sensor network: characteristics and architectures,” Int. J. Inf. Commun. Eng., vol. 6, no. 12, pp. 1398–1401, 2012.

C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” ACM SIGCOMM Comput. Commun. Rev., vol. 24, no. 4, pp. 234–244, 1994.

Z. Zhu and S. H. Yang, “A possible hardware architecture of wireless sensor nodes,” In Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics, 2006, pp. 3377–3381.

M. Singh and V. K. Prasanna, “Optimal energy-balanced algorithm for selection in a single hop sensor network,” In Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003, pp. 9–18.

M. Ilyas and I. Mahgoub, Handbook of sensor networks: compact wireless and wired sensing systems. 2004.

S. Saranya and M. Princy, “Routing Techniques in Sensor Network–A Survey,” Procedia Eng., vol. 38, pp. 2739–2747, 2012.

I. Dietrich and F. Dressler, “On the lifetime of wireless sensor networks,” ACM Trans. Sens. Networks, vol. 5, no. 1, 2009.

A. Kumar and S. Pahuja, “A Comparative Study of Flooding Protocol and Gossiping Protocol in WSN,” Int. J. Comput. Technol. Appl., vol. 5, no. 2, pp. 797–800, 2014.

P. Kumarawadu, D. J. Dechene, M. Luccini, and A. Sauer, “Algorithms for node clustering in wireless sensor networks: A survey,” In Proceedings of the 2008 4th International Conference on Information and Automation for Sustainability, 2008, pp. 295–300.

Q. Zhang, R. H. Jacobsen, and T. S. Toftegaard, “Bio-inspired low-complexity clustering in large-scale dense wireless sensor networks,” In Proceedings of the 2012 IEEE Global Communications Conference (GLOBECOM), 2102, pp. 658–663.

J. N. Al-Karaki and A. E. Kamal, “Routing techniques in wireless sensor networks: a survey,” IEEE Wirel. Commun., vol. 11, no. 6, pp. 6–28, 2004.

E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math., vol. 1, no. 1, pp. 269–271, 1959.

O. Yilmaz, S. Demirci, Y. Kaymak, S. Ergun, and A. Yildirim, “Shortest hop multipath algorithm for wireless sensor networks,” Comput. Math. with Appl., vol. 61, no. 1, pp. 48–59, 2012.

O. Younis, M. Krunz, and S. Ramasubramanian, “Location-unaware coverage in wireless sensor networks,” Ad Hoc Networks, vol. 6, no. 7, pp. 1078–1097, 2008.

X. Chen and P. Yu, “Research on hierarchical mobile wireless sensor network architecture with mobile sensor nodes,” In Proceedings of the 2010 3rd International Conference on Biomedical Engineering and Informatics, 2010, pp. 2863–2867.

S. Fedor and M. Collier, “On the problem of energy efficiency of multi-hop vs one-hop routing in wireless sensor networks,” In Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW’07), 2007, pp. 380–385.

R. Aggarwal, A. Mittal, and R. Kaur, “Hierarchical Routing Techniques for Wireless Sensor Networks: A Comprehensive Survey,” Int. J. Futur. Gener. Commun. Netw., vol. 9, no. 7, pp. 101–112, 2016.

D. Bhattacharyya, T. H. Kim, and S. Pal, “A comparative study of wireless sensor networks and their routing protocols,” Sensors, vol. 10, no. 12, pp. 10506–10523, 2010.

V. Kumar, S. B. Dhok, R. Tripathi, and S. Tiwari, “A review study of hierarchical clustering algorithms for wireless sensor networks,” Int. J. Comput. Sci. Issues, vol. 11, no. 3, p. 92, 2014.

S. P. Singh and S. C. Sharma, “A survey on cluster based routing protocols in wireless sensor networks,” Procedia Comput. Sci., vol. 45, pp. 687–695, 2015.

M. Abdullah and A. Ehsan, “Routing protocols for wireless sensor networks: classifications and challenges,” in Journal of Electronics and Communication Engineering Research, Dec. 2014, vol. 2, pp. 5–15.

M. Ullah and W. Ahmad, “Evaluation of routing protocols in wireless sensor networks,” Blekinge Institute of Technology. Karlshamn, Blekinge, Sweden., 2009.

X. Hou, D. Tipper, and S. Wu, “A gossip-based energy conservation protocol for wireless ad hoc and sensor networks,” J. Netw. Syst. Manag., vol. 14, no. 3, pp. 381–414, 2006.

B. Karp and H. T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in In Proceedings of the 6th annual international conference on Mobile computing and networking, 2000, pp. 243–254.

C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” In Proceedings of the WMCSA’99. Second IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90–100.

I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Comput. networks, vol. 38, no. 4, pp. 393–422, 2002.

J. Kulik, W. Heinzelman, and H. Balakrishnan, “Negotiation-based protocols for disseminating information in wireless sensor networks,” Wirel. networks, vol. 8, no. 2/3, pp. 169–185, 2002.

C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed diffusion: A scalable and robust communication paradigm for sensor networks,” In Proceedings of the 6th annual international conference on Mobile computing and networking, 2000, pp. 56–67.

D. Braginsky and D. Estrin, “Rumor routing algorthim for sensor networks,” In Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, 2002, pp. 22–31.

L. XingGuo, W. JunFeng, and B. LinLin, “LEACH protocol and its improved algorithm in wireless sensor network,” In 2016 international conference on cyber-enabled distributed computing and knowledge discovery (CyberC), 2016, pp. 418–422.

Y. Yao and J. Gehrke, “The cougar approach to in-network query processing in sensor networks,” ACM Sigmod Rec., vol. 31, no. 3, pp. 9–18, 2002.

K. M. Chandy and J. Misra, “Distributed computation on graphs: Shortest path algorithms (TR-LCS-8203),” Texas University At Austin, 1982.

A. Boukerche and A. Martirosyan, “An energy-aware and fault tolerant inter-cluster communication based protocol for wireless sensor networks,” In Proceedings of the IEEE GLOBECOM 2007-IEEE Global Telecommunications Conference, 2007, pp. 1164–1168.


Refbacks

  • There are currently no refbacks.


ISSN: 0353-3670 (Print)

ISSN: 2217-5997 (Online)

COBISS.SR-ID 12826626