The impact of propagation environment and traffic load on the performance of routing protocols in ad hoc networks

Wireless networks are characterized by a dynamic topology triggered by the nodes mobility. Thus, the wireless multi-hops connection and the channel do not have a determinist behaviour such as: interference or multiple paths. Moreover, the nodes' invisibility makes the wireless channel difficult to detect. This wireless networks' behaviour should be scrutinized. In our study, we mainly focus on radio propagation models by observing the evolution of the routing layer's performances in terms of the characteristics of the physical layer. For this purpose, we first examine and then display the simulation findings of the impact of different radio propagation models on the performance of ad hoc networks. To fully understand how these various radio models influence the networks performance, we have compared the performances of several routing protocols (DSR, AODV, and DSDV) for each propagation model. To complete our study, a comparison of energy performance based routing protocols and propagation models are presented. In order to reach credible results, we focused on the notion of nodes' speed and the number of connections by using the well known network simulator NS-2.Comment: 13 pages, 5 figures, International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.1, January 201

Performance Evaluation of AODV, DSR, DYMO & ZRP in Cost 231 Walfisch-Ikegami Path Loss Propagation Model

A Mobile Ad hoc NETwork is a kind of wireless ad-hoc network, and is a self configuring network of mobile routers connected by wireless links. Mobile Ad-Hoc Network (MANET) is a wireless network without infrastructure. Self configurability and easy deployment feature of the MANET resulted in numerous applications in this modern era. Efficient routing protocols will make MANETs reliable. Various research communities are working in field of MANET and trying to adopt the protocols and technology in other applications as well. In this work, we present investigations on the behavior of various routing protocol of MANET with a Cost 231 Walfisch-Ikegami Propagation Model. We evaluate the performance of four different ad-hoc routing protocols on four performance metrics such as Average Jitter, Average End-to-End Delay, Throughput, and Packet Delivery Fraction with varying Pause Time. From the simulation results it is concluded that DSR is better in transmission of packets per unit time and maximum number of packets reached their destination successfully with some delays, i.e. PDF & Throughput is more and Average jitter & end-to-end delay is less. Whereas AODV & ZRP having almost same values in all of the performance metrics, they transmit packets with very less delay but transmits less packets to their destination as compare to DSR.

An enhanced Multipath Strategy in Mobile Ad hoc Routing Protocols

The various routing protocols in Mobile Ad hoc Networks follow different strategies to send the information from one node to another. The nodes in the network are non static and they move randomly and are prone to link failure which makes always to find new routes to the destination. This research mainly focused on the study of the characteristics of multipath routing protocols in MANETS. Two of the multipath routing protocols were investigated and a comparative study along with simulation using NS2 was done between DSR and AODV to propose an enhanced approach to reach the destination maintaining the QoS. A possible optimization to the DSR and AODV routing protocols was proposed to make no node to be overburdened by distributing the load after finding the alternate multipath routes which were discovered in the Route discovery process. The simulation shows that the differences in the protocol highlighted major differences with the protocol performance. These differences have been analyzed with various network size, mobility, and network load. A new search table named Search of Next Node Enquiry Table (SONNET) was proposed to find the best neighbor node. Using SONNET the node selects the neighbor which can be reached in less number of hops and with less time delay and maintaining the QoS

Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks

Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput

Routing efficiency in wireless sensor-actor networks considering semi-automated architecture

Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page