We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...