By Topic

Neighbourhood information dissemination in the star graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fujita, S. ; Dept. of Electr. Eng., Hiroshima Univ., Japan

This paper studies two neighborhood information dissemination problems in the star graph (n-star): The neighborhood broadcast problem (NBP) is the problem of disseminating a message from the source vertex to all the vertices adjacent to the source vertex and the neighborhood gossiping problem (NGP) is the problem of exchanging messages among all neighboring vertices in the given graph. We propose two neighborhood information dissemination schemes in n-star under the single-port, half-duplex model: The first scheme completes a neighborhood broadcast in 1.5 log2 n+O(1) time units and the second scheme completes a neighborhood gossiping in 2.88 log2 n+o(logn) time units. We also derive a lower bound on the neighborhood gossiping of 2.88 log 2 n+O(1) time units, which implies that the latter scheme is optimal with respect to the leading term

Published in:

Computers, IEEE Transactions on  (Volume:49 ,  Issue: 12 )