Sciweavers

964 search results - page 174 / 193
» An Efficient Routing Protocol for Ad-Hoc Networks
Sort
View
GCC
2004
Springer
15 years 3 months ago
Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
Ming Li, Jinfeng Hu, Haitao Dong, Dongsheng Wang, ...
COMCOM
2008
99views more  COMCOM 2008»
14 years 10 months ago
Efficiently reconfigurable backbones for wireless sensor networks
We present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building ...
Stefano Basagni, Chiara Petrioli, Roberto Petrocci...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
14 years 9 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
TMC
2008
136views more  TMC 2008»
14 years 9 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
TSP
2008
100views more  TSP 2008»
14 years 9 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....