Sciweavers

1036 search results - page 22 / 208
» The Distributed Wireless Gathering Problem
Sort
View
MOBIHOC
2006
ACM
14 years 10 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
BROADNETS
2006
IEEE
14 years 27 days ago
On the Broadcast Storm Problem in Ad hoc Wireless Networks
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
Ozan K. Tonguz, Nawaporn Wisitpongphan, Jayendra S...
CN
2010
183views more  CN 2010»
13 years 11 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 4 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
WICON
2008
14 years 10 days ago
A negotiation game for multichannel access in cognitive radio networks
We consider the problem of efficient opportunistic spectrum access in cognitive radio networks where there are multiple secondary users trying to share access to multiple channels...
Hua Liu, Longbo Huang, Bhaskar Krishnamachari, Qin...