Skip to main content

Advertisement

SpringerLink
Log in

Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Ubiquitous and Pervasive Computing (UPC) applications often have Quality of Service (QoS) requirements. These become constraints for the UPC network infrastructure. In this paper, we refer to Mobile ad Hoc Networks, one of the most important technologies supporting UPC, and investigate on Genetic Algorithms (GAs) for QoS routing. GAs are part of the soft computing paradigm and can solve the NP search of QoS routes with multiple constraints. We elaborate on tree-based GAs, which represent the set of paths from source to destination as a tree and encode them through the crossed junctions. While their most well-known applications use m-ary encoding representing single paths in the chromosomes, in this paper we discuss a binary encoding with the objective of improving the convergence speed. The binary encoding represents classes of paths in the chromosomes and allows local search on classes of paths. These classes are both collectively exhaustive and mutually exclusive. Simulation results compare convergence speed and scalability of GA applications with binary and m-ary encoding in networks with an increasing number of nodes and links per node. As the per-class processing is reason of additional computational cost, an hybrid GA application that uses both binary and m-ary encoding is introduced.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Abdullah J, Parish D (2007) Impact of QoS routing metrics for MANETs in the pervasive computing environment. International conferences on wireless and optical communications networks, Singapore

  • Abdulla J, Parish D (2007) Effect of mobility on the performance of GA-based QoS routing in mobile ad hoc networks. International conference on intelligent and advanced systems, Kuala Lumpur

  • Ahn CW, Ramakrishna RS (2002) Genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6:566–579

    Article  Google Scholar 

  • Baker JE (1958) Adaptive selection methods for genetic algorithm. International conference on genetic algorithm and their applications, Pittsburgh

  • Barolli L, Koyama A, Suganuma T, Shiratori N (2003) A genetic algorithm based QoS routing method for multimedia communications over high-speed networks. Inf Process Soc Japan (IPSJ) 44(3):544–552

    Google Scholar 

  • Barolli L, Koyama A, Shiratori N (2003) A QoS routing method for ad-hoc networks based on genetic algorithm. 14th International workshop on database and expert systems applications (DEXA’03), Czech Republic

  • Barolli A, Spaho E, Xhafa F, Barolli L, Takizawa M (2011) Application of GA and multi-objective optimization for QoS routing in ad-hoc networks. 14th international conference on network-based information systems (NBiS), Tirana

  • Barolli A, Takizawa M, Xhafa F, Barolli L (2010) Application of genetic algorithms for QoS routing in mobile ad-hoc networks: a survey. International conference on broadband, wireless computing, communication and applications, Fukuoka

  • Golberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co., Inc, Boston

    Google Scholar 

  • Hanzo L, Tafazolly R (2009) A survey of QoS routing solutions for mobile ad hoc networks. IEEE Commun Surv 9(2):50–69

    Article  Google Scholar 

  • Karthikeyan P, Baskar S, Alphones A (2013) Improved genetic algorithm using different genetic operator combinations (GOCs) for multicast routing in ad hoc networks. Soft Comput J 17(9):1563–1572

    Google Scholar 

  • Kuppusamy P, Thirunavukkarasu K, Kalaavathi B (2011) A study and comparison of OLSR, AODV and TORA routing protocols in ad hoc networks. International conference on electronics computer technology (ICECT), Kanyakumari

  • Liu C, Chiang T, Huang Y (2006) A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm. International conference on advanced information networking and applications, Vienna

  • Maniscalco V, Greco Polito S, Intagliata A (2012) Improvements to Tree-based GA applications for QoS routing. International conference on systems and networks communications, Lisbon

  • Maniscalco V, Greco Polito S, Intagliata A (2013) Tree-based genetic algorithm with binary encoding for QoS routing. International conference on innovative mobile and internet services in ubiquitous computing, Taichung

  • Menchaca-Mendez R, Garcia-Luna-Aceves JJ (2010) Robust and scalable integrated routing in MANETs using context-aware ordered meshes. INFOCOM, San Diego

    Google Scholar 

  • Palmieri F, Castiglione A (2012) Condensation-based routing in mobile ad-hoc networks. Mobile Inf Syst 8(3):199–211

    Google Scholar 

  • Sateesh Kumar P, Ramachamndram S (2008) Scalability of network size on genetic zone routing protocol for MANETs. International conference on advanced computer theory and engineering, Phuket

  • Shimamoto N, Hiramatsu A, Yamasaki K (1993) A dynamic routing control based on a genetic algorithm. International conference on neural networks, San Francisco

  • Sun J-Z (2001) Mobile ad hoc networking: an essential technology for pervasive computing. International conferences on Info-tech and Info-net, Beijing

  • Vavouras M, Papadimitriou K, Papaefstathiou I (2009) High-speed FPGA-based implementations of a genetic algorithm. International symposium on systems, architectures, modeling and simulation, Samos

  • Vijayalakshmi K, Radhakrishnan S (2010) A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks. Soft Comput J 14(11):1227–1239

    Article  Google Scholar 

  • Yang S, Cheng H, Wang F (2010) A genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks. IEEE Trans Syst Man Cynern Part C Appl Rev 40(1):52–63

    Article  Google Scholar 

  • Yussof S, See OH (2010) A robust GA-based QoS routing algorithm for solving multi-constrained path problem. J Comput 5(9):1322–1334

    Article  Google Scholar 

  • Zadeh LA (1994) Soft computing and fuzzy logic. IEEE Softw 11(6):48–56

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Libera Universitá degli Studi di Enna “Kore”, Enna, Italy

    Vincenzo Maniscalco, Silvana Greco Polito & Antonio Intagliata

Authors
  1. Vincenzo Maniscalco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvana Greco Polito
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Intagliata
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincenzo Maniscalco.

Additional information

Communicated by A. Castiglione.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maniscalco, V., Greco Polito, S. & Intagliata, A. Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing. Soft Comput 18, 1705–1714 (2014). https://doi.org/10.1007/s00500-014-1271-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1271-3

Keywords

Search

Navigation