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...
In this paper, we propose some improvements to the flooding protocols that aim to efficiently broadcast a given information through the whole ad-hoc network. These improvements ...
The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form adhoc networks paves the way for building ...
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...
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...