Wireless Networks

, Volume 25, Issue 8, pp 4705–4726 | Cite as

Extracting the overlapped sub-regions in wireless sensor networks

  • Ammar Hawbani
  • Xingfu WangEmail author
  • Hassan Kuhlani
  • Aiman Ghannami
  • Muhammad Umar Farooq
  • Yaser Al-sharabi


In wireless sensor networks, the overlapped sub-regions (faces) are generated due to the intersections among the sensing ranges of nodes. The faces play a significant role in solving the three problems k-coverage (i.e., all the points in the interested field should be covered by at least k active nodes while maintaining connectivity between all active nodes), coverage scheduling and cover sets. To find the faces and discover their coverage degrees, this article presents a distributed algorithm that runs in three steps. First, a colored graph called Intersection Points Colored Graph (IPCG) is proposed, in which the vertices are defined by the range-intersections of nodes-devices and are colored according to the position of these intersections in relation to the ranges of the nodes. The vertex that located on perimeter of the node’s range is colored by red, while the green vertex is an intersection of two ranges inside the range of a third node. The edge that joins two red vertices is colored by red and the edge that joins two green vertices is colored by green while the edge that joins two distinct colored vertices is colored by blue. Second, based on their properties and distinct features, the faces in IPCG are classified into five classes (simple, negative, red, green and positive). Third, based on faces classification, the Three Colored Trees algorithm is proposed to extract the faces in linear time in terms of the number of vertices and edges in IPCG.


Colored graph Overlapped sub-regions WSN sub-regions Wireless sensor networks Faces coverage Coverage scheduling 



This paper is supported by the “Fundamental Research Funds for the Central Universities NO. WK2150110007” and by the National Natural Science Foundation of China (Nos. 61772490, 61472382, 61472381 and 61572454).

Compliance with ethical standards

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.


  1. 1.
    Ammar, Hawbani., et al. (2013). Zigzag coverage scheme algorithm & analysis for wireless sensor networks. Network Protocols and Algorithms, 5(4), 19–38. Scholar
  2. 2.
    Hawbani, A., Wang, X., Husaini, N., & Karmoshi, S. (2014). Grid coverage algorithm & analyzing for wireless sensor networks. Network Protocols and Algorithms, 6(4), 1–18. Scholar
  3. 3.
    Dargie, W., & Poellabauer, C. (2010). Fundamentals of wireless sensor networks: theory and practice. Hoboken: Wiley. ISBN 978-0-470-97568-8.CrossRefGoogle Scholar
  4. 4.
    Ghannami, A., & Shao, C. (2016, December). Experience-based learning for identifying sub-regions in wireless sensor networks. In Internet Technology and Secured Transactions (ICITST), 2016 11th International Conference for (pp. 326–327). IEEE.Google Scholar
  5. 5.
    Zhao, L., Al-Dubai, A., Li, X., Chen, G., & Min, G. (2017). A new efficient cross-layer relay node selection model for wireless community mesh networks. Computers & Electrical Engineering, 61, 361–372.CrossRefGoogle Scholar
  6. 6.
    Rossi, A., Singh, A., & Sevaux, M. (2012). Column generation algorithm for sensor coverage scheduling under bandwidth constraints. Networks, 60(3), 141–154. Scholar
  7. 7.
    Hawbani, A., Wang, X., Karmoshi, S., Wang, L., & Husaini, N. (2015). Sensors grouping hierarchy structure for wireless sensor network. International Journal of Distributed Sensor Networks, 11(8), 650519. Scholar
  8. 8.
    Mini, S., Udgata, S. K., & Sabat, S. L. (2014). Sensor deployment and scheduling for target coverage problem in wireless sensor networks. IEEE Sensors Journal, 14(3), 636–644. Scholar
  9. 9.
    Ammari, H. M., & Das, S. K. (2012). Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Transactions on Computers, 61(1), 118–133. Scholar
  10. 10.
    Zhu, C., Zheng, C., Shu, L., & Han, G. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 619–632. Scholar
  11. 11.
    Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., & Gill, C. (2005). Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Transactions on Sensor Networks (TOSN), 1(1), 36–72. Scholar
  12. 12.
    Yu, J., Chen, Y., Ma, L., Huang, B., & Cheng, X. (2016). On connected target k-coverage in heterogeneous wireless sensor networks. Sensors, 16(1), 104. Scholar
  13. 13.
    Hawbani, A., Wang, X., Kuhlani, H., Karmoshi, S., Ghoul, R., Sharabi, Y., et al. (2017). Sink-oriented tree based data dissemination protocol for mobile sinks wireless sensor networks. Wireless Networks. Scholar
  14. 14.
    Cardei, M., Thai, M. T., Li, Y., & Wu, W. (2005, March). Energy-efficient target coverage in wireless sensor networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE (Vol. 3, pp. 1976–1984). IEEE.
  15. 15.
    Cardei, M., & Du, D. Z. (2005). Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 11(3), 333–340.CrossRefGoogle Scholar
  16. 16.
    Zhang, H., & Hou, J. C. (2005). Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks, 1(1–2), 89–124.Google Scholar
  17. 17.
    Singh, A., & Sharma, T. P. (2014, July). A survey on area coverage in wireless sensor networks. In Control, Instrumentation, Communication and Computational Technologies (ICCICCT), 2014 International Conference on (pp. 829–836). IEEE.
  18. 18.
    Liu, Y., Pu, J., Zhang, S., Liu, Y., & Xiong, Z. (2009). A localized coverage preserving protocol for wireless sensor networks. Sensors, 9(1), 281–302. Scholar
  19. 19.
    Liao, Z., Wang, J., Zhang, S., Cao, J., & Min, G. (2015). Minimizing movement for target coverage and network connectivity in mobile sensor networks. IEEE Transactions on Parallel and Distributed Systems, 26(7), 1971–1983. Scholar
  20. 20.
    Lu, Z., Li, W. W., & Pan, M. (2015). Maximum lifetime scheduling for target coverage and data collection in wireless sensor networks. IEEE Transactions on Vehicular Technology, 64(2), 714–727. Scholar
  21. 21.
    Huang, C. F., & Tseng, Y. C. (2005). The coverage problem in a wireless sensor network. Mobile Networks and Applications, 10(4), 519–528. Scholar
  22. 22.
    Wilson, R. J. (1996). Introduction to graph theory (4th ed.). Delhi: Pearson Education India.zbMATHGoogle Scholar
  23. 23.
    Al-Shalabi, A. A., & Manaf, M. (2012, September). MLS: An efficient maximum layers scheduling algorithm for k-coverage wireless sensor networks. In Wireless Technology and Applications (ISWTA), 2012 IEEE Symposium on (pp. 171–176). IEEE.
  24. 24.
    Mao, X., Liu, Y., Tang, S., Liu, H., Han, J., & Li, X. Y. (2013). Finding best and worst k-coverage paths in multihop wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 24(12), 2396–2406. Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Ammar Hawbani
    • 1
  • Xingfu Wang
    • 1
    Email author
  • Hassan Kuhlani
    • 1
  • Aiman Ghannami
    • 1
  • Muhammad Umar Farooq
    • 1
  • Yaser Al-sharabi
    • 2
  1. 1.School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefeiChina
  2. 2.School of Computer and Information ScienceHefei University of TechnologyHefeiChina

Personalised recommendations