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.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Advances in technologies such as micro electro mechanical systems (MEMS) have empowered more efficient and smaller digital devices, which can be deployed in WSNs (wireless sensor networks) to gather useful information pertaining to a particular environment. In order to control effectively the physical system in a WSN, actuators may be employed to integrate such environmental information into the automation control system. Indeed, sophisticated entities deployed in wireless sensor and actuator networks (WSANs) act as functional robots. The approach of using the mobile sink, as an example of the actuator to control the movement of a sink, has been adopted by researchers in the past to achieve high efficiency in terms of gathering data from the sensors. This is due to the fact that in general, the sensors alone are unable to control the sink and need to send or relay a smaller amount of packet data. Although a number of methods exist in literature to utilize mobile sinks as actuators, most of these techniques are unable to guarantee data gathering from all of the sensors. As a consequence, more research effort is needed to improve the efficiency as well as fairness of data gathering. In WSANs, sinks and sensor entities should be actively controllable by the administrator. Therefore, we must consider an efficient way to access all nodes in the target networks. In this paper, we propose a novel method, based on the set packing algorithm and traveling salesman problem, to accomplish this goal. The effectiveness of our envisioned method is demonstrated through extensive computer-simulations.
    IEEE Transactions on Automatic Control 11/2011; · 2.72 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor and actor networks (WSAN) have become increasingly popular in recent years. The cooperative operation between sensor and actor nodes results in a major advantage against pure sensor networks and extends the range of possible application scenarios. One emerging application is the Amazon scenario in which stationary actors are deployed at accessible points in a thick forest structure and sensor nodes are thrown in a river flowing through the forest to gather observations from unreachable areas of the forest. This unprecedented and unique setting exposes two important challenges: (a) the dynamics of the river forms a continuously varying topology of sensor nodes requiring a highly adaptive network organization and (b) the inherent features of sensor and actor nodes, combined with rapid changes in the link structure of the network require efficient bandwidth utilization and data transmission. In this paper, we address these challenges by introducing SOFROP, a novel self-organizing and fair routing protocol for WSANs. The extensive simulations that are carried out for evaluation point out two highlights of SOFROP. These are the lightweight and efficient routing that is optimized for fairness and the locally acting adaptive overlay network formation.
    The 35th Annual IEEE Conference on Local Computer Networks, LCN 2010, 10-14 October 2010, Denver, Colorado, USA, Proceedings; 01/2010
  • Source
    IEEE Trans. Automat. Contr. 01/2011; 56:2381-2389.

Full-text (2 Sources)