An evolutionary algorithmic approach to construct connected dominating set in MANETs
An evolutionary algorithmic approach to construct connected dominating set in MANETs
- Author(s): D. Manohari and G.S. Anandha Mala
- DOI: 10.1049/ic.2012.0136
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
International Conference on Software Engineering and Mobile Application Modelling and Development (ICSEMA 2012) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): D. Manohari and G.S. Anandha Mala Source: International Conference on Software Engineering and Mobile Application Modelling and Development (ICSEMA 2012), 2012 page ()
- Conference: International Conference on Software Engineering and Mobile Application Modelling and Development (ICSEMA 2012)
- DOI: 10.1049/ic.2012.0136
- ISBN: 978-1-84919-736-6
- Location: Chennai, India
- Conference date: 19-21 Dec. 2012
- Format: PDF
A virtual backbone of a MANETs is typically the Connected Dominating Set (CDS) of the graph representation of the network. The CDS in the MANETs helps to increase the efficiency of the network and extends the life span of the network. While existing CDS protocols are successful in constructing CDS of small size, they either require localized information beyond immediate neighbors, lack the mechanism to properly handle nodal mobility, or involve lengthy recovery procedure when CDS becomes corrupted. In general, the smaller the CDS is, the less communication and storage overhead the protocols making use of CDS will incur. Hence, it is desired that the size of the CDS for mobile ad hoc networks to be as small as possible. On the other hand, it is known that the problem of finding the Minimum Connected Dominating Set (MCDS) is NP-hard. As the construction of MCDS is an NP-hard problem, this proposed work incorporates an evolutionary algorithmic approach using Genetic algorithm to minimize the number of nodes in the CDS. (6 pages)
Inspec keywords: telecommunication network reliability; graph theory; protocols; mobility management (mobile radio); mobile ad hoc networks; genetic algorithms; minimisation
Subjects: Combinatorial mathematics; Optimisation techniques; Protocols; Mobile radio systems; Reliability
Related content
content/conferences/10.1049/ic.2012.0136
pub_keyword,iet_inspecKeyword,pub_concept
6
6