Organization-Oriented Chemical Programming of Distributed Artifacts

Author(s):  
Naoki Matsumaru ◽  
Thomas Hinze ◽  
Peter Dittrich

The construction of molecular-scale machines requires novel paradigms for their programming. Here, we assume a scenario of distributed devices that process in-formation by chemical reactions and that communicate by exchanging molecules. Programming such a distributed system requires specifing reaction rules as well as exchange rules. Here, we present an approach that helps to guide the manual construction of distributed chemical programs. We show how chemical organization theory can assist a programmer in predicting the behavior of the program. The basic idea is that a computation should be understood as a movement between chemical organizations, which are closed and self-maintaining sets of molecular species. When sticking to that design principle, fine-tuning of kinetic laws becomes less important. We demonstrate the approach by a novel chemical program that solves the maximal independent set problem on a distributed system without any central control—a typical situation in ad-hoc networks. We show that the computational result, which emerges from many local reaction events, can be explained in terms of chemical organizations, which assures robustness and low sensitivity to the choice of kinetic parameters.

Author(s):  
Naoki Matsumaru ◽  
Thomas Hinze ◽  
Peter Dittrich

The construction of molecular-scale machines requires novel paradigms for their programming. Here, we assume a scenario of distributed devices that process in-formation by chemical reactions and that communicate by exchanging molecules. Programming such a distributed system requires specifing reaction rules as well as exchange rules. Here, we present an approach that helps to guide the manual construction of distributed chemical programs. We show how chemical organization theory can assist a programmer in predicting the behavior of the program. The basic idea is that a computation should be understood as a movement between chemical organizations, which are closed and self-maintaining sets of molecular species. When sticking to that design principle, fine-tuning of kinetic laws becomes less important. We demonstrate the approach by a novel chemical program that solves the maximal independent set problem on a distributed system without any central control—a typical situation in ad-hoc networks. We show that the computational result, which emerges from many local reaction events, can be explained in terms of chemical organizations, which assures robustness and low sensitivity to the choice of kinetic parameters.


2003 ◽  
Vol 14 (02) ◽  
pp. 287-303 ◽  
Author(s):  
KHALED M. ALZOUBI ◽  
PENG-JUN WAN ◽  
OPHIR FRIEDER

A maximal independent set (MIS) S for a graph G is an independent set and no proper superset of S is also independent. A set S is dominating if each node in the graph is either in S or adjacent to one of the nodes in S. The subgraph weakly induced by S is the graph G′ such that each edge in G′ has at least one end point in S. A set S is a weakly-connected dominating set (WCDS) of G if S is dominating and G′ is connected. G′ is a sparse spanner if it has linear edges. The nodes of WCDS have been proposed in the literature as clusterheads for clustered wireless ad hoc networks. In this paper, we present two distributed algorithms for constructing a WCDS for wireless ad hoc networks in linear time. The first algorithm has an approximation ratio of 5, and requires O(n log n) messages, while the second algorithm has a larger approximation ratio, and requires only O(n) messages. Both of these algorithms are used to obtain sparse spanners. The spanner obtained by the second algorithm has a topological dilation of 3, and a geometric dilation of 6. Both of these algorithms are based on the construction of a MIS. The first algorithm requires the construction of a spanning tree. The second algorithm is fully localized, and does not depend on the spanning tree, which makes the maintenance of the WCDS simpler, and guarantees the maintenance of the same approximation ratio.


2009 ◽  
Vol 01 (01) ◽  
pp. 71-84 ◽  
Author(s):  
XIAOFENG GAO ◽  
YUEXUAN WANG ◽  
XIANYUE LI ◽  
WEILI WU

Connected Dominating Set is widely used as virtual backbone in wireless networks to improve network performance and optimize routing protocols. Based on special characteristics of ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to be adjacent if the distance between them is less than 1. Since every Maximal Independent Set (MIS) is a dominating set and it is easy to construct, we can firstly find an MIS and then connect it into a Connected Dominating Set (CDS). Therefore, the ratio to compare the size of an MIS with a minimum CDS becomes a theoretical upper bound for approximation algorithms to compute CDS. In our paper, with the help of Voronoi diagram and Euler's formula, we improved this upper bound, so that improved the approximations based on this relation.


2016 ◽  
Vol 14 (36) ◽  
pp. 9-25
Author(s):  
John Edwar González ◽  
Jorge Eduardo Ortiz ◽  
Henry Zárate Ceballos

This article presents the state of the art derived from a research project where the construction of a software module related with the capability of the wireless nodes to decide whether or not to enter an ad hoc network, is proposed. If the decision is to enter, the amount of resources needed to provide the net is assessed by analyzing data provided for the network about the resources available and the number of nodes and internal parameters (CPU, hard disk, and processor, among others) through a mathematical model. The module developed should interact with an interpreter at a lower level and with a higher level entity, a distributed system. The research is supported by the computational system of the TLÖN group of the Universidad Nacional de Colombia, where its main purpose is to study the application of a social-inspired paradigm in ad hoc networks.


2008 ◽  
Vol 18 (01) ◽  
pp. 189-199 ◽  
Author(s):  
WAYNE GODDARD ◽  
STEPHEN T. HEDETNIEMI ◽  
DAVID P. JACOBS ◽  
PRADIP K. SRIMANI ◽  
ZHENYU XU

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.


Author(s):  
Shu-Ching Wang ◽  
Ya-Jung Lin ◽  
Yao-Te Tsai ◽  
Kuo-Qin Yan

The era of Internet of Things (IoT) has begun to evolve and with this the devices around us are getting more and more connected. Vehicular Ad-hoc NETworks (VANETs) is one of the applications of IoT. VANET allow vehicles within these networks to communicate effectively with each another. VANETs can provide an extensive range of applications that support and enhance passenger safety and comfort. It is important that VANETs are applied within a safe and reliable network topology; however, the challenging nature of reaching reliable and trustworthy agreement in such distributed systems is one of the most important issues in designing a fault-tolerant system. Therefore, protocols are required so that systems can still be correctly executed, reaching agreement on the same values in a distributed system, even if certain components in the system fail. In this study, the agreement problem is revisited in a VANET with multiple damages. The proposed protocol allows all fault-free nodes (vehicles) to reach agreement with minimal rounds of message exchanges, and tolerates the maximal number of allowable faulty components in the VANET.


2020 ◽  
Vol 39 (6) ◽  
pp. 8357-8364
Author(s):  
Thompson Stephan ◽  
Ananthnarayan Rajappa ◽  
K.S. Sendhil Kumar ◽  
Shivang Gupta ◽  
Achyut Shankar ◽  
...  

Vehicular Ad Hoc Networks (VANETs) is the most growing research area in wireless communication and has been gaining significant attention over recent years due to its role in designing intelligent transportation systems. Wireless multi-hop forwarding in VANETs is challenging since the data has to be relayed as soon as possible through the intermediate vehicles from the source to destination. This paper proposes a modified fuzzy-based greedy routing protocol (MFGR) which is an enhanced version of fuzzy logic-based greedy routing protocol (FLGR). Our proposed protocol applies fuzzy logic for the selection of the next greedy forwarder to forward the data reliably towards the destination. Five parameters, namely distance, direction, speed, position, and trust have been used to evaluate the node’s stability using fuzzy logic. The simulation results demonstrate that the proposed MFGR scheme can achieve the best performance in terms of the highest packet delivery ratio (PDR) and minimizes the average number of hops among all protocols.


Sign in / Sign up

Export Citation Format

Share Document