scholarly journals TEKNIK KOMUNIKASI DATA PADA AD HOC NETWORK COMMUNICATION

2014 ◽  
Vol 11 (2) ◽  
Author(s):  
Budi Rahmadya
Keyword(s):  
Mobile Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Data Communication ◽  
High Mobility ◽  
Delay Tolerant Network ◽  
Network Communication ◽  
Destination Node ◽  
Delivery Ratio ◽  
Data Packets

Ad Hoc Network Communication is mobile networks communications and have a high mobility for each of its nodes. This type of network communications is a temporary networkwith utilizing a WiFi network or Bluethoot as a medium of communications. In the entirenetwork, node moves with a speed varying and unpredictable direction. Packets data delivery from the source node to destination node by using an ad hoc network requires its owntechniques. In this research discussed the existing data communication technique inVehicular Ad Hoc Network (VANETs) Communications with attention: Broadcasting Time, Routing Protocol, Message Dissemination, Delay Tolerant Network Dissemination and / DTN.These techniques can increase the delivery ratio / sending data packets to the destination as well as a smaller delay time. In order to maintain the integrity of the data packets received bythe destination node, the authors have proposed a method of duplicate messages in thisresearch.

scholarly journals TEKNIK KOMUNIKASI DATA PADA AD HOC NETWORK COMMUNICATION

2014 ◽  
Vol 11 (2) ◽  
Author(s):  
Budi Rahmadya
Keyword(s):  
Mobile Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Data Communication ◽  
High Mobility ◽  
Delay Tolerant Network ◽  
Network Communication ◽  
Destination Node ◽  
Delivery Ratio ◽  
Data Packets

Ad Hoc Network Communication is mobile networks communications and have a high mobility for each of its nodes. This type of network communications is a temporary networkwith utilizing a WiFi network or Bluethoot as a medium of communications. In the entirenetwork, node moves with a speed varying and unpredictable direction. Packets data delivery from the source node to destination node by using an ad hoc network requires its owntechniques. In this research discussed the existing data communication technique inVehicular Ad Hoc Network (VANETs) Communications with attention: Broadcasting Time, Routing Protocol, Message Dissemination, Delay Tolerant Network Dissemination and / DTN.These techniques can increase the delivery ratio / sending data packets to the destination as well as a smaller delay time. In order to maintain the integrity of the data packets received bythe destination node, the authors have proposed a method of duplicate messages in thisresearch.

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.

scholarly journals Rancang Bangun Protokol Perutean SDGR+R pada Vehicular AD-HOC Network Berbasis Arah

2020 ◽  
Vol 7 (6) ◽  
pp. 1197
Author(s):  
Eliyah Acantha Manapa ◽  
Sri Wahjuni ◽  
Shelvie Nidya Neyman
Keyword(s):  
Communication Network ◽  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Technology Development ◽  
High Mobility ◽  
Vehicular Ad Hoc Network ◽  
Destination Node ◽  
Delivery Ratio ◽  
Vehicle Communication

<p class="Default"><em>Vehicular Ad-Hoc Network</em> (VANET) merupakan pengembangan jaringan <em>wiresless</em> yang melakukan komunikasi secara <em>Inter Vehicle Communication</em> (IVC). VANET memiliki mobilitas yang tinggi untuk setiap <em>node</em> nya sehingga jaringan komunikasi jenis ini adalah jaringan yang bersifat sementara dikarenakan <em>node</em> bergerak di lintasan dengan arah dan kecepatan yang dinamis. Dengan demikian, pengiriman paket data dari <em>node</em> sumber ke <em>node</em> tujuan menggunakan VANET memerlukan beberapa teknik komunikasi. Teknik terbaru komunikasi VANET saat ini adalah menggunakan SDN (<em>Software Defined Network</em>) yang berbasis <em>geographic</em> (SDGR) sebagai <em>control</em> <em>plane</em> dalam mengontrol komunikasi <em>ad</em>-<em>hoc</em> antar <em>node</em>. Dalam membentuk topologi jaringan komunikasi, SDGR mencari nilai jalur terpendek antar <em>node</em> dan kepadatan <em>node</em> yang tinggi. Tujuan utama penelitian ini melakukan analisis konsep protokol perutean (<em>routing protocol)</em> SDGR dan dilakukan pengembangannya dengan mempertimbangkan arah rute (SDGR+R). Pada SDGR+R, penambahan basis arah rute menggunakan <em>m</em><em>ulticast</em>. Selanjutnya, dilakukan perbandingan kinerja antara SDGR dan SDGR+R. Hasil simulasi menunjukkan SDGR+R memiliki kinerja lebih baik daripada SDGR dalam hal <em>latency</em> sebesar 1.88% dan <em>packet</em> <em>delivery</em> <em>ratio </em>(PDR) sebesar 8.12%. Perancangan protokol perutean SDGR+R menambah ide pengembangan teknologi pada VANET untuk masa mendatang.</p><p class="Default"> <em><strong>Abstract</strong></em></p><p class="Judul2"><em>Vehicular Ad-Hoc Network (VANET) is a wireless network developed for communication on Inter-Vehicle Communication (IVC). Each node in a VANET has high mobility so that this type of communication network is a temporary network because the node moves on the track with dynamic direction and speed. Thus, sending data packets from source node to destination node using VANET requires some communication techniques. The latest technology for VANET communication is to use SDN-based geographic-based SDN (SDGR) as a control plane in controlling Ad-hoc communication between nodes. In</em><em> </em><em>forming the communication network topology, SDGR looks for the shortest path value between nodes and high node density. The main objective of this research is to analyze the concept of SDGR routing protocol and to develop it, considering the direction of the route (SDGR+R). In SDGR + R, the addition of route base directions uses multicast. Next, </em><em>we compare</em><em> the performance between SDGR and SDGR+R.</em><em> Simulation results show SDGR+R has better performance than SDGR in terms of latency </em><em>of 1.88% </em><em>and packet delivery ratio</em><em> of 8.12%</em><em>.</em><em> The design of the SDGR+R routing protocol gives to the idea of technology development on VANET in the future.</em></p><p class="Default"><em><strong><br /></strong></em></p>

Analysis of Reinforcement Based Adaptive Routing in MANET

2016 ◽  
Vol 2 (3) ◽  
pp. 648 ◽  
Author(s):  
Rahul Desai ◽  
B P Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Learning Algorithms ◽  
High Mobility ◽  
Delivery Ratio ◽  
Shortest Path Routing ◽  
Minimum Number ◽  
Shortest Path Algorithms

<p class="Abstract">This paper describes and evaluates the performance of various reinforcement learning algorithms with shortest path algorithms that are widely used for routing packets through the network. Shortest path routing is the simplest policy used for routing the packets along the path having minimum number of hops. In high traffic or high mobility conditions, the shortest path get flooded with huge number of packets and congestions occurs, So such shortest path does not provides the shortest path and increases delay for reaching the packets to the destination. Reinforcement learning algorithms are adaptive algorithms where the path is selected based on the traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis done on a 6 by 6 irregular grid and sample ad hoc network shows that performance parameters used for judging the network - packet delivery ratio and delay provides optimum results using reinforcement learning algorithms. </p>

Study on a Novel GIS-Based Routing Strategy

2014 ◽  
Vol 644-650 ◽  
pp. 2969-2972
Author(s):  
Yue Wei Wang ◽  
Ding Yi Ji
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
High Mobility ◽  
Delivery Ratio ◽  
Scenario Simulation ◽  
Packet Delivery ◽  
Routing Strategy ◽  
Topology Changes ◽  
The City

Given a scenario of Vehicle Ad hoc Network (VANET), this paper presented a GIS-Based routing (GBR) strategy to resolve frequent reconstruction caused by rapid topology changes. Due to the use of road information based on GIS, the protocol can evade permanent or temporary topology holes respectively which frequently occurred in the city scenario. Simulation results showed new routing protocols could achieve better performance in packet delivery ratio and proved GBR’s lower routing overhead, as well as it is better performances in high mobility, compared with DSR in urban vehicle environment.

Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning

2015 ◽  
Vol 11 (2) ◽  
pp. 40-52
Author(s):  
Rahul Desai ◽  
B.P. Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Learning Algorithms ◽  
High Mobility ◽  
Delivery Ratio ◽  
Shortest Path Routing ◽  
Minimum Number ◽  
Shortest Path Algorithms

This paper describes and evaluates the performance of various reinforcement learning algorithms with shortest path algorithms that are widely used for routing packets throughout the network. Shortest path routing is simplest policy used for routing the packets along the path having minimum number of hops. In high traffic or high mobility conditions, the shortest path gets flooded with huge number of packets and congestions occurs, so such shortest path does not provide the shortest path and increases delay for reaching the packets to the destination. Reinforcement learning algorithms are adaptive algorithms where the path is selected based on the traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on a 6-by-6 irregular grid and sample ad hoc network shows that performance parameters used for judging the network such as packet delivery ratio and delay provide optimum results using reinforcement learning algorithms.

Directional Location Verification and Routing in Vehicular Ad-Hoc Network

2020 ◽  
pp. 1-20
Author(s):  
Kamlesh Kumar Rana ◽  
Vishnu Sharma ◽  
Vishal Jain ◽  
Sanjoy Das ◽  
Gagan Tiwari ◽  
...  
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Vehicular Ad Hoc Network ◽  
Delivery Ratio ◽  
Direct Communication ◽  
Data Packets ◽  
Packet Delivery ◽  
Location Verification ◽  
Packet Drop

Vehicular ad-hoc network (VANET) is an autonomous system of mobile vehicles in which vehicles are a source of information. In VANET, direct communication between vehicles provides high-level safety and hassle-free drive. Large moving vehicles such as trucks or buses may affect direct communication of vehicles as a nonline of sight (NLOS) may occur. NLOS restricts direct communication of vehicles. Even the corresponding vehicle is within the communication range of the communicating vehicle. To overcome the NLOS problem and verify the location of the vehicles, this chapter has presented a routing mechanism, namely Directional Location Verification and Routing (DLVR) in Vehicular Ad-hoc Network. DLVR model prevents the false location information of the nodes by reduced packet drop and increased packet delivery ratio. Before transmitting data packets DLVR verifies data packets through reliability check. Through simulation work, it has shown the proposed DLVR model reduced packet drop and increased packet delivery ratio which increases the network performance.

Comparative Assessment and Performance Analysis of Numerous Mobile Ad-Hoc Network Routing Protocols

2019 ◽  
Vol 16 (9) ◽  
pp. 3906-3911
Author(s):  
Karan Singh ◽  
Rajeev Gupta
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Mobile Ad Hoc ◽  
And Performance

Recent progression in the field of information and communication cause increase of packet count over the World Wide Web network. These communicated packets should deliver on time from origin node to destination node using a reliable and shortest route. In this way routing plays an important part in dispatching the packets to destination form the source. This routing becomes more crucial when packets delivery is done in independent mobile nodes which dynamically form a temporary network. This network named as Mobile Ad-Hoc Network and therefore it is said to be particular reason-specific, self-ruling and dynamic. In this paper we analyzed 3 protocols and for a quality of service (i.e., Packet Delivery Ratio) and achieved comparative study of various protocols of routing with respect to Operation of protocols, Route maintenance, Routing table, Route, Route selection, Routing structure, Routing Approaches, Protocol types, Merits and Demerits.

scholarly journals Novel Preventive Detection Technique for Black-Hole Malware Attack in Wireless Mobile Ad-Hoc Network (WMANET)

2019 ◽  
Vol 8 (4) ◽  
pp. 9203-9210
Keyword(s):  
Black Hole ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Destination Node ◽  
Malicious Node ◽  
Data Packets ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Wireless Mobile

A wireless mobile ad-hoc network (WMANET) is endless self-organizing, infrastructure-less collection of movable devices which are connected by using a wireless communication system. In other word’s WMANET is an autonomous, decentralized, dynamic topology, provisional network system having wireless movable devices (nodes) moving randomly without an infrastructure of the network. Furthermore, the nodes communicate with every supplementary node, through forwarding data-packets toward other nodes in the WMANET. The node finds a path to the destination node by applying routing techniques. Due to the dynamic topology of movable nodes wireless mobile network is more vulnerable to security and unprotected to attacks by the malicious node. One of the attacks is Blackhole malware Attack, a malicious-node wrongly advertises shortest to the destination node among an intention of disrupting the network communication. Because the data packets did not arrive at the destination node due to this attack data is lost. In the literature, researchers have been proposed various preventive detection techniques. These techniques used to detect and prevent the black-hole malware attacks. Furthermore, in this paper Novel Detection and Prevention mechanism (INCMAODV) has been simulated the black-hole attack in WMANET scenario. The proposed technique tried to find quality of service (QoS) parameters for instance throughput (Th), packet delivery ratio (PDR) and delay of the network and compared with the state of the art.

MCFS Enhanced Route Selection Approach Using Multipath Carry Forwarding and Searching in VANET

2018 ◽  
Vol 2 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Hiteshkumar Chandrakant Patel ◽  
Gopal Ramchandra Kulkarni
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
High Mobility ◽  
Geographic Location ◽  
Destination Node ◽  
The Road ◽  
Greedy Forwarding ◽  
Road Congestion ◽  
Geographic Forwarding ◽  
Search Approach

This article describes how a vehicular ad-hoc network (VANET) is an infrastructureless network in which vehicles are connected without wires. Routing in VANET is challenging nowadays due to increased number of a vehicle, the high mobility of nodes, dynamically changing topology and highly partitioned network, so the challenges on the roads are also increased like the road congestion, the safety problem, speed, etc. Various protocol designs have been suggested by various authors to search and forward packets to the destination node. These various algorithms use different schemes like greedy forwarding, perimeter forwarding, carry and store approach, geographic location base approach, etc. The proposed system uses both beacon packets and a geographic closure node approach to forward packets. The beacon-based strategy includes a carry and search approach to search for a routing path. Geographic forwarding will start when carry and search forwarding fails to transmit packets. Route requests will perform multicasting while a route reply follows a unicast strategy. The new proposed system achieves good PDR and an end to end delay.

Sign in / Sign up

Export Citation Format

Share Document