Distributed Detection of Minimum Cuts in Wireless Multi-hop Networks
Abstract : Communicating over multi-hop connections simplifies the establishment of wireless multi-hop networks but brings new challenges such as limited reliability, bottlenecks, and weak connections. The minimum cut of a graph is the smallest subset of edges whose removal disconnects some nodes from the others. Finding minimum cuts of a wireless multi-hop network may reveal useful information such as bottlenecks and critical areas. This paper introduces a distributed algorithm for detecting minimum cuts of a given witless multi-hop network by finding available edge-disjoint paths. Initially, the paths between two arbitrary neighbors are detected and these nodes are grouped as visited nodes. Then, the other nodes are added to the visited group one by one by finding at most O(n) paths in total where n is the number of nodes. The comprehensive simulation results showed that the proposed asynchronous algorithm detects minimum cuts with up to 37.1% and 55.8% lower sent bytes than the existing synchronous and central algorithms, respectively.
? Vehicular networks as a special case of mobile ad-hoc networks make use of the frequently existing communication equipment in cars (either pre-installed or enabled by equipment carried by passengers).
? Wireless Mesh Networks (WMNs) provide a cost efficient way to interconnect existing wireless networks as well as to supply larger areas with network access.
? Each road segment has a default speed (i.e., the speed limit) that will be used in cases where no updated information exists.
? MANETs are characterized with low bandwidth-delay product and constantly changing routes, and most existing solutions advocate a close control of the sending rate, especially for TCP connections that span several nodes along a multi-hop route.
? We consider the problem of detecting cuts by the nodes of a wireless network. We assume that there is a specially designated node in the network, which we call the source node.
? Because the problem of constructing the optimal energy-efficient broadcast/multicast tree is NP-hard, several heuristic algorithms for building a source-based energy-efficient broadcast/multicast tree have been developed recently .
? This last feature makes the algorithm highly scalable to large sensor networks. the challenges posed by the possibility of network partitioning in WSNs has been recognized in several papers but the problem of detecting when such partitioning occurs seems to have received little attention.
• We demonstrate the effectiveness of the proposed algorithm through simulations and a real hardware implementation.
• A method of repairing a disconnected network by using mobile nodes has been proposed in.Algorithms for detecting cuts, as the one proposed here, can serve as useful tools for such network repairing methods.
• The proposed algorithm is an extension of our previous work, which partially examined the DOS detection problem.
• The algorithm for detecting CCOS events relies on finding a short path around a hole, if it exists, and is partially inspired by the jamming detection algorithm proposed in.
? We explore the following two problems related to energy-efficient multicasting in WANETs using a source-based multicast tree wireless multicast and the concept of wireless multicast advantage.
? In the hardware front, energy efficient components have been developed, and in the software front, power aware routing, low complexity coding, and low power data processing algorithms have been examined.
? These trends are used by every node to detect if a cut has occurred that has rendered it disconnected from the source.
? The first path allocated previously is now used for data transmission. The data is transferred through the highlighted path.
? The below architecture consists of 11 nodes in which two being source and destination others will be used for data transmission.
|