477 search results - page 62 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
COORDINATION
2008
Springer
13 years 10 months ago
2008
Springer
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...
MOBICOM
2003
ACM
14 years 1 months ago
2003
ACM
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
TMC
2008
13 years 8 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 ...
ICC
2009
IEEE
13 years 6 months ago
2009
IEEE
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
CNSR
2009
IEEE
14 years 10 days ago
2009
IEEE
Broadcasting is a vital communication mechanism in Mobile Ad Hoc Networks, as it is the key element for exchanging control packets to support some services such as management and ...