Many methods for end-to-end bandwidth estimation on wired networks assume that link capacities are constant and that all cross-traffic interaction occurs through queuing delays at...
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong