1578 search results - page 60 / 316 » Direct Routing: Algorithms and Complexity |
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
IEEEIA
2009
13 years 6 months ago
2009
recently, mobile agents have been used to solve many problems in wireless sensor networks. Agents are usually transferred from a node to another to aggregate the sensed data and si...
JALC
2002
13 years 8 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper focus on the testbed experimentation of a meshed tree routing algorithm with local link state for Wireless Personal Area networks (WPANs) based on current IEEE 802.1...
CCCG
2008
13 years 10 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...