Sciweavers

332 search results - page 27 / 67
» Algorithmic aspects of capacity in wireless networks
Sort
View
COCOON
2007
Springer
14 years 2 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...
TON
2010
127views more  TON 2010»
13 years 3 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
AINA
2008
IEEE
14 years 3 months ago
A Peer-to-Peer Approach for Mobile File Transfer in Opportunistic People Networks
With wireless technologies extending to every part of our daily lives, mobile networking applications are becoming increasingly popular for accessing the Internet. In this paper, ...
Ling-Jyh Chen, Ting-Kai Huang
GLOBECOM
2007
IEEE
14 years 16 days ago
Resource Efficient Survivable Clustering for Wireless Sensor Networks
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
Mohammad Masud Hasan, Jason P. Jue