Document Details
|
Document Type |
: |
Thesis |
|
Document Title |
: |
EFFICIENT AND FAIR SELECTION FOR CONTENT DISTRIBUTION IN MOBILE AD-HOC NETWORKS إختيار خلية لتوزيع المحتويات بطريقة عادلة و معتمدة في ال Mobile Ad-hoc Networks |
|
Subject |
: |
Faculty of Computing and Information Technology |
|
Document Language |
: |
Arabic |
|
Abstract |
: |
Mobile Ad-hoc networks (MANETs) are types of wireless networks, which are widely used nowadays, especially with the increasing demand for mobile devices. Deriving solutions in MANETs are quite challenging due to its characteristics, including their decentralized nature, lack of energy, lack of fixed infrastructure, topological changes and limited resources. MANETs are self-organized networks with no control over wireless links. With the absence of a centralized authority, wireless nodes can join randomly and arbitrary. The dynamic changes of MANET's topology results in more opportunities for the malicious nodes to attack.
MANET's routing protocols design is quite challenging process. All wireless nodes in MANET are assumed to be trusted, cooperative and participate in routing processes. MANETs are vulnerable to number of misbehaving /Untrustworthy nodes that could disturb either routing (malicious) or do not get involved in the network activity (selfish). As a consequent, leads to unsecure and/or uncooperative routing paths. Trust management schemes were proposed to establish secure paths and to avoid such nodes. MANETs are also expose to link breakage due to nodes high mobility speed. Moreover, nodes fast disconnection caused by its limited energy increases the overhead and cost in routing discovery process.
There are number of research implemented for selecting next-hop node in routing. With the intensions of enhancing routing operations, , security, decreasing routing packets overhead, better network performance or increasing network life time . In this thesis, it is propose a node selection Algorithm enhancing the reactive routing protocol Ad-hoc On-demand Distance Vector (AODV). It uses and combine three factors: node's trustworthiness, node's energy and node's mobility. The objective is to select the reliable next-hop node with the one goal of establishing a secure and cooperative routing path. Which is accomplish by excluding nodes that are having low energy, high mobility or misbehaving. Moreover, to achieve fairness, by promoting balanced use of resources among the participating nodes by avoiding always select high trusted nodes and involve other nodes with acceptable trust in the routing path as well. On other words, to achieve load balancing. Furthermore, to achieve efficiency by incorporating energy aware node's selection to minimize network path failures. The proposed algorithm achieved better network performance regarding more packet delivery ratio and less end-to-end delay less than the original AODV and TE-AODV in literature. On the other hand, achieved higher average energy consumptions more than both of them. Yet obviously increase bandwidth utilization according to minimizing number of route requests sent across the MANET |
|
Supervisor |
: |
Dr. Etimad Fadel |
|
Thesis Type |
: |
Master Thesis |
|
Publishing Year |
: |
1442 AH
2020 AD |
|
Added Date |
: |
Saturday, December 12, 2020 |
|
Researchers
| روان صالح حسوبه | Hassoubah, Rawan Saleh | Researcher | Master | |
|
Back To Researches Page
|