Sciweavers

331 search results - page 25 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
129
Voted
OL
2011
277views Neural Networks» more  OL 2011»
14 years 6 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
SECON
2010
IEEE
14 years 9 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
MOR
2000
162views more  MOR 2000»
14 years 11 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
TPDS
2008
126views more  TPDS 2008»
14 years 11 months ago
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
ICDCS
2002
IEEE
15 years 4 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li