A beacon selection algorithm for bounded error location estimation in ad hoc networks

Koushik Sinha, Atish Datta Chowdhury

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

8 Citations (Scopus)

Abstract

We consider the class of ad hoc networks, where a small percentage of the nodes are assumed to know their locations a priori and are denoted as reference nodes. Starting from the reference nodes, location information of other nodes are estimated in a hop by hop fashion. Beacon nodes are defined to be nodes that already have a location information (including the reference nodes). Using a two-dimensional cartesian coordinate system, we show that given a maximum of±ε error in the location of each of the beacon nodes anda maximum error of ±δ in each of the measured ranges along either axes, the location of a node can be computed within an error bound of±[3ε(l + √2) + 2δ] to ±(3ε + 2δ) along one axis and within ±[2δ(1 + √2) + 3ε] to ±(3ε+2δ) along its orthogonal axis, by using the beacon selection algorithm proposed in this paper.

Original languageEnglish
Title of host publicationProceedings - International Conference on Computing: Theory and Applications, ICCTA 2007
Pages87-92
Number of pages6
DOIs
Publication statusPublished - 2 Aug 2007
Externally publishedYes
EventInternational Conference on Computing: Theory and Applications, ICCTA 2007 - Kolkata, India
Duration: 5 Mar 20077 Mar 2007

Other

OtherInternational Conference on Computing: Theory and Applications, ICCTA 2007
CountryIndia
CityKolkata
Period5/3/077/3/07

Fingerprint

Ad hoc networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Hardware and Architecture

Cite this

Sinha, K., & Chowdhury, A. D. (2007). A beacon selection algorithm for bounded error location estimation in ad hoc networks. In Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007 (pp. 87-92). [4127348] https://doi.org/10.1109/ICCTA.2007.1

A beacon selection algorithm for bounded error location estimation in ad hoc networks. / Sinha, Koushik; Chowdhury, Atish Datta.

Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007. 2007. p. 87-92 4127348.

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

Sinha, K & Chowdhury, AD 2007, A beacon selection algorithm for bounded error location estimation in ad hoc networks. in Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007., 4127348, pp. 87-92, International Conference on Computing: Theory and Applications, ICCTA 2007, Kolkata, India, 5/3/07. https://doi.org/10.1109/ICCTA.2007.1
Sinha K, Chowdhury AD. A beacon selection algorithm for bounded error location estimation in ad hoc networks. In Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007. 2007. p. 87-92. 4127348 https://doi.org/10.1109/ICCTA.2007.1
Sinha, Koushik ; Chowdhury, Atish Datta. / A beacon selection algorithm for bounded error location estimation in ad hoc networks. Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007. 2007. pp. 87-92
@inproceedings{7011939bf2de4c6fab0d4cc2685c8994,
title = "A beacon selection algorithm for bounded error location estimation in ad hoc networks",
abstract = "We consider the class of ad hoc networks, where a small percentage of the nodes are assumed to know their locations a priori and are denoted as reference nodes. Starting from the reference nodes, location information of other nodes are estimated in a hop by hop fashion. Beacon nodes are defined to be nodes that already have a location information (including the reference nodes). Using a two-dimensional cartesian coordinate system, we show that given a maximum of±ε error in the location of each of the beacon nodes anda maximum error of ±δ in each of the measured ranges along either axes, the location of a node can be computed within an error bound of±[3ε(l + √2) + 2δ] to ±(3ε + 2δ) along one axis and within ±[2δ(1 + √2) + 3ε] to ±(3ε+2δ) along its orthogonal axis, by using the beacon selection algorithm proposed in this paper.",
author = "Koushik Sinha and Chowdhury, {Atish Datta}",
year = "2007",
month = "8",
day = "2",
doi = "10.1109/ICCTA.2007.1",
language = "English",
isbn = "0769527701",
pages = "87--92",
booktitle = "Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007",

}

TY - GEN

T1 - A beacon selection algorithm for bounded error location estimation in ad hoc networks

AU - Sinha, Koushik

AU - Chowdhury, Atish Datta

PY - 2007/8/2

Y1 - 2007/8/2

N2 - We consider the class of ad hoc networks, where a small percentage of the nodes are assumed to know their locations a priori and are denoted as reference nodes. Starting from the reference nodes, location information of other nodes are estimated in a hop by hop fashion. Beacon nodes are defined to be nodes that already have a location information (including the reference nodes). Using a two-dimensional cartesian coordinate system, we show that given a maximum of±ε error in the location of each of the beacon nodes anda maximum error of ±δ in each of the measured ranges along either axes, the location of a node can be computed within an error bound of±[3ε(l + √2) + 2δ] to ±(3ε + 2δ) along one axis and within ±[2δ(1 + √2) + 3ε] to ±(3ε+2δ) along its orthogonal axis, by using the beacon selection algorithm proposed in this paper.

AB - We consider the class of ad hoc networks, where a small percentage of the nodes are assumed to know their locations a priori and are denoted as reference nodes. Starting from the reference nodes, location information of other nodes are estimated in a hop by hop fashion. Beacon nodes are defined to be nodes that already have a location information (including the reference nodes). Using a two-dimensional cartesian coordinate system, we show that given a maximum of±ε error in the location of each of the beacon nodes anda maximum error of ±δ in each of the measured ranges along either axes, the location of a node can be computed within an error bound of±[3ε(l + √2) + 2δ] to ±(3ε + 2δ) along one axis and within ±[2δ(1 + √2) + 3ε] to ±(3ε+2δ) along its orthogonal axis, by using the beacon selection algorithm proposed in this paper.

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

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

U2 - 10.1109/ICCTA.2007.1

DO - 10.1109/ICCTA.2007.1

M3 - Conference contribution

SN - 0769527701

SN - 9780769527703

SP - 87

EP - 92

BT - Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007

ER -