A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most o...
This paper targets mobile telemedicine applications that can be supported using third generation (3G) cellular networks, to provide highly flexible medical services. On the other ...
: In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless ...
Stefan Dulman, Michele Rossi, Paul J. M. Havinga, ...
: This paper describes the implementation architecture and performance analysis of nanoMAC, a CSMA/CA based medium access control protocol, which is specifically designed for high...