The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited
Finding an optimal node deployment strategy in wireless sensor networks (WSNs) that would reduce cost, be robust to node failures, reduce computation, and communication overhead, and guarantee a high level of coverage along with network connectivity is a difficult problem. In fact, sensing coverage...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2017-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8013028/ |
| _version_ | 1828963662831812608 |
|---|---|
| author | Jamal N. Al-Karaki Amjad Gawanmeh |
| author_facet | Jamal N. Al-Karaki Amjad Gawanmeh |
| author_sort | Jamal N. Al-Karaki |
| collection | DOAJ |
| description | Finding an optimal node deployment strategy in wireless sensor networks (WSNs) that would reduce cost, be robust to node failures, reduce computation, and communication overhead, and guarantee a high level of coverage along with network connectivity is a difficult problem. In fact, sensing coverage and network connectivity are two of the most fundamental problems in WSNs as they can directly impact the network lifetime and operation. In this paper, we consider deriving optimal conditions for connectivity with coverage in WSNs. Most versions of this problem are (NP-complete), while approximation algorithms cannot be developed for some versions of polynomial time, unless P = NP. Hence, we also develop a heuristic for some versions of the problem and the efficacy of the heuristic will be evaluated through extensive simulations. We are also interested in determining the probability of finding a path between a given pair of nodes over a given topology of WSNs. This will serve as a measure of connectivity with coverage of the network. Hence, we derive necessary and sufficient conditions for connectivity with coverage over a clustered structure in WSNs. Then, employing queuing networks modeling techniques, we present a dynamic programming study of the connectivity with coverage of clustered structure and its effect on routing in generalized WSNs. The performance evaluation of the proposed schemes shows that availability of nodes, sensor node coverage, and the connectivity were sufficiently enhanced to maximize network lifetime. |
| first_indexed | 2024-12-14T10:33:42Z |
| format | Article |
| id | doaj.art-5cd54836b46f42a3b9bc002913c54088 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T10:33:42Z |
| publishDate | 2017-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-5cd54836b46f42a3b9bc002913c540882022-12-21T23:06:03ZengIEEEIEEE Access2169-35362017-01-015180511806510.1109/ACCESS.2017.27403828013028The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: RevisitedJamal N. Al-Karaki0Amjad Gawanmeh1https://orcid.org/0000-0002-3897-0681Department of Computer Engineering, The Hashemite University, Zarka, JordanDepartment of Electrical and Computer Engineering, Khalifa University, Abu Dhabi, UAEFinding an optimal node deployment strategy in wireless sensor networks (WSNs) that would reduce cost, be robust to node failures, reduce computation, and communication overhead, and guarantee a high level of coverage along with network connectivity is a difficult problem. In fact, sensing coverage and network connectivity are two of the most fundamental problems in WSNs as they can directly impact the network lifetime and operation. In this paper, we consider deriving optimal conditions for connectivity with coverage in WSNs. Most versions of this problem are (NP-complete), while approximation algorithms cannot be developed for some versions of polynomial time, unless P = NP. Hence, we also develop a heuristic for some versions of the problem and the efficacy of the heuristic will be evaluated through extensive simulations. We are also interested in determining the probability of finding a path between a given pair of nodes over a given topology of WSNs. This will serve as a measure of connectivity with coverage of the network. Hence, we derive necessary and sufficient conditions for connectivity with coverage over a clustered structure in WSNs. Then, employing queuing networks modeling techniques, we present a dynamic programming study of the connectivity with coverage of clustered structure and its effect on routing in generalized WSNs. The performance evaluation of the proposed schemes shows that availability of nodes, sensor node coverage, and the connectivity were sufficiently enhanced to maximize network lifetime.https://ieeexplore.ieee.org/document/8013028/Deploymentcoverageconnectivitywireless sensor networksWSN |
| spellingShingle | Jamal N. Al-Karaki Amjad Gawanmeh The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited IEEE Access Deployment coverage connectivity wireless sensor networks WSN |
| title | The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited |
| title_full | The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited |
| title_fullStr | The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited |
| title_full_unstemmed | The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited |
| title_short | The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited |
| title_sort | optimal deployment coverage and connectivity problems in wireless sensor networks revisited |
| topic | Deployment coverage connectivity wireless sensor networks WSN |
| url | https://ieeexplore.ieee.org/document/8013028/ |
| work_keys_str_mv | AT jamalnalkaraki theoptimaldeploymentcoverageandconnectivityproblemsinwirelesssensornetworksrevisited AT amjadgawanmeh theoptimaldeploymentcoverageandconnectivityproblemsinwirelesssensornetworksrevisited AT jamalnalkaraki optimaldeploymentcoverageandconnectivityproblemsinwirelesssensornetworksrevisited AT amjadgawanmeh optimaldeploymentcoverageandconnectivityproblemsinwirelesssensornetworksrevisited |