A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Reducing Throughput-delay Analysis of Conflict–free Scheduling in Multihop Adhoc Networks
2011
International Journal of Communication Networks and Security
An Adhoc networks is a self organized and distributed entity, consisting of n mobile stations (MSs) without the coordination of any centralized access point. Initialization is one of the fundamental tasks to set up an adhoc network, which involves assigning of each of the n MSs a distinct ID number from 1 to n, distributedly. In randomized initialization protocols are developed for single-hop adhoc networks under different conditions. This study investigates the performance of an analytical
doi:10.47893/ijcns.2011.1006
fatcat:34w5d5h4trcrheaxposq6vp2yu