## NTRS

## NTRS - NASA Technical Reports Server

Back to ResultsTopology for efficient information dissemination in ad-hoc networkingIn this paper, we explore the information dissemination problem in ad-hoc wirless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bould relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of such events is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination.Document Type

Conference Paper

Authors

Jennings, E.

Okino, C. M.

Date Acquired

August 23, 2013

Publication Date

July 14, 2002

Distribution Limits

Public

visibility_off