Sciweavers

295 search results - page 8 / 59
» An approximation algorithm for the wireless gathering proble...
Sort
View
INFOCOM
2007
IEEE
15 years 3 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra
TON
2010
127views more  TON 2010»
14 years 4 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
SECON
2007
IEEE
15 years 3 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
JDA
2007
97views more  JDA 2007»
14 years 9 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia