Abstract
In the wireless sensor networks, deploying a small amount of heterogeneous nodes which directly communicate with the Sink node, can form shortcuts. The shortcuts can make the network to have small-world properties, which can save energy and improve network performance. In the large-scale networks, the optimal deployment of heterogeneous nodes is a NP-hard problem. Considering the total energy consumption of the network and the uniformity of each node energy consumption, this paper presents a clustering heterogeneous network routing algorithm which based on mixed integer programming (CHNMIP). Firstly, the algorithm supposes that the heterogeneous nodes can only be placed in the position of the common nodes and converts the optimal deployment of heterogeneous nodes into a mixed integer programming problem, and finds out the approximate optimal solution using Lagrangian relaxation and Benders decomposition algorithm. Then, it dynamically divides common nodes into clusters, and sets the appropriate transmission. Finally, it theoretically analyzes the performance of CHNMIP routing algorithm, and the simulation results also show that CHNMIP routing algorithm can better improve the network performance in different simulation environment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Szewczyk, R., Mainwaring, A., Polastre, J., et al. (2004). An analysis of a large scale habitat monitoring application. In Proceedings of the 2nd international conference on embedded networked sensor systems (pp. 214–226). New York.
Desnoyers, P., Ganesan, D., & Shenoy, P. (2005). TSAR: A two tier storage architecture using interval skip graphs. In Proceedings of the third ACM conference on embedded networked sensor systems (pp. 39–50). San Diego, CA.
Yarvis, M., Kushalnagar, N., Singh, H., et al. (2005). Exploiting heterogeneity in sensor networks. In 24th Annual joint conference of the IEEE computer and communications societies (pp. 878–879).
Helmy, A. (2003). Small worlds in wireless networks. IEEE Communication Letters, 7(10), 490–492.
Helmy, A. (2004). Analysis of wired short cuts in wireless sensor networks. In Proceedings of the IEEE/ACS international conference on pervasive services (Vol. 1, pp. 167–177).
Chang, W., Wu, T., Chen, R., et al. (2009). A small-world routing protocol for wireless sensor networks. In Proceedings of the 4th IEEE international conference on wireless communications (pp. 483–490). Washington, DC: IEEE Computer Society.
Sharma, G., & Mazumdar, R. (2005). Hybrid sensor networks: A small world. In MobiHoc 05: Proceedings of the 6th ACM international symposium on mobile ad hoc networking and computing (pp. 366–377). New York.
Jiang, C. J., Chen, C., Chang, J. W., et al. (2008). Construct small worlds in wireless networks using data mules. In IEEE international conference on sensor networks, ubiquitous, and trustworthy computing (pp. 28–35). Washington.
Cavakcabti, D., Agrawal, D., Kelner, J., et al. (2004). Exploiting the small-world effect to increase connectivity in wireless ad hoc networks. In Proceedings of the 11th IEEE international conference on telecommunications (pp. 388–393).
Hawick, K. A., & James, H. A. (2010). Small-world effects in wireless agent sensor networks. International Journal of Wireless and Mobile Computing, 4(3), 155–164.
Liu, L. (2009). Research on node deployment problem in data collection oriented wireless networks. Shenyang: Shenyang Institute of Automation, Chinese Academy of Sciences.
Wang, X., & Li, L. (2012). Research of an adaptive aggregation routing algorithm in wireless sensor networks. Journal of Networks, 7(7), 1071–1077.
Luo, L., & Li, L. (2012). An ant colony system based routing algorithm for wireless sensor network. In 2012 International conference on computer science and electronics engineering (pp. 376–379).
Heinzelman, W. R., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 660–670.
Liu, M., Ye, J., & Zheng, S. (2008). An energy balancing mechanism based on additional cluster heads in wireless sensor networks. Journal of Information & Computational Science, 5(4), 1805–1812.
Nesterov, Y., & Nemirovskii, A. (1994). A interior-point polynomial algorithms in convex programming. Philadelphia, PE: SIAM.
Sihai, Z., Layuan, L., & Lijie, Y. (2012). A preemptive multicast routing protocol in MANET. International Journal of Advancements in Computing Technology, 4(1), 256–263.
Layuan, L., & Chunlin, L. (2007). A QoS multicast routing protocol for clustering mobile ahocnetworks. Computer Communications, 30, 1641–1654.
Acknowledgements
The work was supported by the National Natural Science Foundation (NSF) under Grants (Nos. 61672397, 61472294), the Jiangsu Key Laboratory of Image and Video Understanding for Social Safety (Nanjing University of Science and Technology), Grant No. 30916014107, Program for the High-end Talents of Hubei Province. Any opinions, findings and conclusions are those of the authors and do not necessarily reflect the views of the above agencies.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chunlin, L., Layuan, L. & Xiangli, W. An Optimal Clustering Routing Algorithm for Wireless Sensor Networks with Small-World Property. Wireless Pers Commun 96, 2983–2998 (2017). https://doi.org/10.1007/s11277-017-4335-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-4335-8