期刊名称:International Journal of Computer Science and Network Security
印刷版ISSN:1738-7906
出版年度:2010
卷号:10
期号:9
页码:111-118
出版社:International Journal of Computer Science and Network Security
摘要:With the increase of portable devices as well as progress in wireless communications, ad hoc networking is gaining importance with the increasing number of widespread applications. Ad hoc networking can be applied in places where there is little or no communication infrastructure or existing infrastructure is expensive or inconvenient to use. In MANETs, nodes do not have a priori knowledge of topology of network around them, they have to discover it. These networks are rapidly deployable community networks, which are the largely hobbyist-led development of interlinked computer networks. MANETs use limited network management and administration, in order to establish communications, dynamically. These algorithms need to keep routing table reasonably small, choose best route for given destination (fastest, most reliable, highest throughput, or cheapest route) and keep table up-to-date when nodes move or join. In this paper, we propose an efficient routing technique with minimum power consumption for Ad hoc networks. A hybrid technique using the Analytical Hierarchy Process (AHP) and Genetic Algorithm (GA) has been adopted by use of key communication parameters to select the optimal nodes / routes. Here in this work, GA and AHP together have been used for the optimal selection of the routes as well as the node selection parameters. Simulations and testing of the developed algorithms on a considered 802.11b MANET has shown an average throughput gain of 45 to 55% (depending upon power consumption) over traditional minimum hop route selection techniques.
关键词:Ad hMobile adhoc Networks; Node Density (ND); Power Consumption (PC); Node Status (NS); Traffic Congestion (TC); Throughput; Genetic Algorithms; Analytical Hierarchy Process