Biplab Sikdar

A protocol for tracking mobile targets using sensor networks

With recent advances in device fabrication technology, economical deployment of large scale sensor networks, capable of pervasive monitoring and control of physical systems have become possible. Scalability, low overhead anti distributed functionality are some of the key requirements for any protocol designed for such large scale sensor networks. In this paper, we present a protocol, Distributed Predictive Tracking, for one of the most likely applications for sensor networks: tracking moving targets. The protocol uses a clustering based approach for scalability and a prediction based tracking mechanism to provide a distributed and energy efficient solution. The protocol is robust against node or prediction failures which may result in temporary loss of the target and recovers from such scenarios quickly and with very little additional energy use. Using simulations we show that the proposed architecture is able to accurately track targets with random movement patterns with accuracy over a wide range of target speeds.

Queueing analysis and delay mitigation in IEEE 802.11 random access MAC based wireless networks

We present an analytic model for evaluating the queueing delays at nodes in an IEEE 802.11 MAC based wireless network. The model can account for arbitrary arrival patterns, packet size distributions and number of nodes. Our model gives closed form expressions for obtaining the delay and queue length characteristics. We model each node as a discrete time G/G/1 queue and derive the service time distribution while accounting for a number of factors including the channel access delay due to the shared medium, impact of packet collisions, the resulting backoffs as well as the packet size distribution. The model is also extended for ongoing proposals under consideration for 802.11e wherein a number of packets may be transmitted in a burst once the channel is accessed. Our analytical results are verified through extensive simulations. The results of our model can also be used for providing probabilistic quality of service guarantees and determining the number of nodes that can be accommodated while satisfying a given delay constraint.

A queueing model for finite load IEEE 802.11 random access MAC

This paper presents an analytic model for evaluating the MAC layer queueing delays at wireless nodes using the distributed coordination function of IEEE 802.11 MAC specifications. Our model is valid for finite loads and can account for arbitrary arrival patterns, packet size distributions and number of nodes. Each node is modeled as a discrete time G/G/1 queue and we obtain closed form expressions for the delay and queue length characteristics at each node. We derive the service time distribution for the packets at each node while accounting for a number of factors including the channel access delay due to the shared medium, impact of packet collisions, the resulting backoffs as well as the packet size distribution. Our analytical results are verified through extensive simulations and are more accurate than existing models.

Modeling queueing and channel access delay in unsaturated IEEE 802.11 random access MAC based wireless networks

In this paper, we present an analytic model for evaluating the queueing delays and channel access times at nodes in wireless networks using the IEEE 802.11 Distributed Coordination Function (DCF) as the MAC protocol. The model can account for arbitrary arrival patterns, packet size distributions and number of nodes. Our model gives closed form expressions for obtaining the delay and queue length characteristics and models each node as a discrete time G/G/l queue. The service time distribution for the queues is derived by accounting for a number of factors including the channel access delay due to the shared medium, impact of packet collisions, the resulting backoffs as well as the packet size distribution. The model is also extended for ongoing proposals under consideration for 802.11e wherein a number of packets may be transmitted in a burst once the channel is accessed. Our analytical results are verified through extensive simulations. The results of our model can also be used for providing probabilistic quality of service guarantees and determining the number of nodes that can be accommodated while satisfying a given delay constraint.

Scalable and distributed GPS free positioning for sensor networks

Accurate positioning mechanisms are important in large scale sensor networks to achieve a number of functionalities like location aware routing, efficient coordination of resources and other application specific requirements. This paper proposes a distributed and scalable GPS free positioning algorithm for wireless sensor network. This approach is an effort in the direction of finding a solution to the positioning problem, which minimizes the number of messages exchanged and the coordinate setup time. We use a clustering based approach for the coordinate formation wherein a small subset of the nodes can successfully establish the coordinate system for the whole network. We also compare the performance of this system against existing mechanisms and show that our system scales linearly as the number of nodes in the network increases in contrast to the exponential increase in current mechanism. Additionally, out mechanism takes considerably lower convergence times. The proposed mechanism takes considerably lower convergence times. The proposed mechanism is scalable, distributed and able to support the ad hoc deployment of large scale sensor networks quickly and efficiently.

On the impact of IEEE 802.11 MAC on traffic characteristics

IEEE 802.11 medium access control (MAC) is gaining widespread popularity as a layer-2 protocol for wireless local-area networks. While efforts have been made previously to evaluate the performance of various protocols in wireless networks and to evaluate the capacity of wireless networks, very little is understood or known about the traffic characteristics of wireless networks. In this paper, we address this issue and first develop an analytic model to characterize the interarrival time distribution of traffic in wireless networks with fixed base stations or ad hoc networks using the 802.11 MAC. Our analytic model and supporting simulation results show that the 802.11 MAC can induce pacing in the traffic and the resulting interarrival times are best characterized by a multimodal distribution. This is a sharp departure from behavior in wired networks and can significantly alter the second order characteristics of the traffic, which forms the second part of our study. Through simulations, we show that while the traffic patterns at the individual sources are more consistent with long-range dependence and self-similarity, in contrast to wired networks, the aggregate traffic is not self-similar. The aggregate traffic is better classified as a multifractal process and we conjecture that the various peaks of the multimodal interarrival time distribution have a direct contribution to the differing scaling exponents at various timescales.

Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno, and SACK

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.

Energy Efficient Transmission Strategies for Body Sensor Networks with Energy Harvesting

This paper addresses the problem of developing energy efficient transmission strategies for Body Sensor Networks (BSNs) with energy harvesting. It is assumed that multiple transmission modes that allow a tradeoff between the energy consumption and packet error probability are available to the sensor nodes. Taking into account the energy harvesting capabilities of the nodes, decision policies are developed to determine the transmission mode to use at a given instant of time in order to maximize the quality of coverage. The problem is formulated as a Markov Decision Process (MDP) and the performance of the transmission policy thus derived is compared with that of energy balancing as well as aggressive policies. An upper bound on the performance of arbitrary policies, and lower bounds specific to energy balancing and aggressive policies are derived.

A Survey of MAC Layer Issues and Protocols for Machine-to-Machine Communications

With the growing interest in the use of autonomous computing, sensing and actuating devices for various applications such as smart grids, home networking, smart environments and cities, health care, and machine-to-machine (M2M) communication has become an important networking paradigm. However, in order to fully exploit the applications facilitated by M2M communications, adequate support from all layers in the network stack must first be provided in order to meet their service requirements. This paper presents a survey of the requirements, technical challenges, and existing work on medium access control (MAC) layer protocols for supporting M2M communications. This paper first describes the issues related to efficient, scalable, and fair channel access for M2M communications. Then, in addition to protocols that have been developed specifically for M2M communications, this paper reviews existing MAC protocols and their applicability to M2M communications. This survey paper then discusses ongoing standardization efforts and open problems for future research in this area.

Relay Scheduling for Cooperative Communications in Sensor Networks with Energy Harvesting

This paper considers wireless sensor networks (WSNs) with energy harvesting and cooperative communications and develops energy efficient scheduling strategies for such networks. In order to maximize the long-term utility of the network, the scheduling problem considered in this paper addresses the following question: given an estimate of the current network state, should a source transmit its data directly to the destination or use a relay to help with the transmission? We first develop an upper bound on the performance of any arbitrary scheduler. Next, the optimal scheduling problem is formulated and solved as a Markov Decision Process (MDP), assuming that complete state information about the relays is available at the source nodes. We then relax the assumption of the availability of full state information, and formulate the scheduling problem as a Partially Observable Markov Decision Process (POMDP) and show that it can be decomposed into an equivalent MDP problem. Simulation results are used to show the performance of the schedulers.