We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
Most of the proposed algorithms in ad hoc networks assume homogeneous nodes with similar transmission range and capabilities. However, in heterogeneous ad hoc network, it is not ne...
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...
Abstract—In this work, we discuss how to support Video-onDemand service in multi-hop WiMax mesh networks. We are interested in the scenario that end users connect to the video se...
Routers equipped with multiple 802.11 radios can alleviate capacity problems in wireless mesh networks. However, a practical, complete system architecture that can realize the bene...
Krishna N. Ramachandran, Irfan Sheriff, Elizabeth ...