Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469733 | ||
| 003 | CHVBK | ||
| 005 | 20210128100324.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1462-y |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1462-y | ||
| 245 | 0 | 0 | |a Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks |h [Elektronische Daten] |c [Bara'a Attea, Enan Khalil, Ahmet Cosar] |
| 520 | 3 | |a 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. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Energy efficient clustering |2 nationallicence | |
| 690 | 7 | |a Wireless mobile sensor network |2 nationallicence | |
| 690 | 7 | |a MOEA/D |2 nationallicence | |
| 690 | 7 | |a Multi-objective optimization |2 nationallicence | |
| 690 | 7 | |a NSGA-II |2 nationallicence | |
| 690 | 7 | |a Routing |2 nationallicence | |
| 700 | 1 | |a Attea |D Bara'a |u Department of the Computer Science, Baghdad University, Baghdad, Iraq |4 aut | |
| 700 | 1 | |a Khalil |D Enan |u Computer Engineering Department, Gazi University, Ankara, Turkey |4 aut | |
| 700 | 1 | |a Cosar |D Ahmet |u Computer Engineering Department, Middle East Technical University, Ankara, Turkey |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 2983-2995 |x 1432-7643 |q 19:10<2983 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1462-y |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1462-y |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Attea |D Bara'a |u Department of the Computer Science, Baghdad University, Baghdad, Iraq |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Khalil |D Enan |u Computer Engineering Department, Gazi University, Ankara, Turkey |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Cosar |D Ahmet |u Computer Engineering Department, Middle East Technical University, Ankara, Turkey |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 2983-2995 |x 1432-7643 |q 19:10<2983 |1 2015 |2 19 |o 500 | ||