Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

Report as inappropriate Your report has been received

Description

The International Journal of Computer Science and Information Security (IJCSIS Vol. 9 No. 2) is a reputable venue for publishing novel ideas, state-of-the-art research results and fundamental advances in all aspects of computer science and information & communication security. IJCSIS is a peer reviewed international journal with a key objective to provide the academic and industrial community a medium for presenting original research and applications related to Computer Science and Information Security. . The core vision of IJCSIS is to disseminate new knowledge and technology for the benefit of everyone ranging from the academic and professional research communities to industry practitioners in a range of topics in computer science & engineering in general and information & communication security, mobile & wireless networking, and wireless communication systems. It also provides a venue for high-calibre researchers, PhD students and professionals to submit on-going research and developments in these areas. . IJCSIS invites authors to submit their original and unpublished work that communicates current research on information assurance and security regarding both the theoretical and methodological aspects, as well as various applications in solving real world information security problems.

Shared by: ijcsis

Stats

views:: 107
posted:: 3/8/2011
language:: English
pages:: 4

Public Domain

Document Sample

(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 Dileep kumar singh
Department of Computer Science & Engineering Department of Computer Science & Engineering
K.P. Engineering College, Agra-283202- India Dehradun Institue of Technology, Dehraun-India,
E-mail-: drkkgautam@gmail.com E-mail-: paras_dileep19@rediffmail.com

Abstract-The networks Mobility (NEMO) Protocol is a way of Mobile networks can here very complex form of
managing the mobility of an entire network, and mobile internet hierarchy e.g. Mobile networks in a mobile network visiting
protocol is the basic solution for networks Mobility. A mobile nodes(VMNS) in mobile networks and so on. This
hierarchical route optimization system for mobile network is situation is repaired as nested mobile network.
proposed to solve management of hierarchical route optimization
problems. In present paper we study hierarchical Route
Optimization scheme using memetic algorithm(HROSMA) The
NEMO ARCHITECTURE
concept of optimization- finding the extreme of a function that When a mobile network moves from one place to
maps candidate ‘solution’ to scalar values of ‘quality’ – is an another, it changes its points of attachment to the internet,
extremely general and useful idea. For solving this problem, we which also makes changes to its reach ability and to the
use a few salient adaptations, and We also extend HROSMA Internet topology. NEMO (Network Mobility) working group
perform routing between the mobile networks. has come up with NEMO support solution. NEMO support is
a mechanism that maintains the continuity of session between
Keywords-Route Optimization, Memetic algorithm personal area mobile networks. Node (MNN) and their correspondent nodes
networks, NEMO, IP. (CN) upon a mobile Router’s change of point attachment.
NEMO support is divided into two parts:
INTRODUCTION 1. NEMO Basic Support
In the trend of ubiquitous computing, many electric 2. NEMO Extended Support
appliances, more electronic devices capable of integrating with NEMO Basic Support is a solution for persevering
wireless communications are being added. The mobile internet session continuity by means of bidirectional tunneling
protocol (IP) working group within the internet engineering between Home Agent (HA) and a mobile network. And
task force (IETF) has proposed the mobile IP protocol [1], [2] NEMO extended Support is a solution for providing the
to support host mobility in IP based networks. The mobile IP necessary optimization between arbitrary Mobile Networks
aims at maintaining internet connectivity while a host is Nodes and correspondent Nodes, including routing
moving. The networks mobility (NEMO) protocol is a way of optimization [5]. There has not been much research done with
managing the mobility of an entire network, viewed as a single the NEMO extended Support Protocol.
unit, which changes its points to attachments in the internet A mobile Network is composed of one or more IP
[3]. Such an internet will include one or more mobile routers subnets viewed as a single unit. The Mobile Router is the
(MRs) that connect it to the global internet. A mobile network gateway for the communication between the mobile network
can connect it to the global internet. and the internet.
A mobile network can have a hierarchical structure; An Access Router (AN) is a router at the edge of an
in this paper we propose a hierarchical Route Optimization access network which provides wireless link to mobile
scheme using memetic algorithm (HROSMA) for mobile nodes.A link is simply a physical medium via which data is
network. transformed between multiple nodes. A Home Link is the
In addition to routing inefficiency, other criteria are linkattached to the interface at the Home Agent on which the
important in designing a route optimization scheme for mobile Home Prefix is configured. Any Link other than Home link is
networks. The concepts of network mobility were introduced foreign link.NEMO link is the link within the mobile network.
to reduce the signaling overheads of a number of hosts moving
as group. A Mobile Router has two interfaces:-
The NEMO basic support protocol uses a Ingress Interface: The interface of the MR attached to
bidirectional tunnel between the home agent (HA) and the a link inside the mobile network.
mobile networks needs (MNNS) from sending all there
location registration simultaneously when the MR changes its Egress interface: The interface of the MR attached to
point of attachment. The characteristic is called mobility the home link if the MR is at home and to foreign link if it is a
transparency, which is a very desirable feature for the route foreign network.
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 MULTIOBJECTIVE OPTIMIZATION (MOO)
Mobile Ip version 6 (MIPv6) [2]. MIPv6 is a version of An unaccompanied multi objective optimization
Internet Protocol (IP) that supports mobile nodes. 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
MOBILE ROUTERS defined this problem as
A Mobile Router is a router that can change its point
of attachment to the network by moving from one link to “Minimize” z = f(x)
another. All the Internet traffic to and from the mobile Where f(x) = (f1(x), f2(x)…..fn(x))
network passes through the Mobile Router. Therefore, Mobile Subject to xЄx
Router has to perform certain operations to be able to support Z2 minimize PF {0}
network mobility.
Fig -3 an example of multiobjective optimization problem
HROSMA with mobile search space (MSS) x, as vector fitness function f
For the hierarchical Route Optimization scheme that maps solution in x to objective vector made up of two
using tree information option (HROSTIO) we use an assistant component (mobile routers) ‘costs’ z1 and the z2
data structure and call it MNN-CN(mobile network node-
minimized.
corresponding node) list .It is stored at MRs and records the
relationship of the MNN-C
Here if we define
a=mobile router -1
BASE STATION
b=mobile router-2
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
And
which has a fixed connection to a BSC (or RNC). In mobile
1=access router -1
network infrastructure element such as base station controller
2=access router-2
(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
1
or partial network services.

A radiation antenna is classified as omni directional
and directional with an ommnidirectional antenna, a single a
frequency spreads out in all directions of 360 coverage. A cell
is directional antenna with each different set channel. b
c
SYSTEM STATE OF BASE STATION
The BS system, including antenna parts, cannot
provide partial or whole service function for coverage cell d
when single or more fatal failures occur in the BS system. In e
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 Minimize z1
because of unanticipated handled interruption to a component
of the system. f : x z

Fig-3
PERSONAL AREA NETWORK
A mobile network can have a hierarchical structure
e.g. a mobile network within another mobile network. This This fig is also defined a routing inefficiency for the traffic
situation is referred to as nested mobile network. A personal management and disigend a imported rout optimization
area network (PAN) may travel a vehicle, which also contains schemes for traffic management of mobile networks. The
a mobile network of larger scale fig 1 illustrate a simple larger concept of traffic management for the network mobility was
Scale. MR-1, MR-2 are attaché their own home link. A introduce the signaling over heads of a number of hosts
wireless personal area network moves as a single unit with one moving as a group as MRs.
or more mobile routers that connect it to global internet.

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:- 7: SAMN”:=LocalSearch(SAMN”,I s_sched(succ(LS)))
The impressive record of Memetic Algorithms 8: MN: =Replace (PUC”,rep_sched(s ucc(RED)))
producing high quality solution in combinalarial optimization 9: A: =Reduce (Nandom(AUSAMN) ,red_sched(succ(RED)))
and in real -world application (e.g. see page 220[5]) is some 10: end while
times cited as a testament of their m herent effective – ness of 11: MN: =Randomlmmigrants(P,imm_sched(succ(IMM)))
robustness as black box search. However, since the advent of 13: return (A)
the no free lunch theorems [6,7,8] 109,19, 2, we know that Here we represent a Algorithm, we put forward a
MA, s like any other search algorithm , are only reality good simple framework that could serve as a guide for making a
to the extent to which they can be “aligned” to the specific more Memetic MA for MOO. In line1, MN (Mobile
features of a route optimization problems in mobile networks Networks) of solution is initialized. As usual this procedure
. None the less, MAs, like there fore bears evolutionary may be simply random or it may employ some heuristics(s).
algorithms (EAs), do have unassailable advantage over other Line 2 sets the archive A to the no dominated solution from
more traditional search techniques: that is their flexibility. MN. Thereafter, the main loop of the MA begins line 4 sets up
This flexibility has important advantage, as has to solve an inner loop in which a stagnation criterion is checked. This
mobile route optimization problems: one is to choose some should be based on some memeplex which monitors progress
traditional techniques. And them simplify or otherwise other in diversity, proximity, and /or some other criteria. Line5-9
the problems. gives a very high level description of the update of the MN
As in any other optimization scenario as route and archive. Five different ‘schedulers’ are employed,
optimization problems, we should know that the out set what basically corresponding to mating selection, reproduction,
is a desirable outcomes; the Memetic Algorithm frame work lifetime learning, survival selection and update of the archive,
proposed above required. The operators and procedures be respectively. Each scheduler chooses from a memeplex of
selected based on their current success abs. operators, based on estimates of the current success of those
operators. E.g. in line 5, Select from is the operation of mating
When a mobile network moves from one place to selection, the domain of which is the union of the MN and
another it change its point attachment to the internet, which archive, and co-domain is a Small Area Mobile Networks
also makes changes to its reach ability and to the internet (SAMN), the selection is controlled by the scheduler,
topology. sel_sched, which use a success measures, succ, to choose one
operators for the set SEL, of currently available operators for
PERFORMANCEMEASURESIN MAs FOR MOO selection. Notice that MN and A are potentially of variable
If one is developing or using an algorithm for size, in this scheme. In line 11, the MN is updated using some
optimization it almost goes without saying that there should be immigration policy to rerelease it from stagnation, the archives
some way to measures its performance. In MOO the situation of no dominated solution are returned in line 13.
is the same regarding the time aspect of performance The frame work proposed is rather broad and actually
assessment but the quality aspect is clearly more difficult. the instantiating it requires us to consider how we should resolve
extensive array of existing met heuristic , issues and methods many choices, including those considered in the following
reviewed in the section above gives a richer basis from which sections, at the very least. Table 1 summaries some of the MA
to design new MAs than do the existing MAs for MOO elements / configuration choice to consider.
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. CONCLUSION
In recent years, Muscat and krasnogor have provided a guiding In this paper, we have proposed a scheme for mobile
manifesto for putting the “Memetic” back in Memetic service use of BS system and memetic alogithm. The
algorithm [9, 10] advocating. survavility of Route optimization scheme in nested mobile
network modifying the process of Memetic Algorithm.
Hierarchical Route Optimization scheme optimization scheme
Candidate MA framework for MOO:- in mobile network modifying the process of memetic
1. MN: = initialize(MN) alogrithm. And hence the NEMO basic support protocol needs
2. A: = Nondom (MN) to be extended with an appropriative route optimization
scheme. the optimization scheme to we easily solved by
Algorithm Candidate MA framework for MOO MEMETIC ALOGRITHM . We propose a scheme can
1: MN: = Initialize (MN) achieve the hierarchical Route Optimization scheme using
2: MN: = Nondom (MN) memetic alogrithm (HROSMA) for route optimization
3: while stop criterion not satisfied do environment.
4: while stagnation _criterion not And hence the basic support protocol for Hierarchical
satisfied do Route Optimization scheme optimization scheme of Route
5: SAMN: =SelectFrom(PUA,sel_sc hed(succ(SEL))) optimization scheme for mobile network needs to be
6: SAMN: =Vary (SAMN,var_sched (succ(VAR))) extended with an appropriative route optimization scheme. we

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. Access Router

REFERENCES

Mr1 Mr2 Mr3 Mr4
(1) J.Kabara , P. Krishna Murthy, and D. Tipper, Mr5
“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, MR1, MR2……………MRn ….M
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,
AUTHORS PROFILE
Ravi jain, Ken Young Telcordia Technologies, 445
South Street, Morristown, NJ 07960 pp 1-6 Author1- Dr.K.K.Gautam is a DEAN of K.P.Group of
(8) Sangjoon Park , Jiyoung song, and Byunggi Kim, institution. He has also moral responsibility of teaching and he
Member, IEEE “A Survivability Strategy in Mobile is the professor in mathematics & Computer Science
Networks. IEEE TRANSACTION ON department. He is working in the wireless and mobile
TECHNOLOGY, VOL. 55,NO.328-340. computing field.
(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 1-
2.
(11) Joshua Knowles and David Corne, “Memetic
algorithms for multiobjective optimization: issues, Author2-Er.Dileep Kumar kingh is the Assistant professor in
methods and prospect, page 1-40. the dehradun institute of technology. He is working on the
wireless and mobility from last three years.
(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-.

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