578 search results - page 7 / 116 » Dynamic Probabilistic Retransmission in Ad Hoc Networks |
SRDS
2007
IEEE
15 years 3 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...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—In this paper, we introduce a framework for distributed opportunistic scheduling in multihop wireless ad hoc networks. With the proposed framework, one can take a schedu...
DSN
2008
IEEE
15 years 4 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
97
Voted
MOBIHOC
2000
ACM
15 years 1 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
100
click to vote
MSN
2007
Springer
15 years 3 months ago
2007
Springer
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates ex...