Sciweavers

102 search results - page 7 / 21
» Radio Network Distributed Algorithms in the Unknown Neighbor...
Sort
View
MOBIHOC
2007
ACM
14 years 8 months ago
Allocating dynamic time-spectrum blocks in cognitive radio networks
A number of studies have shown the abundance of unused spectrum in the TV bands. This is in stark contrast to the overcrowding of wireless devices in the ISM bands. A recent trend...
Yuan Yuan, Paramvir Bahl, Ranveer Chandra, Thomas ...
ADHOCNOW
2008
Springer
13 years 10 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
PODC
2011
ACM
12 years 11 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 10 days ago
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
Yi Gai, Bhaskar Krishnamachari
MOBIHOC
2006
ACM
14 years 8 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu