Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/3631
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Trivedi, Maulik | - |
dc.date.accessioned | 2012-07-11T04:40:18Z | - |
dc.date.available | 2012-07-11T04:40:18Z | - |
dc.date.issued | 2012-06-01 | - |
dc.identifier.uri | http://10.1.7.181:1900/jspui/123456789/3631 | - |
dc.description.abstract | Geocasting is a variation on the notion of multicasting. Geocasting is useful for sending messages to nodes in a speci ed geographical region. This region is called the geocast region. This work tries to improve a protocol, named Geo-TORA, for geocasting in mobile ad hoc networks. The modi ed GeoTORA protocol combines routing with clustering to implement geocasting. Thus, GeoTORA requires two phases for routing. First, it divides the group of nodes into regions and then anycasting is performed which is done by modifying the Temporally-Ordered Routing Algorithm (TORA)(unicast) routing protocol. Subsequently clusters are formed within the geocast region to deliver the messages to nodes within the region. This integration of TORA and Clustering can signifi cantly reduce the overhead of control packet overhead, while maintaining reasonable accuracy. Also this Protocol works on large MANET with accuracy and delivers optimized output. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 10MCEC19 | en_US |
dc.subject | Computer 2010 | en_US |
dc.subject | Project Report 2010 | en_US |
dc.subject | Computer Project Report | en_US |
dc.subject | Project Report | en_US |
dc.subject | 10MCE | en_US |
dc.subject | 10MCEC | en_US |
dc.subject | 10MCEC19 | en_US |
dc.title | GeoTORA Optimization | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
10MCEC19.pdf | 10MCEC19 | 903.98 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.