Abstract
In this article, we are going to discuss the comparison of three different categories of routing principles, namely, flat routing, hierarchical routing and location-based routing in Wireless Sensor Networks. Under the flat routing strategies, we are going to discuss 1-D flooding and 2-D flooding. Under the hierarchical category, we will explore spanning tree and under the location-based routing category, we will use angle-based dynamic path construction. For all these four algorithms, on the basis of a precise energy modelling and MAC layer modelling, comparison is made out on the basis of energy consumption and delay incurred for the transmission of data from the sensing nodes via the forwarding nodes and ultimately converging at the sink node. Also, retransmission probability, an important criterion, is taken into consideration and its effect on energy consumption and end-to-end delay is observed.
Similar content being viewed by others
References
Sohraby, K., Minoli, D., & Znati, T. (2007). Wireless sensor networks: Technology, protocols and applications (pp. 1–74). Hoboken, New Jersey: Wiley.
Haghighi, M. S., Mohamedpour, K., Varadharajan, V., & Quinn, B. G. (2011). Stochastic modeling of hello flooding in slotted CSMS/CA wireless sensor networks. IEEE Transactions on Information Forensics and Security, 6(4), 1185–1199.
Hassanzadeh, A., Stoleru, R. & Chen, J. (2011). Efficient flooding in wireless sensor networks secured with neighbourhood keys. In Seventh international conference on wireless and mobile computing, networking and communications.
Yildirim, K. S., & Kantarci, A. (2014). Time synchronization based on slow-flooding in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 25(1), 244–253.
Cheng, L., Gu, Y., He, T. & Niu, J. (2013). Dynamic switching-based reliable flooding in low-duty-cycle wireless sensor networks. In IEEE INFOCOM.
Khan, M., Pandurangan, G., & Kumar, V. S. A. (2009). Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 20(1), 124–139.
Khamforoosh, K. (2011). Clustered balanced minimum spanning tree for routing and energy reduction in wireless sensor networks. In IEEE symposium on wireless technology and technology, Langkawi.
Lu, Y., Chen, J., Comsa, I. S. & Kuonen, P. (2011). Backup path with energy prediction based on energy-aware spanning tree in wireless sensor networks. In International conference on cyber-enabled distributed computing and knowledge discovery.
Xiong, X. & Ning, A. (2014). Competitive decision algorithm for constructing maximum lifetime spanning tree in wireless sensor networks. In 9th International conference on computer science and education, Vancouver.
Sia, Y. K., Liew, S. Y., Goh, H. G. & Gan, M. L. (2014). Spanning mutli-tree algorithms for load balancing in multi-sink wireless sensor networks with heterogeneous traffic generating nodes. In International conference on frontiers of communications, networks and applications.
Choi, W., Das, S. K. & Basu, K. (2004). Angle-based dynamic path construction for route load-balancing in wireless sensor networks. In IEEE wireless communications and networking conference.
Shin, K., Kim, K. & Kim, S. (2011). ADSR: Angle-based multi-hop routing strategy for mobile wireless sensor networks. In IEEE Asia-Pacific services computing conference.
Yang, G., Yin, G. & Yang, W. (2008). Intra-cluster multi-hop routing algorithm based on forwarding restriction in WSNs. In Chinese control and decision conference.
Yaman, L., Xingwei, W. & Min, H. (2013). Space angle based energy-aware algorithm in three dimensional wireless sensor networks. In International symposium on distributed computing and applications to business, engineering and science.
Jiguo, Y., Wang, N., Wang, G. & Yu, D. (2013). Connected dominating sets in wireless ad hoc and sensor networks—A comprehensive survey. Computer Communications, 36(1), 121–134.
Bettstetter, C. (2002). On the minimum node degree and connectivity of a wireless multihop network. In 3rd ACM international symposium on mobile ad hoc networking in computing.
Zhou, H.-Y., Luo, D.-Y., Gao, Y., & Zuo, D.-C. (2011). Modeling of node energy consumption for wireless sensor networks. Wireless Sensor Network, 3(1), 18–23.
Berberis, A., Barboni, L. & Valle, M. (2007). Evaluating energy consumption in wireless sensor networks applications. In IEEE 10th Euromicro conference on system design architectures, methods and tools.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aetesam, H., Snigdh, I. A Comparative Analysis of Flat, Hierarchical and Location-Based Routing in Wireless Sensor Networks. Wireless Pers Commun 97, 5201–5211 (2017). https://doi.org/10.1007/s11277-017-4775-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-4775-1