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

Authors:
Koushik Sinha;Atish DattaChowdhury
Affiliations:
Honeywell Technology Solutions Lab, Bangalore, India;Honeywell Technology Solutions Lab, Bangalore, India
Venue:
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Year:
2005

Citing 7
Cited 0

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
A mobility-transparent deterministic broadcast mechanism for ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Location Systems for Ubiquitous Computing

Computer
GPS-Free Positioning in Mobile ad-hoc Networks

HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Exact Location Identification in a Mobile Computing Network

ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Indoor geolocation science and technology

IEEE Communications Magazine
Transmission techniques for radio LAN's-a comparative performance evaluation using ray tracing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.