Sciweavers

114 search results - page 4 / 23
» Random access transport capacity
Sort
View
IOR
2006
173views more  IOR 2006»
13 years 6 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
MOBIHOC
2008
ACM
14 years 6 months ago
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garc...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 6 months ago
Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance
We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We co...
Ravi Tandon, Sennur Ulukus
ICC
2007
IEEE
14 years 20 days ago
Energy and Utility Optimization in Wireless Networks with Random Access
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
Amir Mahdi Khodaian, Babak Hossein Khalaj
LISA
2008
13 years 8 months ago
Portable Desktop Applications Based on P2P Transportation and Virtualization
Play-on-demand is usually regarded as a feasible access mode for web content (including streaming video, web pages and so on), web services and some Software-As-A-Service (SaaS) a...
Youhui Zhang, Xiaoling Wang, Liang Hong