Advertisement
Published in:
2005 | OriginalPaper | Chapter
A Distributed Location Identification Algorithm for Ad hoc Networks Using Computational Geometric Methods
Authors : Koushik Sinha, Atish DattaChowdhury
Published in: High Performance Computing – HiPC 2005
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.