no code implementations • 11 Jul 2013 • Sharad Sharma, Shakti Kumar, Brahmjit Singh
Based upon this distance (cost) between two adjacent nodes we evaluate minimal shortest path that updates routing tables.
no code implementations • 11 Jul 2013 • Shakti Kumar, Brahmjit Singh, Sharad Sharma
Dynamic behaviour of a WMN imposes stringent constraints on the routing policy of the network.