Decentralized self-deployment algorithm for effective boundary coverage of mobile sensor networks

Author

Song WenJun ; Hong Yiguang

Author_Institution

Key Lab. of Syst. & Control, Chinese Acad. of Sci., Beijing, China

fYear

2011

fDate

22-24 July 2011

Firstpage

6001

Lastpage

6006

Abstract

In this paper, an effective multi-agent coverage problem along the smooth boundary of a bounded convex domain is investigated. A group of self-deployed mobile sensor agents are design to cover the boundary based on their sensing capacities. A decentralized motion coordination algorithm is proposed to solve the coverage problem, which is developed with the help of sliding mode control. Then special case when the boundary is a circle, the optimization of the effective coverage is discussed, and the effectiveness of the proposed algorithm is illustrated via numerical simulations.

Keywords

mobile computing; numerical analysis; sensor placement; wireless sensor networks; bounded convex domain; decentralized motion coordination algorithm; decentralized self-deployment algorithm; effective boundary coverage; effective coverage; mobile sensor networks; numerical simulations; sensing capacities; sliding mode control; Distributed control; Equations; Mathematical model; Mobile communication; Mobile computing; Robot sensing systems; Decentralized control; Effective coverage; Mobile sensor networks; Sensor deployment;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (CCC), 2011 30th Chinese

Conference_Location

Yantai

ISSN

1934-1768

Print_ISBN

978-1-4577-0677-6

Electronic_ISBN

1934-1768

Type

conf

Filename

6000614