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 ...
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problem...
Jin Wang, Brian J. d'Auriol, Xiaoling Wu, Young-Ko...
As the scale of electronic devices shrinks, “electronic textiles” (e-textiles) will make possible a wide variety of novel applications which are currently unfeasible. Due to t...
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...