Reliable Multicast in Heterogeneous Mobile Ad-hoc Networks

In disaster scenarios, communication infrastructure could be damaged orcompletely failed. Mobile Ad-hoc Networks (MANETs) can be used to substitutefailed communication devices and thus to enable communication. As group communicationis an important part in disaster scenarios, multicast will be used to addressseveral nodes. In this paper, we propose our new reliable multicast protocol RMDA(Reliable Multicast over Delay Tolerant Mobile Ad hoc Networks). We introducean efficient group management approach and a new method for reliable multicastdelivery over Delay Tolerant Networks. We show, that our protocol is adaptive todifferent kinds of MANETs, e.g. with or without clusterheads, respectively. Forthose without, we use our name resolution over adaptive routing approach

Reliable multicast in heterogeneous mobile ad-hoc networks

In disaster scenarios, communication infrastructure could be damaged or completely failed. Mobile Ad-hoc Networks (MANETs) can be used to substitute failed communication devices and thus to enable communication. As group communication is an important part in disaster scenarios, multicast will be used to address several nodes. In this paper, we propose our new reliable multicast protocol RMDA (Reliable Multicast over Delay Tolerant Mobile Ad hoc Networks). We introduce an efficient group management approach and a new method for reliable multicast delivery over Delay Tolerant Networks. We show, that our protocol is adaptive to different kinds of MANETs, e.g. with or without clusterheads, respectively. For those without, we use our name resolution over adaptive routing approach

Software-based fault-tolerant routing algorithm in multidimensional networks

Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The software-based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks (Suh et al., 2000). Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments

Efficient Mobile Data Collection with Mobile Collect

WISENET (NES)PromosCONE

Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network

An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good properties of the network structure. It is recoverable for local accidents in the hierarchical network structure. Moreover, the design principle is theoretically supported with a calculation method for the optimal service rates of message-ferries derived from a tandem queue model for stochastic processes on a chain of edges in the network. These results obtained from a combination of complex network science and computer science will be useful for developing a resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of Collective Adaptive Systems) at The 9th IEEE International Conference on SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201