522 search results - page 65 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In ad hoc wireless networks, a successful broadcasting requires that the nodes forwarding the broadcast packet form a connected dominating set to ensure the coverage. An efficien...
TMC
2008
13 years 7 months ago
2008
Abstract--In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the locationdependent contention may cause serious unfairness an...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting a small subset of hosts (also called nodes) to form ...