Enhanced mobility management scheme for mobile producer handoff in named data networking /
The problem of managing network mobility has been an open issue in network mobility management. This is because of the huge volume of multimedia contents across IP networks. The current IP architecture seems inadequate to continuously manage the ever-increasing number of mobile and network devices,...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
Kuala Lumpur :
Kulliyyah of Engineering,International Islamic University Malaysia ,
2021
|
| Subjects: | |
| Online Access: | http://studentrepo.iium.edu.my/handle/123456789/11279 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 05311nam a2200385 4500 | ||
|---|---|---|---|
| 008 | 230309s2021 my a f m 000 0 eng d | ||
| 040 | |a UIAM |b eng |e rda | ||
| 041 | |a eng | ||
| 043 | |a a-my--- | ||
| 100 | 1 | |9 30398 |a Ahmed, Muhammed Zaharadeen |e author | |
| 245 | |a Enhanced mobility management scheme for mobile producer handoff in named data networking / |c by Muhammed Zaharadeen Ahmed | ||
| 264 | 1 | |a Kuala Lumpur : |b Kulliyyah of Engineering,International Islamic University Malaysia , |c 2021 | |
| 300 | |a xxiii, 164 leaves : |b illustrations ; |c 30 cm. | ||
| 336 | |2 rdacontent |a text | ||
| 337 | |2 rdamedia |a unmediated | ||
| 337 | |2 rdamedia |a computer | ||
| 338 | |2 rdacarrier |a volume | ||
| 338 | |2 rdacarrier |a online resource | ||
| 347 | |a text file |b PDF |2 rdaft | ||
| 500 | |a Abstracts in English and Arabic. | ||
| 500 | |a "A thesis submitted in fulfilment of the requirement for the degree of Doctor of Philosophy (Engineering)." --On title page. | ||
| 502 | |a Thesis (Ph.D)--International Islamic University Malaysia, 2021. | ||
| 504 | |a Includes bibliographical references (leaves 143-148). | ||
| 520 | |a The problem of managing network mobility has been an open issue in network mobility management. This is because of the huge volume of multimedia contents across IP networks. The current IP architecture seems inadequate to continuously manage the ever-increasing number of mobile and network devices, that consumes and generate multimedia contents. This initiated and stimulated the concept of CCN/NDN to solve challenges faced in IP networks. Named Data Networking is a new content centric network architecture that can possibly tackle most issues of IP mobility and security. NDN approach is commonly identified under Information Concentric Network or Content Concentric Network and is centered on addressing contents by themselves using names, rather than assigning IP addresses to packets on hosts where information is located on the global internet. This thesis proposed a mobility management scheme with improved network availability and scalability for the mobile producer during and after inter-technology handoff. This is achieved by using rendezvous-based mobility management approach. For network availability, anchorless (locator-free) approach is used for producer’s connectivity during handoff for intra and inter access point change over. This ensures mobile producers’ registration and location update as it successfully achieves mobile handoff within an outside the network core. Forwarding paths and labels are also enhanced with minimal signaling cost and using best route approach to ensure easy transmission and reception of Interest and Data contents between mobile producers and rendezvous servers. For network scalability, simulation is used. The number of rendezvous server is increased for each simulation scenarios of pull, push, upload and shear to ensure traffic redistribution and by synchronizing the proposed scheme with scenario aware protocol. Each of the rendezvous server has an amount of data streams it can respond to in a network session when a mobile producer or consumer transmits its interest request. In the first scenario, four rendezvous nodes were deployed to implement the proposed number of data content streams in the NDN network. These data streams range between 100 to 1500 in each rendezvous node and is accessed multiple times to by producers and consumer for specified time interval. For the second scenario the number of rendezvous servers were increased to seven where number of data streams were maintained to 1500 in each rendezvous with maximum of 300 connection request per consumers and producers. For the third scenario, the number of consumers 10 and mobile producers are 15 to access 1500 maximum number of data streams in each rendezvous. In the final simulation link loss rate is at maximum of 10% and all other parameters were maintained constant based on first, second with 15% and third scenario with 23%. This can enable mobile producers to be able to retransmit their interest request in situation of total packet losses for at least three times. Based on the implementation, Algorithms are designed for network availability during and after successful mobile producer handoff, and for unique prefix name assignment. These are supported by an effective flowchart for clear description. For the results, ndnSIM2.1 is used in coding the scenarios based on random way point movement model and the analysis is simulated in Linux environment. Wireshark is interfaced to observe some basic parameters such as average throughput, round trip time, | ||
| 655 | 0 | |9 64 |a Theses, IIUM local | |
| 690 | |9 19519 |a Dissertations, Academic |x xKulliyyah of Engineering |z IIUM | ||
| 700 | 1 | |a Aisha Hassan Abdalla Hashim |e degree supervisor |9 10346 | |
| 700 | 1 | |a Othman Omran Khalifah |e degree supervisor | |
| 700 | 0 | |a Huda Adibah Mohd Ramli |e degree supervisor | |
| 710 | 2 | |9 169 |a International Islamic University Malaysia |b xKulliyyah of Engineering | |
| 856 | 1 | 4 | |u http://studentrepo.iium.edu.my/handle/123456789/11279 |
| 900 | |a sz to asbh | ||
| 942 | |2 lcc |n 0 |c THESIS | ||
| 999 | |c 512791 |d 544208 | ||
| 952 | |0 0 |1 0 |2 lcc |4 0 |7 5 |8 IIUMTHESIS |9 1010229 |a IIUM |b IIUM |c THESIS |d 2023-01-11 |e MGIFT |p 11100453917 |r 2023-01-11 |w 2023-01-11 |y THESIS | ||