Sciweavers

2068 search results - page 240 / 414
» Performance Analysis of a Distributed Wireless Access Scheme
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CORR
2007
Springer
119views Education» more  CORR 2007»
15 years 4 months ago
Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection
This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional pa...
Caleb K. Lo, Robert W. Heath Jr., Sriram Vishwanat...
184
Voted
MOBICOM
2009
ACM
15 years 11 months ago
Revenue maximization and distributed power allocation in cognitive radio networks
Cognitive radio is an enabling technology that allows unlicensed users to opportunistically access the spectrum in order to enhance the spectrum efficiency. In this paper, we cons...
Shaolei Ren, Mihaela van der Schaar
PEWASUN
2004
ACM
15 years 10 months ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...
IPPS
2006
IEEE
15 years 10 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo