Design route optimization scheme for nested mobile networks /
Due to the fast development of network technologies in the past few years, situations where not only a single node but an entire network roams and changes its point of attachment to the Internet, have been revealed. However, one requirement of a protocol supporting network mobility is to achieve con...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Kuala Lumpur :
Kulliyyah of Engineering, International Islamic University Malaysia,
2015
|
| Subjects: | |
| Online Access: | http://studentrepo.iium.edu.my/handle/123456789/4525 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 033390000a22002770004500 | ||
|---|---|---|---|
| 008 | 170221t2015 my a g m 000 0 eng d | ||
| 040 | |a UIAM |b eng | ||
| 041 | |a eng | ||
| 043 | |a a-my--- | ||
| 050 | |a TK5105.543 | ||
| 100 | 1 | |a Mahmod, Shayma'a Senan | |
| 245 | 1 | |a Design route optimization scheme for nested mobile networks / |c by Shayma'a Senan Mahmod | |
| 260 | |a Kuala Lumpur : |b Kulliyyah of Engineering, International Islamic University Malaysia, |c 2015 | ||
| 300 | |a xvi, 147 leaves : |b ill. ; |c 30cm. | ||
| 502 | |a Thesis (Ph.D)--International Islamic University Malaysia, 2015. | ||
| 504 | |a Includes bibliographical references (leaves 126-132). | ||
| 520 | |a Due to the fast development of network technologies in the past few years, situations where not only a single node but an entire network roams and changes its point of attachment to the Internet, have been revealed. However, one requirement of a protocol supporting network mobility is to achieve continuous and uninterrupted communication to and from all nodes. Network Mobility (NEMO) (RFC3963), developed by Internet Engineering Task Force (IETF), was introduced for this purpose but it still suffers from some limitations, such as pinball routing problem and signaling problem. When the level of nesting increases, these limitations become worse. To overcome these drawbacks, this thesis proposes a route optimization scheme using hierarchical structure with advanced Binding Update List (BUL+). This proposed scheme aims to solve the pinball routing problem (non-optimal routing problem) where packets transmitted from mobile network node have to go through long routing path and visit all home agents of NEMO's mobile routers to reach correspondent node. Moreover, the proposed scheme addresses the binding update storm (signaling problem) to achieve seamless handoff. This can be achieved by building advanced Binding Update List (BUL+) in every mobile router of nested mobile network in order to record the binding update information for all child mobile routers and their mobile network nodes connected to their parent mobile router. The evaluation technique followed in this thesis is by using simulation and mathematical analysis. The simulation carried on by using OPNET to measure performance metrics (based on simulation time) such as delay, throughput, traffic, and response time. In addition to simulation, mathematical analysis has been used to measure performance metrics (based on nesting degree) that are: handoff latency, packet transmission delay, and routing cost. The outcomes of this thesis are developing a scheme that reduces packet transmission delay, handoff latency, and achieves optimal routing | ||
| 596 | |a 1 | ||
| 655 | 7 | |a Theses, IIUM local | |
| 690 | |a Dissertations, Academic |x Kulliyyah of Engineering |z IIUM | ||
| 710 | 2 | |a International Islamic University Malaysia. |b Kulliyyah of Engineering | |
| 856 | 4 | |u http://studentrepo.iium.edu.my/handle/123456789/4525 | |
| 900 | |a sbh-lfr | ||
| 999 | |c 437418 |d 468467 | ||
| 952 | |0 0 |6 T TK 005105.543 M215D 2015 |7 0 |8 THESES |9 760422 |a IIUM |b IIUM |c MULTIMEDIA |g 0.00 |o t TK 5105.543 M215D 2015 |p 11100340939 |r 2017-10-20 |t 1 |v 0.00 |y THESIS | ||
| 952 | |0 0 |6 TS CDF TK 5105.543 M215D 2015 |7 0 |8 THESES |9 853509 |a IIUM |b IIUM |c MULTIMEDIA |g 0.00 |o ts cdf TK 5105.543 M215D 2015 |p 11100340940 |r 2017-10-26 |t 1 |v 0.00 |y THESISDIG | ||