### 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 language | English |
---|---|

Title of host publication | Proceedings - International Conference on Computing |

Subtitle of host publication | Theory and Applications, ICCTA 2007 |

Pages | 87-92 |

Number of pages | 6 |

DOIs | |

Publication status | Published - 2 Aug 2007 |

Event | International Conference on Computing: Theory and Applications, ICCTA 2007 - Kolkata, India Duration: 5 Mar 2007 → 7 Mar 2007 |

### Publication series

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

### Other

Other | International Conference on Computing: Theory and Applications, ICCTA 2007 |
---|---|

Country | India |

City | Kolkata |

Period | 5/3/07 → 7/3/07 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007*(pp. 87-92). [4127348] (Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007). https://doi.org/10.1109/ICCTA.2007.1