Sciweavers

269 search results - page 5 / 54
» Minimizing broadcast latency in ad hoc wireless networks
Sort
View
ADHOCNOW
2004
Springer
15 years 2 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
COMSUR
2006
96views more  COMSUR 2006»
14 years 9 months ago
A survey of multipoint relay based broadcast schemes in wireless ad hoc networks
Almost every routing protocol in mobile ad hoc networks (MANETs) depends on a broadcast scheme to disseminate routing information. For this reason, creating an efficient broadcast...
Ou Liang, Y. Ahmet Sekercioglu, Nallasamy Mani
ADHOC
2007
144views more  ADHOC 2007»
14 years 9 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
109
Voted
IMCSIT
2010
14 years 7 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
FSTTCS
2004
Springer
15 years 2 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi