检索结果-内蒙古大学图书馆

A distributed broadcast algorithm for wireless mobile ad hoc networks

13th International Multimedia Modeling Conference (MMM 2007)

作者： Li Layuan Zheng Feng Li Chunlin Sun Qiang Wuhan Univ Technol Sch Comp Sci Wuhan 430063 Peoples R China

ISBN: (纸本)9783540694281

In Wireless mobile ad hoc networks, many unicast and multicast protocols depend on broadcast mechanism to finish control and route establishment functionality. In a straightforward broadcast by flooding, each node will retransmit a message to all it neighbors until the message has been propagated to the entire network. So it will become very inefficient and will be easy to result the broadcast storm problem. Thus an efficient broadcast algorithm should be used to less the broadcast storm caused by broadcast. Due to the dynamic nature of ad hoc networks, global information of the network is difficult to obtain, so the algorithm should be distributed. In this paper, a distributed heuristic-based algorithm is presented. The algorithm is based on joint distance-counter threshold scheme. It runs in a distributed manner by each node in the network without needing any global information. Each node in an ad hoc network hears the message from its neighbors and decides whether to retransmit or not according to the signal strength and the number of the receiving messages. By using the JDCT algorithm, it's easy to find the nodes that consist of the vertices of the hexagonal lattice to cover the whole networks. The algorithm is very simple and it is easy to operate and has a good performance in mobile wireless communication environments. A comparison among several existing algorithms is conducted. Simulation results show that the new algorithm is efficient and robust.

关键词： ad hoc networks broadcast algorithm wireless networks broadcast storm

来源：评论

学校读者我要写书评

暂无评论

A Reliable broadcast algorithm with Multiple-Opportunity Acknowledgement in Internet of Vehicles

A Reliable Broadcast Algorithm with Multiple-Opportunity Ack...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)

作者： Liu, Pengxue Zhang, Dalong Li, Yitong Shi, Shijie Kong, Cuiping Zhengzhou Univ Sch Informat Engn Zhengzhou Peoples R China China Minsheng Bank Beijing Peoples R China

ISBN: (纸本)9781728125428

With the rapid development of information and communication technologies, Internet of Vehicles (IoV) will become more common globally. As most of the envisioned services provided by IoV require the information dissemination and exchange among vehicles, it is of great importance to design a high-reliable and low-redundancy data dissemination algorithm for IoV applications. In this paper, we propose a reliable broadcast algorithm with multiple-opportunity acknowledgement (MOA), which can improve the reliability of data dissemination process by implementing the MOA mechanism and reduce the redundant retransmissions caused by broadcast. Simulation results shows that our proposed broadcast algorithm is superior to the flooding algorithm in terms of packet delivery ratio, broadcast overhead and dissemination delay.

关键词： broadcast algorithm Acknowledgement mechanism IoV

来源：评论

学校读者我要写书评

暂无评论

A Novel broadcast algorithm of Wireless Sensor Networks Based on Multiple Objective Programming and Genetic algorithm

引用

International Conference on Mechanical Engineering, Industry and Manufacturing Engineering (MEIME 2011)

作者： Liu, ZhanJun Liang, ChengChao Wang, Yang Ren, Cong Chongqing Univ Posts & Telecommun Key Lab Mobile Commun Technol Chongqing 400065 Peoples R China

ISBN: (纸本)9783037851371

Considering the restriction of physical resource and the environment, we propose a new broadcast path algorithm based on genetic algorithm and ideal point model. The proposed algorithm combines multiple constrains and utilizes the advantages of genetic algorithm in multiple objective programming. Simulation results show that the proposed algorithm reveal better performance on efficiency resource utilization.

关键词： Wireless Sensor Networks broadcast algorithm Multiple Objective Programming Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Blockchain Network Communication Architecture Based on Information-Centric Networking

引用

APPLIED SCIENCES-BASEL 2025年第6期15卷 3340-3340页

作者： Zhou, Yufei Han, Rui Li, Yang Chinese Acad Sci Inst Acoust Natl Network New Media Engn Res Ctr 21 North Fourth Ring Rd Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Elect Elect & Commun Engn 19 A Yuquan Rd Beijing 100049 Peoples R China

Blockchain technology, as a distributed ledger technology, is becoming increasingly popular in various fields. However, the performance limitations of blockchain networks hinder their further development. Existing research on optimizing blockchain communication mechanisms based on P2P networks is constrained by the end-to-end transmission principles of TCP/IP networks, which lead to network congestion and bandwidth wastage during large-scale blockchain content distribution. Meanwhile, studies on ICN-based blockchain systems primarily focus on blockchain communication protocol implementation and compatibility within ICN/NDN networks. However, research on blockchain communication mechanisms in hybrid IP/ICN networking environments remains limited, failing to fully leverage ICN's advantages to enhance the communication efficiency of existing blockchain P2P networks. To address this issue, this paper proposes BLOCK-ICN, an ICN-based blockchain network communication architecture compatible with IP networks. BLOCK-ICN enables ICN nodes with computing and storage capabilities to deploy blockchain applications, while maintaining compatibility with P2P networks. By leveraging ICN multicast technology, the architecture provides relay acceleration services for blockchain data dissemination. Specifically, in terms of network topology, BLOCK-ICN classifies network domains based on delay information provided by an enhanced resolution system and establishes select domain gateways based on data flow forwarding dependencies, thereby constructing a hierarchical and structured relay network topology. Regarding the broadcast protocol, ICN nodes perform parallel broadcasting via ICN multicast, and upon receiving messages, they further disseminate them to P2P nodes, reducing the overall network broadcast latency and bandwidth consumption. We extended SimBlock to implement and evaluate BLOCK-ICN. Simulation results demonstrated that, in a Bitcoin network with 16,000 nodes and an ICN node

关键词： blockchain information-centric networking P2P network network partition broadcast algorithm

来源：评论

学校读者我要写书评

暂无评论

Realizing and benchmarking broadcast algorithms in wireless mesh networks

引用

COMPUTER COMMUNICATIONS 2011年第10期34卷 1169-1181页

作者： Lin, Ying-Dar Chang, Shun-Lee Tao, Shi-Hung Yeh, Jui-Hung Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

broadcasting by flooding causes the broadcast storm problem in multi-hop wireless networks. This problem becomes more likely in a wireless mesh network (WMN) because WMNs can bridge wired LANs. increasing broadcast traffic and collision probability. Since the network control, routing, and topology maintenance of a WMN highly rely on layer-2 broadcasting, unreliable broadcast algorithms directly destabilize a WMN. Researchers have developed many algorithms for efficient and reliable broadcast in multi-hop wireless networks. However, real-world systems rarely verify or compare these approaches, especially in a WMN. This paper examines six representative broadcast algorithms: simple flooding, dynamic probabilistic, efficient counter-based broadcast, scalable broadcast, domain pruning, and connected-dominating-set based algorithms. This study addresses both common and algorithm-specific implementation in a real-world IEEE 802.11s WMN testbed. Experiments under various topologies and packet lengths reveal the reliability, forwarding ratio, and efficiency of these six algorithms. Quantitative survey results indicate that the scalable broadcast algorithm possesses the best reliability due to its lower collision probability. The domain-pruning algorithm is the most efficient algorithm when considering both reliability and the forwarding ratio. (C) 2010 Elsevier B.V. All rights reserved.

关键词： broadcast algorithm Multi-hop wireless networks Mesh networks 802.11s WMN

来源：评论

学校读者我要写书评

暂无评论

Six-Shot broadcast: A Context-Aware algorithm for Efficient Message Diffusion in MANETs

Six-Shot Broadcast: A Context-Aware Algorithm for Efficient ...

引用

On the Move Confederated International Conference and Workshops

作者： Garbinato, Benoit Holzer, Adrian Vessaz, Francois Univ Lausanne Lausanne Switzerland

ISBN: (纸本)9783540888703

In this paper, we introduce six-shot broadcast (M), a new context-aware message diffusion algorithm that uses location information to fine-tune its broadcasting process. Message diffusion is indeed one of the core challenges brought up by distributed systems and has therefore largely been studied in the context;of traditional network structures such as the Internet, With the emergence of mobile ad hoc networks (MANETs), new broadcasting algorithm especially geared at these networks have been introduced. These algorithms must reach two conflicting objectives when broadcasting a message, namely reliability vs. efficiency. That is, they must maximize the number of nodes that deliver the message (reliability), while minimizing the number of nodes that forward the message (efficiency). In recent;years as more and more mobile devices have become context-aware, several broadcasting algorithms have been introduced using contextual information, such is location, in order to increase reliability and efficiency. Along that line, we provide a in-depth performance evaluation of our 6SB algorithm, by comparing it to similar broadcasting algorithms also targeted at MANETs. Our results show that 6SB competes with the most efficient algorithms in high densities of nodes and offers increased reliability in low densities at a reasonable overhead.

关键词： MANETs broadcast algorithm context-aware systems

来源：评论

学校读者我要写书评

暂无评论

Optimal broadcasting for locally twisted cubes

引用

INFORMATION PROCESSING LETTERS 2012年第4期112卷 129-134页

作者： Yang, Xiaofan Wang, Lei Yang, Luxing Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Chongqing Univ Coll Math & Stat Chongqing 400044 Peoples R China

This paper addresses the single node broadcast problem over a locally twisted cube (LTQ). The broadcast algorithm proposed for this problem uses a new broadcast tree construction which can run in time O (N log N) where N = 2(n) is the number of the nodes in LTQ. The broadcast tree turns out to be optimal in terms of the number of transmission steps. To the best of our knowledge, it is the first time to present an optimal broadcast algorithm for LTQ. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Interconnection networks Locally twisted cubes broadcast algorithm Optimal broadcast tree

来源：评论

学校读者我要写书评

暂无评论

Towards a Trust-Enhanced Blockchain P2P Topology for Enabling Fast and Reliable broadcast

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2020年第2期17卷 904-917页

作者： Hao, Weifeng Zeng, Jiajie Dai, Xiaohai Xiao, Jiang Hua, Qiang-Sheng Chen, Hanhua Li, Kuan-Ching Jin, Hai Huazhong Univ Sci & Technol Serv Comp Technol & Syst Lab Natl Engn Res Ctr Big Data Technol & Syst Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cluster & Grid Comp Lab Wuhan 430074 Peoples R China Providence Univ Dept Comp Sci & Informat Engn Taichung 43301 Taiwan

Blockchain technology offers an intelligent amalgamation of distributed ledger, Peer-to-Peer (P2P), cryptography, and smart contracts to enable trustworthy applications without any third parties. Existing blockchain systems have successfully either resolved the scalability issue by advancing the distributed consensus protocols from the control plane, or complemented the security issue by updating the block structure and encryption algorithms from the data plane. Yet, we argue that the underlying P2P network plane remains as an important but unaddressed barrier for accelerating the overall blockchain system performance, which can be discussed from how fast and reliable the network is. In order to improve the blockchain network performance about enabling fast and reliable broadcast, we establish a trust-enhanced blockchain P2P topology which takes transmission rate and transmission reliability into consideration. Transmission rate reflects blockchain network speed to disseminate transactions and blocks, and transmission reliability reveals whether transmission rate changes drastically on unreliable network connection. This paper presents BlockP2P-EP, a novel trust-enhanced blockchain topology to accelerate transmission rate and meanwhile retain transmission reliability. BlockP2P-EP first operates the geographical proximity sensing clustering, which leverages K-Means algorithm for gathering proximity peer nodes into clusters. It follows by the hierarchical topological structure that ensures strong connectivity and small diameter based on node attribute classification. Then we propose establishing trust-enhanced network topology. On top of the trust-enhanced blockchain topology, BlockP2P-EP conducts the parallel spanning tree broadcast algorithm to enable fast data broadcast among nodes both intra- and inter- clusters. Finally, we adopt an effective node inactivation detection method to reduce network load. To verify the validity of BlockP2P-EP protocol, we carefully de

关键词： Reliability Peer-to-peer computing Network topology Protocols Topology Clustering algorithms Blockchain peer-to-peer network network clustering trust-enhanced topology broadcast algorithm

来源：评论

学校读者我要写书评

暂无评论

Communication models for a free-space optical cross-connect switch

引用

JOURNAL OF SUPERCOMPUTING 2004年第1期27卷 19-48页

作者： Er-El, D Feitelson, DG Hebrew Univ Jerusalem Sch Engn & Comp Sci IL-91904 Jerusalem Israel

We design and analyze communication algorithms for an optical switch based on the electroholographic effect, that provides capabilities for configuration changes and a limited multicast. As configuration changes incur a high overhead, we suggest the use of a high-speed forwarding unit as part of the network interface. We develop broadcast algorithms that trade off the number of configuration changes and forwarding operations in order to achieve the minimal completion time. For general point-to-point communication, we use the limited multicast to create a spanning topology along which messages can be forwarded. This requires care to avoid collisions, but is still preferable to using configuration changes if the topology is rich enough but still has a low degree.

关键词： all-optical network electroholographic switch circuit switching broadcast algorithm spanning topology collision avoidance forwarding

来源：评论

学校读者我要写书评

暂无评论

Wormhole broadcast in star graph networks

引用

PARALLEL COMPUTING 1998年第8期24卷 1263-1276页

作者： Latifi, S Srimani, PK Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA Univ Nevada Dept Elect Engn Las Vegas NV 89154 USA

We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is derived and efficient algorithms are developed to achieve broadcasting in O(n) communication time in a star graph S-n (with n! nodes which is sublogarithmic in the number of nodes in the network). (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： star graph interconnection network wormhole routing communication complexity broadcast algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：