Sciweavers

194 search results - page 20 / 39
» Gathering Algorithms on Paths Under Interference Constraints
Sort
View
ICC
2007
IEEE
185views Communications» more  ICC 2007»
14 years 1 months ago
Maximal Lifetime Rate and Power Allocation for Sensor Networks with Data Distortion Constraints
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
James C. F. Li, Subhrakanti Dey, Jamie S. Evans
TWC
2008
159views more  TWC 2008»
13 years 7 months ago
Resource allocation for spectrum underlay in cognitive radio networks
A resource allocation framework is presented for spectrum underlay in cognitive radio networks. We consider both interference constraints for primary users and quality of service (...
Long Bao Le, Ekram Hossain
SPAA
2003
ACM
14 years 26 days ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
ICDCS
1999
IEEE
13 years 12 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
—In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmi...
Rui Zhang, Ying-Chang Liang