Genetic Algorithm for k-Connected Relay Node Placement in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are widely used for many applications including health care, environment monitoring, underground mines, and so on. In WSN, deployment of relay nodes to cover specific region or target is an important issue. In a target-based WSN, it is important that all the targets must be covered by sensor nodes, and the sensor nodes are connected with the backbone network. In this paper, we propose two algorithms for relay node placement which provide k-connectivity of the sensor nodes. The first algorithm is based on Genetic Algorithm (GA), and the second one is based on greedy approach. We have also to extensively simulate both the algorithms to study their performance.
KeywordsPotential positions Relay node k-connected Wireless sensor networks Genetic algorithm
- 4.Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. IEEE Infocom, pp. 1380–1387 (2001)Google Scholar
- 5.Martins, F.V.C., Nakamura, F.G., Quintao, F.P., Mateus, G.R.: Modeland algorithms for the density, coverage and connectivity control problem in flat WSNs. In: Proceedings of the International Network Optimization Conference (INOC’07), pp. 1145–1152 (2007)Google Scholar
- 7.Nitesh, K., Jana, P.K.: Relay node placement algorithm in wireless sensor network. In: Proceedngs of IACC-2014, pp. 220–225. IEEE (2014)Google Scholar
- 8.Kuila, P., Gupta, S.K., Jana, P.K.: A novel evolutionary approach for load balanced clustering problem for wireless sensor networks. Swarm Evol. Comput. 12, 48–56 (2013)Google Scholar
- 9.Gupta, S.K., Kuila, P., Jana, P.K.: GAR: an energy efficient GA-based routing for wireless sensor networks. In: Proceedings of ICDCIT 2013, LNCS (Springer), vol. 7753, pp. 267–277 (2013)Google Scholar