Optimal Data Collection from a Network using Probability Collectives (Swarm Based)
| dc.contributor.author | Abdulkadir Ahmed, Olalekan Ogunbiyi, Tahir Aduragba | |
| dc.date.accessioned | 2024-11-05T23:45:50Z | |
| dc.date.available | 2024-11-05T23:45:50Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | This paper contains the implementation of the BeeAdhoc algorithm for data routing in mobile Ad-Hoc Network (MANet). The algorithm was inspired by the foraging behaviour of honey bees and its implementation mimics this behaviour. The integration was done on Network Simulator version 2 (NS-2.34) where different scenarios were considered in comparison with other existing state-of-the-art routing algorithms that have been implemented in the chosen simulator. The comparison was carried out between DSR, DSDV, AOMDV which are all multipath routing algorithms as the BeeAdhoc; this gave a better insight to the different behaviour of the algorithms on a common application environment. Throughput, end-to-end delay and routing overhead constitute the indices used for the performance evaluation. Experimental results showed the best performance of BeeAdhoc over, DSDV and AOMDV algorithms. | |
| dc.identifier.issn | 2320-9356 | |
| dc.identifier.uri | https://kwasuspace.kwasu.edu.ng/handle/123456789/2618 | |
| dc.language.iso | en | |
| dc.publisher | International Journal of Research in Engineering and Science | |
| dc.relation.ispartofseries | 3; 4 | |
| dc.title | Optimal Data Collection from a Network using Probability Collectives (Swarm Based) | |
| dc.type | Article |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Optimal Data Collection from a Network using Probability Collectives (Swarm Based)
- Size:
- 296.36 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: