Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/15480
Title: Effective cluster based techniques for improving networking functions of mobile ad hoc networks
Researcher: Karunakaran S
Guide(s): Thangaraj P
Keywords: Mobile Adhoc Network, Adaptive Weighted Cluster Based Routing, Cluster Based Service Discovery, clusterhead, Cluster Based Congestion Control algorithm
Upload Date: 30-Jan-2014
University: Anna University
Completed Date: 
Abstract: Mobile Ad-hoc Network (MANET) consists of mobile nodes interconnected by wireless multi-hop communication paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastructure or administrative support. In the present thesis, four cluster based techniques have been proposed for improving the performance of MANET by enhancing its key networking functions along with effective clusterhead selection. The existing cluster based routing algorithms suffer from frequent change of clusterheads, resulting in the failure of sessions and network partitions. The proposed Adaptive Weighted Cluster Based Routing (AWCBRP) algorithm amends swiftly to the topological changes and accomplishes the routing efficiently with improved packet delivery ratio and minimized end-to-end delay. A Cluster-Based Service Discovery (CBSD) algorithm has been developed to achieve efficient service identification by using reliable clusterhead. A Cluster Based Congestion Control (CBCC) algorithm has been developed to support congestion control using scalable and distributed cluster based approach. The co-operation among the cluster nodes is achieved by exchanging a small amount of control packets along with the communication paths. AWCBR adapts quickly to the topological changes and establishes the routing efficiently with 97% to 98% of Packet Delivery Ratio (PDR) for 20 to 100 nodes. It improves the packet propagation delay by picking up the efficient routes that satisfies the highest consistency along with loop free attribute from the source node to the destination node and exhibits lowest endto- end delay with 0.04 to 0.11 seconds for 40 to 100 nodes. The TC-EPM algorithm stabilizes the topology of the network by regulating the connectivity power level, so that the nodes converge quickly to a desired topology independently of the initial network state. It achieves 191 nodes to be alive out of 200 nodes for 500 seconds of simulation time. newline newline newline
Pagination: xxi, 153
URI: http://hdl.handle.net/10603/15480
Appears in Departments:Faculty of Science and Humanities

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File33.9 kBAdobe PDFView/Open
02_certificates.pdf614.6 kBAdobe PDFView/Open
03_abstract.pdf19.08 kBAdobe PDFView/Open
04_acknowledgement.pdf13.59 kBAdobe PDFView/Open
05_contents.pdf43.72 kBAdobe PDFView/Open
06_chapter 1.pdf56.5 kBAdobe PDFView/Open
07_chapter 2.pdf83.06 kBAdobe PDFView/Open
08_chapter 3.pdf612.71 kBAdobe PDFView/Open
09_chapter 4.pdf413.09 kBAdobe PDFView/Open
10_chapter 5.pdf414.12 kBAdobe PDFView/Open
11_chapter 6.pdf415.24 kBAdobe PDFView/Open
12_chapter 7.pdf24.93 kBAdobe PDFView/Open
13_references.pdf29.29 kBAdobe PDFView/Open
14_publications.pdf14.62 kBAdobe PDFView/Open
15_vitae.pdf12.75 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: