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
 · 
68 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) promise fine-grain monitoring in a wide variety of applications, which require dense sensor nodes deployment. Due to high density of nodes, spatially redundant or correlated data is generated. Redundancy increases the reliability level of information delivery but increases the energy consumption of the nodes too. Since energy conservation is a key issue for WSNs, therefore, spatial correlation can be exploited to deactivate some of the nodes generating redundant information. In this paper, we present an energy-aware spatial correlation based on a clustering protocol. In this approach, only the cluster-heads are responsible of exploiting spatial correlation of their member nodes and selecting the appropriate member nodes to remain active. The correlation is based on the distortion tolerance and the residual energy of member nodes. Each cluster-head divides its clustered region into correlation regions and selects a representative node in each correlation region which is closer to the center of correlation region and has the higher residual energy. Hence, the whole field is represented by a subset of active nodes which perform the task well. Simulation results prove that the required reporting rate can be achieved with lesser number of nodes by exploiting spatial correlation and eventually conserving the nodes energy.
    Communication Systems Software and Middleware, 2007. COMSWARE 2007. 2nd International Conference on; 02/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor and actuator network (WSAN) are composed of a large number of heterogeneous sensors and actuators. In the automated WSAN, sensors are collaborated to monitor the physical phenomenon in the surveillance field, while the actuators are to collect sensing data, process the data and perform appropriate actions without the existence of central controller. Most WSANs are used in the real-time sensing and reaction systems towards physical environment. In this paper, we propose a real-time architecture for automated WSAN to bind the latency in applications. In the architecture, we present distributed mechanisms for sensor-actuator event reporting and self-aware coordination to maintain the delay bound sensor-actuator communication. And then we present mechanism for ordered multi-event task assignment, and the acting coordination mechanism to provide efficient reaction and execution of the event task in time. Preliminary simulation results are presented to demonstrate the advantages of our solutions.
    01/2009;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In wireless sensor and actor network research, the commonly used mobility models for a mobile actor are random walk model, random waypoint mobility model, or variants thereof. For a fully connected network, the choice of mobility model for the actor is not critical because, there is at least one assured path from the sensor nodes to the actor node. But, for a sparsely connected network where information cannot propagate beyond a cluster, random movement of the actor may not be the best choice to maximize event detection and subsequent action. This paper presents static and dynamic intelligent mobility models that are based on the inherent clusters’ information of a sparsely connected network. Simulation results validate the idea behind the intelligent mobility models and provide insights into the applicability of these mobility models in different application scenarios.
    Telecommunication Systems 03/2009; 40(3):141-149. · 1.16 Impact Factor

Preview (2 Sources)

Download
0 Downloads