Second International Conference on Systems and Networks Communications (ICSNC 2007) Parameterized Hierarchical Layer Topology Construction for Wireless Networks Cap Esterel, France August 25-August 31 ISBN: 0-7695-2938-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSNC.2007.59
Recently, a promising network topology for wireless networks, the Hierarchical Layer Graph, has been introduced. This topology consists of arbitrary many layers of nodes with low-interference short-distance links in the lower layers and long-distance links in the higher layers which allow for paths with a small number of hops. The construction algorithm which was given for this topology is based on node IDs. In this paper, we present a novel distributed construction algorithm that computes each node?s rank in the hierarchy based on arbitrary metrics. A mathematical analysis shows the benefits which our algorithm entails.
Citation:
Johannes Lessmann, Arvind Krishnamurthy, "Parameterized Hierarchical Layer Topology Construction for Wireless Networks," icsnc, pp.15, Second International Conference on Systems and Networks Communications (ICSNC 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||