Learn More
This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime maximization and rate allocation problems. To guarantee the individual performance of sensor nodes, we adopt the network utility maximization (NUM) framework to ensure certain fairness(More)
The network lifetime and application performance are two fundamental but conflicting desig objectives in wireless sensor networks. Hence there is an intrinsic tradeoff between network lifetime maximization and application performance maximization. Often application performance correlates to the application data rate obtained in sensor networks. We can thus(More)
This paper considers the problem of routing in sensor networks from the point of view od data collection. That is, given the initial amount of battery energy in each node, the aim is to determine how much data can each source transmit until the network is partitioned (i.e., until the nodes cannot find endto-end routes to their respective sinks). In(More)
Proper admission control in cognitive radio networks is critical in providing QoS guarantees to secondary unlicensed users. In this paper, we study the admission control and channel allocation problem in overlay cognitive radio networks under the maximum cumulative delay constraint. We formulate it as a Markov decision process problem, and then solve it by(More)
In this paper, we propose and study two adaptive media access control protocols to support probabilistic data delivery reliability in sensor networks using MAC layer retransmissions. Since retransmissions consume energy, our adaptive <i>p-persistent</i> CSMA protocols tune their persistence probabilities in an effort to minimize the expected number of(More)
Key-based workload partitioning is a common strategy used in parallel stream processing engines, enabling effective key-value tuple distribution over worker threads in a logical operator. It is likely to generate poor balancing performance when workload variance occurs on the incoming data stream. This paper presents a new key-based workload partitioning(More)
Sensor networks are deployed to gather some useful data from a field and forward it toward a set of base stations or sinks for data analysis and decision making. Each sensor node is endowed with a finite amount of energy, and each byte transmission or reception costs a certain fixed fraction of energy as well as a variable fraction that depends on the(More)
Many sensor network applications only require probabilistic data delivery, as they can tolerate some missing data samples. For example, in environmental monitoring, missing temperature, pressure and humidity level samples can often be inferred by spatial and/or temporal interpolations. In this paper we propose and study an adaptive <i>p-persistent</i>(More)