The active badge system (abstract)
CHI '93 Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
On constructing minimum spanning trees in k-dimensional spaces and related problems
On constructing minimum spanning trees in k-dimensional spaces and related problems
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
GPS-Free node localization in mobile wireless sensor networks
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Scalable logical coordinates framework for routing in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
MuR: A Distributed Preliminary Method For Location Techniques in Sensor Networks
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
| Hi-index | 0.00 |
The use of localization mechanism is essential in wireless sensor networks either for communication protocols (geographic routing protocol) or for application (vehicle tracking). The goal of localization mechanism is to determine either precisely or coarsely the node location using either a global reference (GPS) or a locale one. In this work, we introduce a new localized algorithm which classified the proximity of the neighborhood for a node. This qualitative localization does not use any anchor or dedicated hardware like a GPS. Each node builds a Qualitative Distance Table according to the 2-hop neighborhood informations. Thus, the algorithm allows to determine coarsely the location of the neighbors which are classified as very close, closeor far. The algorithm is analyzed on a regular particular topology and then we evaluate this accuracy on a random topologies. We apply this algorithm for a localized topology control and we show that these topology control algorithms remain effective even without GPS information.