Energy management in sensor networks is a critical issue to prolong the network lifetime. However, the end-to-end latency increases due to energy saving algorithms. We propose a new protocol, ELS (Energy efficient low Latency Sleep Schedule for Target Tracking Sensor networks), that provides a dynamic sleep schedule for the radios to increase the network lifetime as well as transmit the target’...

Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring. One of the primary concerns that hinder the successful deployment of WSNs is source-location privacy (SLP). The privacy of the source location is vital and highly jeopardized by the usage of wireless communications. Although message content privacy can be ensured through message encryption, i...

This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs that comprise a large number of statically placed sensor nodes transmitting data to a collection point (the sink), we show that by controlling the si...

We present the first constant approximation to the single sink buy-at-bulk network design problem, where we have to design a network by buying pipes of different costs and capacities per unit length to route demands at a set of sources to a single sink. The distances in the underlying network form a metric. This result improves the previous bound of O(log |R|), where R is the set of sources. We...

The Internet and the Grid are changing the face of high performance computing. Rather than tightly-coupled SPMD-style components running in a single cluster, on a parallel machine, or even on the Internet programmed in MPI, applications are evolving into sets of cooperating components scattered across diverse computational elements. These components may run on diierent operating systems and har...

We present the COST-DISTANCE problem: finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known randomized approximation scheme for COST-DISTANCE, where is the number of sources. We reduce several common network design problems to COST-DISTANCE, obtaining (in some cases) the first ...

Locations Hai Zhou1, D.F. Wong1, I-Min Liu2, and Adnan Aziz2 1 Department of Computer Sciences, University of Texas, Austin, TX 78712 2 Department of Electrical and Computer Engineering, University of Texas, Austin, TX 78712 Abstract During the routing of global interconnects, macro blocks form useful routing regions which allow wires to go through but forbid bu ers to be inserted. They give re...