Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure and frequent node mobility. A class of ant colony based routing protocols has recently gained attention because of their adaptability to the network changes. AntHocNet is ant colony based hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. M...

In this paper, we consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in parallel and distributed computing systems. We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable interconnects. It is well-known that this type of interconnect has low hardware cost, but c...

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. To fulfill certain quality parameters, and to achieve network stability, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution...

Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be ad...

Finding multipath routes for Ad Hoc networks is a challenging task due to mobility of nodes. In this paper, we propose a cross-layer node disjoint multipath routing protocol AODV-MCPI. This routing protocol works in conjunction with MAC-CPI protocol at MAC layer. The protocol at MAC layer ensures that there are no collisions due to interference as every node ensures a minimum of ‘safe-distance’...

In this paper, we study a broadcast problem in directed trees. This problem is motivated by the task of implementing broadcast and multicast requests in computer systems with networks that utilize circuit routing schemes such as wormhole routing or virtual cut through routing as opposed to store and forward routing. Examples of such systems include the Intel Paragon and the NCUBE-2. The problem...

Various simulators (e.g., ns-2 and GloMoSim) are available to implement and study the behavior of the routing protocols for mobile ad hoc networks (MANETs). But, students and investigators who are new to this area often get perplexed in the complexity of these simulators and lose the focus in designing and analyzing the characteristics of the network and the protocol. Most of the time would be ...

This note attempts to understand graph limits as defined by Lovasz and Szegedy (2006)} in terms of harmonic analysis on semigroups. is done representing probability distributions random exchangeable graphs mixtures characters the semigroup unlabeled with node-disjoint union, thereby providing an alternative derivation de Finetti's theorem for graphs.

The problem of QoS Routing for MANET posses several challenges that must be addressed. To select the most optimal route from source to destination, one has to choose from a set of routes with the corresponding quality of connectivity and resources. A rationale for multiple routes is presented. We argued that QoS routing protocol should exploit the rich non-disjoint node connectivity over disjoi...

This work considers the problem of peer-to-peer video streaming for a critical private web cast, for a medium sized heterogeneous network. The nodes can form an overlay network based on multicast tree at application level. The nodes are assumed to have different bandwidths and reliabilities, with a majority of the nodes having low bandwidths and low reliability such that they can only receive s...