Coordinate-Free Boundary Nodes Identification by Angle Comparison in Wireless Sensor Networks

Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 234)

Abstract

Identifying the boundary nodes of a wireless sensor network (WSN) is one of the prerequisites for healing coverage holes, which belongs to the main problems of QoS in a network. Most of the existing solutions for this problem rely on the usage of coordinates or a relatively even distribution of sensors on the underlying network. However, as equipping localization devices on sensors usually means considerably higher cost, coordinates are often unavailable in low-budget networks. And it is often hard to guarantee the distribution of nodes. Therefore, identifying the boundary nodes without coordinates still faces difficulties. In this paper, we propose a distributed algorithm to solve this problem. In our method, a checking node first finds out all the potential triangles that with vertices from the 1-hop neighbors of the node. Then, the sensor keeps triangles containing it by calculating angles. At last, triangles with gap edges are identified by angle comparison to avoid wrong identification of a boundary node which has a U shaped ring locates beside. Illustrated simulation results show the performance effectiveness of our method, especially in networks with random and uneven sensor deployment.

Keywords

Boundary node identification Coordinate-free method Angle comparison Coverage problem Wireless sensor networks 

References

  1. 1.
    Shu, L., Mukherjee, M., Wu, X.: Toxic gas boundary area detection in large-scale petrochemical plants with industrial wireless sensor networks. IEEE Commun. Mag. 54, 22–28 (2016)CrossRefGoogle Scholar
  2. 2.
    Senouci, M., Mellouk, A., Assnoune, K.: Localized movement-assisted sensor deployment algorithm for hole detection and healing. IEEE Trans. Parallel Distrib. Syst. 25, 1267–1277 (2014). ISSN: 1045-9219CrossRefGoogle Scholar
  3. 3.
    Fang, F., Gao, J., Guibas, L.: Locating and bypassing holes in sensor networks. Mobile Netw. Appl. 11, 187–200 (2006)CrossRefGoogle Scholar
  4. 4.
    Li, W., Zhang, W., Sneddon, I.N.: Coverage hole and boundary nodes detection in wireless sensor networks. J. Netw. Comput. Appl. 48, 35–43 (2015)CrossRefGoogle Scholar
  5. 5.
    Fekete, S.P., Kaufmann, M., Krooller, A., Lehmann, K.: A new approach for boundary recognition in geometric sensor networks. In: Proceedings of the 17th Canadian Conference on Computational Geometry, pp. 82–85 (2005)Google Scholar
  6. 6.
    Kroller, A., Fekete, S.P., Pfistere, D., Fischer, S.: Deterministic boundary recognition and topology extraction. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, Miami, pp. 1000–1009 (2006)Google Scholar
  7. 7.
    Wang, Y., Gao, J., Mitchell, J.: Boundary recognition in sensor networks by topological methods. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, MobiCom 2006, Los Angeles, pp. 122–133 (2006)Google Scholar
  8. 8.
    Beghdad, R., Lamraoui, A.: Boundary and holes recognition in wireless sensor Networks. J. Innov. Digit. Ecosyst. 3(1), 1–14 (2016)CrossRefGoogle Scholar
  9. 9.
    Dhanapala, D., Jayasumana, A., Mehta, S.: On boundary detection of 2D and 3D wireless sensor networks. In: 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, Houston, pp. 1–5 (2011)Google Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyAnhui University of TechnologyMaanshanChina

Personalised recommendations