—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
Abstract— Heterogeneous multicast is an efficient communication scheme especially for multimedia applications running over multihop networks when multicast receivers in the same...
Abstract—In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the...
Sung-Ju Lee, William Su, Julian Hsu, Mario Gerla, ...
— 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