By Topic

A reliable data transport protocol for partitioned actors in Wireless Sensor and Actor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Handigol, N. ; Dept. of Comput. Sci., Stanford Univ., Stanford, CA, USA ; Selvaradjou, K. ; Murthy, C.S.R.

In Wireless Sensor and Actor Networks (WSANs), effective Actor-Actor Communication (AAC) is an important requirement for the timely responses to events reported by the sensors. However, due to scattered nature of events, mobility of actor nodes, and low density of actor nodes, the network of actor nodes tends to get partitioned frequently. To provide effective AAC in such situations, the energy-constrained sensor nodes located between the partitioned actor nodes need to be utilized. This solution for healing the actor network partitions should involve minimal use of the sensor nodes so that the network lifetime is maximized. In this work, we propose an energy-efficient Actor-Actor Reliable Transport Protocol (A2RT) for WSANs with actor nodes equipped with directional antennas and dual radio interfaces. Our proposed transport protocol consists of a transport wrapper and a dynamic priority scheduler. Using simulations, we show that our transport wrapper achieves high reliability with minimum retransmissions both under static and dynamic network topology conditions. The results also show that the traffic scheduler of our protocol helps to achieve the goals of real-time delivery by maximizing the number of packets that meet the delay constraints.

Published in:

High Performance Computing (HiPC), 2010 International Conference on

Date of Conference:

19-22 Dec. 2010