Sciweavers

14 search results - page 2 / 3
» Selfish Routing with Incomplete Information
Sort
View
INFOCOM
2012
IEEE
11 years 8 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
CNIS
2006
13 years 7 months ago
Self-organising quorum systems for ad hoc networks
There are many essential applications for quorum systems in ad-hoc networks, such as that of location servers in large-scale networks. Existing research proposes many approaches t...
Gareth Owen, Mo Adda
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
13 years 5 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh
IEEEIAS
2008
IEEE
13 years 12 months ago
A Friend Mechanism for Mobile Ad Hoc Networks
: In the autonomous environment of mobile ad hoc network (MANET) where nodes are free to move around and depend on each other to initiate communication, cooperation among nodes is ...
Shukor Abd Razak, Normalia Samian, Mohd Aizaini Ma...
SENSYS
2006
ACM
13 years 11 months ago
RBP: robust broadcast propagation in wireless networks
Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated pe...
Fred Stann, John S. Heidemann, Rajesh Shroff, Muha...