Sciweavers

104 search results - page 4 / 21
» Two-Phased Approximation Algorithms for Minimum CDS in Wirel...
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
MOBIHOC
2003
ACM
14 years 7 months ago
Topology management in ad hoc networks
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
Lichun Bao, J. J. Garcia-Luna-Aceves
COLOGNETWENTE
2007
13 years 9 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
COCOON
2005
Springer
14 years 1 months ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
14 years 27 days ago
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
Wei Lou, Jie Wu