Sciweavers

1592 search results - page 84 / 319
» Source-Tree Routing in Wireless Networks
Sort
View
110
Voted
CONEXT
2005
ACM
15 years 2 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida
100
Voted
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 7 months ago
Performance Comparison and Analysis of Preemptive-DSR and TORA
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Preemptiv...
V. Ramesh, P. Subbaiah, N. Koteswar Rao, N. Subhas...
CN
2008
192views more  CN 2008»
15 years 22 days ago
Research on multicast routing protocols for mobile ad-hoc networks
A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links. The goal of MANETs is to ext...
Junhai Luo, Xue Liu, Danxia Ye
104
Voted
VTC
2006
IEEE
118views Communications» more  VTC 2006»
15 years 6 months ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu
106
Voted
JNW
2007
104views more  JNW 2007»
15 years 16 days ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad