Analysis of greedy perimeter stateless routing protocol network simulation using bird flocking algorithm
Main Article Content
Abstract
The purpose of this study is to simulate the GPSR protocol network on NS3 using the bird flocking algorithm and to analyze the comparison of performance measurements obtained from the simulation results. The Greedy Perimeter Stateless Routing network was simulated using NS-3 in this simulation. The simulation area is created in length, width. The distance between nodes is 50 meters and is simulated in an area of 1000m x 300m for 30 seconds and 802.11 MAC protocol is used. This simulation was successfully implemented in finding the location of the nearest node using the GPSR protocol with the PSO / BFA algorithm. The number of nodes used in the simulation is 150 nodes and 2 nodes, so it can be concluded that the performance of Quality of Service (QoS) is greatly affected by the number of nodes and the algorithm used in the simulation.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work