Results 1 - 10
of
135
Cost-efficient processing of min/max queries over distributed sensors with uncertainty
, 2004
"... The rapid development in micro-sensors and wireless networks has made large-scale sensor networks possible. However, the wide de-ployment of such systems is still hindered by their limited energy which quickly runs out in case of massive communication. In this paper, we study the cost-efficient proc ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
processing of aggregate queries that are generally communication-intensive. In particular, we fo-cus on MIN/MAX queries that require both identity and value in the answer. We study how to provide an error bound to such answers, and how to design an “optimal ” sensor-contact policy that mini
1 Maximizing Network Utilization with Max-Min Fairness in Wireless Sensor Networks
"... Abstract—The state of the art for optimal data-gathering in wireless sensor networks is to use additive increase algorithms to achieve fair rate allocation while implicity trying to maximize network utilization. We explicitly formulate the problem of maximizing the network utilization subject to a m ..."
Abstract
- Add to MetaCart
max-min fair rate allocation constraint in the form of two coupled linear programs. We first show how the max-min rate can be computed efficiently for a given network. We then adopt a dual-based approach to maximize the network utilization. The analysis of the dual shows the sub
ADistributed Optimal Lexicographic Max-min Rate Allocation in Solar Powered Wireless Sensor Networks
"... Understanding the optimal usage of fluctuating renewable energy in Wireless Sensor Networks (WSNs) is complex. Lexicographic Max-min (LM) rate allocation is a good solution, but is non-trivial for multi-hop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all ..."
Abstract
- Add to MetaCart
Understanding the optimal usage of fluctuating renewable energy in Wireless Sensor Networks (WSNs) is complex. Lexicographic Max-min (LM) rate allocation is a good solution, but is non-trivial for multi-hop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all
Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks
"... We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping of con ..."
Abstract
- Add to MetaCart
We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping
Efficient gossip-based aggregate computation
- in Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems
"... Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a novel gossip-based scheme using which all the nodes in an n-node overlay network can compute the common aggregates of MIN ..."
Abstract
-
Cited by 33 (1 self)
- Add to MetaCart
of MIN, MAX, SUM, AVERAGE, and RANK of their values using O(n log log n) messages within O(log n log log n) rounds of communication. To the best of our knowledge, ours is the first result that shows how to compute these aggregates with high probability using only O(n log log n) messages. In contrast
ABSTRACT EnergyEfficient Monitoring of Extreme Values in Sensor Networks ∗
"... Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorithmic challenges from aggregate and selection queries, in the sense that an individual node cannot by itself determine its ..."
Abstract
- Add to MetaCart
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorithmic challenges from aggregate and selection queries, in the sense that an individual node cannot by itself determine
Optimizing Multi-hop Queries in ZigBee Based Multisink Sensor Networks, in the 10th International Conference on Distributed Computing and Networking (ICDCN’09
- in Wireless Sensor Networks, in the Fourth IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’07
"... Abstract. Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query range to achieve certain global optimality while avoid congesting the sensors in the meanwhile. We study this p ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
this problem for a ZigBee cluster tree by formulating it into a multi-dimensional multi-choice knapsack problem. Maximum overall query range and max-min fair query range objectives are investigated. Distributed algorithms are proposed which exploit the ZigBee cluster tree structure to keep the computation
Wireless Sensor Networking in Challenging Environments
, 2014
"... This Dissertation is brought to you for free and open access by Washington University Open Scholarship. It has been accepted for inclusion in All Theses and Dissertations (ETDs) by an authorized administrator of Washington University Open Scholarship. For more information, please contact ..."
Abstract
- Add to MetaCart
This Dissertation is brought to you for free and open access by Washington University Open Scholarship. It has been accepted for inclusion in All Theses and Dissertations (ETDs) by an authorized administrator of Washington University Open Scholarship. For more information, please contact
Time and Energy Complexity of Distributed Computation in Wireless Sensor Networks
- In Proceedings of the IEEE Infocom
, 2005
"... Abstract — We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class ..."
Abstract
-
Cited by 18 (0 self)
- Add to MetaCart
to the class of type-threshold functions (as defined in [2]), of which max, min, and indicator functions are important examples; our discussions are couched in terms of the max function. We view the problem as one of message passing distributed computation over a geometric random graph. The network is assumed
POS: A Practical Order Statistics Service for Wireless Sensor Networks
"... Abstract — Wireless sensor networks are being deployed to monitor a wide range of environments. Since energy efficiency is critical in these deployments, previous work proposed in-network aggregation and approximation techniques to reduce the energy consumed collecting data. In-network aggregation c ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
can be used to compute statistics such as max, min, and average accurately and energy-efficiently, but it does not work well for order statistics such as median. Current approximation techniques to compute order statistics cannot deliver both good accuracy and energy efficiency. This is unfortunate
Results 1 - 10
of
135