P. 1
Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

|Views: 158|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 memetic alogirithm in a Mobile Networks
K .K. Gautam Department of Computer Science & Engineering K.P. Engineering College, Agra-283202- India E-mail-: drkkgautam@gmail.com Dileep kumar singh Department of Computer Science & Engineering Dehradun Institue of Technology, Dehraun-India, E-mail-: paras_dileep19@rediffmail.com Mobile networks can here very complex form of hierarchy e.g. Mobile networks in a mobile network visiting mobile nodes(VMNS) in mobile networks and so on. This situation is repaired as nested mobile network. NEMO ARCHITECTURE When a mobile network moves from one place to another, it changes its points of attachment to the internet, which also makes changes to its reach ability and to the Internet topology. NEMO (Network Mobility) working group has come up with NEMO support solution. NEMO support is a mechanism that maintains the continuity of session between mobile 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 Support 2. NEMO Extended Support NEMO Basic Support is a solution for persevering session continuity by means of bidirectional tunneling between Home Agent (HA) and a mobile network. And NEMO extended Support is a solution for providing the necessary optimization between arbitrary Mobile Networks Nodes and correspondent Nodes, including routing optimization [5]. There has not been much research done with the NEMO extended Support Protocol. A mobile Network is composed of one or more IP subnets viewed as a single unit. The Mobile Router is the gateway for the communication between the mobile network and the internet. An Access Router (AN) is a router at the edge of an access network which provides wireless link to mobile nodes.A link is simply a physical medium via which data is transformed between multiple nodes. A Home Link is the linkattached to the interface at the Home Agent on which the Home Prefix is configured. Any Link other than Home link is foreign link.NEMO link is the link within the mobile network. A Mobile Router has two interfaces:Ingress Interface: The interface of the MR attached to a link inside the mobile network. Egress interface: The interface of the MR attached to the home link if the MR is at home and to foreign link if it is a foreign network.

Abstract-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.
Keywords-Route Optimization, Memetic algorithm personal area networks, NEMO, IP.

INTRODUCTION In the trend of ubiquitous computing, many electric appliances, more electronic devices capable of integrating with wireless communications are being added. The mobile internet protocol (IP) working group within the internet engineering task force (IETF) has proposed the mobile IP protocol [1], [2] to support host mobility in IP based networks. The mobile IP aims at maintaining internet connectivity while a host is moving. The networks mobility (NEMO) protocol is a way of managing the mobility of an entire network, viewed as a single unit, 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 Optimization scheme using memetic algorithm (HROSMA) for mobile network. In addition to routing inefficiency, other criteria are important in designing a route optimization scheme for mobile networks. The concepts of network mobility were introduced to reduce the signaling overheads of a number of hosts moving as group. The NEMO basic support protocol uses a bidirectional tunnel between the home agent (HA) and the mobile networks needs (MNNS) from sending all there location registration simultaneously when the MR changes its point of attachment. The characteristic is called mobility transparency, which is a very desirable feature for the route optimization scheme.

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 the Mobile Ip version 6 (MIPv6) [2]. MIPv6 is a version of Internet Protocol (IP) that supports mobile nodes. MOBILE ROUTERS A Mobile Router is a router that can change its point of attachment to the network by moving from one link to another. All the Internet traffic to and from the mobile network passes through the Mobile Router. Therefore, Mobile Router has to perform certain operations to be able to support network mobility. HROSMA For the hierarchical Route Optimization scheme using tree information option (HROSTIO) we use an assistant data structure and call it MNN-CN(mobile network nodecorresponding node) list .It is stored at MRs and records the relationship of the MNN-C BASE STATION In more environment, a cell that Is geographical region unit is geographical region unite is covered by the radio frequency of a base station. Each call is controlled by a BS which has a fixed connection to a BSC (or RNC). In mobile network infrastructure element such as base station controller (BSC), wired links and mobile switch centre (MSC) are employed to provide and maintain essential service; hence the operation interruption of a network component affects overall or partial network services. A radiation antenna is classified as omni directional and directional with an ommnidirectional antenna, a single frequency spreads out in all directions of 360 coverage. A cell is directional antenna with each different set channel. SYSTEM STATE OF BASE STATION The BS system, including antenna parts, cannot provide partial or whole service function for coverage cell when single or more fatal failures occur in the BS system. In this paper, we consider that system failures are caused by key distribution method. For example by interrupt sequence mishandling, overall system operation falls into failure state because of unanticipated handled interruption to a component of the system. PERSONAL AREA NETWORK A mobile network can have a hierarchical structure e.g. a mobile network within another mobile network. This situation is referred to as nested mobile network. A personal area network (PAN) may travel a vehicle, which also contains a mobile network of larger scale fig 1 illustrate a simple larger Scale. MR-1, MR-2 are attaché their own home link. A wireless personal area network moves as a single unit with one or more mobile routers that connect it to global internet.

MULTIOBJECTIVE OPTIMIZATION (MOO) An unaccompanied multi objective optimization problem is a example of route optimization for mobile network. Because mobile moves as a single unit with one or more mobile routers that connect it to the global internet. We defined this problem as “Minimize” z = f(x) Where f(x) = (f1(x), f2(x)…..fn(x)) Subject to xЄx Z2 minimize PF {0} Fig -3 an example of multiobjective optimization problem with mobile search space (MSS) x, as vector fitness function f that maps solution in x to objective vector made up of two component (mobile routers) ‘costs’ z1 and the z2 minimized. Here if we define a=mobile router -1 b=mobile router-2 . . And 1=access router -1 2=access router-2 . . 1

a b c d e

Minimize f : x Fig-3 z

z1

This fig is also defined a routing inefficiency for the traffic management and disigend a imported rout optimization schemes for traffic management of mobile networks. The concept of traffic management for the network mobility was introduce the signaling over heads of a number of hosts moving as a group as MRs.

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 Algorithms producing high quality solution in combinalarial optimization and in real -world application (e.g. see page 220[5]) is some times 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 that MA, s like any other search algorithm , are only reality good to the extent to which they can be “aligned” to the specific features of a route optimization problems in mobile networks . None the less, MAs, like there fore bears evolutionary algorithms (EAs), do have unassailable advantage over other more traditional search techniques: that is their flexibility. This flexibility has important advantage, as has to solve mobile route optimization problems: one is to choose some traditional techniques. And them simplify or otherwise other the problems. As in any other optimization scenario as route optimization problems, we should know that the out set what is a desirable outcomes; the Memetic Algorithm frame work proposed above required. The operators and procedures be selected based on their current success abs. When a mobile network moves from one place to another it change its point attachment to the internet, which also makes changes to its reach ability and to the internet topology. PERFORMANCEMEASURESIN MAs FOR MOO If one is developing or using an algorithm for optimization it almost goes without saying that there should be some way to measures its performance. In MOO the situation is the same regarding the time aspect of performance assessment but the quality aspect is clearly more difficult. the extensive array of existing met heuristic , issues and methods reviewed in the section above gives a richer basis from which to design new MAs than do the existing MAs for MOO themselves. In a typical cellular network, the area of coverage is after geographically divided into hexagonal cells. The call is the basic unit of a cellular system. In recent years, Muscat and krasnogor have provided a guiding manifesto for putting the “Memetic” back in Memetic algorithm [9, 10] advocating.

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 a simple framework that could serve as a guide for making a more Memetic MA for MOO. In line1, MN (Mobile Networks) of solution is initialized. As usual this procedure may be simply random or it may employ some heuristics(s). Line 2 sets the archive A to the no dominated solution from MN. Thereafter, the main loop of the MA begins line 4 sets up an inner loop in which a stagnation criterion is checked. This should be based on some memeplex which monitors progress in diversity, proximity, and /or some other criteria. Line5-9 gives a very high level description of the update of the MN and 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 those operators. E.g. in line 5, Select from is the operation of mating selection, the domain of which is the union of the MN and archive, 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 one operators for the set SEL, of currently available operators for selection. Notice that MN and A are potentially of variable size, in this scheme. In line 11, the MN is updated using some immigration policy to rerelease it from stagnation, the archives of no dominated solution are returned in line 13. The frame work proposed is rather broad and actually instantiating it requires us to consider how we should resolve many choices, including those considered in the following sections, at the very least. Table 1 summaries some of the MA elements / configuration choice to consider. CONCLUSION In this paper, we have proposed a scheme for mobile service use of BS system and memetic alogithm. The survavility of Route optimization scheme in nested mobile network modifying the process of Memetic Algorithm. Hierarchical Route Optimization scheme optimization scheme in mobile network modifying the process of memetic alogrithm. And hence the NEMO basic support protocol needs to be extended with an appropriative route optimization scheme. the optimization scheme to we easily solved by MEMETIC ALOGRITHM . We propose a scheme can achieve the hierarchical Route Optimization scheme using memetic alogrithm (HROSMA) for route optimization environment. And hence the basic support protocol for Hierarchical Route Optimization scheme optimization scheme of Route optimization scheme for mobile network needs to be extended with an appropriative route optimization scheme. we

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 satisfied do 5: SAMN: =SelectFrom(PUA,sel_sc hed(succ(SEL))) 6: SAMN: =Vary (SAMN,var_sched (succ(VAR)))

not

223

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 2, February 2011

propose a scheme can achieve the mobile route optimization environment. It may get a survivability scheme. REFERENCES (1) J.Kabara , P. Krishna Murthy, and D. Tipper, “Information auuurance in wireless network”. In proc. IEEE workshop on DIREN’02. (2) U. Varshney A.P Snow and A.D. Malloy, “Designing Survivable wireless and mobile network” in proc. IEEE WCNC’99, neworeleans, LA, Sep. 1994, pp.30-34. (3) D.Tipper, S. Rammaswamy, and T. Dahiberg,”pcs network survivability” in proc. IEEE WCNC, new or leans LA, sep 1999, invited paper. (4) D. Samfat, R. molva, N. Asokan, “Untraceability in mobilke Network” Proceeding of Mobi COM’95, Berkely, November 1995. (5) Zhang Bin, Wujing-Xing Proc. Of the feb.2003 ICCNMC’03 IEEE. (6) Sangjoon Park, Jiyoung Song, Byunaggi Kim, IEEE Trans of Veh. Tech. Vol. 55 pp 328-339. (7) Ashotosh Dutta , James Burns , K. Daniel Wong, Ravi jain, Ken Young Telcordia Technologies, 445 South Street, Morristown, NJ 07960 pp 1-6 (8) Sangjoon Park , Jiyoung song, and Byunggi Kim, Member, IEEE “A Survivability Strategy in Mobile Networks. IEEE TRANSACTION ON TECHNOLOGY, VOL. 55,NO.328-340. (9) M.A. Abido, A new multiobjective evolutionary algorithm for environmental /economic power dispatch. In Power Engineering Society Summer Meeting, Vol. 2, page 1263-1268, IEEE, 2001. (10) Pragya Lamsal, “Network Mobility”, Research Seminar on Hot Topics in Internet Protocols, page 12. (11) Joshua Knowles and David Corne, “Memetic algorithms for multiobjective optimization: issues, methods and prospect, page 1-40. (12)Jhonson, C. Perkins and J. Arkko, “Mobility support in JPVG”, IETF, RFC3775, Jun., 2004. (13)T. Ernst and H. Lach, “Network mobility support terminology”, Interior draft, Feb., 2005 [Online] http://infreport.isoc.org/idref/draft-ietf-nemo-terminology. (14)M.A. Abido, A new multiobjective evolutionary algorithm for environmental /economic power dispatch. In Power Engineering Society Summer Meeting, Vol. 2, page 1263-1268, IEEE, 2001. (15)Pragya Lamsal, “Network Mobility”, Research Seminar on Hot Topics in Internet Protocols, page 1-.

Access Router

Mr1

Mr2 Mr5

Mr3

Mr4

MR1, MR2……………MRn ….M

AUTHORS PROFILE

Author1- Dr.K.K.Gautam is a DEAN of K.P.Group of institution. He has also moral responsibility of teaching and he is the professor in mathematics & Computer Science department. He is working in the wireless and mobile computing field.

Author2-Er.Dileep Kumar kingh is the Assistant professor in the dehradun institute of technology. He is working on the wireless and mobility from last three years.

224

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

You're Reading a Free Preview

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