Sciweavers

505 search results - page 68 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
ADHOC
2007
115views more  ADHOC 2007»
14 years 12 months ago
Modeling adaptive node capture attacks in multi-hop wireless networks
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...
Patrick Tague, Radha Poovendran
INFOCOM
2010
IEEE
14 years 10 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 9 months ago
Low Bound of Energy-Latency Trade-Off of Opportunistic Routing in Multi-Hop Networks
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
Ruifeng Zhang, Jean-Marie Gorce, Katia Jaffr&egrav...
ICC
2011
IEEE
201views Communications» more  ICC 2011»
13 years 11 months ago
Channel Aggregation in Cognitive Radio Networks with Practical Considerations
—In cognitive radio (CR) networks, licensed spectrum that can be shared by secondary users (SUs) is always restricted by the needs of primary users (PUs). Although channel aggreg...
Bo Gao, Yaling Yang, Jung-Min Park 0001
ICASSP
2008
IEEE
15 years 6 months ago
Cooperative MIMO-beamforming for multiuser relay networks
In this paper, we develop a beamforming algorithm for multiuser MIMO-relaying wireless systems. We consider a relaying scenario with multiple sources transmitting to one or more d...
Amr El-Keyi, Benoît Champagne