Learn More
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach called backpressure routing, in which routing and forwarding decisions are made on a per-packet basis. Although there is a considerable theoretical literature on backpressure routing,(More)
The state of the art congestion control algorithms for wireless sensor networks respond to coarse-grained feedback regarding available capacity in the network with an additive increase multiplicative decrease mechanism to set source rates. Providing precise feedback is challenging in wireless networks because link capacities vary with traffic on interfering(More)
— When the data rates in sensor networks are comparable to the available channel bandwidth, traditional randomized access schemes face the problem of energy inefficiency and reduced throughput due to increased MAC collisions as well as the problem of unfair data delivery. We argue that under such conditions it is preferable to focus on techniques for(More)
The state of the art for optimal data-gathering in wireless sensor networks is to use additive increase algorithms to achieve max-min fair rate allocation ([1], [3]) while implicity trying to maximize network utilization. In this work we explicitly formulate the problem of maximizing the network utilization subject to a max-min fair rate allocation(More)
Considerable research has been done on detecting and blocking portscan activities that are typically conducted by infected hosts to discover other vulnerable hosts. However, the focus has been on enterprise gateway-level Intrusion Detection Systems where the traffic volume is low and network configuration information is readily available. This paper(More)
—The capabilities of sensor networking devices are increasing at a rapid pace. It is therefore not impractical to assume that future sensing operations will involve real time (inelastic) traffic, such as audio and video surveillance, which have strict bandwidth constraints. This in turn implies that future sensor networks will have to cater for a mix of(More)
—We take a top-down approach of formulating the rate control problem, over a collection tree, in a wireless sensor network as a generic convex optimization problem and propose a distributed back pressure algorithm using Lyapunov drift based optimization techniques. Primarily, we show that existing theoretical results in the field of stochastic network(More)
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most of the work is theoretical in nature and while providing insights into the asymptotic behavior of these querying mechanisms, does not account for the non-idealities faced by the(More)
—The receiver capacity model is a simple model to capture flow dynamics in a multi-hop wireless network, by presenting linear constraints to define the feasible rate region of the network, taking into account interference. The model associates with each receiver in the network a notion of constant receiver capacity. Receiver capacity is defined as the(More)
  • 1