Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
4Activity
0 of .
Results for:
No results containing your search query
P. 1
Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

Ratings: (0)|Views: 157 |Likes:
Published by ijcsis
The networks Mobility (NEMO) Protocol is a way of managing the mobility of an entire network, and mobile internet protocol is the basic solution for networks Mobility. A hierarchical route optimization system for mobile network is proposed to solve management of hierarchical route optimization problems. In present paper we study hierarchical Route Optimization scheme using memetic algorithm(HROSMA) The concept of optimization- finding the extreme of a function that maps candidate ‘solution’ to scalar values of ‘quality’ – is an extremely general and useful idea. For solving this problem, we use a few salient adaptations, and we also extend HROSMA perform routing between the mobile networks.
The networks Mobility (NEMO) Protocol is a way of managing the mobility of an entire network, and mobile internet protocol is the basic solution for networks Mobility. A hierarchical route optimization system for mobile network is proposed to solve management of hierarchical route optimization problems. In present paper we study hierarchical Route Optimization scheme using memetic algorithm(HROSMA) The concept of optimization- finding the extreme of a function that maps candidate ‘solution’ to scalar values of ‘quality’ – is an extremely general and useful idea. For solving this problem, we use a few salient adaptations, and we also extend HROSMA perform routing between the mobile networks.

More info:

Published by: ijcsis on Mar 08, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/19/2011

pdf

text

original

 
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011
Hierarchical Route Optimization by Using memeticalogirithm in a Mobile Networks
K .K. GautamDepartment of Computer Science & EngineeringK.P. Engineering College, Agra-283202- IndiaE-mail-:drkkgautam@gmail.com
 
Dileep kumar singhDepartment of Computer Science & EngineeringDehradun Institue of Technology, Dehraun-India,E-mail-:paras_dileep19@rediffmail.com
 
Abstract-
The networks Mobility (NEMO) Protocol is a way of managing the mobility of an entire network, and mobile internetprotocol is the basic solution for networks Mobility. Ahierarchical route optimization system for mobile network isproposed to solve management of hierarchical route optimizationproblems. In present paper we study hierarchical RouteOptimization scheme using memetic algorithm(HROSMA) Theconcept of optimization- finding the extreme of a function thatmaps candidate ‘solution’ to scalar values of ‘quality’ – is anextremely general and useful idea. For solving this problem, weuse a few salient adaptations, and We also extend HROSMAperform routing between the mobile networks.
 
Keywords
-
Route Optimization, Memetic algorithm personal areanetworks, NEMO, IP.
INTRODUCTIONIn the trend of ubiquitous computing, many electricappliances, more electronic devices capable of integrating withwireless communications are being added. The mobile internetprotocol (IP) working group within the internet engineeringtask force (IETF) has proposed the mobile IP protocol [1], [2]to support host mobility in IP based networks. The mobile IPaims at maintaining internet connectivity while a host ismoving. The networks mobility (NEMO) protocol is a way of managing the mobility of an entire network, viewed as a singleunit, which changes its points to attachments in the internet[3]. Such an internet will include one or more mobile routers(MRs) that connect it to the global internet. A mobile network can connect it to the global internet.A mobile network can have a hierarchical structure;in this paper we propose a hierarchical Route Optimizationscheme using memetic algorithm (HROSMA) for mobilenetwork.In addition to routing inefficiency, other criteria areimportant in designing a route optimization scheme for mobilenetworks. The concepts of network mobility were introducedto reduce the signaling overheads of a number of hosts movingas group.The NEMO basic support protocol uses abidirectional tunnel between the home agent (HA) and themobile networks needs (MNNS) from sending all therelocation registration simultaneously when the MR changes itspoint of attachment. The characteristic is called mobilitytransparency, which is a very desirable feature for the routeoptimization scheme.Mobile networks can here very complex form of hierarchy e.g. Mobile networks in a mobile network visitingmobile nodes(VMNS) in mobile networks and so on. Thissituation is repaired as nested mobile network.NEMO ARCHITECTUREWhen a mobile network moves from one place toanother, it changes its points of attachment to the internet,which also makes changes to its reach ability and to theInternet topology. NEMO (Network Mobility) working grouphas come up with NEMO support solution. NEMO support isa mechanism that maintains the continuity of session betweenmobile networks. Node (MNN) and their correspondent nodes(CN) upon a mobile Router’s change of point attachment.NEMO support is divided into two parts:1. NEMO Basic Support2. NEMO Extended SupportNEMO Basic Support is a solution for perseveringsession continuity by means of bidirectional tunnelingbetween Home Agent (HA) and a mobile network. AndNEMO extended Support is a solution for providing thenecessary optimization between arbitrary Mobile NetworksNodes and correspondent Nodes, including routingoptimization [5]. There has not been much research done withthe NEMO extended Support Protocol.A mobile Network is composed of one or more IPsubnets viewed as a single unit. The Mobile Router is thegateway for the communication between the mobile network and the internet.An Access Router (AN) is a router at the edge of anaccess network which provides wireless link to mobilenodes.A link is simply a physical medium via which data istransformed between multiple nodes. A Home Link is thelinkattached to the interface at the Home Agent on which theHome Prefix is configured. Any Link other than Home link isforeign link.NEMO link is the link within the mobile network.A Mobile Router has two interfaces:-Ingress Interface: The interface of the MR attached toa link inside the mobile network.Egress interface: The interface of the MR attached tothe home link if the MR is at home and to foreign link if it is aforeign network.
221 http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011
NEMO Basic Support protocol is an extension to theMobile Ip version 6 (MIPv6) [2]. MIPv6 is a version of Internet Protocol (IP) that supports mobile nodes.MOBILE ROUTERSA Mobile Router is a router that can change its pointof attachment to the network by moving from one link toanother. All the Internet traffic to and from the mobilenetwork passes through the Mobile Router. Therefore, MobileRouter has to perform certain operations to be able to supportnetwork mobility.HROSMAFor the hierarchical Route Optimization schemeusing tree information option (HROSTIO) we use an assistantdata structure and call it MNN-CN(mobile network node-corresponding node) list .It is stored at MRs and records therelationship of the MNN-CBASE STATIONIn more environment, a cell that Is geographicalregion unit is geographical region unite is covered by the radiofrequency of a base station. Each call is controlled by a BSwhich has a fixed connection to a BSC (or RNC). In mobilenetwork infrastructure element such as base station controller (BSC), wired links and mobile switch centre (MSC) areemployed to provide and maintain essential service; hence theoperation interruption of a network component affects overallor partial network services.A radiation antenna is classified as omni directionaland directional with an ommnidirectional antenna, a singlefrequency spreads out in all directions of 
360
coverage. A cellis directional antenna with each different set channel.SYSTEM STATE OF BASE STATIONThe BS system, including antenna parts, cannotprovide partial or whole service function for coverage cellwhen single or more fatal failures occur in the BS system. Inthis paper, we consider that system failures are caused by keydistribution method. For example by interrupt sequencemishandling, overall system operation falls into failure statebecause of unanticipated handled interruption to a componentof the system.PERSONAL AREA NETWORK 
 
A mobile network can have a hierarchical structuree.g. a mobile network within another mobile network. Thissituation is referred to as nested mobile network. A personalarea network (PAN) may travel a vehicle, which also containsa mobile network of larger scale fig 1 illustrate a simple larger Scale. MR-1, MR-2 are attaché their own home link. Awireless personal area network moves as a single unit with oneor more mobile routers that connect it to global internet.MULTIOBJECTIVE OPTIMIZATION (MOO)An unaccompanied multi objective optimizationproblem is a example of route optimization for mobilenetwork. Because mobile moves as a single unit with one or more mobile routers that connect it to the global internet. Wedefined this problem as“Minimize” z = f(x)Where
f(x) = (f1(x), f2(x)…..fn(x))
Subject to x
Є
xZ2 minimize PF {0}Fig -3 an example of multiobjective optimization problemwith mobile search space (MSS) x, as vector fitness function f that maps solution in x to objective vector made up of twocomponent (mobile routers) ‘costs’
1
z
and the
2
z
 minimized.Here if we definea=mobile router -1b=mobile router-2..And1=access router -12=access router-2..1Minimize
1
z
 f : x zFig-3This fig is also defined a routing inefficiency for the trafficmanagement and disigend a imported rout optimizationschemes for traffic management of mobile networks. Theconcept of traffic management for the network mobility wasintroduce the signaling over heads of a number of hostsmoving as a group as MRs.a
 
bcde
222 http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011
MEMETICALGORITHM APPROACH:-The impressive record of Memetic Algorithmsproducing high quality solution in combinalarial optimizationand in real -world application (e.g. see page 220[5]) is sometimes cited as a testament of their m herent effective – ness of robustness as black box search. However, since the advent of the no free lunch theorems [6,7,8] 109,19, 2, we know thatMA, s like any other search algorithm , are only reality goodto the extent to which they can be “aligned” to the specificfeatures of a route optimization problems in mobile networks. None the less, MAs, like there fore bears evolutionaryalgorithms (EAs), do have unassailable advantage over other more traditional search techniques: that is their flexibility.This flexibility has important advantage, as has to solvemobile route optimization problems: one is to choose sometraditional techniques. And them simplify or otherwise other the problems.As in any other optimization scenario as routeoptimization problems, we should know that the out set whatis a desirable outcomes; the Memetic Algorithm frame work proposed above required. The operators and procedures beselected based on their current success abs.When a mobile network moves from one place toanother it change its point attachment to the internet, whichalso makes changes to its reach ability and to the internettopology.PERFORMANCEMEASURESIN MAs FOR MOOIf one is developing or using an algorithm for optimization it almost goes without saying that there should besome way to measures its performance. In MOO the situationis the same regarding the time aspect of performanceassessment but the quality aspect is clearly more difficult. theextensive array of existing met heuristic , issues and methodsreviewed in the section above gives a richer basis from whichto design new MAs than do the existing MAs for MOOthemselves. In a typical cellular network, the area of coverageis after geographically divided into hexagonal cells. The call isthe basic unit of a cellular system.In recent years, Muscat and krasnogor have provided a guidingmanifesto for putting the “Memetic” back in Memeticalgorithm [9, 10] advocating.
Candidate MA framework for MOO:- 
1.
 
MN: = initialize(MN)2.
 
A: = Nondom (MN)
Algorithm Candidate MA framework for MOO
1: MN: = Initialize (MN)2: MN: = Nondom (MN)3:
while
stop criterion not satisfied
do
4:
while
stagnation _criterion notsatisfied
do
5: SAMN: =SelectFrom(PUA,sel_sc hed(succ(SEL)))6: SAMN: =Vary (SAMN,var_sched (succ(VAR)))7: SAMN”:=LocalSearch(SAMN”,I s_sched(succ(LS)))8: MN: =Replace (PUC”,rep_sched(s ucc(RED)))9: A: =Reduce (Nandom(AUSAMN) ,red_sched(succ(RED)))10:
end while
11: MN: =Randomlmmigrants(P,imm_sched(succ(IMM)))13:
return
(A)Here we represent a Algorithm, we put forward asimple framework that could serve as a guide for making amore Memetic MA for MOO. In line1, MN (MobileNetworks) of solution is initialized. As usual this proceduremay be simply random or it may employ some heuristics(s).Line 2 sets the archive A to the no dominated solution fromMN. Thereafter, the main loop of the MA begins line 4 sets upan inner loop in which a stagnation criterion is checked. Thisshould be based on some memeplex which monitors progressin diversity, proximity, and /or some other criteria. Line5-9gives a very high level description of the update of the MNand archive. Five different ‘schedulers’ are employed,basically corresponding to mating selection, reproduction,lifetime learning, survival selection and update of the archive,respectively. Each scheduler chooses from a memeplex of operators, based on estimates of the current success of thoseoperators. E.g. in line 5, Select from is the operation of matingselection, the domain of which is the union of the MN andarchive, and co-domain is a Small Area Mobile Networks(SAMN), the selection is controlled by the scheduler,sel_sched, which use a success measures, succ, to choose oneoperators for the set SEL, of currently available operators for selection. Notice that MN and A are potentially of variablesize, in this scheme. In line 11, the MN is updated using someimmigration policy to rerelease it from stagnation, the archivesof no dominated solution are returned in line 13.The frame work proposed is rather broad and actuallyinstantiating it requires us to consider how we should resolvemany choices, including those considered in the followingsections, at the very least. Table 1 summaries some of the MAelements / configuration choice to consider.
 
CONCLUSION
 
In this paper, we have proposed a scheme for mobileservice use of BS system and memetic alogithm. Thesurvavility of Route optimization scheme in nested mobilenetwork modifying the process of Memetic Algorithm.Hierarchical Route Optimization scheme optimization schemein mobile network modifying the process of memeticalogrithm. And hence the NEMO basic support protocol needsto be extended with an appropriative route optimizationscheme. the optimization scheme to we easily solved byMEMETIC ALOGRITHM . We propose a scheme canachieve the hierarchical Route Optimization scheme usingmemetic alogrithm (HROSMA) for route optimizationenvironment.And hence the basic support protocol for HierarchicalRoute Optimization scheme optimization scheme of Routeoptimization scheme for mobile network needs to beextended with an appropriative route optimization scheme. we
223 http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->