Sciweavers

370 search results - page 32 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
VTC
2008
IEEE
224views Communications» more  VTC 2008»
15 years 4 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
CEC
2007
IEEE
15 years 1 months ago
A memetic algorithm for dynamic design of wireless sensor Networks
We present a memetic algorithm that dynamically optimizes the design of a wireless sensor network towards energy conservation and extension of the life span of the network, taking ...
Konstantinos P. Ferentinos, Theodore A. Tsiligirid...
MOR
2000
162views more  MOR 2000»
14 years 9 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
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 7 days ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
MOBIHOC
2006
ACM
15 years 9 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano