Distributed Antiflocking Algorithms for Dynamic Coverage of Mobile Sensor Networks

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Nuwan Ganganath, Chi-Tsun Cheng, C. K. Tse
Journal/Conference Name I
Paper Category
Paper Abstract Mobile sensor networks (MSNs) are often used for monitoring large areas of interest (AoI) in remote and hostile environments, which can be highly dynamic in nature. Due to the infrastructure cost, MSNs usually consist of a limited number of sensor nodes. In order to cover large AoI, the mobile nodes have to move in an environment while monitoring the area dynamically. MSNs that are controlled by most of the previously proposed dynamic coverage algorithms either lack adaptability to dynamic environments or display poor coverage performances due to considerable overlapping of sensing coverage. As a new class of emergent motion control algorithms for MSNs, antiflocking control algorithms enable MSNs to self-organize in an environment and provide impressive dynamic coverage performances. The antiflocking algorithms are inspired by the solitary behavior of some animals who try to separate from their species in most of daily activities in order to maximize their own gains. In this paper, we propose two distributed antiflocking algorithms for dynamic coverage of MSNs, one for obstacle-free environments and the other for obstacle-dense environments. Both are based on the sensing history and local interactions among sensor nodes.
Date of publication 2016
Code Programming Language Matlab
Comment

Copyright Researcher 2022