A New Nemo Route Optimization Scheme Using Nemo Correspondent Registration Procedure

Samer Sami Hasan Al-Rammahi (P54907)

Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/513396

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Rosilah Hassan, Associate Professor Dr.
dc.contributor.author	Samer Sami Hasan Al-Rammahi (P54907)
dc.date.accessioned	2023-10-16T04:36:13Z	-
dc.date.available	2023-10-16T04:36:13Z	-
dc.date.issued	2013-10
dc.identifier.other	ukmvital:71384
dc.identifier.uri	https://ptsldigital.ukm.my/jspui/handle/123456789/513396	-
dc.description	Network mobility basic support protocol (NEMO BSP) is an important requirement for internet networks to reach the goal of ubiquitous connectivity. NEMO basic support protocol handles the mobility of multiple nodes in an aggregate way as a mobile network. The standard NEMO suffers from a number of problems and limitations, such as inefficient route due to pinball problem, link drop problem, and long handoff latency; however, most previous studies attempting to solve such problems impose an extra signaling load and/or modify the functionalities of the main entities. To overcome such problems: Firstly, a new architecture for infrastructure-based route optimization in NEMO (FRON) that uses a correspondent firewall with new filtering rules to support the route optimization in NEMO BSP been proposed. In order to further improve the correspondent registration, a more secure and lightweight enhanced return routability procedure (ERRP) extended from the original correspondent registration option headers within FRON infrastructure also been developed. Furthermore, instead of employing ERRP in stateless environments, a new route optimization scheme for NEMO stateless DHCPv6 using the proposed ERRP with the DHCPv6PD (DHCPv6 prefix delegation) protocol been implemented. Finally, to overcome the bursts of re-registration signaling due to dropping links in the binding cache of the correspondent entities; correspondent node, correspondent router, and correspondent firewall; a new cache replacement policy is proposed to solve such problem. The results shows that the proposed mechanisms provides secure communications by making an authorized decision about the mobile router (MR) home of address (HoA), care of address (CoA), and the complete mobile network prefixes (MNPs) underneath the MR. In addition, it reduces the total signaling required for NEMO handoffs, especially when the number of mobile network nodes (MNNs) and/or CNs is increased. Moreover, the proposed mechanisms can be easily deployed without modifying the mobility protocol stack of CNs. A thorough analytical model and network simulator (NS-2) are used for evaluating the performance of the proposed mechanisms compared with NEMO BSP and state-of-the-art of route optimization schemes. Numerical and simulation results demonstrate that our proposed design and mechanisms outperforms other route optimization schemes in terms of security considerations, handoff latency, and total signaling load on wired and wireless links.,PhD
dc.language.iso	eng
dc.publisher	UKM, Bangi
dc.relation	Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat
dc.rights	UKM
dc.subject	New Nemo Route Optimization Scheme
dc.subject	Nemo Route Optimization
dc.subject	Nemo Correspondent Registration Procedure
dc.subject	Routing (Computer network management)
dc.title	A New Nemo Route Optimization Scheme Using Nemo Correspondent Registration Procedure
dc.type	Theses
dc.format.pages	143
dc.identifier.callno	TK5105.5487 .R343 2013 3
dc.identifier.barcode	000688
Appears in Collections:	Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Files in This Item:

File	Description	Size	Format
ukmvital_71384+Source01+Source010.PDF Restricted Access		6.33 MB	Adobe PDF	View/Open

Show simple item record Recommend this item