An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks
Abstract
:1. Introduction
1.1. Background and Motivation
1.2. Related Works
1.3. Contributions
- We defined the link cost for the sake of energy saving and less delay, by considering the residual energy of the node, the transmission energy consumption and the forward energy consumption of the next hop.
- We generated the minimum routing graph based on the link cost. Here, in order to obtain this graph, the shortest path set of each node is calculated from the source node to the sink node according to the improved Dijkstra algorithm [28].
- We proposed an “edge-cutting” strategy to balance the load in the minimum routing graph, so that the network structure can be adjusted in real time to optimize the route by dynamically sensing the node load. Simulation results show that our algorithm can decrease the average network energy, balance the node load, extend network lifetime, and also reduce transmission delay and packet loss rate, showing a good network performance.
2. Network Model and Related Definitions
2.1. Network Model
- (1)
- All sensor nodes are isomorphic and randomly deployed in a certain monitoring area. The sensor nodes have only one sink node, and the location of sensor nodes and the sink node will not be changed after being deployed.
- (2)
- The node can change the transmission power according to the distance to the receiver, and the distance from one sensor node to another can be estimated based on the received signal strength.
- (3)
- In a practical application, the packet size and the data generation rate can be determined according to different scenarios. As for this paper, in order to simplify the model, the size of the packet is fixed and the data generation rate is the same for all nodes.
2.2. Related Definitions
3. ESRA Routing Algorithm
3.1. Link Cost
3.2. Generation of Minimum Routing Graph
Algorithm 1 The Generation of Minimum Routing Graph |
Input: the link cost matrix , the network size N Output: the shortest path set 1. for I = 1:N 2. Calculate the initial shortest path of node i by Dijkstra algorithm. 3. update 4. Find the set of adjacent nodes of the shortest path . 5. k = 1 // Start finding adjacent nodes from the first node of . 6. while () 7. Insert adjacent nodes from the kth node of , and get the candidate path under the current k. 8. update 9. k = k + 1 10. end // Get the candidate path set . 11. g = 2 12. while () 13. Calculate the link cost by Equation (6). 14. if 15. update 16. end 17. g = g + 1 18. end 19. end 20. return the shortest path set |
3.3. Path Optimization Based on Edge-Cutting Strategy
Algorithm 2 The Edge-Cutting Strategy |
Input: the minimum routing graph, the layered set L, initial load of node i in the minimum routing graph Output: the minimum routing tree 1. for 2. while () //complete edge-cutting for all nodes of layer . 3. if exist a node “a” with the least load at the layer 4. if exist multiple candidate parent nodes of the child nodes of node “a” 5. Cut off the link between the child nodes of “a” and other candidate parent nodes. 6. end 7. else if exist multiple nodes with the least load at the layer 8. Calculate the node product , and set the node with the smallest node product to “a”. 9. if the child node of node “a” exist multiple candidate parent nodes. 10. Cut off the link between the child nodes of “a” and its other candidate parent nodes. 11. end 12. update -a //delete the node “a” 13. end 14. Recalculate the load of all nodes 15. end 16. end 17. return the minimum routing tree |
- Case 1 When there is only one node “a” with the least load in this layer, if the child nodes of node “a” have multiple candidate parent nodes, the link between the child nodes of node “a” and other candidate parent nodes are cut off. If the child nodes of node “a” only have one candidate parent node, the edge-cutting operation is not performed. Then, node “a” is removed from this layer and all nodes’ loads are updated.
- Case 2 When there are multiple nodes with the least load simultaneously, the smaller the load product of all the nodes on the shortest path which is from this node to the sink, the larger the residual energy of this node, thus the smaller the amount of data transfer undertaken by this path. That is, the advantage of this node as next hop is greater. Here the “node product”, expressed as:
4. Simulation Results and Analysis
4.1. The Impact of Parameter β on Network Performance
4.2. Comparison with Other Algorithms
4.2.1. Average Hops and Average Energy Consumption
4.2.2. Traffic Balance and Energy Balance
5. Conclusions
Author Contributions
Funding
Conflicts of Interest
References
- Soeharwinto; Sinulingga, E.; Siregar, B. Remote Monitoring of Post-Eruption Volcano Environment Based-On Wireless Sensor Network (WSN): The Mount Sinabung Case. J. Phys. Conf. Ser. 2017, 801, 12–84. [Google Scholar] [CrossRef]
- Song, W.Z.; Huang, R.; Xu, M.; Shirazi, B.A.; Lahusen, R. Design and deployment of sensor network for real-time high-fidelity volcano monitoring. IEEE Trans. Parallel Distrib. Syst. 2010, 21, 1658–1674. [Google Scholar] [CrossRef]
- Gope, P.; Hwang, T. BSN-care: A secure IoT-based modern health-care system using body sensor network. IEEE Sens. J. 2015, 16, 1368–1376. [Google Scholar] [CrossRef]
- Serna, M.A.; Sreenan, C.J.; Fedor, S. A visual programming framework for wireless sensor networks in smart home applications. In Proceedings of the IEEE Tenth International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Singapore, 7–9 April 2015; pp. 1–6. [Google Scholar]
- Kim, H.Y. An energy-efficient load balancing scheme to extend lifetime in wireless sensor networks. Cluster Comput. 2016, 19, 279–283. [Google Scholar] [CrossRef]
- Yousif, Y.K.; Badlishah, R.; Yaakob, N.; Amir, A. An Energy Efficient and Load Balancing Clustering Scheme for Wireless Sensor Network (WSN) Based on Distributed Approach. J. Phys. Conf. Ser. 2018, 1019, 012007. [Google Scholar] [CrossRef]
- Gherbi, C.; Aliouat, Z.; Benmohammed, M. An adaptive clustering approach to dynamic load balancing and energy efficiency in wireless sensor networks. Energy 2016, 114, 647–662. [Google Scholar] [CrossRef]
- Chen, C.P.; Mukhopadhyay, S.C.; Chuang, C.L.; Liu, M.Y.; Jiang, J.A. Efficient coverage and connectivity preservation with load balance for wireless sensor networks. IEEE Sens. J. 2015, 15, 48–62. [Google Scholar] [CrossRef]
- Kandris, D.; Vergados, D.J.; Vergados, D.D.; Tzes, A. A routing scheme for congestion avoidance in wireless sensor networks. In Proceedings of the 6th Annual IEEE Conference on Automation Science and Engineering (CASE 2010), Toronto, ON, Canada, 21–24 August 2010; pp. 21–24. [Google Scholar]
- Li, S.; Zhao, S.; Wang, X.; Zhang, K.; Li, L. Adaptive and secure load-balancing routing protocol for service-oriented wireless sensor networks. IEEE Syst. J. 2014, 8, 858–867. [Google Scholar] [CrossRef]
- Ahmed, A.M.; Paulus, R. Congestion detection technique for multipath routing and load balancing in WSN. Wirel. Netw. 2017, 23, 881–888. [Google Scholar] [CrossRef]
- Guo, W.; Xiong, N.; Chao, H.C.; Hussain, S.; Chen, G. Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks. Sensors 2011, 11, 6533–6554. [Google Scholar] [CrossRef] [PubMed] [Green Version]
- Ennaji, R.; Boulmalf, M. Routing Protocols in Wireless Sensor Networks. Int. J. Comput. Sci. Eng. Surv. 2017, 1, 522–525. [Google Scholar]
- Xin, H.; Liu, X. Energy-Balanced Transmission with Accurate Distances for Strip-based Wireless Sensor Networks. IEEE Access 2017, 5, 16193–16204. [Google Scholar] [CrossRef]
- Schurgers, C.; Srivastava, M.B. Energy efficient routing in wireless sensor networks. In Proceedings of the Communications for Network-Centric Operations: Creating the Information Force, McLean, VA, USA, 28–31 October 2001; pp. 731–738. [Google Scholar]
- Chiang, S.S.; Huang, C.H.; Chang, K.C. A Minimum Hop Routing Protocol for Home Security Systems Using Wireless Sensor Networks. IEEE Trans. Consum. Electron. 2007, 53, 1483–1489. [Google Scholar] [CrossRef]
- Akyildiz, I.F.; Su, W.; Sankarasubramaniam, Y.; Cayirci, E. A survey on sensor networks. IEEE Commun. Mag. 2002, 40, 102–114. [Google Scholar] [CrossRef]
- Velmurugan, A.K.; Kannan, R.J. Sleep Scheduling for Energy Efficient Load Balance Routing in Heterogeneous Wireless Sensor Network. Indian J. Public Health Res. Dev. 2017, 8, 236–241. [Google Scholar] [CrossRef]
- Ye, D.; Zhang, M. A Self-Adaptive Sleep/Wake-Up Scheduling Approach for Wireless Sensor Networks. IEEE Trans. Cybern. 2017, 48, 979–992. [Google Scholar] [CrossRef] [PubMed]
- Mishra, S.; Kansal, P. Routing protocol based on sleep scheduling and tree cluster structure in wireless sensor network. In Proceedings of the International Conference on Advances in Computing, Communication & Automation, Bareilly, India, 30 September–1 October 2016; pp. 1–4. [Google Scholar]
- Liu, X.; Zhang, P. Data Drainage: A Novel Load Balancing Strategy for Wireless Sensor Networks. IEEE Commun. Lett. 2017, 22, 125–128. [Google Scholar] [CrossRef]
- Kacimi, R.; Dhaou, R.; Beylot, A.L. Load balancing techniques for lifetime maximizing in wireless sensor networks. Ad Hoc Netw. 2013, 11, 2172–2186. [Google Scholar] [CrossRef] [Green Version]
- Kleerekoper, A.; Filer, N.P. DECOR: Distributed construction of load balanced routing trees for many to one sensor networks. Ad Hoc Netw. 2014, 16, 225–236. [Google Scholar] [CrossRef]
- Montoya, G.A.; Donoso, Y. Energy Load Balancing Strategy to Extend Lifetime in Wireless Sensor Networks. Proc. Comput. Sci. 2013, 17, 395–402. [Google Scholar] [CrossRef]
- Zhang, D.; Li, G.; Zheng, K.; Ming, X.; Pan, Z. An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks. IEEE Trans. Ind. Inf. 2013, 10, 766–773. [Google Scholar] [CrossRef]
- Jiang, H.; Sun, Y.; Sun, R.; Xu, H. Fuzzy-Logic-Based Energy Optimized Routing for Wireless Sensor Networks. Int. J. Distrib. Sens. Netw. 2013, 9, 216561. [Google Scholar] [CrossRef]
- Chughtai, O.; Badruddin, N.; Awang, A. A Congestion-aware and Energy Efficient Traffic Load Balancing Scheme for Routing in WSNs. In Proceedings of the TENCON 2014—2014 IEEE Region 10 Conference, Bangkok, Thailand, 22–25 October 2014; pp. 1–6. [Google Scholar]
- Bai, Y.; Hu, P.; Xia, L.; Guo, F. Analysis and Solution of k-th Short Path Problem. J. Wuhan Univ. Inf. Sci. Ed. 2009, 34, 492–494. [Google Scholar]
- Wang, C.F.; Shih, J.D.; Pan, B.H.; Wu, T.Y. A network lifetime enhancement method for sink relocation and its analysis in wireless sensor networks. IEEE Sens. J. 2014, 14, 1932–1943. [Google Scholar] [CrossRef]
- Tang, L.; Feng, S.; Hao, J.; Zhao, X. Energy-efficient routing algorithm based on multiple criteria decision making for wireless sensor networks. Wirel. Pers. Commun. Int. J. 2015, 80, 97–115. [Google Scholar] [CrossRef]
- Lee, K.; Kim, H.J.; Park, S.; Han, S. Satisfying the target network lifetime in wireless sensor networks. Comput. Netw. 2014, 65, 41–55. [Google Scholar] [CrossRef]
- Liu, A.F.; Zhang, P.H.; Chen, Z.G. Theoretical analysis of the lifetime and energy hole in cluster based wireless sensor networks. J. Parallel Distrib. Comput. 2011, 71, 1327–1355. [Google Scholar] [CrossRef]
- Dong, M.; Ota, K.; Li, H.; Du, S.; Zhu, H.; Guo, S. Rendezvous: towards fast event detecting in wireless sensor and actor networks. Computing 2014, 96, 995–1010. [Google Scholar] [CrossRef]
- Heinzelman, W.B.; Chandrakasan, A.P.; Balakrishnan, H. An Application Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Trans. Wirel. Commun. 2002, 1, 660–670. [Google Scholar] [CrossRef]
Definition | Value |
---|---|
Simulation area | 100 × 100 m2 |
Network size | 150~300 |
Maximum communication range | 30 m |
Packets size | 1024 bits |
Buffer size | 20 packets |
Sink | (50, 50) |
Data generation rate | 1024 bits/round |
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Share and Cite
Tang, L.; Lu, Z.; Cai, J.; Yan, J. An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks. Sensors 2018, 18, 3477. https://doi.org/10.3390/s18103477
Tang L, Lu Z, Cai J, Yan J. An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks. Sensors. 2018; 18(10):3477. https://doi.org/10.3390/s18103477
Chicago/Turabian StyleTang, Liangrui, Zhilin Lu, Jinqi Cai, and Jiangyu Yan. 2018. "An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks" Sensors 18, no. 10: 3477. https://doi.org/10.3390/s18103477
APA StyleTang, L., Lu, Z., Cai, J., & Yan, J. (2018). An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks. Sensors, 18(10), 3477. https://doi.org/10.3390/s18103477