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

Electronics and Communications in Japan (Part I: Communications) Pub Date : 2007-01-08 DOI:10.1002/ecja.20351

Kenji Ohtsuka, Taku Ishihara, Shigeo Shioda

{"title":"A proposal for an efficient message-flooding scheme using a link-cut technique","authors":"Kenji Ohtsuka, Taku Ishihara, Shigeo Shioda","doi":"10.1002/ecja.20351","DOIUrl":null,"url":null,"abstract":"<p>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 <i>link-cut technique</i>); 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</p>","PeriodicalId":100405,"journal":{"name":"Electronics and Communications in Japan (Part I: Communications)","volume":"90 5","pages":"11-22"},"PeriodicalIF":0.0000,"publicationDate":"2007-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecja.20351","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics and Communications in Japan (Part I: Communications)","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ecja.20351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

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

查看原文本刊更多论文

提出了一种使用链路切断技术的高效消息泛洪方案

我们提出了一种有效的消息泛洪方案，旨在减少通过网络传输的消息数量。所提出的方法包括预先将双向链路转换为单向链路(在本文中我们将其称为链路切断技术);通过避免消息链路冲突，我们的目标是减少传输的消息数量，并且通过合并超时事务，与标准泛洪方法相比，我们能够将消息数量减少50%，同时保持100%的传递成功率。此外，我们在模拟中表明，通过利用有关每个节点的传出链路数量(相邻节点的数量)的信息，我们能够减少发送的消息数量，同时限制消息传输时间的增长。©2007 Wiley期刊公司电子工程学报，2009,29 (5):1104 - 1104;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecja.20351

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronics and Communications in Japan (Part I: Communications)

自引率

0.00%

发文量