Performance analysis of a distributed comparison-based self-diagnosis protocol for wireless ad-hoc networks

Wireless ad-hoc networks are collections of wireless nodes having no predefined infrastructure. Most of the existing routing protocols for wireless ad-hoc networks use the shortest path or minimum distance path to the destination. However, the shortest path routing does not provide a good balance of the traffic load among all nodes. When many users utilize the shortest paths, some nodes become highly congested and become what is known as hotspots. These hotspots degrade the performance of wireless ad-hoc networks by creating long queuing and contention delays. This paper investigates the effects of shortest path routing on the network by varying different network parameters. A load distributed path routing is also proposed to enhance the performance of shortest path routing. Matlab simulations show that the load distributive routing provides 35% and 44% less contentions in a 20-node and 30-node network respectively, when compared to shortest path routing.

A peer-to-peer file search and download protocol for wireless ad-hoc networks

This paper presents an overlay based Byzantine tolerant broadcast protocol for wireless ad-hoc networks. The use of an overlay results in a significant reduction in the number of messages. The protocol overcomes Byzantine failures by combining digital signatures, gossiping of message signatures, and failure detectors. These ensure that messages dropped or modified by Byzantine nodes will be detected and retransmitted and that the overlay will eventually consist of enough correct processes to enable message dissemination. An appealing property of the protocol is that it only requires the existence of one correct node in each one-hop neighborhood. The paper also includes a detailed performance evaluation by simulation.

CF-MAC is an energy efficient collision-free MAC protocol for wireless ad-hoc networks, based on the theory of Balanced Incomplete Block Design (BIBD). It has been originally designed considering energy saving as primary aim. In this paper, using computer simulations, its ability to handle voice calls has been evaluated. Specifically, the Mean Opinion Score and the Cumulative Distribution Function of the one way packet delay have been analyzed, for various protocol parameters and network scenarios. Moreover, a comparison between CF-MAC and classical 802.11 DCF access function has been proposed. Simulation results have shown that by properly selecting protocol parameters, CF-MAC can effectively support VoIP calls.

This paper considers the problem of self-diagnosis of wireless mesh networks (WMNs) and mobile ad-hoc networks (MANETs) using the comparison approach. In this approach, the network consists of a collection of n independent heterogeneous mobile or stationary hosts interconnected via wireless links, and it is assumed that at most sigma of these hosts are faulty. In order to diagnose the state of the wireless mesh and ad-hoc network, tasks are assigned to pairs of hosts and the outcomes of these tasks are compared. The agreements and disagreements among hosts are the basis for identifying the faulty ones. We develop a new distributed self-diagnosis protocol, called adaptive-DSDP, for MANETs and WMNs that identifies both hard and soft faults in a finite amount of time. We analyze the time and communication complexities of our protocol and compare it to existing self-diagnosis protocols

Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military applications. Multicasting plays an important role in the ad-hoc wireless networks, where nodes form groups to carry out certain tasks that require point-to-multipoint and multipoint-to-multipoint voice and data communication. The biggest challenge in the ad-hoc wireless networks is to find an optimized path between the two nodes. In this paper, we present an ant colony based metaheuristic multicast routing protocol for ad-hoc wireless networks, in that we analyzed the performance of dynamic core based multicast routing protocol (DCMP). This approach maps the solution capability of swarm intelligence to mathematical and engineering problems. The DCMP is highly adaptive, efficient and scalable. The performance of these protocols has been examined under realistic scenarios using NS 2, the network simulator tool. Performance has been analyzed for the metrics packet delivery ratio and control overheads with the multicast routing protocol. The proposed ant colony based routing protocol reduce the overheads in routing.

The Ad-Hoc networks are autonomous and infrastructure-less networks that provide flexibility to network nodes to connect and disconnect at any time. Routing protocol is a crucial part in the changeable topology network. DSDV, DSR and AODV are the most typical basic protocols for wireless Ad-Hoc networks. In this paper, it interprets and compares these three typical routing protocols using NS-2 simulator. It analyzes these three protocols in several aspects such as packet loss rate, route cost, average end-to-end delay and packet delivery fraction through simulations using Network Simulator in varying network conditions including the number of nodes, maximum moving speed of mobile node, maximum number of connections, node pause time, data rate and node moving range. Performance analysis of simulation results shows that each protocol has its own best suitable scene, so one can choose the optimal protocol under different scenarios according to the simulation results.

An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point.A Mobile Ad hoc NETwork called MANET is a kind of wireless ad-hoc network that is a self configuring network of mobile routers.These mobile routers are connected by wireless links.In MANET there are various routing protocols available.DSR, AODV and DSDV are most popular.Our proposed works are related to examine routing protocol for mobile ad hoc networks -the Destination Sequenced Distance Vector (DSDV) and On Demand protocol that evaluates both protocols based on the packet delivery fraction and average delay while varying number of sources and pause time.In this Improved -DSDV approach we can overcome the problem of state routes, as well as improve the performance of regular DSDV.We compare the performance of our work with DSDV.In our improved DSDV routing protocol, nodes can cooperate together to obtain an objective opinion about another nodes trustworthiness.

Abstract—We focus on a popular message dissemination pro-tocol for wireless ad-hoc networks, GOSSIP3. Our contribution is twofold. First, we perform an extensive experimental evaluation of GOSSIP3 under fully utilized wireless channel and across diverse node densities. We identify the parameters of GOSSIP3 that need special configuration for the protocol to operate optimally. Second, we devise a self-configuration algorithm for GOSSIP3 that allows the protocol to work optimally for any network. We demonstrate through simulations that our protocol significantly outperforms the default configuration of GOSSIP3. I.

Complete-exchange multicasting is quite useful for numerous applications. We explicate a load-balanced complete-exchange multicast protocol (LCM), based on passive clustering, for wireless ad-hoc networks. From a logical viewpoint, LCM constructs multiple cluster structures to balance the traffic loads among all group members. It further avoids overloading of nodes or traffic congestion on the route. In LCM, an innovative scheme is devised to deal with the scenario in which a node plays different roles for different cluster structures. Simulation results show that LCM not only preserves all the advantages of passive clustering, but also performs very efficiently in complete-exchange multicasting. Consequently, LCM is really a feasible solution for load-balanced complete-exchange multicasting, especially for dense networks.

Development of applications and protocols for wireless ad-hoc networks has always been a challenge. Spe- cific characteristics such as frequent topology changes due to nodes moving around, popping up or being turned off, need to be considered from the earliest stages of develop- ment. Since testing and evaluation using genuine wireless devices is both expensive and highly impractical, other tools need to be used in the development phase. Simulators give a very detailed model of lower layers' behaviors, but code often needs to be completely rewritten in order to be used on actual physical devices. Emulators present a trade-off be- tween real test beds and simulators, providing a virtual wireless network at the lowest layers, and yet allowing real code to be run on the higher layers. In this paper, we pre- sent such an emulation platform, called NEMAN, that al- lows us to run a virtual wireless network of hundreds of nodes on a single end-user machine. NEMAN has shown to be an important and very useful tool during development of different applications and protocols for our project, includ- ing a key management protocol and a distributed event noti- fication service.

We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR) protocol, which is an on-demand routing protocol for wireless ad-hoc networks. We evaluate the performance of WRP-Lite and DSR for varying degree of mobility and traffic in a 20-node network. The performance parameters are end-to-end delay, control overhead, percentage of packets delivered, and hop distribution. We show that WRP-Lite has much better delay and hop performance while having comparable overhead to DSR.

Ad hoc mobile networks are composed of mobile nodes communicating through wireless medium, without any fixed backbone infrastructure. In these networks, Congestion occurs in any intermediate nodes when data packets travel from source to destination and they incur high packet loss and long delay, which cause the performance degradations of a network. This paper presents the early detection congestion and control routing protocol for wireless Ad-hoc networks called as EDAODV. EDAODV detects congestion at a node level by calculating queue_status value and finding congestion status. Based on a congestion status, EDAODV utilizes the non-congested predecessor and successor nodes of a congested node and initiates route finding process bi-directionally to find alternate non-congested path between them for transmitting data. The process finds more non-congested alternate paths and chooses a best single path for transmitting data.

In wireless ad hoc networks, mobile peers communicate with other peers over wireless links, without the support of preexisting infrastructures, which is an attractive form of peer communications for certain applications. Although many enabling technologies have progressed significantly in recent years, the highly-anticipated deployment of large-scale, heterogeneous wireless ad hoc networks still faces considerable technical challenges, among which achieving secure, trustworthy and dependable peer communications is a major one. In this chapter, we promote identity-based key management, which serves as a prerequisite for various security procedures. We first identify that peer identity plays an irreplaceable role in wireless ad hoc networks, where autonomous peers can join or leave such systems and change their location in these systems at any time. Next, we show that identity-based key management schemes are effective and efficient for bootstrapping any chosen security procedures, especially in wireless ad hoc networks where both over-the-air communication and on-board computing resources can be severely constrained. Finally, we illustrate identity-based secure communication schemes with a security enhancement to the Dynamic Source Routing protocol. We find that identity-based schemes are intrinsically suitable for and practically capable of securing wireless ad hoc networks and may have great impact on dealing with other network security issues.

The wireless ad hoc network is a new type of mobile communication network that can be quickly constructed at any time and any place. However, with the continuous expansion of its scale and the increasing number of network nodes, the limited time slot resources are difficult to ensure the communication needs of a large number of services between nodes, which has become a bottleneck restricting the development of wireless ad hoc networks. Multiple radio technology provides more operating frequency for each node to realize time slot and frequency resource multiplexing, thus solving the problem of insufficient channel resources. In this paper, we introduced the two-dimensional election algorithm and resource allocation mechanism to ensure the normal operation of the network. We have established the analytical models of election success probability, scheduling delay and network effective throughput. Simulation results show that by increasing the number of radio frequencies, the scheduling delay between nodes can be significantly reduced.KeywordsTwo-dimensional electionAd hoc networkScheduling delayThroughout