Sciweavers

332 search results - page 9 / 67
» Algorithmic aspects of capacity in wireless networks
Sort
View
MOBICOM
2003
ACM
14 years 2 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
TWC
2008
103views more  TWC 2008»
13 years 8 months ago
Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks
In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. ...
Jun Cai, Xuemin Shen, Jon W. Mark, Attahiru Sule A...
WCNC
2008
IEEE
14 years 3 months ago
Adaptive Split Transmission for Video Streams in Wireless Mesh Networks
— Wireless mesh networks hold great promise in the wireless transmission of video flows, particularly if the problem of providing sufficient network capacity can be addressed. ...
Wanqing Tu, Cormac J. Sreenan
TCOM
2008
120views more  TCOM 2008»
13 years 8 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
INFOCOM
2008
IEEE
14 years 3 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose