Infoscience

Student project

Base Stations in Mobile Ad-Hoc Networks

Multi-hop ad-hoc networks consist of nodes which cooperate by forwarding packets for each other to allow communication beyond the power range of each node. In pure ad-hoc networks, no additional infrastructure is required to allow the nodes to communicate. Multi-hop hybrid networks are a combination of ad-hoc and cellular networks. As in ad-hoc networks, the nodes forward packets on behalf of other nodes. However, a few base stations are introduced. This enables long-range communication, increases connectivity and allows centralized services. In our work, we investigate the problem of placing base stations in multi-hop hybrid networks. Since nodes extend the service area by themselves, conventional cellular approaches are not suitable for such networks. We propose the Cluster Covering Algorithm, an algorithm which takes into account the percolation phenomenon, and compare it with several greedy algorithms. We measure the connectivity through different simulations on real population distribution data of Zurich (CH), the Surselva Valley (CH) and Finland. The simulation results show that the Cluster Covering Algorithm outperforms the greedy algorithms.

Related material