180 Park Ave - Building 103
Florham Park, NJ
http://www2.research.att.com/~rpanta/
Mitigating the Effects of Software Component Shifts for Incremental Reprogramming of Wireless Sensor Networks
Rajesh Panta, Saurabh Bagchi
IEEE Transactions on Parallel and Distributed Systems,
2012.
[PDF]
[BIB]
IEEE Copyright
The definitive version was published in IEEE Transactions on Parallel and Distributed Systems , 2012-08-27
{Wireless reprogramming of sensor nodes is an essential requirement for long-lived networks because software functionality needs to be changed over time. The amount of information that needs to be wirelessly transmitted during reprogramming should be minimized to reduce reprogramming time and energy. In this paper, we present a multi-hop incremental reprogramming protocol called Hermes that transfers over the network the delta between the old and new software and lets the sensor nodes rebuild the new software using the received delta and the old software. It reduces the delta by using techniques to mitigate the effects of function and global variable shifts caused by the software modifications. Then it compares the binary images at the byte level with a method to create a small delta that needs to be sent over the wireless network to all the nodes. For the wide range of software change scenarios that we experimented with, we find that Hermes transfers up to 201 times less information than Deluge, the standard reprogramming protocol for TinyOS, and 64 times less than an existing incremental reprogramming protocol by Jeong and Culler. }
Efficient Asynchronous Low Power Listening for Wireless Sensor Networks
Rajesh Panta, Gregory Vesonder, James Pelletier
31st IEEE International Symposium on Reliable Distributed Systems,
2012.
[PDF]
[BIB]
IEEE Copyright
This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in 2012 , 2012-10-08
{Low Power Listening (LPL) is a widely used asynchronous technique to reduce idle listening energy cost in wireless sensor networks. Early LPL protocols like B-MAC that were designed for bit streaming radios achieve low duty cycle by keeping the radio transceiver awake for short time periods. However, they require a transmitter node to precede a packet transmission with a long preamble. Furthermore, they cannot be used with modern packet radios like widely used IEEE 802.15.4 based radio transceivers, which cannot transmit arbitrarily long preambles. Recent LPL schemes like X-MAC, on the other hand, reduce the length of the preamble and are designed to work with packet radios. However, in order to ensure that a receiver can detect a transmitter's preamble transmission, these schemes need to turn the radio transceiver on for longer time duration than the early schemes like B-MAC. In this paper, we present a novel LPL scheme called QuickMAC, that achieves the best of both worlds---small radio awake periods, compatibility with packet (and bit stream) radios, and short preamble length. From our experiments using TMote sky motes, we show that QuickMAC reduces duty cycle by a factor of about 4 compared to X-MAC. }
Scalable Geocasting for Vehicular Communications
Rajesh Panta, Rittwik Jana, Robert Hall, Josh Auzins, Vaneet Aggarwal
IEEE Vehicular Networking Conference, 2011,
2011.
[PDF]
[BIB]
IEEE Copyright
This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in IEEE Vehicular Networking Conference, 2011. , 2011-11-14
{This paper presents GeoVCom, a robust geocast
protocol for vehicular networks. GeoVCom allows a vehicle to
send geocast messages to all vehicles in a given geographical area
without the sender having any knowledge about which vehicles
are present in that area. GeoVCom is ad hoc, scalable and can
handle communications under a wide variability of traffic load.
We investigate the performance of GeoVCom in both simulation
and real world tests using an implementation running on smart
phones. Our field deployment and simulation results show that
the number of transmissions per geocast message is kept low,
significantly outperforming conventional flooding algorithms and
at the same time maintaining a high (over 90%) success rate.}
Geocast for Wireless Sensor Networks
Rajesh Panta, Robert Hall, Josh Auzins, Maria Fernandez
IEEE Conference on Network Protocols,
2011.
[PDF]
[BIB]
IEEE Copyright
This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in Submitted to IEEE Conference on Network Protocols. , 2011-10-17
{An important but relatively less studied class of network layer protocol for wireless sensor networks is geocast. It allows a sensor node to send messages to all nodes in a given geographical area without the sender node having any knowledge about which nodes are present in that area. Developing a robust geocast protocol for practical sensor networks poses several challenges. Geocast messages should be reliably delivered to the destination area in the presence of unreliable wireless links, a typical characteristic of practical sensor network deployments. The protocol should minimize the number of radio transmissions and avoid control traffic to save energy, which is a scarce resource in sensor networks. The protocol should be robust against a wide range of network densities. This paper presents the design, implementation, and evaluation of SGcast --- a reliable, robust, and energy-efficient geocast protocol that achieves these goals. For a wide range of experiments conducted using networks of real sensor nodes and simulations, we show that compared to a recent geocast protocol, SGcast achieves up to 11.08x reduction in energy consumption and up to 2.17x improvement in successful delivery of geocast messages to the destination area, while being extremely robust against a wide variability in network densities. }
