105 search results - page 18 / 21 » Hierarchical routing in ad hoc networks using k-dominating s... |
CCCG
2010
13 years 8 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
As mobile devices, such as laptops, PDAs or mobile phones, are getting more and more ubiquitous and are able to communicate with each other via wireless technologies, the paradigm...
ADHOC
2007
13 years 7 months ago
2007
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
WINET
2010
13 years 5 months ago
2010
In this paper, we present a model that estimates the time duration of routes formed by several intermediate nodes in mobile multi-hop ad-hoc networks. First, we analyze a 3-node ro...
PEWASUN
2005
ACM
14 years 28 days ago
2005
ACM
Scalability issues for routing in mobile ad hoc networks (MANETs) have been typically addressed using hybrid routing schemes operating in a hierarchical network architecture. Seve...