522 search results - page 73 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
TON
2010
13 years 2 months ago
2010
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
DIALM
2003
ACM
14 years 29 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
COMCOM
2006
13 years 7 months ago
2006
In this paper, we designed and implemented an integrated wireless system, namely a SIP-based MIP6-MANET system. This SIP-based MIP6MANET system is an integration and implementatio...
SIGCSE
2005
ACM
14 years 1 months ago
2005
ACM
In a world of ad-hoc networks, highly interconnected mobile devices and increasingly large supercomputer clusters, students need models of computation that help them think about d...