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

22 Citations (Scopus)

Abstract

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
Pages343-352
Number of pages10
StatePublished - Dec 1 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

Conference

Conference12th International Conference on High Performance Computing, HiPC 2005
CountryIndia
CityGoa
Period12/18/0512/21/05

Fingerprint

Wireless Sensor Networks
Wireless sensor networks
Sensor nodes
Vertex of a graph
Sensor
Telecommunication links
Topology
Network Topology
Equipment and Supplies
Positioning
Simulation Experiment
High Accuracy
Cover
Target
Evaluate
Experiments
Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Deogun, J. S., Das, S., Hamza, H. S., & Goddard, S. (2005). An algorithm for boundary discovery in wireless sensor networks. In High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings (pp. 343-352). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).

An algorithm for boundary discovery in wireless sensor networks. / Deogun, Jitender S.; Das, Saket; Hamza, Haitham S.; Goddard, Steve.

High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. 2005. p. 343-352 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).

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

Deogun, JS, Das, S, Hamza, HS & Goddard, S 2005, An algorithm for boundary discovery in wireless sensor networks. in High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3769 LNCS, pp. 343-352, 12th International Conference on High Performance Computing, HiPC 2005, Goa, India, 12/18/05.
Deogun JS, Das S, Hamza HS, Goddard S. An algorithm for boundary discovery in wireless sensor networks. In High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. 2005. p. 343-352. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Deogun, Jitender S. ; Das, Saket ; Hamza, Haitham S. ; Goddard, Steve. / An algorithm for boundary discovery in wireless sensor networks. High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. 2005. pp. 343-352 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4f06787417624cd4b5db11a969d3ed1e,
title = "An algorithm for boundary discovery in wireless sensor networks",
abstract = "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.",
author = "Deogun, {Jitender S.} and Saket Das and Hamza, {Haitham S.} and Steve Goddard",
year = "2005",
month = "12",
day = "1",
language = "English (US)",
isbn = "3540309365",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "343--352",
booktitle = "High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings",

}

TY - GEN

T1 - An algorithm for boundary discovery in wireless sensor networks

AU - Deogun, Jitender S.

AU - Das, Saket

AU - Hamza, Haitham S.

AU - Goddard, Steve

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646748155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646748155&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33646748155

SN - 3540309365

SN - 9783540309369

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 343

EP - 352

BT - High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings

ER -