Sciweavers

208 search results - page 33 / 42
» Randomized Distance-Vector Routing Protocol
Sort
View
TSP
2008
100views more  TSP 2008»
13 years 8 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
IPSN
2011
Springer
12 years 11 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
INFOCOM
2003
IEEE
14 years 1 months ago
A Framework for Reliable Routing in Mobile Ad Hoc Networks
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K....
EDCC
2010
Springer
14 years 1 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
IWCMC
2006
ACM
14 years 2 months ago
VANETCODE: network coding to enhance cooperative downloading in vehicular ad-hoc networks
Inter-vehicular communication is fast emerging as a popular application for mobile ad-hoc networks. Content distribution in Vehicular Ad-Hoc Networks (VANET) is particularly chall...
Shabbir Ahmed, Salil S. Kanhere