Power Efficient Connected Ad-hoc Networks
J.F. Chicharo, Paul Boustead · 2005
Graph (DRNG) and K-Neigh graphs are computed by using the location or the distance information of the network nodes. Inaccurate distance or information can lead to disconnected topology graphs. Furthermore, a distance based topology graph may not necessarily be connected due to wireless signal attenuation and propagation characteristics. In a realistic scenario, a small link distance may correspond to a large transmission power as the signal may need to transverse through obstacles. Hence it is imperative to include the environment characteristics when generating power efficient connected topology graphs. In this paper we identify the topology construction procedures that may lead to disconnected network topologies. We propose a new that can work in conjunction with the neighbour discovery protocol to provide a better connected and power efficient network topology. indicate that the proposed algorithm provides a significant improvement in the connectivity of power base DRNG graphs.