Conference Paper

Real-Time Coordination and Routing in Wireless Sensor and Actor Networks.

DOI: 10.1007/11759355_34 Conference: Next Generation Teletraffic and Wired/Wireless Advanced Networking, 6th International Conference, NEW2AN 2006, St. Petersburg, Russia, May 29 - June 2, 2006, Proceedings
Source: DBLP

ABSTRACT In Wireless Sensor Actor Networks (WSAN), sensor nodes perform the sensing task and actor nodes take action based on the sensed
phenomena in the field. To ensure efficient and accurate operations of WSAN, new communication protocols are imperative to
provide sensor-actor coordination in order to achieve energy-efficient and reliable communication. Moreover, the protocols
must honor the application-specific real-time delay bounds for the effectiveness of the actors in WSAN.

In this paper, we propose a new real-time coordination and routing (RCR) framework for WSAN. It addresses the issues of coordination among sensors and actors and honors the delay bound for routing
in distributed manner. RCR configures sensors to form hierarchical clusters and provides delay-constrained energy aware routing (DEAR) mechanism. It
uses only cluster-heads to coordinate with sink/actors in order to save the precious energy resources. The DEAR algorithm
integrates the forwardtracking and backtracking routing approaches to establish paths from source nodes to sink/actors. In
the presence of the sink in WSAN, it implements the centralized version of DEAR (C-DEAR) to coordinate with the actors through
the sink. In the absence of sink or ignoring its presence, there is a distributed DEAR (D-DEAR) to provide coordination among
sensors and actors. Cluster-heads then select the path among multiple alternative paths to deliver the packets to the actors
within the given delay bound in an efficient way. Simulation experiments prove that RCR achieves the goal to honor the realistic application-specific delay bound.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor and actor networks (WSANs) have been increasingly popular for environmental monitoring applications in the last decade. While the deployment of sensor nodes enables a fine granularity of data collection, resource-rich actor nodes provide further evaluation of the information and reaction. Quality of service (QoS) and routing solutions for WSANs are challenging compared to traditional networks because of the limited node resources. WSANs also have different QoS requirements than wireless sensor networks (WSNs) since actors and sensor nodes have distinct resource constraints. In this paper, we present, LRP-QS, a lightweight routing protocol with dynamic interests and QoS support for WSANs. LRP-QS provides QoS by differentiating the rates among different types of interests with dynamic packet tagging at sensor nodes and per flow management at actor nodes. The interests, which define the types of events to observe, are distributed in the network. The weights of the interests are determined dynamically by using a nonsensitive ranking algorithm depending on the variation in the observed values of data collected in response to interests. Our simulation studies show that the proposed protocol provides a higher packet delivery ratio and a lower memory consumption than the existing state of the art protocols.
    Ad Hoc Networks 11/2013; 11(8):2313-2328. DOI:10.1016/j.adhoc.2013.05.012 · 1.94 Impact Factor
  • Source
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor and Actuator Networks (WSANs) are composed of sensors and actuators to perform distributed sensing and actuating tasks. Most WSAN applications (e.g., fire detection) demand that actuators rapidly respond to events under observation. Therefore, real-time and fault-tolerant transmission is a critical requirement in WSANs to enable sensed data to reach actuators reliably and quickly. Due to limited power resources, energy-efficiency is another crucial requirement. Such requirements become formidably challenging in large-scale WSANs. However, existing WSANs fall short in meeting these requirements. To this end, we first theoretically study the Kautz graph for its applicability in WSANs to meet these requirements. We then propose a Kautz-based Real-time, Fault-tolerant and Energy-efficient WSAN (REFER). REFER has a protocol that embeds Kautz graphs into the physical topology of a WSAN for real-time communication and connects the graphs using Distributed Hash Table (DHT) for high scalability. We also theoretically study routing paths in the Kautz graph, based on which we develop an efficient fault-tolerant routing protocol. It enables a relay node to quickly and efficiently identify the next shortest path from itself to the destination only based on node IDs upon routing failure. REFER is advantageous over previous Kautz graph based works in that it does not need an energy-consuming protocol to find the next shortest path and it can maintain the consistency between the overlay and physical topology. Experimental results demonstrate the superior performance of REFER in comparison with existing systems in terms of real-time communication, energy-efficiency, fault-tolerance and scalability.
    Distributed Computing Systems (ICDCS), 2012 IEEE 32nd International Conference on; 01/2012

Preview (2 Sources)