Comparison of Packet Delivery Fraction of On-demand Routing Protocol based on different Terrain-Area in MANET

2017 ◽  
Vol MCSP2017 (01) ◽  
pp. 38-41
Author(s):  
Hari Shankar Sahu ◽  
Rupanita Das

Now a days telecommunication technology leads to a rapid growth of number of users, these number of users nothing but number of nodes in MANET.A wireless ad hoc network is a decentralized type of wireless network. The mobility of nodes effect on the performance of the network. Due to mobility of nodes the link breaks number of times which effect on the packet delivery. Therefore to analyze the performance, packet delivery fraction (PDF)can be used. This paper describe the packet delivery fraction of on demand routing protocol AODV and DSR on different terrain areas using GLOMOSIM.

2016 ◽  
Vol 144 (4) ◽  
pp. 42-50
Author(s):  
Niroj Kumar ◽  
Bikram Keshari ◽  
Sarojananda Mishra

Author(s):  
Haibo Jiang ◽  
Yaofei Ma ◽  
Dongsheng Hong ◽  
Zhen Li

Wireless ad hoc network is generally employed in military and emergencies due to its flexibility and easy-to-use. It is suitable for military wireless network that has the characteristics of mobility and works effectively under severe environment and electromagnetic interfering conditions. However, military network cannot benefit from existing routing protocol directly; there exists quite many features which are only typical for military network. For example, there are several radios in the same vehicle. This paper presents a new metric for routing, which is employed in A* algorithm. The goal of the metric is to choose a route of less distance and less transmission delay between a source and a destination. Our metric is a function of the distance between the ends and the bandwidth over the link. Moreover, we take frequency selection into account since a node can work on multi-frequencies. This paper proposed the new metric, and experimented it based on A* algorithm. The simulation results show that this metric can find the optimal route which has less transmission delay compared to the shortest path routing.


2021 ◽  
Author(s):  
Ling Zhang ◽  
Qin Liu

Abstract This paper addresses the optimization of on-demand routing protocols for quantum wireless Ad Hoc network. This paper proposes an optimal quantum route metric algorithm that integrates quantum route metric and classic route metric to select a better route path for quantum communication. The paper also improves the route discovery protocol by proposing a "reverse synchronization method" which means after the route request is completed, the quantum entanglement channel is established synchronously when the reverse path is established. This method, better than general methods which builds quantum channels after the forward path establishment, reduces the time and the numbers of messages for quantum channel establishment, thus improving the efficiency. Accordingly, this paper elaborates the specific methods, procedures and related upgrading message formats involved in quantum route discovery, quantum channel establishment and quantum information transmission of on-demand routing protocols for quantum wireless Ad Hoc network. The advantage of the "reverse synchronization method" in reducing the time and the numbers of messages for quantum channel establishment is verified through analysis on protocol performance.


IET Networks ◽  
2014 ◽  
Vol 3 (4) ◽  
pp. 245-251 ◽  
Author(s):  
Lawal Bello ◽  
Panos Bakalis ◽  
Predrag Rapajic ◽  
Kwashie A. Anang

2015 ◽  
Vol 40 (4) ◽  
pp. 267-298 ◽  
Author(s):  
Himadri Nath Saha ◽  
Rohit Singh ◽  
Debika Bhattacharyya ◽  
P.K. Banerjee

Abstract With advent of technology MANET is becoming more and more ubiquitous, and so is the vulnerability of such networks to attacks. In this paper, we propose a secure, lightweight, on-demand routing protocol for MANETs. It uses the concept of fidelity to allocate trust to a neighbor, thereby taking the decision whether to send data via that neighbor or not. To combat attacks efficiently new packets like report and recommendation are used. After receiving a few of these packets a node can conclude about the behavior of a node, thereby identifying and blacklisting the malicious nodes. We try to impose bounds for the fidelity with reference to the battery of the node, which restricts a node to increase its fidelity to infinity and become dominant in the network. This protocol not only finds a secure route to transmit data, but also identifies the malicious nodes in the network. Our protocol exhibits high packet delivery fraction, with low normalized routing load and low end to end delay; which has been observed while simulating in GloMoSim platform. We have observed that our protocol performs not only better than other existing secure routing protocol in a malicious environment, but also combats, many attacks which have not been dealt with these protocols.


Informatica ◽  
2006 ◽  
Vol 17 (4) ◽  
pp. 481-502
Author(s):  
Chinnappan Jayakumar ◽  
Chenniappan Chellappan

Sign in / Sign up

Export Citation Format

Share Document