Analysis of topology control algorithms in multi-hop cellular networks

In multi-hop wireless networks, the way the network topology is defined has a strong impact on routing. This paper deals with topology control in cellular networks with relays. Several topology control algorithms taken from ad-hoc networks are adapted to cellular networks. Most of the algorithms considered here are based on proximity graphs. Performance analysis is carried out in a realistic scenario built from geographical data of a live network. Assessment is based on several performance criteria, namely connectivity, energy efficiency, sparseness, adaptability, throughput and interference. Results show that the properties of the graph obtained by topology control, which will be used later for routing, greatly depend on the specific algorithm.