Authors: Anil Kumar Yadav; Rama Shankar Yadav; Raghuraj Singh; Ashutosh Kumar Singh
Addresses: Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Pin-211004, Allahabad, India ' Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Pin-211004, Allahabad, India ' Department of Computer Science and Engineering, Harcourt Butler Technological Institute, Pin-208002, Kanpur, India ' Department of Electronics and Communication Engineering, Indian Institute of Information Technology, Pin-211012, Allahabad, India
Abstract: In wireless ad hoc networks, there is no predefined infrastructure and nodes can communicate with each other via relaying the messages through intermediate nodes. The ad hoc network has found a variety of military and civil applications such as battlefield communication, disaster recoveries, conferences, environmental detection, security, pollution sensing and traffic monitoring. Connected dominating sets (CDS) can be regarded as a virtual backbone for wireless ad hoc network and a smaller CDS is designed to minimise the interference problem, control messages and maintenance cost. The objective of designing a CDS heuristic is to reduce the search space to save scarce resources such as bandwidth energy. We discuss few centralised algorithms that have constant performance ratios for its size. We also discuss few algorithms of distributed and localised type. Further, we compare various CDS algorithms in terms of performance ratio, time complexity, message complexity with their merits and demerits and are illustrated in Table 2.
Keywords: graph theory; wireless ad hoc networks; QoS; quality of service; topology; energy management; connected dominating sets; CDS; wireless networks.
International Journal of Engineering Systems Modelling and Simulation, 2015 Vol.7 No.1, pp.22 - 34
Received: 02 May 2012
Accepted: 03 Jan 2013
Published online: 03 Dec 2014 *