Comprehensive experimental performance analysis of DSR, AODV and DSDV routing protocol for different metrics values with predefined constraints

A Mobile Adhoc Network is a multi-hop self-configuring network without any fixed infrastructure. Due to mobility of nodes, dynamic topology and highly dynamic environment, designing and implementing stable routing in Mobile Ad-hoc Networking is a major challenge and a critical issue. This paper analyses the performance analysis of on demand routing protocol, Dynamic Source Routing (DSR), Adhoc on Demand Distance Vector Routing (AODV) and table driven protocol, Destination-Sequenced Distance Vectoring (DSDV) using a network simulator NS2. Different types of test scenario have designed with fixed number of nodes but varying mobility. Different performance metric values like, throughput, delay, normalized network load, end to end delay, dropped packets, packets delivery ratio have been observed. The experimental results have been analysed and recommendation based on the obtained results has been proposed about the significance of each protocol in different scenarios and situations. The simulation results show that both protocols are good in performance in their own categories. We believe that findings of this paper will help the researcher to find the best protocol under predefined condition with varied mobility. We believe that this research will help the researcher to identify and further investigate any particular metrics value of AODV, DSR and DSDV

Performance Enhancement of Routing in MANETs by using EOMD

Usually large scale of network applications requires communication of the single copy of same information packets simultaneously to many destinations. Applying the infrastructure- based multicast routing protocols in Mobile Ad hoc wireless Networks (MANETs) is a big challenge task. The circumstances that make Multicasting in ad hoc networks is extra intricate than in wired networks are node mobility, Interference of Wi-Fi alerts and broadcast nature of the communication. Tree based Protocols aren't suitable for common topology modifications as an excessive amount of overhead for updating the filter information and additionally no longer suitable for partition or isolation. The major impact of routing for multi-hop MANETs comes due to mobility of the node, as performance is prone to modifications in network topology. When any link breaks, the direction should be repaired or changed, similar to direction preservation or route discovery, respectively. The rerouting process charges in radio bandwidth and battery energy, and the extra routing latency can also affect QoS for community packages, degrading communication performance. The ODMRP is more robust to mobility and unreliable wireless links as its core layout relies on periodic floods of path discovery and renovation. ODMRP periodically reconstructs the ?forwarding mesh? on a fixed quick interval. The path refresh is the most essential parameter because it has the important effect at the protocol overhead. We proposed an Extended - On Demand Multicast Routing Protocol with motion detection (EOMD), which reduces communication overhead and performance improvisation in mobile Ad-Hoc Network in Mobility

Performance evaluation of dynamic source routing protocol with variation in transmission power and speed

Mobile ad-hoc network (MANET) is a set of mobile wireless nodes (devices) which is not rely on a fixed infrastructure. In MANETs, each device is responsible for routing its data according to a specific routing protocol. The three most common MANET routing protocols are: dynamic source routing protocol (DSR), optimized link state routing protocol (OLSR), and ad-hoc on-demand distance vector (AODV). This paper proposes an efficient evaluation of DSR protocol by testing the MANETs routing protocol with variation in transmission power at different speeds. The performance analysis has been given using optimized network engineering tools (OPNET) modeler simulations and evaluated using metrics of average end to end delay and throughput. The results show that the throughput increases as the transmission power increases up to a certain value after which the throughput decreases, also the network work optimally at a certain transmission power which varied at different speed

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future