Sciweavers

1265 search results - page 44 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
TWC
2008
108views more  TWC 2008»
13 years 7 months ago
Successive-Capture Analysis of RTS/CTS in Ad-Hoc Networks
We consider a wireless ad-hoc network with random ALOHA transmissions between nodes. However nodes can decide to use the Request-to-Send (RTS) / Clear-to-Send (CTS) protocol for oc...
Chin Keong Ho, Jean-Paul M. G. Linnartz
COMCOM
2006
114views more  COMCOM 2006»
13 years 7 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
13 years 7 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
JPDC
2007
112views more  JPDC 2007»
13 years 7 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
INFOCOM
2009
IEEE
14 years 2 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu