We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networ...
Alaeddine El Fawal, Jean-Yves Le Boudec, Kav&eacut...
—Vehicular Ad-hoc NETworks (VANETs) adopting Dedicated Short-Range Communications (DSRCs) have emerged as a preferred choice of network design for the Intelligent Transportation ...
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
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 ...