Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Coverage breach problems in bandwidth constrained sensor networks |
| Author (s): | Cheng, Maggie Ruan, Lu Wu, Weili |
| Department/Lab Affiliations: | Computer Science |
| Keywords: | Channel bandwidth LP-relaxation method bandwidth-constrained sensor networks |
| Subject Terms: | Sensor networks. |
| Issue Date: | 2007-06 |
| Publisher: | Association of Computing Machinery |
| Citation: | Cheng, Maggie., Ruan, Lu., and Wu, Weili. "Coverage Breach Problems in Bandwidth Constrained Sensor Networks." ACM Transactions of Sensor Networks, vol. 3, no. 2, (2007). |
| Abstract: | Recent research in sensor networks highlights the low-power mode operation of sensor networks. In wireless sensor networks, network lifetime can be extended by organizing sensors into mutually exclusive subsets and alternatively activating each subset. Coverage breach occurs when a subset fails to cover all the targets. In bandwidth-constrained sensor networks, coverage breach is more likely to happen because when active sensors periodically send data to the base station, contention for channel access must be considered. Channel bandwidth imposes a limit on the cardinality of each subset. To make efficient use of both energy and bandwidth with minimum coverage breach requires optimal arrangement of sensor nodes. This article addresses three coverage breach problems related to the low-power operation of wireless sensor networks where channel bandwidth is limited. The three coverage breach problems are formulated using integer linear programming models. A greedy approximation algorithm and a heuristic based on the LP-relaxation method are proposed. Effects of changing different network resources on sensor network coverage are studied through simulations. One consistent result is that when the number of sensors increases, network lifetime can be improved without loss of network coverage only if there is no bandwidth constraint; with bandwidth constraints, network lifetime may be improved further at the cost of coverage breach. |
| Type: | Article - Journal text |
| In Title: | ACM Transactions of Sensor Networks |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: |
| Publisher URL: | |
| Link to this page: |
| title | Coverage breach problems in bandwidth constrained sensor networks |
| contributor.author | Cheng, Maggie |
| contributor.author | Ruan, Lu |
| contributor.author | Wu, Weili |
| contributor.deptlab | Computer Science |
| subject | Channel bandwidth |
| subject | LP-relaxation method |
| subject | bandwidth-constrained sensor networks |
| subject.LCSH | Sensor networks. |
| date.issued | 2007-06 |
| publisher | Association of Computing Machinery |
| identifier.citation | Cheng, Maggie., Ruan, Lu., and Wu, Weili. "Coverage Breach Problems in Bandwidth Constrained Sensor Networks." ACM Transactions of Sensor Networks, vol. 3, no. 2, (2007). |
| identifier.pub.URI | |
| description.abstract | Recent research in sensor networks highlights the low-power mode operation of sensor networks. In wireless sensor networks, network lifetime can be extended by organizing sensors into mutually exclusive subsets and alternatively activating each subset. Coverage breach occurs when a subset fails to cover all the targets. In bandwidth-constrained sensor networks, coverage breach is more likely to happen because when active sensors periodically send data to the base station, contention for channel access must be considered. Channel bandwidth imposes a limit on the cardinality of each subset. To make efficient use of both energy and bandwidth with minimum coverage breach requires optimal arrangement of sensor nodes. This article addresses three coverage breach problems related to the low-power operation of wireless sensor networks where channel bandwidth is limited. The three coverage breach problems are formulated using integer linear programming models. A greedy approximation algorithm and a heuristic based on the LP-relaxation method are proposed. Effects of changing different network resources on sensor network coverage are studied through simulations. One consistent result is that when the number of sensors increases, network lifetime can be improved without loss of network coverage only if there is no bandwidth constraint; with bandwidth constraints, network lifetime may be improved further at the cost of coverage breach. |
| type | Article - Journal |
| type.DCMIType | text |
| type.status | Final version |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |
| rights.URI | |
| relation.isPartOf | ACM Transactions of Sensor Networks |
| date.accessioned | 2007-04-11T17:00:48Z |
| date.available | 2008-04-22T21:17:06Z |
| identifier.persist.URI |