Sciweavers

77 search results - page 6 / 16
» Ad-hoc networks beyond unit disk graphs
Sort
View
IMCSIT
2010
14 years 9 months ago
Efficient Coloring of Wireless Ad Hoc Networks With Diminished Transmitter Power
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
Krzysztof Krzywdzinski
ICDCS
2008
IEEE
15 years 6 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
IWCMC
2006
ACM
15 years 5 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
PODC
2005
ACM
15 years 5 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
15 years 4 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...