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

Analyzing the Effectiveness of TCA-CBB by Comparing Various VANET broadcasting algorithms in Terms of Quality of Service

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第1期124卷 261-282页

作者： Sumithra, S. Vadivel, R. Bharathiar Univ Dept Informat Technol Coimbatore Tamil Nadu India

broadcasting on Vehicular Ad Hoc Networks (VANET) is quickly becoming a hot topic. One of the complications presented by this topic is that it is limited to Vehicle-to-Vehicle (V2V) situations rather than employing communications networks (such as broadband connections). Intelligent Transportation Systems (ITS) are primarily focused on the distribution of emergency messages as well as basic information. The IEEE has recognized Wireless Access in Vehicular Environment (WAVE) as the standard for this message distribution. IEEE 802.11p and Dedicated Short Range Communication (DSRC) are two Medium Access Control (MAC) layer protocols supported by this WAVE. At high vehicle density scenarios, the increasing rate of broadcasting will slow down the performance of the broadcasting method and increase the packet loss ratio. In this paper, various broadcasting algorithms are compared in terms of Quality of Service (QoS) to analyze the best algorithm which achieves high packet delivery ratio and improve the performance at high vehicle density scenario. A new broadcasting algorithm Traffic Condition Aware Customized Beacon broadcasting (TCA-CBB) method is introduced and compared with other methods. At the end of the performance evaluation between the broadcasting methods, it is proved that the proposed TCA-CBB algorithms shows best results.

关键词： broadcasting algorithm Beacons WAVE DSRC Vehicular Ad-Hoc Network ITS

来源：评论

学校读者我要写书评

暂无评论

RVCCC: A new variational network of cube-connected cycles and its topological properties

引用

THEORETICAL COMPUTER SCIENCE 2019年 767卷 34-50页

作者： Zhang, Zhen Huang, Shu-qiang Guo, Dong Li, Yong-Hui Jinan Univ Dept Comp Sci Guangzhou 510632 Guangdong Peoples R China Jilin Univ Minist Educ Lab Symbol Computat & Knowledge Engn Changchun 130012 Jilin Peoples R China Jinan Univ Dept Optoelect Engn Guangzhou 510632 Guangdong Peoples R China Univ Sydney Sch Elect & Informat Engn Sydney NSW 00026A Australia

The CCC(r, n) network is an extension of the hypercube which replaces each vertex with a cycle of length n, providing that the hypercube is r-dimensional. When n > r, the CCC(r, n) network contains more vertices than that of CCC(r, r), which makes it more useful in the construction of a large-scale interconnection network. However, the CCC(r, n) is irregular when n > r, which makes their properties difficult to be analyzed. In this paper, we propose a new variational network of the cube-connected cycles (RVCCC). The RVCCC networks have the properties of regularity, vertex-symmetry, and low diameter. Compared with the general CCC networks, the RVCCC networks are more suitable for constructing a large-scale interconnection network. After the shortest internode distance between any two vertices in the RVCCC was determined, the exact diameter of this network was calculated and the communication algorithms, including the routing algorithm and the broadcasting algorithm, were also developed. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Cube-connected cycles Shortest internode distance Diameter Routing algorithm broadcasting algorithm

来源：评论

学校读者我要写书评

暂无评论

Distance and Energy-Balance based Reliable Broadcast in Mobile Ad Hoc Networks

Distance and Energy-Balance based Reliable Broadcast in Mobi...

引用

International Conference on Wireless Communication and Sensor Network (WCSN)

作者： Wang, Xiao-yan Yu, Yan-ping Liu, Xin-xin Ning, Dong-sheng Liu, Ke-yan Yu, Yan Zhejiang Gongshang Univ Coll Informat & Elect Engn Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781479970919

broadcasting is the most common operation of data transmission in mobile Ad Hoc networks. The conventional blind flooding algorithm incurs the broadcast storm problem. Moreover, energy is critical for the life and the performance of Ad Hoc networks. In order to alleviate the broadcast storm, balance the node energy in network and provide broadcast reliability, a reliable broadcasting algorithm based on the distance and the energy balance is proposed in this paper. In this algorithm, a node determines the distance to the immediate previous neighbor node by obtaining the information of neighbor node from the received data packets. Then a node will schedule the forwarding in a time-division manner according to its forwarding priority which is determined by the distance to the immediate previous node and its own residual energy. To provide reliable broadcast, the algorithm also adopts retransmission mechanism utilizing broadcast packets to acknowledge those packets correctly received instead of acknowledgement packets such as ACK. Simulation results show that this algorithm achieves high arrival rate and lower latency. Meanwhile, it can balance energy consumption of the nodes in a network and prolong the network lifetime.

关键词： Mobile Ad Hoc networks broadcast storm reliable broadcast based on distance energy balance broadcasting algorithm

来源：评论

学校读者我要写书评

暂无评论

broadcasting algorithms of Carbon Nanotubes

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2011年第4期8卷 554-562页

作者： Manuel, Paul Guizani, Mohsen Kuwait Univ Dept Informat Sci Safat 13060 Kuwait

A carbon nanotube is like a cylinder rolled up from a single sheet of graphite, whose atoms are arranged in hexagons. It is expected that nanotechnology will revolutionize the computing, networking and telecommunication industries by producing faster and smaller non-silicon-based chipsets, memory, processors, and new-generation computers based on carbon nanotubes. Computer scientists predict that nano-computers will radically transform the computer industry in the coming years. The next target of computer engineers and scientists is parallel processors using nanotechnology. Nano-computing which is the computational aspect of nano architectures is an emerging technology and is at the early stage of its development. Keeping these latest trends in mind, we propose to study the computational aspects of nanotechnology-based fixed interconnection networks. In this paper, carbon nanotube is proposed as a new fixed interconnection architecture. The structural properties of carbon nanotube networks are studied. One of the important features of a "good" interconnection network is that it is "communication-friendly topological structure." A routing algorithm in a communication friendly topological structure helps to exchange messages between any two processors without any bottlenecks. This paper provides a broadcasting algorithm which runs in optimal time plus 1. Another interesting attribute of an interconnection network is service-facility design which is also called domination problem. This paper exhibits that carbon nanotube architecture is communication-friendly and service-facility-friendly.

关键词： Carbon Nanotubes Fixed Interconnection Network broadcasting algorithm Domination Problem NP-Complete

来源：评论

学校读者我要写书评

暂无评论

Distributed Energy Self-Adaptation in ad hoc Networks

Distributed Energy Self-Adaptation in ad hoc Networks

引用

Globecom Workshops

作者： Ruiz, Patricia Bouvry, Pascal Univ Luxembourg Luxembourg Luxembourg

ISBN: (纸本)9781424488650

Nowadays energy management is a key feature in many different fields, specially in mobile ad hoc networks where devices heavily rely on the battery life, thus, the network survival is absolutely related to the energy consumption of nodes. In this work, we present a broadcasting algorithm AEDB that not only tries to reduce the network but also the device resources. AEDB is an extension of EDB which is a distance based and also energy aware broadcasting algorithm. The new proposed scheme, AEDB, regulates the transmission power of the device in order to decrease the energy consumption with no detriment of the performance of the algorithm. This is done by managing the transmission power of the device in terms of the number of one hop neighbors for disseminating a message. Results show that by adaptively managing the transmission power, the energy the device uses is highly reduced obtaining at the same time, good performance in terms of both the coverage achieved and the broadcast time.

关键词： broadcasting algorithm distributed energy self-adaptation energy consumption energy management energy management systems mobile ad hoc networks mobile ad hoc networks power aware computing telecommunication network management transmission regulation

来源：评论

学校读者我要写书评

暂无评论

An optimal-broadcasting algorithm for pyramid networks

An optimal-broadcasting algorithm for pyramid networks

引用

9th World Multi-Conference on Systemics, Cybernetics and Informatics

作者： Hsieh, Hsien-Jone Duh, Dyi-Rong Natl Chi Nan Univ Dept Comp Sci & Informat Engn Nantou 545 Hsien Taiwan

ISBN: (纸本)9789806560543

For interconnection networks, designing optimal broadcasting algorithms is in general more difficult than designing simple broadcasting algorithms. In this paper, broadcasting on pyramid networks is discussed. The proposed broadcasting algorithm is optimal with respect to message complexity and transmission delay. Base on this algorithm, (1) the height of the broadcasting trees do not exceed the diameter, (2) each node can receive the message from the source node via a shortest path, (3) each node receives the message exactly once, and (4) each node takes O(1) time to confirm the next nodes along shortest paths without any centralized controller.

关键词： broadcasting algorithm interconnection networks pyramid networks shortest path routing algorithm and transmission delay

来源：评论

学校读者我要写书评

暂无评论

High-Performance broadcasting algorithms on Cluster

引用

Tsinghua Science and Technology 2004年第1期9卷 30-37页

作者：舒继武魏英霞王鼎兴 Department of Computer Science and Technology Tsinghua University Beijing 100084 China

In many clusters connected by high-speed communication networks, the exact structure of the underlying communication network and the latency difference between different sending and receiving pairs may be ignored when they broadcast, such as in the approach adopted by the broadcasting method in MPICH, a widely used MPI implementation. However, the underlying network cluster topologies are becoming more and more complicated and the performance of traditional broadcasting algorithms, such as MPICHs MPI_Bcast, is far from good. This paper analyzed the impact of communication latencies and the underlying topologies on the performance of broadcasting algorithms for multilevel clusters. A multilevel model was developed for broadcasting in clusters with complicated topologies, which divides the cluster topology into many levels based on the underlying topology. The multilevel model was used to develop a new broadcast algorithm, MLM broadcast-2 (MLMB-2), that adapts to a wide range of clusters. Comparison of the performance of the counterpart MPI operation MPI_Bcast and MLMB-2 shows that MLMB-2 outperforms MPI_Bcast by decreasing the broadcast running time by 60%-90%.

关键词： broadcasting algorithm communication latency high-speed communication networks cluster computing

来源：评论

学校读者我要写书评

暂无评论

Novel hierarchical interconnection networks for high-performance multicomputer systems

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2004年第6期20卷 1213-1229页

作者： Jan, GE Hwang, YS Lin, MB Liang, D Natl Taipei Univ Dept Comp Sci San Shia 237 Taiwan Natl Taiwan Ocean Univ Dept Comp Sci Chilung 202 Taiwan Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106 Taiwan

This paper proposes several novel hierarchical interconnection networks based on Heawood graphs, namely, folded Heawood networks, root-folded Heawood networks, recursively expanded Heawood networks, and flooded Heawood networks. Like hypercubes and networks extended from Petersen networks, these hierarchical Heawood networks have the following properties: regular topology, high scalability, and small diameter. Due to these important properties, these hierarchical Heawood networks seem to have potential as alternatives for future interconnection structures of multicomputer systems. Furthermore, this paper will demonstrate that the routing and broadcasting algorithms for these proposed networks are as elegant as the algorithms for hypercubes and Petersen-based networks.

关键词： broadcasting algorithm routing algorithm Heawood graph Heawood networks folded Heawood networks root-folded Heawood networks recursively expanded Heawood networks flooded Heawood networks

来源：评论

学校读者我要写书评

暂无评论

Fully connected cubic network applied in parallel processing

Fully connected cubic network applied in parallel processing

引用

IEEE Region 10 Technical Conference on Computers, Communications, Control and Power Engineering

作者： Wang, HY Gu, WK Chang, RKC Zhejiang Univ Dept Informat & Elect Engn Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)0780374908

The paper introduces the application of FCCN (Fully Connected Cubic Network) topology in massively parallel processing systems. Because of the simple self-routing algorithm, small diameter and average number of internode distance, the fault-tolerance, FCCN can act as a high performance interconnection network in the massively parallel processing systems Moreover, Hypercube can be embedded in FCCN nature, so that FCCN will implement all developed parallel algorithms for Hypercube easily and efficiently. And the broadcasting algorithm of FCCN is proposed.

关键词： fully connected cubic network parallel processing broadcasting algorithm

来源：评论

学校读者我要写书评

暂无评论

Fully Connected Cubic Network Applied in Parallel Processing

Fully Connected Cubic Network Applied in Parallel Processing

引用

2002年IEEE十区计算机、通信、控制和电机工程会议

作者： Rocky K.C.Chang Dept. of Computing The Hong Kong Polytechnic University Hung Hom Kowloon

The paper introduces the application of FCCN(Fully Connected Cubic Network) topology in massivelyparallel processing systems. Because of the simpleself-routing algorithm, small diameter and averagenumber of internode distance, the fault-tolerance, FCCNcan act as a high performance interconnection network inthe massively parallel processing systems. Moreover,Hypercube can be embedded in FCCN nature, so thatFCCN will implement all developed parallel algorithmsfor Hypercube easily and effciently. And the broadcastingalgorithm of FCCN is proposed.

关键词： Fully Connected Cubic Network parallel processing broadcasting algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：