Sciweavers

306 search results - page 44 / 62
» Routing Algorithms for Anycast Messages
Sort
View
SENSYS
2003
ACM
15 years 5 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
ICC
2008
IEEE
121views Communications» more  ICC 2008»
15 years 6 months ago
Finding the Fastest Path in Wireless Networks
—The timeliness of packet delivery is an important performance measure in wireless networks, especially when urgent messages need to be transported through a network. This paper ...
Yi Xu, Wenye Wang
FSTTCS
2004
Springer
15 years 5 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICN
2009
Springer
15 years 4 months ago
New Algorithm for the Design of Topology Aware Hypercube in Multi-hop Ad Hoc Networks
Securing group communications in resource constrained, infrastructure-less environments such as Mobile Ad Hoc Networks (MANETs) has become one of the most challenging research dire...
Maria Striki, Kyriakos Manousakis, John S. Baras
INFOCOM
2008
IEEE
15 years 6 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...