Sciweavers

Share
15 search results - page 2 / 3
» Void Traversal for Guaranteed Delivery in Geometric Routing
Sort
View
CCCG
2008
11 years 6 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
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...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
INFOCOM
2008
IEEE
11 years 11 months ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...
GLOBECOM
2006
IEEE
11 years 11 months ago
Position-based Routing using Virtual Small World in MANETs
— Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased ro...
Cong Liu, Jie Wu
ICCCN
2007
IEEE
11 years 7 months ago
Greedy Face Routing with Face ID Support in Wireless Networks
—Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should pro...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
ICDCSW
2009
IEEE
11 years 12 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
books