Exploiting use of a new performance metric for construction of robust and efficient wireless backbone network

Abstract

In order to improve transmission throughput of a multi-hop wireless network, many efforts have been made in recent years to reduce traffic and hence transmission collisions by constructing backbone networks with minimum size. However, many other important issues need to be considered. Instead of simply minimizing the number of backbone nodes or supporting some isolated network features, in this work, we exploit the use of algebraic connectivity to control backbone network topology design for concurrent improvement of backbone network robustness, capacity, stability and routing efficiency. In order to capture other network features, we also provide a general cost function and introduce a new metric, connectivity efficiency, to tradeoff algebraic connectivity and cost for backbone construction. We have designed both centralized and distributed algorithms to build more robust and efficient backbone infrastructure to better support the application needs. Our performance studies demonstrate that, compared to peer work, our algorithms could achieve much higher throughput and delivery ratio, and much lower end-to-end delay and routing distances under all test scenarios.

A localized backbone renovating algorithm for wireless ad hoc and sensor networks

“…[25] selects the nodes with wider communication range, more energy, etc., then uses a steiner tree to connect the dominating set. [26] constructs the backbone via algebraic connectivity and introduce a new metric, connectivity efficiency, as a benchmark when constructing the backbone. In [9], by setting a timer at each node, the nodes with higher node degree have higher probability to be included in the backbone, which finally produces a spanning tree.…”