KEIP: a distributed k-connectivity estimation algorithm based on independent paths for wireless sensor networks
- 98 Downloads
Maintaining the connectivity between all nodes is a challenging task in wireless sensor networks (WSNs) because failure of some nodes may divide the network to disconnected parts. A network is k-connected if we need to remove at least k nodes to disconnect it. There are at least k disjoint paths between each pair of nodes in a k-connected network which preserves the connectivity of the network after removing k-1 arbitrary nodes. Therefore, with high k values the network may tolerate more failures without losing its connectivity. Finding the k value of a given network can provide useful information about the robustness of the connectivity. The existing distributed k-connectivity estimation (detection) algorithms use local neighborhood information to find an approximated value for k. In this paper, we propose a new energy efficient distributed algorithm which finds the k value of the given WSN with more accuracy by detecting the minimum number of disjoint paths between the sink and all other nodes. We extend the definition of disjoint paths to independent paths, which are the disjoint paths with shared nodes, and use this concept to find the k value. The comprehensive simulation and testbed results show that the proposed algorithm is faster and has at least 20% higher correct detection ratio, lower mean square error ratio and also lower energy consumption than the existing algorithms.
Keywordsk-connectivity Wireless sensor networks Fault tolerance Reliability Distributed algorithms
This work was supported by the TUBITAK (Scientific and Technical Research Council of Turkey) [Project Number 113E470].
- 5.Ahmed, H. I., Wei, P., Memon, I., Du, Y., & Xie, W. (2013). Estimation of time difference of arrival (TDoA) for the source radiates BPSK signal. IJCSI International Journal of Computer Science Issues, 10(3), 164–171.Google Scholar
- 7.Gustav, Y.H., Wang, Y., Domenic, M.K., Zhang, F., & Memon, I. (2013). Velocity similarity anonymization for continuous query location based services. In IEEE international conference on computational problem-solving (ICCP), 2013 (pp. 433–436).Google Scholar
- 8.Arain, Q. A., Memon, H., Memon, I., Memon, M. H., Shaikh, R. A., & Mangi, F. A. (2017). Intelligent travel information platform based on location base services to predict user travel behavior from user-generated GPS traces. International Journal of Computers and Applications, 39(3), 155–168.CrossRefGoogle Scholar
- 12.Cornejo, A., & Lynch, N. (2010). Fault-tolerance through k-connectivity. In Workshop on network science and systems issues in multi-robot autonomy: ICRA (vol. 2).Google Scholar
- 13.Atay, N. & Bayazit, B. (2009). Mobile wireless sensor network connectivity repair with k-redundancy. Algorithmic Foundation of Robotics VIII (pp. 35–4).Google Scholar
- 16.Jorgic, M., Goel, N., Kalaichevan, K., Nayak, A., & Stojmenovic, I. (2007). Localized detection of k-connectivity in wireless ad hoc, actuator and sensor networks. In IEEE international conference on computer communications and networks, ICCCN, (pp. 3–33).Google Scholar
- 17.Szczytowski, P., Khelil, A. & Suri, N. (2012). DKM: Distributed k-connectivity maintenance in wireless sensor networks. In IEEE annual conference on wireless on-demand network systems and services (WONS) (pp. 83–90).Google Scholar
- 18.Censor-Hillel, K., Ghaffari, M., & Kuhn, F. (2014). Distributed connectivity decomposition. In Proceedings of the 2014 ACM symposium on principles of distributed computing (pp. 156–165). New York: ACM.Google Scholar
- 19.Gupta, B. & Gupta, A. (2013). On the k-connectivity of ad-hoc wireless networks. In IEEE 7th international symposium on service oriented system engineering (SOSE) (pp. 546–550).Google Scholar
- 20.Nutov, Z. (2010). Approximating minimum-power k-connectivity. Ad Hoc & Sensor Wireless Networks, 9(1–2), 129–137.Google Scholar
- 21.Li, N. & Hou, J. C. (2004) FLSS: A fault-tolerant topology control algorithm for wireless networks. In Proceedings of the 10th ACM annual international conference on Mobile computing and networking (pp. 275–286).Google Scholar
- 30.Zhang, L., Wang, X., & Dou, W. (2004). Design and analysis of a k-connected topology control algorithm for ad hoc networks. In International symposium on parallel and distributed processing and applications (pp. 178–187). Berlin: Springer.Google Scholar
- 32.Almasaeid, H.M. & Kamal, A.E. (2009). On the minimum k-connectivity repair in wireless sensor networks. IEEE international conference on communications (pp. 1–5).Google Scholar
- 35.Meghanathan, N., & Gorla, S. (2010). On the probability of k-connectivity in wireless ad hoc networks under different mobility models. International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks, 2(3). https://doi.org/10.5121/jgraphoc.2010.2301.CrossRefGoogle Scholar
- 37.Zhao, J., Yagan, O., & Gligor, V. (2015). Exact analysis of k-connectivity in secure sensor networks with unreliable links. In 13th IEEE international symposium on modeling and optimization in mobile, ad hoc, and wireless networks (WiOpt), 2015.Google Scholar
- 40.MEMSIC. Inc, IRIS Datasheet, http://www.memsic.com/userfiles/files/Datasheets/WSN/IRIS_Datasheet.pdf.
- 41.Levis, P., Madden, S., Polastre, J., Szewczyk, R., Whitehouse, K., Woo, A., & Culler, D. (2005). Tinyos: An operating system for sensor networks. In W. Weber, J. M. Rabaey, & E. Aarts (Eds.), Ambient intelligence (pp. 115–148). Springer.Google Scholar
- 42.Levis, P., Lee, N., Welsh, M. & Culler, D. (2003). TOSSIM: Accurate and scalable simulation of entire TinyOS applications. In International conference on embedded networked sensor systems (pp. 126–137), ACM.Google Scholar