137 search results - page 11 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
TON
2008
13 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
IWDC
2005
Springer
14 years 25 days ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...