The Impact of Radio Propagation Models on Ad Hoc Networks Performances

Abstract

<b>Problem statement:</b> 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 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. <b>Approach:</b> 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. <b>Results:</b> 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. 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. <b>Conclusion:</b> To conclude, the simulation findings are to be taken as a strong reference on the three routing protocols’ behaviour; however, it shouldn’t be considered as an exact representation of its behaviour and real environment because of several simulation constraints such as: the dimension of movement field of mobile nodes, the traffic type and the simulation timing

Impact of the Smart City Architecture, Speed and Traffic Density of Vehicles on the Performances of Vanets

“…Our objective is to provide a qualitative assessment of the protocols applicability in different vehicular scenarios. These two routing protocols are simulated and compared with Network Simulator-2 under Manhattan Grid Mobility Model (A, Rhattoy, 2012), this Model is similar to City Section Mobility Model, and he uses a grid road topology, as shown Fig. 1.…”

“…Each node maintains a preferred neighbor, which is the next hop on the path to reach a destination. Two different classes of routing algorithms have been proposed in the literature, namely, proactive and reactive (P.S., C. Nayak, 2016 andRhattoy, 2012). In a proactive algorithm, each node maintains updated list of destinations and periodically advertises routing table to all the neighbors.…”

Performance Evaluation of Routing Schemes in Wireless Sensor Networks for Train Monitoring

“…If both nodes are in line of sight, this model uses a good propagation paradigm. Otherwise, it changes the shadowing parameters to ensure bad propagation paradigm (Rhattoy et al, 2012). Thus, shadowing visibility switches between two paradigms depending on the visibility between sensor nodes which allows a more accurate simulation model to represent a realistic environment as illustrated in table 2.…”

Physical propagation and traffic load impact on the performance of routing protocols and energy Consumption in manet

“…However, the environment where the waves spread and the utilized frequency also play a crucial role. The radio propagation waves are controlled by strict rules, mainly when there are obstacles between the transmitter and the receiver [1]- [3]. Among the changes a wave may undergo, we can cite: reflection, diffraction, diffusion and absorption (figure.1).…”