Award Date

1-1-2008

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Committee Member

Ajoy K. Datta

Number of Pages

46

Abstract

A major challenge faced in MANETs is locating the devices for communication, especially with high node mobility and sparse node density. Present solutions provided by the ad hoc routing protocols range from flooding [1] the entire network with route requests, to deploying a separate location management scheme to maintain a device location database. Many applications as well as various unicast routing protocols such as Dynamic Source Routing (DSR), Ad Hoc On Demand Distance Vector (AODV), Zone Routing Protocol (ZRP), and Location Aided Routing (LAR) use broadcasting or a derivation of it. Flooding, which is often deployed to achieve the above objective, is expensive in terms of overhead and wastes valuable resources such as bandwidth and power. We propose to develop a strategy to reduce the redundant transmission of packets in normal flooding used in broadcasting, and we describe strategies for choosing only an optimal set of nodes for rebroadcast in a grid network. The main contribution is to reduce the redundant transmission of packets and to forward packets with minimum transmissions. To determine the minimal set of nodes for efficient transmission, we propose a new algorithm, Efficient Broadcasting by Selective Forwarding, using a distance-based approach; The distance-based approach [2] is implemented for broadcast and rebroadcast to a set of nodes with the help of a threshold value [3] that is taken to be threshold = n* transmission-radius, where n is a real number. This reduces the number of redundant transmission. This threshold value can be tuned to show performance enhancement.

Keywords

Broadcasting; Efficient; Forwarding; Selective

Controlled Subject

Computer science

File Format

pdf

File Size

860.16 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Rights

IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Download


Share

COinS