Given a directed graph with n nodes andm edges, the (strong) edge connectivity λ(u, v) between two nodes u and v is the minimum number of edges whose deletion makes u and v not strongly connected. The problem of computing the edge connectivities between all pairs of nodes of a directed graph can be done in O(m) time by Cheung, Lau and Leung (FOCS 2011), where ω is the matrix multiplication fact...

The reliability of communication can be enhanced by increasing the network connectivity. Topology control and node sleep scheduling are used to reduce the energy consumption. This paper considers the problem of maintaining k-connectivity of WSN at minimum energy level while keeping only a subset of sensor nodes active to save energy. In our proposed scheme, each node is assumed to have multiple...

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 information flow paths in a data network, where traffic generated by servers ( or sources) takes a multi-hop path in order to reach its clients (destinations). Each node in the middle of this multi-hop path should route the incoming traffic and the traffic generated by itself to the next hop in such a way that the traffic reaches its destination while avoiding congestion ...

Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. This optimization problem is referred to as minimum-energy routing. While minimum-energy unicast routing can b...

Coordinated checkpointing is an effective fault tolerant technique in distributed system as it avoids the domino effect and require minimum storage requirement. Most of the earlier coordinated checkpoint algorithms block their computation during checkpointing and forces minimum-process or non-blocking but forces all nodes to takes checkpoint even though many of them may not be necessary or non-...

Energy conservation is a critical issue in ad hoc wireless networks for node and network life since the nodes are powered by batteries only One major approach for energy conservation is to route a communica tion session along the route which requires the lowest total energy con sumption This optimization problem is referred to as Minimum Energy Routing While the minimum energy unicast routing p...

Mobile Ad hoc NETwork (MANET) is a collection of mobile nodes that are arbitrarily located so that the interconnections between nodes are dynamically changing. In MANET mobile nodes forms a temporary network without the use of any existing network infrastructure or centralized administration. A routing protocol is used to find routes between mobile nodes to facilitate communication within the n...