Sciweavers

661 search results - page 101 / 133
» Local Approximation Algorithms for Scheduling Problems in Se...
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 8 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
WINET
2010
113views more  WINET 2010»
13 years 7 months ago
Designing multihop wireless backhaul networks with delay guarantees
— As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existi...
Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang
EWSN
2004
Springer
14 years 2 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
ICALP
2004
Springer
14 years 2 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
INFOCOM
2010
IEEE
13 years 7 months ago
Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...
Lirong Jian, Zheng Yang, Yunhao Liu