Essays about: "Least hops path"
Found 2 essays containing the words Least hops path.
-
1. Implementation and performance analysis of star-based mesh network
University essay from JTH, Data- och elektroteknik; Tekniska HögskolanAbstract : The goal of the thesis is to design the star-based mesh topology by introducing multiple pan-coordinators (hub/switches) under a multipath-fading environment and to improve the data transaction rate of a network which usually gets worst when there is a single pan-coordinator for synchronization of devices in conventional mesh topology; also reduce the hop-count as least as possible. Most of the work has been done on NS-2 network simulator; therefore the research model which has been used here is a simulation model. READ MORE
-
2. An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks
University essay from Institutionen för datavetenskapAbstract : This thesis examines some of the best known algorithms for solving the shortest point-to-point path problem, and evaluates their performance on real metropolitan area networks. The focus has mainly been on Dijkstra‟s algorithm and different variations of it, and the algorithms have been implemented in C# for the practical tests. READ MORE