Sciweavers

2149 search results - page 47 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
BROADNETS
2004
IEEE
15 years 5 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
Michael J. Neely, Eytan Modiano
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 1 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 7 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
MOBIHOC
2009
ACM
16 years 1 months ago
Efficient resource management in OFDMA Femto cells
Femto cells are a cost-effective means of providing ubiquitous connectivity in future broadband wireless networks. While their primary purpose has been to improve coverage in curr...
Karthikeyan Sundaresan, Sampath Rangarajan
ICC
2009
IEEE
140views Communications» more  ICC 2009»
14 years 11 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...