107 search results - page 18 / 22 » Perfect Simulations for Random Trip Mobility Models |
FAABS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
100
Voted
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
98
Voted
TMC
2008
14 years 9 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
JSAC
2006
14 years 9 months ago
2006
Abstract--A research area that has become increasingly important in recent years is that of on-board mobile communication, where users on a vehicle are connected to a local network...