Localization using discrete event simulation

Authors:
Baybora Aksoy;Volkan Ustun;Jeffrey S. Smith
Affiliations:
Auburn University, Auburn, AL;Auburn University, Auburn, AL;Auburn University, Auburn, AL
Venue:
WSC '04 Proceedings of the 36th conference on Winter simulation
Year:
2004

Citing 5
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Location Systems for Ubiquitous Computing

Computer
Shortest Path Algorithms: An Evaluation Using Real Road Networks

Transportation Science
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Relative location estimation in wireless sensor networks

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on the implementation of a localization algorithm for sensor networks using a discrete event simulation (DES) architecture. In this implementation, DES is used to calculate the distances between the sensors in terms of hop lengths and to implement a mass-spring optimization scheme. This implementation allows us to estimate the number of packets required during the localization process after the deployment of the sensors.