Skip to main content

Advertisement

Springer Nature Link
Log in

On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

This paper considers a two-tier hierarchical heterogeneous wireless sensor network using the concept of clustering. The network has two type of nodes: regular sensor nodes (litenodes or LN) with limited communications, storage, energy, and computation power; and high-end sophisticated nodes (SNs), or clusterheads, with significantly additional resources. The litenodes communicate their data to the SNs and the SNs forward all collected data to a central gateway node called the base station (BS). Our network architecture allows the LNs to reach a SN via multiple hops through other LNs. We investigate the problem of optimally placing a minimum number of sophisticated nodes to handle the traffic generated by the lite nodes, while ensuring that the SNs form a connected network using their wireless links. This placement problem is formulated and solved as multi-constraint optimization problem using well known approaches: Binary Integer Linear Programming (BILP) approach, Greedy approach (GREEDY) and Genetic Algorithm (GA) approach. It was found through simulations that BILP performed best for regular grid topologies, while GA performed better for random LN deployment. Furthermore, the effects of various parameters on the solution are also presented. The paper also proposes a HYBRID approach that uses the solutions provided by GREEDY and/or BILP as the initial solution to the GA. Using HYBRID, results comparable to original GA could be obtained in only 11.46% of the time required for the original GA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10

Similar content being viewed by others

References

  1. Raghavendra C, Sivalingam K, Znati T (eds) (2004) Wireless sensor networks. Springer, Boston

    Google Scholar 

  2. Mhatre V, Rosenberg C (2004) Homogeneous vs. heterogeneous clustered sensor networks: a comparative study. In: IEEE international conference on communications, June, vol 6. pp 3646–3651

  3. Tang J, Hao B, Sen A (2006) Relay node placement in large scale wireless sensor networks. J Comput Commun 29(4):490–501 (Special Issue on Sensor Networks)

    Article  Google Scholar 

  4. Turon M (2005) Mote-view: a sensor network monitoring and management tool. In: The second IEEE workshop on embedded networked sensors, Sydney, March 2005, pp 11–18

  5. Savarese C, Rabaey JM, Beutel J (2001) Locationing in distributed ad-hoc wireless sensor networks. In: Proceedings of IEEE international conference on acoustics, speech and signal processing, May, vol 4. IEEE, Piscataway, pp 2037–2040

    Google Scholar 

  6. Pandey S, Prasad P, Sinha P, Agrawal P (2005) Localization of sensor networks considering energy accuracy tradeoffs. In: Collaborative computing: networking, applications and worksharing, 2005 international conference on, San Jose, December 2005, pp 1–10

  7. Suomela J (2006) Computational complexity of relay placement in sensor networks. In: Lecture Notes in Computer Science, January, vol 3831. Springer, Heidelberg, pp 521–529

    Google Scholar 

  8. Pandey S, Dong S, Agrawal P, Sivalingam K (2007) A hybrid approach to optimize node placements in hierarchical heterogeneous networks. In: Proceedings of IEEE wireless communications and networking conference, Hong Kong, March 2007

  9. Gupta G, Younis M (2003) Fault-tolerant clustering of wireless sensor networks. In: Proceeding of IEEE WCNC. IEEE, Piscataway, pp 1579–1584

    Google Scholar 

  10. Liu H, Wan P, Jia X (2006) On optimal placement of relay nodes for reliable connectivity in wireless sensor networks. J Comb Optim 11:249–260

    Article  MATH  MathSciNet  Google Scholar 

  11. Hou Y, Shi Y, Sherali H, Midkiff SF (2005) On energy provisioning and relay node placement for wireless sensor network. IEEE Trans Wirel Commun 4(5):2579–2590

    Article  Google Scholar 

  12. Li W, Cassandras CG (2005) A minimum-power wireless sensor network self-deployment scheme. IEEE Wirel Commun Netw Conf 3:1897–1902, March

    Article  Google Scholar 

  13. Chakrabarty K, Iyengar SS, Qi H, Cho E (2002) Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans Comput 51(12):1448–1453

    Article  MathSciNet  Google Scholar 

  14. Cheng X, Du D, Wang L, Xu B (2008) Relay sensor placement in wireless sensor networks. Wirel Netw 14(3)

  15. Xin Y, Guven T, Shayman MA (2005) Topology design for wireless ad-hoc networks with backbone support. In: The IEEE conference on information sciences and systems, Baltimore, March 2005

  16. Xu K, Wang Q, Hassanein H, Takahara G (2005) Optimal wireless sensor networks (wsns) deployment: minimum cost with lifetime constraint. In: IEEE international conference on wireless and mobile computing, networking and communications. IEEE, Piscataway, pp 454–461

    Google Scholar 

  17. Wang Q, Xu K, Hassanein H, Takahara G (2005) Minimum cost guaranteed lifetime design for heterogeneous wireless sensor networks. In: Proc. IEEE IPCCC, Phoenix, April, pp. 599–604

  18. Wang Q, Xu K, Takahara G, Hassanein H (2005) Locally optimal relay node placement in heterogeneous wireless sensor networks. In: IEEE global telecommunications conference, December, vol 6. IEEE, Piscataway, pp 3549–3553

    Chapter  Google Scholar 

  19. Akkaya K, Younis M (2005) A survey of routing protocols in wireless sensor networks. Elsevier Ad Hoc Netw J 3:325–349

    Google Scholar 

  20. Shakkottai S, Srikant R, Shroff N (2003) Unreliable sensor grids: coverage, connectivity and diameter. In: IEEE INFOCOM, San Francisco, March

  21. ILOG, I (2006) Ilog cplex 7.5. Mountain View, California, July. (Online) http://www.ilog.com

  22. Kahn JM, Katz RH, Pister KSJ (1999) Next century challenges: mobile networking for “smart dust”. In: ACM Mobicom, Seattle, August 1999

  23. Maulin P, Chandrasekaran R, Venkatesan S (2005) Energy efficient sensor,relay and base station placements for coverage, connectivity and routing. In: 24th IEEE international performance, computing, and communications conference, Phoenix, April 2005, pp 581–586

  24. Bredin JL, Demaine ED, Hajiaghayi M, Rus D (2005) Deploying sensor networks with guaranteed capacity and fault tolerance. In: MobiHoc ’05: proceedings of the 6th ACM international symposium on mobile ad hoc networking and computing, pp 309–319

  25. Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques. In: KDD workshop on text mining

  26. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  27. West DB (2000) Introduction to graph theory, 2nd edn. Prentice Hall, Englewood Cliffs

    Google Scholar 

  28. Houck C, Joines J, Kay M (1995) A genetic algorithm for function optimization: a matlab implementation. NCSU, Tech. Rep. NCSU-IE TR 95-09

  29. Pandey S (2006) Secure localization and node placement strategies for wireless networks. Auburn University, Ph.D. Thesis

  30. Ramsey F, Schafer D (2002) The Statistical Sleuth, 2nd edn. Duxbury, Pacific Grove

    Google Scholar 

  31. Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proc. ACM Mobicom, Boston, MA

  32. Heizelman W, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication Protocol for wireless microsensor networks. In: Proc. 33rd international conference on system sciences, January

Download references

Author information

Author notes

  1. Santhosh Pandey

    Present address: Cisco Systems, San Jose, CA, USA

Authors and Affiliations

  1. Department of ECE, Auburn University, Auburn, AL, 36849, USA

    Santhosh Pandey, Shaoqiang Dong & Prathima Agrawal

  2. CSEE Department, University of Maryland, Baltimore County (UMBC), Baltimore, MD, 21250, USA

    Krishna M. Sivalingam

  3. Indian Institute of Technology Madras, Chennai, India

    Krishna M. Sivalingam

Authors
  1. Santhosh Pandey
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shaoqiang Dong
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Prathima Agrawal
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Krishna M. Sivalingam
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Krishna M. Sivalingam.

Additional information

Part of the research was supported by a grant from Air Force Office of Scientific Research (AFOSR) grant No. FA9550-06-1-0103.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pandey, S., Dong, S., Agrawal, P. et al. On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks. Mobile Netw Appl 14, 401–414 (2009). https://doi.org/10.1007/s11036-008-0108-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-008-0108-7

Keywords