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.

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 = aug

day = "2",

doi = "10.1109/ICCTA.2007.1",

language = "English",

isbn = "0769527701",

series = "Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007",

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.