Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/108588
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, S. | - |
dc.contributor.author | Shen, H. | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | IEEE Infocom, 2015, vol.26, pp.244-252 | - |
dc.identifier.isbn | 9781479983810 | - |
dc.identifier.issn | 0743-166X | - |
dc.identifier.uri | http://hdl.handle.net/2440/108588 | - |
dc.description.abstract | Border surveillance for intrusion detection is an important application of wireless sensor networks. Given a set of mobile sensors and their initial positions, how to move these sensors to a region border to achieve barrier coverage energy-efficiently is challenging. In this paper, we study the 2-D MinMax barrier coverage problem of moving n sensors in a two-dimensional plane to form a barrier coverage of a specified line segment in the plane while minimizing the maximum sensor movement for the sake of balancing battery power consumption. Previously, this problem was shown to be NP-hard for the general case. It was an open problem whether the problem is polynomial-time solvable for the case when sensors have a fixed number of sensing ranges. We study a special case of great practical significance that the sensors have the same sensing range and present an O(n3 log n) time algorithm. Our algorithm computes a permutation of the left and right endpoints of the moving ranges of all the sensors forming a barrier coverage and minimizes the maximum sensor movement distance by characterizing permutation switches that are critical. To the best of our knowledge, this is the first result for solving the 2-D MinMax barrier coverage problem for the case that all sensors have a uniform sensing range. | - |
dc.description.statementofresponsibility | Shuangjuan Li and Hong Shen | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.relation.ispartofseries | IEEE INFOCOM | - |
dc.rights | © 2015 IEEE | - |
dc.source.uri | http://dx.doi.org/10.1109/infocom.2015.7218388 | - |
dc.title | Minimizing the maximum sensor movement for barrier coverage in the plane | - |
dc.type | Conference paper | - |
dc.contributor.conference | 34th IEEE Conference on Computer Communications (INFOCOM) (26 Apr 2015 - 1 May 2015 : Kowloon) | - |
dc.identifier.doi | 10.1109/INFOCOM.2015.7218388 | - |
dc.relation.grant | http://purl.org/au-research/grants/arc/DP150104871 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648] | - |
Appears in Collections: | Aurora harvest 8 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_108588.pdf Restricted Access | Restricted Access | 178.84 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.