1265 search results - page 20 / 253 » Randomized Algorithms and Probabilistic Analysis in Wireless... |
ICNP
2007
IEEE
14 years 1 months ago
2007
IEEE
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
SRDS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we propose a novel ReliAble ProbabIlistic Dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and sel...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
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...
CONEXT
2005
ACM
13 years 9 months ago
2005
ACM
Random key Pre-distribution scheme has been proposed to overcome the memory, computation and energy limits of individual sensor in wireless sensor networks. In this scheme, a ring...
ENTCS
2007
13 years 7 months ago
2007
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...