Combinatorica
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Locating Tiny Sensors in Time and Space: A Case Study
ICCD '02 Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD'02)
Bluetooth and sensor networks: a reality check
Proceedings of the 1st international conference on Embedded networked sensor systems
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Evaluation of basic protocols for optical smart dust networks
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
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
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper we numerically analyze the impact of interferences on the probability of success of a localization algorithm. This problem is particularly relevant in the context of sensor networks. Actually, our numerical results are relevant even when we do not consider interferences. Moreover, our numerical computations show that the main harmful interferences are the ones occurring between sensors which get localized at the same time and send simultaneously their own location. This is demonstrated by varying the time span of the random waiting time before the emissions. We then observe that the longer the waiting time the closer the curves are to the ones obtained without interferences. Hence, this proves to be an efficient way of reducing the impact of interferences. Moreover, our numerical experiments demonstrate that among the sectors of disk with same area, the one with the smaller radius of emission and larger angle of emission is the more appropriate to the localization algorithm.