Abstract
Wireless sensor networks which are formed by sensor nodes are used widely for sensing the environment and observing useful information from the data gathered. Due to harsh environmental conditions, the network can be disconnected. Restoring the network’s lost connectivity is crucial for future functioning of the network and is done by placing relay nodes, which are small devices used for transmission of sensed data. This problem of reconnecting the network in an optimal manner is shown to be NP-hard; therefore, we practice meta-heuristics to this problem. In this paper, we propose Federating Network using Particle Swarm Optimization (FN-JPSO), which can be applied efficiently for restoring the lost connectivity. Our proposed approach first finds the representative node for each disconnected segment and then creates Steiner points for reconnection. These Steiner points are further used to create random spanning trees, which are used as particles in FN-JPSO to provide an optimal interconnected network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ranga V, Dave M, Verma AK (2006) Network partitioning recovery mechanisms in WSANs: a survey. In: Wireless personal communications, vol 72, no 2. Springer, pp 857–917
Ranga V, Dave M, Verma AK (2014) A hybrid timer based single node failure recovery approach for WSANs. In: Wireless personal communications, vol 77, no 3. Springer, pp 2155–2182
Senel F, Younis M, Akkaya K (2011) Bio-inspired relay node placement heuristics for repairing damaged wireless sensor networks. IEEE Trans Veh Technol 60(4):1835–1848. IEEE Press
Lee S, Younis M (2012) Optimized relay node placement for connecting disjoint wireless sensor networks. Comput Netw 56:2278–2804. Elsevier
Lee S, Younis M (2010) Optimized relay placement to federate segments in wireless sensor network. IEEE J Sel Area Commun Spec Issue Mission Crit Netw 28(5):742–752. IEEE Press (2010)
Consoli S, Moreno-Perez JA, Darby-Dowman K, Mladenovic N (2010) Discrete particle swarm optimization for the minimum labelling Steiner tree problem. Nat Comput 9(1):29–46. Springer
Qu R, Xu Y, Castro JP, Landa-Silva D (2013) Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. J Heuristics 19(2):317–342. ACM (2013)
Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the world multiconference on systemics, cybernetics and informatics, Piscataway, NJ, pp 4104–4109
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sharma, R., Ranga, V. (2017). Particle Swarm Optimization for Disconnected Wireless Sensor Networks. In: Vishwakarma, H., Akashe, S. (eds) Computing and Network Sustainability. Lecture Notes in Networks and Systems, vol 12. Springer, Singapore. https://doi.org/10.1007/978-981-10-3935-5_42
Download citation
DOI: https://doi.org/10.1007/978-981-10-3935-5_42
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3934-8
Online ISBN: 978-981-10-3935-5
eBook Packages: EngineeringEngineering (R0)