Sciweavers

914 search results - page 142 / 183
» Branch and Bound on the Network Model
Sort
View
SECON
2008
IEEE
16 years 20 days ago
Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...
Özlem Durmaz Incel, Bhaskar Krishnamachari
CPAIOR
2008
Springer
15 years 8 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
TON
2010
147views more  TON 2010»
15 years 4 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
SPAA
2010
ACM
15 years 11 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
GIS
2005
ACM
16 years 7 months ago
In-network surface simplification for sensor fields
Recent research literature on sensor network databases has focused on finding ways to perform in-network aggregation of sensor readings to reduce the message cost. However, with t...
Brian Harrington, Yan Huang