Coverage and Connectivity Guaranteed Deterministic Deployment Pattern for WSN

Conference paper
First Online:
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)

Abstract

In Wireless Sensor Network, node placement may be random or regular. In deterministic deployment, sensors are placed by hand at selected spots prior to network operation in wireless sensor network. It is more popular today when the deployment area is physically accessible and its success depends on the optimality of the deployment pattern. In this paper, we propose a new ploygon based deployment pattern for optimal placement of sensors in WSN with guaranteed coverage and connectivity. The coverage of the proposed deployment is compared with existing deployments like square, stripe, triangles and shown positive results. The connectivity is measured as the number of active nodes in the dominating set and it is also good when we compare the connectivity with a topology construction algorithms A3 in [7].

Keywords

Sensor Network Sensor Node Wireless Sensor Network Active Node Topology Control 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Bai H, Xuan D, Yun Z, Lai T, Jia W (2008) Complete optimal deployment patterns for full-coverage and k-connectivity \((k \le 6) \) wireless sensor networks. In: Proceedings of the 9th ACM international symposium on mobile ad hoc networking and computingGoogle Scholar
  2. 2.
    Junguo Z, Feng Z (2012) Study on optimal regular deployment patterns of wireless sensor network. Res J Appl Sci Eng Technol 4:2300–2303Google Scholar
  3. 3.
    Labrador MA, Wightman PM (2009) Topology control in wireless sensor networks. Springer, HeidelbergMATHGoogle Scholar
  4. 4.
    Liu L, Xia F, Wang Z, Chen J, Sun Y (2005) Deployment issues in wireless sensor networks. Lecture notes in computer science, pp 239–248Google Scholar
  5. 5.
    Santhi P (2005) Topology control in ad hoc and sensor networks. Wiley, New JerseyCrossRefGoogle Scholar
  6. 6.
    Wightman P, Labrador M (2009) Atarraya-a simulation tool to teach and research topology control algorithms for wireless sensor networks. In: Proceedings of the 2nd international ICST conference on simulation tools and techniquesGoogle Scholar
  7. 7.
    Wightman PM, Labrador MA (2011) A family of simple distributed minimum connected dominating set-based topology construction algorithms. J Netw Comput Appl 1997–2010Google Scholar
  8. 8.
    Yun Z, Bai X, Xuan D, Lai TH, Weijia J (2010) Optimal deployment patterns for full coverage and k-connectivity \((k \le 6)\) wireless sensor networks. IEEE/ACM Trans Netw 18:934–947CrossRefGoogle Scholar
  9. 9.
    Zhang H, Hou J (2005) Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens Wirel Netw 1:89–123Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Kalasalingam University KrishnankoilIndia

Personalised recommendations