Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Size: px

Start display at page:

Download "Evaluation of an Enhanced Scheme for High-level Nested Network Mobility"

Pierce Sanders
5 years ago
Views:

1 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan. A. Hashm Unversty of Albutana, Sudan IIUM, Malaysa Abstract Recently, wreless devces have been used sgnfcantly due to the contnuous and enormous servces that they provde. The Moblty Support has been desgned to acheve a permanent and contnung access to the Internet whle the wreless devces are roamng and changng ther ponts of attachment. One of the major challenges that arse s how to acheve seamless moblty and hgh network performance. The Internet Engneerng Task Force (IETF) has developed Moble IP, whch allows Moble node to be connected whle t s movng as well as functonng n foregn moble network zone usng ts orgnal IP address. IETF also n order to manage moblty of an entre network as sngle unt, they developed NEMO Basc Support Protocol (NEMO BS), whch allows Moble Routers to move and change ther pont of attachment. When a Moble Router connected to other moble router on foregn moble network, t makes a herarchcal structure known as nested moble network; nested moble network suffers from deferent problems due ts complexty structure. When the level of nestng becomes hgh, problems of tunnelng overhead are ncreased, whch wll produce hgh message delay and affect network performance. Many proposed schemes have been ntroduced to overcome nested network moblty ssues. However, novel efforts are requred. Ths research am to present and evaluate a new scheme to support nested network moblty especally n hgh level of nestng. The evaluaton of ths proposed scheme s done usng analytcal approach. The proposed scheme enhancement s benchmarked wth NEMO protocol and ROTIO approach wtch t based on IETF standers. The result obtaned had shown that the proposed scheme has better performance than the benchmark. Key words: Moble Network, Moble Router, Nested Moble Network, Performance 1. Introducton Wreless devces and wreless networkng technologes are drastcally grows recently, consequently, many electronc devces are capable to connect to the Internet usng ther own IP addresses, moble networkng becomes more applcable to varous scenaros. So the users are expected to be connected anywhere at any tme. However, network moblty s not supported as core functonalty n the TCP/IP stack, so addtonal mechansms are requred to support network moblty. Internet Engneerng Task Force (IETF) has ntated many protocols to support connectvty to these devces. Ths keeps the connecton whle the users are movng, not only to sngle devce but also to Moble Networks that are movng as a sngle unt. Moble Network contans multple moble nodes and other wreless devces (routers, swtches and hosts) that are capable to exchange the data between them,the topology of network defers from network to another dependng on the number and complexty of nodes. The archtecture of moble network can be Vehcular Area Network (VAN), a Personal Area Network (PAN) or a Body Area Network (BAN) whch requre access to the Internet. Hence, an effcent moblty management scheme s needed to provde contnuous servces for moble network as t changes ts pont of attachment to the Internet. To provde the moblty support, IETF has proposed MIPv6 for host moblty and network moblty Basc Support Protocol (NEMO- BS) [1], for a whole network moblty. NEMO enables moble nodes to move together as moble network usng moble router ()[2]. Moreover, t allows s from dfferent moble network to connect each other n form known as nested moble network (Nested Nemo). In NEMO [3]. Any s manly desgned to be connected to a partcular network or home network. Then the s gven a permanent IP address known as a home address (HoA). The s HoA, t s a constant address and t s not changng regardless of ts attachment pont n the Internet. When the s move from ts home network, and jon another network, packets addressed to the nodes of the home network are routed to the home network and a home agent (HA), a router n the home network manages all these packets. When the moble router attached to the foregn network, t gets an address known as care-of address (CoA) n foregn moble network. Then the moble router sends a bndng update (BU) message to ts HA wth the purpose of map the CoA wth ts HoA, after that, a bdrectonal tunnel between and HA s establshed. All packets are encapsulated and transferred to the moble node (MN) n home network through ths tunnel. receves the encapsulated packet and extracts the orgnal packet to MN. The man problem here s the addtonal IP header that are added and removed for purpose of tunnelng occur between s and Home Agents, whch may causes a lot of problems drectly affects the network performance. when there are many routers connected Manuscrpt receved October 5, 2015 Manuscrpt revsed October 20, 2015

2 2 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 together, they are create herarchcal form known as Nested Network Moblty, whch s suffer from the Bdrectonal tunnelng overhead that are occurs multple tme dependng on level of nestng. Network moblty (NEMO) manages the movement of durng t changes the pont of attachment of the moble network n order to be connected to the nternet [1]. Therefore, t s very sgnfcant to acqure the hgh performance of moblty management protocol to accomplsh fast and seamless handoff wth lower delay and packet losses n NEMO envronment [4]. Network Moblty Support protocol s based on creatng bdrectonal tunnel between and ts Home Agent (HA), only should send the bndng update message (BU) wth the network prefx to provde Internet connectvty to all MNs. Followng ths technque hde the moblty of MNs and lmted the repeated regstraton of the MNs [4]. However, establshng of b-drecton tunnelng between the and t s HA for all communcatons causes on an ncreasng message sze because t s done by (IP-n-IP) encapsulaton. Ths ncreases handoff latency, packet loss, sgnalng cost and tunnelng overhead especally when the level of nestng s becomes hgh. 2. esgn of the Proposed Scheme for Hgh Level Nested Network Moblty In order to address the ssues related to the nested network moblty especally n case of hgh level nestng, an enhanced herarchal scheme have been proposed to overcome the overall performance ssues and support seamless moblty. The proposed scheme uses Herarchal archtecture that dvdes the doman under MAP nto multple sub domans dependng on the level of nestng. Therefore, ths technque reduces the transmsson cost, decreases the nested tunnels, enhances Intra doman routng perfectly; n addton to mprovng Message elay, and enhancng Handoff latency and Bndng Update. Ths scheme s smple to mplement, as t requres only slght change n the mplementaton of moble routers and moble nodes, no change s requred on home agents, correspondent node or any other network components. fgure 1 shows the proposed scheme and ts benefts.[5] Fgure 1 shows the map doman under TL, whch s dvded nto multple sub domans, so after each three levels of nestng a frst arrvng acts as sub doman TL (STL) that nherts all the features of orgnal TL. So all the operatons are done locally nsde a sub doman rather than on a whole doman. Ths way the path n between and a near TL becomes shorter whch gves an mportant advantage as llustrated n fgure 6. Each STL sends ts cache s contents to the orgnal TL usng sutable cache strategy technque. When correspondent node sent a message to ts the orgnal TL search ts cache s contents and set whch STL to receve a message, then the STL route the message to the. Fg. 1 the proposed scheme[43] 3. Proposed Scheme Operatons When vsts a network, t receves a Router Advertsement message from AR. the Advertsement message contans MAP opton of last STL to allow the to dscover STL address. Once the receves Router Advertsement messages wth the MAP opton that contans prefx nformaton for RCoA, t confgures two addresses, RCoA and LCoA by the stateless address confguraton mechansm. Rfc4041. Then As the bulds RCoA, the sends Local Bndng Update message to the STL. Upon recevng Local Bndng Update message, STL performs uplcate Address etecton (A) for RCoA. Then The STL returns a Bndng Acknowledgement message to the, to ndcate the result of the bndng update to the STL. Fnally The receves acknowledgement packet from STL contanng RCoA. Once the bndng update n STL s successfully completed, the STL updates the orgnal MAP cache. Hence, the orgnal MAP now s up to date wth the sub- doman s map contents. When HA and CNs sends a message to the, the orgnal MAP receves the message and searches ts cache to determne whch STL receves ths message. The targeted STL drectly routes the message to the. fgure 2 shows the scenaro of operatons. The proposed scheme provdes a short path to complete these operatons, so t gves low handoff latency, low transmsson delay, low messagng cost, low regstraton overhead and low sgnalng cost n comparson wth the prevous scenaros.

IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 3 4. Analytcal Evaluaton of The Proposed Scheme Fg.

Fg. 4 the sgnalng follow of the proposed scheme Analytcal model has been developed to compare the packet transmsson delay and handoff latency of the proposed scheme wth selected benchmark.

3 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October Analytcal Evaluaton of The Proposed Scheme Fg. 2 the scenaro of proposed scheme operatons Fgure 3 shows the operaton of regstraton on the STL and snapshot of operaton n sub doman rather than a whole doman. Fg. 3 the operatons on the sub doman Fgure 4 shows the sgnalng follow of the proposed scheme. Fg. 4 the sgnalng follow of the proposed scheme Analytcal model has been developed to compare the packet transmsson delay and handoff latency of the proposed scheme wth selected benchmark. We have calculated the packet transmsson delay by summng up the lnk delay between CN and, lnk delay between HA and, processng delay at home agents, lnk delay between AR and, lnk delay between AR and TL, lnk delay at each sub doman and the lnk delay between and MN. We have also calculated the handoff latency by summng up the total delay of movement detecton, the total delay of duplcate address detecton at each sub doman TL and the total processng delay at each and lnk delay between each. Notatons The analytcal model uses the notaton shown n table 1 Table 1 the notatons of the analytcal model N The degree of nestng of whole doman M The degree of nestng nsde sub doman N The number of sub domans S TMLR The Processng delay of, +1 The lnk delay between and +1 L The processng delay of HA HA The lnk delay between correspondent node LCN and The processng delay of S_TL S The lnk delay between home agent and LHA The lnk delay between and Mn L MN The lnk delay between AR and LAR The lnk delay between AR and TMLR LAR TL The processng delay of movement detecton M The processng delay of duplcate A address detecton 4.1. Packet Transmsson elay We have calculated the packet transmsson delay by summng up the lnk delay between CN and, the lnk delay between HA and, and processng delay at home agents, the lnk delay between AR and, the lnk delay between AR and TL, lnk delay at each sub doman and lnk delay between and MN. Ths secton shows the equaton used to calculate the packet transmsson delay for each approach.

4 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 4.1.1. Packet transmsson delay n NEMO.

4 4 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October Packet transmsson delay n NEMO. Equaton (1) [6] calculates the packet transmsson delay for NEMO approach as follows: Handoff latency of ROTIO. Equaton (6) [6] calculates the handoff latency n ROTIO Handoff latency of LBU Packet transmsson delay n ROTIO. Equaton (2) [6] calculates the packet transmsson delay n ROTIO approach as follows: Equaton (7) [7] calculates the handoff latency n LBU Handoff latency of proposed scheme. Equaton (8) calculates the handoff latency n proposed scheme as follow: Packet transmsson delay n LBU+. Equaton (3) [7] calculates the packet transmsson delay n LBU+ approach as follows: Packet transmsson delay n proposed scheme. Equaton (4) calculates the packet transmsson delay n proposed 4.2. Handoff latency The handoff latency s calculated by summng up the total delay of movement detecton and total delay of duplcate address detecton at each sub doman TL, the total processng delay at each, and the lnk delay between each. Ths secton shows the calculaton of the handoff latency for each approach Handoff latency of NEMO. Equaton (5) [7] calculates the handoff latency n NEMO 5. Result and dscusson Table 2 shows the system parameters values that are used to evaluate the proposed scheme. Table 2 the System parameters values Parameter value, +1 L HA LCN 50 ms S LHA ms L MN LAR LAR TL 100 ms LCN 50 ms M A 10s 5.1. Packet transmsson delay Fgure 5 shows that the packet transmsson delay produced by the proposed scheme s less than those proposed by other approaches.

IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 5 Fg 5 comparson of packet transmsson delay 5.2. Handoff latency.

5 IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October Fg 5 comparson of packet transmsson delay 5.2. Handoff latency. Fgure 6 shows that the handoff latency produced by the proposed scheme s less than those proposed by the other approaches. [3] Ernst, Therry. "Network moblty support termnology." Network (2007). [4] [Perera, Eranga, Vjay Svaraman, and Aruna Senevratne. "Survey on network moblty support." ACM SIGMOBILE Moble Computng and Communcatons Revew 8.2 (2004): [5] Al, Mohammed Babker, and Asha Hassan A. Hashm. "Improvng Message elay, Handoff latency and Bndng Update n Hgh level Nested Network Moblty." Internatonal Journal of Computer Scence and Network Securty (IJCSNS) 15.1 (2015): 27 [6] Cho, H., Kwon, T., and Y. Cho, "Route Optmzaton Usng Tree Informaton Opton for Nested Moble Networks", IEEE Journal On Selected Areas n Communcatons, Vol. 24, No. 9, , September [7] Senan, Shayma, et al. "Evaluaton of nested network moblty approaches." Appled Sc 11 (2011): Mohammed Babker Al Mohammed. Receved the B.Sc. egrees n Math and computer scence (statstcs/computer) from Gezra unversty faculty of math and computer scence n 2007 Sudan and M.Sc. n computer scence and nformaton from Gezra unversty faculty of Engneerng and Technology sudan Ph.. student at unversty of Sudan of scence and technology faculty of computer scence and nformaton technology Fg. 6 comparson of handoff latency 6. Concluson In ths paper, a novel scheme usng herarchcal structure has been proposed to overcome the performance problems that occur n nested network moblty n case of hgh degree of nestng level. An analytcal model for packet transmsson delay and handoff latency are developed and evaluated compared to the benchmarks. The result obtaned had shown that the proposed scheme has better performance than the benchmark. References [1] evarapall, Vjay, et al. Network moblty (NEMO) basc support protocol. RFC 3963, January, [2] Al-Surm, Ibrahm, Mohamed Othman, and Borhanuddn Mohd Al. "Moblty management for IP-based next generaton moble networks: Revew, challenge and perspectve." Journal of Network and Computer Applcatons 35.1 (2012):

IP mobility support is becoming very important as the

IP mobility support is becoming very important as the 706 IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 6, JUNE 2003 A New Scheme for Reducng Lnk and Sgnalng Costs n Moble IP Young J. Lee and Ian F. Akyldz, Fellow, IEEE Abstract IP moblty support s provded