We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
This paper presents a work in progress which deals with the problem of node misbehaviour in ad-hoc networks. A realistic approach is used to determine the impact of contention wind...
Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and deve...
Zinaida Benenson, Markus Bestehorn, Erik Buchmann,...
Providing service discovery in an efficient and scalable way in ad hoc networks is a challenging problem, in particular for multihop scenarios, due to the large number of potential...
In this paper we describe our analysis of a real trace and propose a mobility model. The trace data we used for this study was collected from a military experiment carried out in L...
Xiaofeng Lu, Yung-chih Chen, Ian X. Y. Leung, Zhan...