A distributed location identification algorithm for ad hoc networks using computational geometric methods

Koushik Sinha, A. Datta Chowdhury

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

2 Citations (Scopus)

Abstract

We present here a novel approach where we identify a region within which a node is guaranteed to be found, in contrast to the existing approaches where no such confining region for a node can be guaranteed, but only the location could be estimated either with no definitive error bound or only with some probabilistic error. The location identification algorithm presented here minimizes the size of this region, using computational geometric methods. The proposed technique iteratively improves the region of residence of all the nodes in the network through the exchange of region information among neighbors in O(nD) time, where n and D are the number of nodes and diameter of the network respectively. Simulation results also show encouraging results with this approach.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages62-72
Number of pages11
Volume3769 LNCS
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event12th International Conference on High Performance Computing, HiPC 2005 - Goa, India
Duration: 18 Dec 200521 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3769 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on High Performance Computing, HiPC 2005
CountryIndia
CityGoa
Period18/12/0521/12/05

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Sinha, K., & Chowdhury, A. D. (2005). A distributed location identification algorithm for ad hoc networks using computational geometric methods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3769 LNCS, pp. 62-72). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).