期刊名称：International Journal of Wireless & Mobile Networks
印刷版ISSN：0975-4679
电子版ISSN：0975-3834
出版年度：2012
卷号：4
期号：5
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Mobile Sensors find their target position and placed themselves over the target field to achieve a certain goal in self deployment with certain additional functionality like sensor relocation. An efficient deployment scheme guaranteed maximum coverage with full connectivity. Certain variance of coverage could be manageable but loss of connectivity because of failure of some sensor node causes complete isolation of some sensing area which causes loss of data of that area. So it is not enough to be just connected, it should be K connected (K>1) to control the isolation. Again the obstacles over the target field should be managed during deployment. A self deployment scheme using mobile sensors is proposed which achieve K connectivity. The target area is divided into n × n square grid. The distributed algorithm deploys a sensor in each square grid cell to maximize the coverage and achieve K connectivity. A square grid deployment pattern is used which guarantee at least (K=4) connectivity. The first algorithm assumed a plane target area with no obstacle. The second proposed algorithm has the capacity of obstacle adaptability which assumed a target area with some obstacle. Simulation result shows maximum coverage with minimum moving cost and obstacle adaptability.
