Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks

Date

2015-10-01

Author

Attea, Bara'a A.
Khalil, Enan A.
Coşar, Ahmet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

297
views

0
downloads

Individual sensors in wireless mobile sensor networks (MSNs) can move in search of coverage region for the sensing accuracy and for reaching the most efficient topology. Besides, sensors' clustering is crucial for achieving an efficient network performance. Although MSNs have been an area of many research efforts in recent years, integrating the coverage problem of MSNs with the efficient routing requirement that will maximize the network lifetime is still missing. In this paper, we consider the coverage optimization problem where the location of a given number of mobile sensors needs to be re-decided such that the sensed data from the detected targets can be routed more efficiently to the sink and thus increasing the network lifetime. We formulate this NP-complete problem as a multi-objective optimization (MOO) problem, with two conflicting and correlated objectives; aiming at high coverage as well as longevity of network lifetime. The Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) is utilized as a cluster-based routing protocol to tackle this MOO problem. Each round of the proposed NSGA-II based routing protocol creates a set of near-Pareto-optimal solutions containing a number of non-dominated solutions, in which the sink can pick up and distribute the one with high coverage to form the clustered routes. Heuristic operators are also proposed to enhance the quality of the solutions. Simulation results are provided to illustrate the effectiveness and performance of the proposed evolutionary algorithm.

Subject Keywords

Energy efficient clustering, Wireless mobile sensor network, MOEA/D, Multi-objective optimization, NSGA-II, Routing

URI

https://hdl.handle.net/11511/31044

Journal

SOFT COMPUTING

DOI

https://doi.org/10.1007/s00500-014-1462-y

Collections

Graduate School of Natural and Applied Sciences, Article

Suggestions

OpenMETU
Core

MOFCA: Multi-objective fuzzy clustering algorithm for wireless sensor networks SERT, SEYYİT ALPER; Bagci, Hakan; Yazıcı, Adnan (2015-05-01) This study introduces a new clustering approach which is not only energy-efficient but also distribution-independent for wireless sensor networks (WSNs). Clustering is used as a means of efficient data gathering technique in terms of energy consumption. In clustered networks, each node transmits acquired data to a cluster-head which the nodes belong to. After a cluster-head collects all the data from all member nodes, it transmits the data to the base station (sink) either in a compressed or uncompressed ma...
Exploiting energy-aware spatial correlation in wireless sensor networks Shah, Ghalib A.; Bozyigit, Muslim (2007-01-12) Wireless sensor networks (WSNs) promise fine-grain monitoring in a wide variety of applications, which require dense sensor nodes deployment. Due to high density of nodes, spatially redundant or correlated data is generated. Redundancy increases the reliability level of information delivery but increases the energy consumption of the nodes too. Since energy conservation is a key issue for WSNs, therefore, spatial correlation can be exploited to deactivate some of the nodes generating redundant information. ...
An energy aware fuzzy approach to unequal clustering in wireless sensor networks Bagci, Hakan; Yazıcı, Adnan (2013-04-01) In order to gather information more efficiently in terms of energy consumption, wireless sensor networks (WSNs) are partitioned into clusters. In clustered WSNs, each sensor node sends its collected data to the head of the cluster that it belongs to. The cluster-heads are responsible for aggregating the collected data and forwarding it to the base station through other cluster-heads in the network. This leads to a situation known as the hot spots problem where cluster-heads that are closer to the base stati...
Path planning and localization for mobile anchor based wireless sensor networks Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017) In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...
Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming İncebacak, Davut; Baykal, Nazife; Bıçakcı, Kemal; Department of Information Systems (2013) Wireless Sensor Networks (WSNs) are composed of battery powered small sensor nodes with limited processing, memory and energy resources. Self organization property together with infrastructureless characteristics of WSNs make them favorable solutions for many applications. Algorithms and protocols developed for WSNs must consider the characteristics and constraints of WSNs but since battery replenishment is not possible or highly challenging for sensor nodes, one of the major concerns in designing network p...

Citation Formats

B. A. Attea, E. A. Khalil, and A. Coşar, “Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks,” SOFT COMPUTING, pp. 2983–2995, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31044.