Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Energy balanced data propagation in wireless sensor networks
Wireless Networks
An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Priority based adaptive coordination of wireless sensors and actors
Proceedings of the 2nd ACM international workshop on Quality of service & security for wireless and mobile networks
Probabilistic Protocols for Fair Communication in Wireless Sensor Networks
Algorithmic Aspects of Wireless Sensor Networks
Near-optimal data propagation by efficiently advertising obstacle boundaries
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Simple and efficient geographic routing around obstacles for wireless sensor networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Hi-index | 0.00 |
Widely used positioning systems like GPS are not a valid solution in large networks with small size, low cost sensors, due both to their size and their cost. Thus, new solutions for localization awareness are emerging, commonly based on the existence of a few references spread into the network. We propose a localization algorithm to reduce the number of transmitting nodes. The algorithm relies on self selecting nodes for location information disclosure. Each node makes a decision based on its proximity to the nodes in the area covered only by two of the references used for its own localization. We analyze different aspects of the location awareness propagation problem: communication overhead, redundant transmissions, network coverage.