An algorithm for boundary discovery in wireless sensor networks

Jitender S. Deogun, Saket Das, Haitham S. Hamza, Steve Goddard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Scopus citations


Wireless Sensor Networks (WSNs) consist of a large number of nodes networked via wireless links. In many WSN settings, sensor nodes are deployed in an ad hoc manner. One important issue in this context is to detect the boundary of the deployed network to ensure that the sensor nodes cover the target area. In this paper, we propose a new algorithm that can be used to discover the boundary of a randomly deployed WSN. The algorithm does not require the sensor nodes to be equipped with positioning devices and is scalable for large number of nodes. Simulation experiments are developed to evaluate the performance of the proposed algorithms for different network topologies. The simulation results show that the algorithm detects the boundary nodes of the network with high accuracy.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing, HiPC 2005 - 12th International Conference, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540309365, 9783540309369
StatePublished - 2005
Event12th International Conference on High Performance Computing, HiPC 2005 - Goa, India
Duration: Dec 18 2005Dec 21 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3769 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Conference on High Performance Computing, HiPC 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'An algorithm for boundary discovery in wireless sensor networks'. Together they form a unique fingerprint.

Cite this