58 search results - page 7 / 12 » Iterative Local Solutions for Connected Dominating Set in Ad... |
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
ADHOC
2005
13 years 7 months ago
2005
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...