MARC details
| 000 -LEADER |
| fixed length control field |
04448ntm a2200289 a 4500 |
| 001 - CONTROL NUMBER |
| control field |
vtls000099680 |
| 003 - CONTROL NUMBER IDENTIFIER |
| control field |
KUKTEM |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
| control field |
20251117113326.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
| fixed length control field |
170502t2017 my da f am 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
| International Standard Book Number |
THE0001059(Local) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
| Level of rules in bibliographic description |
201905171315 |
| Level of effort used to assign nonsubject heading access points |
nazirah |
| Level of effort used to assign subject headings |
201710021207 |
| Level of effort used to assign classification |
aishah |
| Level of effort used to assign subject headings |
201710021148 |
| Level of effort used to assign classification |
aishah |
| -- |
201705021050 |
| -- |
saini |
| 040 ## - CATALOGING SOURCE |
| Original cataloging agency |
UMP |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
FSKKP .A23 2017 r Thesis |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
| Personal name |
Abdulsaheb, Ghaida Muttasher |
| 245 13 - TITLE STATEMENT |
| Title |
An enhanced cluster head selection algorithm for routing in mobile AD-HOC network / |
| Statement of responsibility, etc. |
Ghaida Muttasher Abdulsaheb |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
| Place of publication, distribution, etc. |
Kuantan, Pahang : |
| Name of publisher, distributor, etc. |
UMP, |
| Date of publication, distribution, etc. |
2017 |
| 300 ## - PHYSICAL DESCRIPTION |
| Extent |
xvii, 227 p. : |
| Other physical details |
ill. (some col.) ; |
| Dimensions |
30 cm. + |
| Accompanying material |
1 CD ROM |
| 500 ## - GENERAL NOTE |
| General note |
Faculty of Computer Systems and Software Engineering |
| 502 ## - DISSERTATION NOTE |
| Dissertation note |
Thesis (Doctor of Philosophy in Computer Science) -- Universiti Malaysia Pahang – 2017 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
| Bibliography, etc. note |
Bibliography : p. 156-166 |
| 520 3# - SUMMARY, ETC. |
| Summary, etc. |
Mobile Ad hoc networks have become one of the most important kinds of network because of their simple construction, which does not require any pre-fixed infrastructure. Clustering is used to reduce connection load and eliminate the routing traffic that occurs during the discovery route process. The characteristics of MANET have led to many difficulties in partitioning the main networks to a cluster, selecting a node to be the cluster head, and choosing the most suitable route for sending data from a sender to a receiver. This thesis proposes an algorithm for increasing the stability of the cluster by selecting the most stable cluster head, maintaining the cluster structure with minimum maintenance overhead, and finding the best performance routing algorithm for use over MANET. This thesis proposes a cluster based routing protocol, the Enhanced Cluster Routing Protocol (ECRP), which uses a modified cluster formation algorithm to build the cluster structure and select one of the nodes to be the cluster head. The selection of the cluster head is made based on different parameters, which are: storage capacity, load distribution, accumulative time, available power, and node movement. The scale of each node is calculated according to these parameters and the node that contains the highest parameter values is chosen to be the cluster head, which is used to decide the route and the management process for all other nodes in the cluster. An algorithm for cluster maintenance is proposed that categorizes and recovers errors according to their type. The cluster maintenance stage ensures proper delivery when sending packets, which covers link failure, node movement, cluster head movement, ordinary nodes becoming the cluster head, two nodes needing to be the cluster head, and node shutdown. The routing discovery process is divided into two stages: intra-cluster routing discovery and inter-cluster routing discovery. Intra cluster routing is defined as routing within the same cluster. Inter-cluster routing corresponds to routing between two clusters using a Global Positioning System (GPS). A model for the Ad hoc network was simulated with various cluster scenarios. The effect of changes in movement (speed) and node density (number of nodes) on the performance of the proposed routing protocols was measured. The performance of ECRP algorithms was compared with other cluster based algorithms. The results show that the ECRP algorithms is more stable and effective than existing solutions as shown in the final trust scores for throughput, packet delivery ratio, end to end delay, number of dropped packets, and normalized control overhead. The simulation results show that the ECRP increases throughput and the packet delivery ratio. The end to end delay, the number of dropped packets, and normalized control overhead was reduced.The results presented in this thesis are significant in terms of making clustering algorithms acceptable to users and improving the performance of cluster formations, maintenance and routing algorithms over MANET. Results indicate that the ECRP can achieve at least a 5% to 10% improvement compared with other cluster based algorithms. |
| 610 20 - SUBJECT ADDED ENTRY--CORPORATE NAME |
| Corporate name or jurisdiction name as entry element |
Faculty of Computer Systems and Software Engineering |
| General subdivision |
Dissertations |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name entry element |
Universities and Colleges |
| General subdivision |
Dissertations |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name entry element |
Theses |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
| Uniform Resource Identifier |
<a href="http://ecollib.ump.edu.my/25913/">http://ecollib.ump.edu.my/25913/</a> |
| Public note |
Access in library only |