A Taxonomy of Distributed Real-time Control Systems

International Journal of Distributed Sensor Networks

2009

Networked Embedded Systems have come to occupy an important role in emerging applications. Nodes in such a system are interconnected by a mesh topology. Despite the availability of multiple shortest paths between pairs of nodes, simulation results revealed that these paths cannot be effectively exploited by spreading the messages over the paths in a uniform method. We define the union of all the shortest paths between a pair of nodes as a contour. We present results that characterize the structure of contours when each node communicates directly with eight immediate neighbors. Heuristic rules that effectively disseminate messages over the available paths are presented. Simulation results demonstrate that the new method for dissemination ensures that nodes in a contour, which are at the same distance from the source, handle roughly the same number of messages. In the future, such techniques can be extended to general topologies.

Section: The Monitoring Problemmentioning

confidence: 99%

Contour Guided Dissemination for Networked Embedded Systems

Chu

Duan

International Journal of Distributed Sensor Networks

2009

“…A SANe is a distributed platform for integrated computation and control in real-time environments [1]. The nodes are distinguished by being resource constrained.…”

Section: S Sastry and S S Iyengarmentioning

confidence: 99%

Real-Time Sensor-Actuator Networks

International Journal of Distributed Sensor Networks

Iyengar

2005

“…Often, the systems are designed to overlay on an underlying grid. For example, in automation systems, the regions demarcated by such a grid are called zones [10]; a zone is a commonly used abstraction to support the design, operation, and maintenance activities. Motivated by applications in such domains, we consider regular mesh topologies that arise by embedding the nodes in a 2D Basegrid.…”

Section: Introductionmentioning

confidence: 99%

Multipath Dissemination in Regular Mesh Topologies

Mamidisetty

Duan

IEEE Trans. Parallel Distrib. Syst.

et al. 2009

Self Cite

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite the presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.