Distributed k-Coverage Decision Scheme for System Deployment in Mobile Sensor Networks | Zendy

Guofang Nan | Zendy; Huidong Lian | Zendy; Minqiang Li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Distributed k-Coverage Decision Scheme for System Deployment in Mobile Sensor Networks

Author(s) -

Guofang Nan,

Huidong Lian,

Minqiang Li

Publication year - 2013

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1155/2013/485250

Subject(s) - voronoi diagram , computer science , wireless sensor network , software deployment , quality of service , distributed computing , computer network , key distribution in wireless sensor networks , scheme (mathematics) , mobile wireless sensor network , network topology , topology (electrical circuits) , real time computing , wireless network , wireless , telecommunications , mathematical analysis , geometry , mathematics , combinatorics , operating system

K-coverage sensor deployment is an important issue in wireless sensor networks (WSNs) applications. This is because an efficient topology structure significantly affects the quality of service and lifetime of WSNs. In the present work, we study the sensor deployment problem and propose novel distributed decision schemes to guide sensor movement to achieve k-coverage deployment. In our schemes, the kth order Voronoi diagram is used to discover the regions that do not meet the k-coverage requirement. Two different movement strategies are designed to determine the optimal location of each mobile sensor through local topological information. Finally, simulation results validate the effectiveness and accuracy of the proposed schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research