Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games

The optimal and distributed provisioning of high coverage capacity in mobile sensor networks is known as a fundamental but hard problem. The situation is exacerbated in a mobile wireless setting due to the dynamic coverage of a mobile sensor network resulting from continuous movement of sensors. In...

Full description

Saved in:
Bibliographic Details
Main Authors: Jianhua Liu, Guangxue Yue, Shigen Shen, Huiliang Shang, Hongjie Li
Format: Article
Language:English
Published: Wiley 2014-11-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2014/264307
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849434735437152256
author Jianhua Liu
Guangxue Yue
Shigen Shen
Huiliang Shang
Hongjie Li
author_facet Jianhua Liu
Guangxue Yue
Shigen Shen
Huiliang Shang
Hongjie Li
author_sort Jianhua Liu
collection DOAJ
description The optimal and distributed provisioning of high coverage capacity in mobile sensor networks is known as a fundamental but hard problem. The situation is exacerbated in a mobile wireless setting due to the dynamic coverage of a mobile sensor network resulting from continuous movement of sensors. In this paper, we propose an optimization framework for maximizing the coverage capacity in mobile sensor networks that comprise both stationary sensors (SSs) and mobile sensors (MSs). Both the intracoverage capacity and the intercoverage capacity are jointly optimized by considering the control of the power and distance between MSs and SSs and the interference among MSs. We propose a new noncooperative control algorithm that iteratively solves intracoverage capacity optimization between MSs and SSs. We also further formulate intercoverage capacity as evolutionary coalition game and present a new cooperative interference control algorithm that iteratively solves intercoverage capacity optimization among MSs. We prove the existence of a solution for iteration control equation of the power and distance and the interference to maximize the coverage capacity. Finally, we assess the performance of the proposed algorithm and show that proposed control scheme can effectively improve the average coveragecapacity in mobile sensor networks.
format Article
id doaj-art-e41f6cecbe9b4e85a50bb04129ec0377
institution Kabale University
issn 1550-1477
language English
publishDate 2014-11-01
publisher Wiley
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj-art-e41f6cecbe9b4e85a50bb04129ec03772025-08-20T03:26:33ZengWileyInternational Journal of Distributed Sensor Networks1550-14772014-11-011010.1155/2014/264307264307Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary GamesJianhua Liu0Guangxue Yue1Shigen Shen2Huiliang Shang3Hongjie Li4 College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing 314001, China College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing 314001, China College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing 314001, China Department of Electronic Engineering, Fudan University, Shanghai 200433, China College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing 314001, ChinaThe optimal and distributed provisioning of high coverage capacity in mobile sensor networks is known as a fundamental but hard problem. The situation is exacerbated in a mobile wireless setting due to the dynamic coverage of a mobile sensor network resulting from continuous movement of sensors. In this paper, we propose an optimization framework for maximizing the coverage capacity in mobile sensor networks that comprise both stationary sensors (SSs) and mobile sensors (MSs). Both the intracoverage capacity and the intercoverage capacity are jointly optimized by considering the control of the power and distance between MSs and SSs and the interference among MSs. We propose a new noncooperative control algorithm that iteratively solves intracoverage capacity optimization between MSs and SSs. We also further formulate intercoverage capacity as evolutionary coalition game and present a new cooperative interference control algorithm that iteratively solves intercoverage capacity optimization among MSs. We prove the existence of a solution for iteration control equation of the power and distance and the interference to maximize the coverage capacity. Finally, we assess the performance of the proposed algorithm and show that proposed control scheme can effectively improve the average coveragecapacity in mobile sensor networks.https://doi.org/10.1155/2014/264307
spellingShingle Jianhua Liu
Guangxue Yue
Shigen Shen
Huiliang Shang
Hongjie Li
Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
International Journal of Distributed Sensor Networks
title Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
title_full Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
title_fullStr Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
title_full_unstemmed Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
title_short Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
title_sort coverage capacity optimization for mobile sensor networks based on evolutionary games
url https://doi.org/10.1155/2014/264307
work_keys_str_mv AT jianhualiu coveragecapacityoptimizationformobilesensornetworksbasedonevolutionarygames
AT guangxueyue coveragecapacityoptimizationformobilesensornetworksbasedonevolutionarygames
AT shigenshen coveragecapacityoptimizationformobilesensornetworksbasedonevolutionarygames
AT huiliangshang coveragecapacityoptimizationformobilesensornetworksbasedonevolutionarygames
AT hongjieli coveragecapacityoptimizationformobilesensornetworksbasedonevolutionarygames