A proposal for an efficient message-flooding scheme using a link-cut technique

We propose an efficient message-flooding scheme that aims to reduce the number of messages transmitted over the network. The proposed method involves the prior conversion of two-way links into single-way links (in this paper we refer to this as the link-cut technique); by avoiding message link collisions we aim to reduce the number of messages transmitted and by incorporating a time-out transaction, we are able to realize a 50 percent reduction in the number of messages as compared to standard flooding methods while maintaining a delivery success rate of 100 percent. In addition, we show in simulations that by making use of information regarding the number of outgoing links for each node (the number of adjacent nodes), we are able to reduce the number of messages sent while constraining the growth in the message transmission times. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(5): 11–22, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20351