477 search results - page 1 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
PERCOM
2004
ACM
14 years 4 months ago
2004
ACM
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
ICOIN
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
COMCOM
2002
13 years 4 months ago
2002
In this paper, we propose a new protocol for wireless mobile ad hoc communications, which establishes a dynamic wireless mobile infrastructure to mimic and maintain the operation ...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
TMC
2008
13 years 5 months ago
2008
This paper addresses the problem of data acquisition in ad hoc and sensor networks with mobile sinks and proposes a protocol based on swarm intelligence, SIMPLE, to route data in s...