– In this paper, we present a novel routing protocol for wireless ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR...
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...
—Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalabi...
Jingwen Jin, Jin Liang, Jingyi Jin, Klara Nahrsted...
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...