Battery Power Aware Connected Dominating Set Based Routing in Wireless Multi-Hop Ad Hoc Networks

Resumen

Routing in multi-hop ad hoc networks has to overcome many issues and challenges. The nodes in such networks are mobile, battery operated and has limited operating time. Such a temporary network with short lifetime will be helpful in distinct situations like military/police operations, disaster recovery, emergency rescue operations, peer group in a remote area, etc. Many individuals use their hand-held smart mobile device for doing all of their tasks including streaming multimedia applications. The surge in mobile applications has necessitated the emphasis on energy efficiency and quality of service (QoS). Thus, energy conserving and QoS aware routing protocol is a key communication component for present day multi-hop wireless ad hoc networks. The Connected Dominating Set (CDS) is an interesting topic in the mathematical subject, graph theory. One of the popular applications of CDS is to provide a virtual backbone for routing in wireless networks. In this paper, an energy efficient distributed routing algorithm for computing an optimal CDS in wireless multi-hop ad-hoc networks is proposed. Appropriate steps for updating the CDS representing the ad hoc network, when dynamic topological changes occur are also included. The performance evaluation of the proposed routing algorithm is done by comparing it with the Wu-Li algorithm (WLA) and CDS as well as stochastic diffusion search based routing algorithm(CDS-SDS QoS), using the network simulator ns2.