Sciweavers

25 search results - page 5 / 5
» HAP: A New Model for Packet Arrivals
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
14 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
CORR
2006
Springer
147views Education» more  CORR 2006»
14 years 10 months ago
ARQ Diversity in Fading Random Access Channels
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...
Young-Han Nam, Praveen Kumar Gopala, Hesham El Gam...
WINET
2010
142views more  WINET 2010»
14 years 8 months ago
Demand-driven publish/subscribe in mobile environments
—We propose a novel Self-Balancing Supply/Demand (SBSD) reactive MANET protocol. Our algorithm dynamically discovers publications matching specified subscriptions by controlled f...
Aris M. Ouksel, Doug Lundquist
INFOCOM
2009
IEEE
15 years 4 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
MOBIHOC
2009
ACM
15 years 10 months ago
Characterizing the exit process of a non-saturated IEEE 802.11 wireless network
In this paper, we consider a non-saturated IEEE 802.11 based wireless network. We use a three-way fixed point to model the node behavior with Bernoulli packet arrivals and determi...
Punit Rathod, Onkar Dabeer, Abhay Karandikar, Anir...