Algorithms 17-18. The shortest paths from a fixed node in a network
M. Sysło (1972)
Applicationes Mathematicae
Similarity:
M. Sysło (1972)
Applicationes Mathematicae
Similarity:
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Ewa Niewiadomska-Szynkiewicz (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
Recent advances in technology have enabled the development of low cost, low power and multi functional wireless sensing devices. These devices are networked through setting up a Wireless Sensor Network (WSN). Sensors that form a WSN are expected to be remotely deployed in large numbers and to self-organize to perform distributed sensing and acting tasks. WSNs are growing rapidly in both size and complexity, and it is becoming increasingly difficult to develop and investigate such large...
Ewa Niewiadomska-Szynkiewicz, Michał Marks (2009)
International Journal of Applied Mathematics and Computer Science
Similarity:
Many applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Self-organization and localization capabilities are one of the most important requirements in sensor networks. This paper provides an overview of centralized distance-based algorithms for estimating the positions of nodes in a sensor network. We discuss and compare three approaches: semidefinite programming, simulated annealing and two-phase stochastic optimization-a...
Guo, Qin, Luo, Mingxing, Li, Lixiang, Yang, Yixian (2010)
Mathematical Problems in Engineering
Similarity:
Ľudovít Molnár (1971)
Kybernetika
Similarity:
Ľudovít Molnár (1971)
Kybernetika
Similarity:
T. B. Boffey (1991)
The Yugoslav Journal of Operations Research
Similarity: