Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information
This paper develops an efficient and distributed boundary detection algorithm to precisely recognize wireless sensor network (WSN) boundaries using only local connectivity information. Specifically, given any node in a WSN, the proposed algorithm constructs its 2-hop isocontour and locally makes a r...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/897039 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832553132657213440 |
|---|---|
| author | Baoqi Huang Wei Wu Guanglai Gao Tao Zhang |
| author_facet | Baoqi Huang Wei Wu Guanglai Gao Tao Zhang |
| author_sort | Baoqi Huang |
| collection | DOAJ |
| description | This paper develops an efficient and distributed boundary detection algorithm to precisely recognize wireless sensor network (WSN) boundaries using only local connectivity information. Specifically, given any node in a WSN, the proposed algorithm constructs its 2-hop isocontour and locally makes a rough decision on whether this node is suspected to be on boundaries of the WSN by examining the associated 2-hop isocontour. Then, a heuristic operation is performed to refine this decision, with the result that the suspected boundary node set is significantly shrunk. Lastly, tight boundary cycles corresponding to both inner and outer WSN boundaries are derived by searching the suspected boundary node set. Furthermore, regarding WSNs with relatively low node densities, the proposed algorithm is adapted to improve the quality of boundary detection. Even though the proposed algorithm is initially presented under the assumption of the idealized unit disk graph (UDG) model, we further consider the more realistic quasi-UDG (QUDG) model. In addition, a message complexity analysis confirms the energy efficiency of the proposed algorithm. Finally, we carry out a thorough evaluation showing that our algorithm is applicable to both dense and sparse deployments of WSNs and is able to produce accurate results. |
| format | Article |
| id | doaj-art-7d486f2d203048baba3635b542be2c92 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2014-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-7d486f2d203048baba3635b542be2c922025-02-03T05:55:25ZengWileyInternational Journal of Distributed Sensor Networks1550-14772014-07-011010.1155/2014/897039897039Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity InformationBaoqi Huang0Wei Wu1Guanglai Gao2Tao Zhang3 College of Computer Science, Inner Mongolia University, Hohhot 010021, China College of Computer Science, Inner Mongolia University, Hohhot 010021, China College of Computer Science, Inner Mongolia University, Hohhot 010021, China Neimenggu Mobile Communication Co., Ltd., Hohhot 010090, ChinaThis paper develops an efficient and distributed boundary detection algorithm to precisely recognize wireless sensor network (WSN) boundaries using only local connectivity information. Specifically, given any node in a WSN, the proposed algorithm constructs its 2-hop isocontour and locally makes a rough decision on whether this node is suspected to be on boundaries of the WSN by examining the associated 2-hop isocontour. Then, a heuristic operation is performed to refine this decision, with the result that the suspected boundary node set is significantly shrunk. Lastly, tight boundary cycles corresponding to both inner and outer WSN boundaries are derived by searching the suspected boundary node set. Furthermore, regarding WSNs with relatively low node densities, the proposed algorithm is adapted to improve the quality of boundary detection. Even though the proposed algorithm is initially presented under the assumption of the idealized unit disk graph (UDG) model, we further consider the more realistic quasi-UDG (QUDG) model. In addition, a message complexity analysis confirms the energy efficiency of the proposed algorithm. Finally, we carry out a thorough evaluation showing that our algorithm is applicable to both dense and sparse deployments of WSNs and is able to produce accurate results.https://doi.org/10.1155/2014/897039 |
| spellingShingle | Baoqi Huang Wei Wu Guanglai Gao Tao Zhang Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information International Journal of Distributed Sensor Networks |
| title | Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information |
| title_full | Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information |
| title_fullStr | Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information |
| title_full_unstemmed | Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information |
| title_short | Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information |
| title_sort | recognizing boundaries in wireless sensor networks based on local connectivity information |
| url | https://doi.org/10.1155/2014/897039 |
| work_keys_str_mv | AT baoqihuang recognizingboundariesinwirelesssensornetworksbasedonlocalconnectivityinformation AT weiwu recognizingboundariesinwirelesssensornetworksbasedonlocalconnectivityinformation AT guanglaigao recognizingboundariesinwirelesssensornetworksbasedonlocalconnectivityinformation AT taozhang recognizingboundariesinwirelesssensornetworksbasedonlocalconnectivityinformation |