Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/15481
Title: Reducing broadcast overhead using optimum density based model for probability flooding in MANET
Researcher: Karthikeyan N
Guide(s): Duraiswamy K
Keywords: Mobile Adhoc NETwork(MANET), Dynamic Source Routing, Adhoc On demand Distance Vector, Destination Sequenced Distance Vector, Wireless Network
Upload Date: 30-Jan-2014
University: Anna University
Completed Date: 
Abstract: Mobile Ad hoc NETwork (MANET) is a wireless network which consists of mobile devices such as cell phones, personal digital assistants and laptops which are portable and it can cooperate in relaying packets on behalf of one another. Broadcasting is a technique of transmitting a message from a source host to all other hosts in the MANET, which is mainly used in many routing protocols for route discovery process. The evaluation is made on the three routing protocols namely Dynamic Source Routing (DSR), Adhoc On demand Distance Vector (AODV), and Destination Sequenced Distance Vector (DSDV). In simple flooding, each node retransmits every unique received packet only once. Packets that have already been received are just discarded. In this scheme, the total number of rebroadcasts is equal to N-1, where N is the total number of mobile nodes in the network. In the fixed probabilistic method (probabilistic approach), a host rebroadcasts the message with fixed probability p. The probability flooding is similar to the flooding except that nodes rebroadcast with a predetermined probability. In this method, when a node is receiving a broadcast message for the first time it rebroadcasts the message with a predetermined probability so that every node has the same probability to rebroadcast the message regardless of its number of neighbours. The deterministic approach namely cluster based broadcasting method has been evaluated with respect to the performance metrics such as MAC load, routing load, power consumption and packet collision. In general, the wireless network is classified into two types namely dense network and sparse network which are based on the number of nodes located in the network. In FR-DSDV, if the density of the node is high, then the probability value for broadcasting the route update messages will be lesser for reducing the broadcast overhead. On the other side, if the density of the node is less, then the probability value will be higher for better reachability to the neighboring nodes. newline newline newline
Pagination: xxii, 152
URI: http://hdl.handle.net/10603/15481
Appears in Departments:Faculty of Science and Humanities

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File49.57 kBAdobe PDFView/Open
02_certificates.pdf833.53 kBAdobe PDFView/Open
03_abstract.pdf21.04 kBAdobe PDFView/Open
04_acknowledgement.pdf13.55 kBAdobe PDFView/Open
05_contents.pdf43.86 kBAdobe PDFView/Open
06_chapter 1.pdf344.17 kBAdobe PDFView/Open
07_chapter 2.pdf768.33 kBAdobe PDFView/Open
08_chapter 3.pdf423.79 kBAdobe PDFView/Open
09_chapter 4.pdf128.54 kBAdobe PDFView/Open
10_chapter 5.pdf20.45 kBAdobe PDFView/Open
11_references.pdf29.22 kBAdobe PDFView/Open
12_publications.pdf16.56 kBAdobe PDFView/Open
13_vitae.pdf11.78 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.