Sciweavers

266 search results - page 52 / 54
» Capacity bounds for ad hoc and hybrid wireless networks
Sort
View
LCN
2007
IEEE
14 years 1 months ago
Semi-Split TCP: Maintaining End-to-End Semantics for Split TCP
—It has long been acknowledged that TCP performance suffers in hybrid networks. A Split TCP approach has been proposed to address this problem. In this approach, a proxy is emplo...
Fei Xie, Ning Jiang, Yao Hua Ho, Kien A. Hua
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
MOBIHOC
2001
ACM
14 years 7 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
TON
2008
109views more  TON 2008»
13 years 7 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 1 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun