Connectivity and Topology Organization in Ad-Hoc Networks for Service Delivery

This chapter introduces the concept of connectivity and robustness of a mobile ad-hoc network as a function of the node density and coverage radius. It presents an elementary analytical model based on the spatial Poisson process to formulate the connectivity problem as the computation of the existence of wireless links forming paths obtained by Dijkstra’s shortest path algorithm. It also introduces a simple clustering strategy that starts forming groups based on one-hop distance and then adjust the coverage radius of the nodes in order to decrease the interference, processing load and isolated nodes in the network. It includes results of scenarios with different robustness of origin-destination pairs and number of clusters and shows the benefits of using the introduced policies.