118 search results - page 21 / 24 » Mobility Resistant Clustering in Multi-Hop Wireless Networks |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
WIMOB
2008
IEEE
14 years 1 months ago
2008
IEEE
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
ICC
2000
IEEE
13 years 12 months ago
2000
IEEE
—In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different trans...
ICDCSW
2007
IEEE
14 years 1 months ago
2007
IEEE
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...