scholarly journals Secure and effective random paths selection (SERPS) algorithm for security in MANETs

2018 ◽  
Vol 7 (2.8) ◽  
pp. 134
Author(s):  
P Suma ◽  
Mohammed Ali Hussain
Keyword(s):  
Ad Hoc ◽  
Minimum Cost ◽  
Data Packets ◽  
Routing Strategy ◽  
Dynamic Source ◽  
Fixed Topology ◽  
Minimum Cost Paths ◽  
Hoc Networks ◽  
Cost Paths ◽  
The Cost

Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.

scholarly journals A proposed routing scheme for power reduction in wireless networks

2013 ◽  
Vol 3 (1) ◽  
pp. 20 ◽  
Author(s):  
Dalia Elewely ◽  
Marwa Areed ◽  
Hesham Ali
Keyword(s):  
Wireless Networks ◽  
Ad Hoc ◽  
Power Saving ◽  
Ad Hoc Wireless Networks ◽  
Mobile Nodes ◽  
Routing Scheme ◽  
Routing Strategy ◽  
Network Operation ◽  
Dynamic Source ◽  
Hoc Networks

Ad-hoc networks consist of a set of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration. The loss of some nodes may cause significant topological changes, undermine the network operation, and affect the lifetime of the network. This paper discusses the energy consumption problem and summaries the existing power saving techniques in ad-hoc wireless networks. The main objective of this paper is to introduce a new power aware multi-path node disjoint routing scheme based on the Dynamic Source Routing protocol (DSR), which can prolong MANETs lifetime, reduce routing delay and increase the reliability of the packets reaching its destination. Therefore, a comprehensive study of DSR protocol has been drawn using NS-2 simulator, to evaluate the performance of DSR as a routing strategy and investigate its efficiency in saving wireless networks resources, as a prelude to avoid its performance shortcomings in our proposed routing scheme. Keywords: Power aware protocol, node disjoint, network simulation 2, multipath routing, Dsr protocol, ad-hoc network.

scholarly journals Development of a Priority based System for Emergency Vehicles to Reduce Accidents in VANETs

2020 ◽  
Vol 9 (2) ◽  
pp. 483-486
Keyword(s):  
Waiting Time ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Human Life ◽  
Traffic Signals ◽  
Emergency Vehicles ◽  
Movement System ◽  
Hoc Networks ◽  
The Cost ◽  
Vehicle Movement

Due to tremendous increase of vehicles in number leads to excessive congestion of vehicles at intersection of roads. It causing inconvenience to emergency vehicles like Ambulance and Fire brigade etc, ultimately which is the cost of human life To avoid this, Emergency Vehicles will have to give high priority to overcome from the congestion. Vehicular Ad-Hoc Networks (VANETs) is a network which is used to create a temporary communication among the vehicles. In this paper, priority based vehicle movement system is proposed to give high priority to emergency vehicles and establishing communication among the vehicles through VANET. Due to this high priority, there is no necessity to wait for the emergency vehicles at the traffic signals to get the green signal while communicating with traffic controller. In this paper, SUMO simulator is used for experimental analysis. The result indicates that the proposed methodology reduces the waiting time when compared to the existing system.

Secure Route Discovery in DSR against Black Hole Attacks in Mobile Ad Hoc Networks

2012 ◽  
pp. 125-143
Author(s):  
P. Subathra ◽  
S. Sivagurunathan
Keyword(s):  
Black Hole ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
False Negative ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
And Performance ◽  
Hoc Networks

A Mobile Ad hoc Network (MANET) is a collection of wireless nodes communicating over multi-hop paths without any infrastructure. Nodes must cooperate to provide necessary network functionalities. The security in routing protocols like Dynamic Source Routing (DSR) can be compromised by a “Black Hole” attack. Here, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops them, leading to performance degradation. The situation becomes worse when two or more nodes cooperate and perform the “Cooperative black hole” attack. This chapter proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating the attacking nodes. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio, and false negative probability in comparison with trust and probe based schemes.

Analysis of Effective Routing Protocols for Flying Ad-Hoc Networks

2020 ◽  
Vol 3 (2) ◽  
pp. 1-18 ◽  
Author(s):  
Sudesh Kumar ◽  
Abhishek Bansal ◽  
Ram Shringar Raw
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
High Speed ◽  
Ad Hoc ◽  
Network Formation ◽  
High Mobility ◽  
Delivery Ratio ◽  
Data Packets ◽  
Hoc Networks ◽  
Networking Technology

Recently, the flying ad-hoc network (FANETs) is a popular networking technology used to create a wireless network through unmanned aerial vehicles (UAVs). In this network, the UAV nodes work as intermediate nodes that communicate with each other to transmit data packets over the network, in the absence of fixed an infrastructure. Due to high mobility degree of UAV nodes, network formation and deformation among the UAVs are very frequent. Therefore, effective routing is a more challenging issue in FANETs. This paper presents performance evaluations and comparisons of the popular topology-based routing protocol namely AODV and position-based routing protocol, namely LAR for high speed mobility as well as a verity of the density of UAV nodes in the FANETs environment through NS-2 simulator. The extensive simulation results have shown that LAR gives better performance than AODV significantly in terms of the packet delivery ratio, normalized routing overhead, end-to-end delay, and average throughput, which make it a more effective routing protocol for the highly dynamic nature of FANETs.

Trust-based minimum cost opportunistic routing for Ad hoc networks

2011 ◽  
Vol 84 (12) ◽  
pp. 2107-2122 ◽  
Author(s):  
Wang Bo ◽  
Huang Chuanhe ◽  
Li Layuan ◽  
Yang Wenzhong
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Minimum Cost ◽  
Opportunistic Routing ◽  
Hoc Networks
Sign in / Sign up

Export Citation Format

Share Document