Sciweavers

201 search results - page 1 / 41
» On Computing Ad-hoc Selective Families
Sort
View
EURONGI
2004
Springer
13 years 10 months ago
A Family of Encounter-Based Broadcast Protocols for Mobile Ad-Hoc Networks
A family of message propagation protocols for highly mobile ad-hoc networks is defined, and is studied analytically and by simulation. The coverage of a message (the fraction of n...
Dave E. Cooper, Paul D. Ezhilchelvan, Isi Mitrani
WCNC
2010
IEEE
13 years 8 months ago
Selection of Repetition Codes for MAC in Vehicular Ad Hoc Networks
—In the context of vehicular safety and entertainment applications, we focus on the design of a reliable medium access control scheme. Each vehicle is willing to form a network a...
Ali Honarvar, Shahrokh Valaee
SAJ
2002
127views more  SAJ 2002»
13 years 4 months ago
Limited flooding protocol for mobile ad hoc networks
Mobile ad hoc networks are collections of mobile nodes without any fixed infrastructure or central co-ordinating mechanism for packet routing. Consequently, routing is a challenge...
Mieso K. Denko, W. Goddard
MOBIHOC
2002
ACM
14 years 4 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
SWAT
2004
Springer
138views Algorithms» more  SWAT 2004»
13 years 10 months ago
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
Leszek Gasieniec, Tomasz Radzik, Qin Xin