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

COMMENTS ON broadcast algorithms FOR 2-DIMENSIONAL GRIDS

PARALLEL COMPUTING 1991年第1期17卷 109-112页

作者： SIMMEN, M Department of Physics University of Edinburgh Mayfield Road Edinburgh EH9 3JZ Scotland UK

In a recent paper, Saad and Schultz discussed several algorithms for broadcasting data in loosely coupled two-dimensional processor grids. This note disputes a claim made about the performance of one of their algorith... 详细信息

关键词： MULTICOMPUTERS 2-DIMENSIONAL GRIDS COMMUNICATIONS broadcast algorithms

来源：评论

学校读者我要写书评

暂无评论

Revisiting broadcast algorithms for Wireless Edge Networks 38

Revisiting Broadcast Algorithms for Wireless Edge Networks

引用

IEEE 38th International Symposium on Reliable Distributed Systems (SRDS)

作者： Rosa, Andre Costa, Pedro Akos Leitao, Joao Univ Lisbon NOVA LINCS Lisbon Portugal Univ Lisbon DI FCT NOVA Lisbon Portugal

ISBN: (纸本)9781728142227

With the advent of Edge Computing, suitable, practical, and novel abstractions are required for applications to leverage the existing computational power at the edge. In particular, applications in the domains of smart cities and the Internet of Things (IoT) can rely on devices in the vicinity of data consumers and producers for their operation. While these devices are expected to be equipped with wireless radios, network infrastructure might be unavailable in many scenarios. In those cases, devices must rely on wireless ad hoc networks for coordination and cooperation. In this context, one of the most important primitives is the broadcast of messages, that can be leveraged as a building block to devise more complex distributed services and applications. The literature on wireless ad hoc broadcast algorithms is quite vast, with many different algorithms being proposed which explore or combine different techniques or features in their operation. While such protocols are becoming increasingly relevant, understanding how they relate among them is complicated. To address this challenge, in this paper, we introduce a novel framework that allows to abstract the operation of wireless ad hoc broadcast protocols. Leveraging on our framework, we explore a particularly interesting class of these protocols: neighboraware ad hoc broadcast protocols;of which we propose 4 novel protocols. Finally, we rely on a materialization of our framework to implement prototypes of these protocols and experimentally study their performance in a testbed composed of 21 Raspberry Pi 3 - model B.

关键词： broadcast algorithms Wireless ad hoc Reliability Experimental Evaluation

来源：评论

学校读者我要写书评

暂无评论

Survey on broadcast algorithms for Mobile Ad Hoc Networks

引用

ACM COMPUTING SURVEYS 2015年第1期48卷 8-8页

作者： Ruiz, Patricia Bouvry, Pascal Univ Luxembourg Luxembourg Luxembourg Univ Luxembourg Fac Sci Technol & Commun Luxembourg Luxembourg

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades, many works have been proposed trying to make ad hoc networks a reality. The importance of broadcasting in networking and the broadcast nature of the wireless medium have encouraged researchers to join their efforts on designing efficient dissemination algorithms for Mobile Ad Hoc Networks (MANETs). The many different challenges that MANETs face, such as limited network resources, network partitions, or energy restrictions, gave rise to many different approaches to overcome one or more of those problems. Therefore, literature reveals a huge variety of techniques that have been proposed for efficient message dissemination. In this article, we make an in-depth review of the existing state-of-the-art techniques, as well as propose a new taxonomy that provides a global overview of the most relevant existing algorithms.

关键词： Communication Protocols broadcast algorithms ad hoc networks taxonomy underlying topology variable and fixed transmission range

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for Data broadcast in Wireless Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2012年第7期11卷 1237-1248页

作者： Gandhi, Rajiv Kim, Yoo-Ah Lee, Seungjoon Ryu, Jiho Wan, Peng-Jun Rutgers State Univ Dept Comp Sci Camden NJ 08102 USA NIH Natl Ctr Biotechnol Informat Natl Lib Med Bethesda MD 20894 USA AT&T Labs Res Florham Pk NJ 07932 USA UNIST Ulsan 330708 South Korea IIT Dept Comp Sci Chicago IL 60616 USA

broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it nontrivial to design a minimum-latency broadcast algorithm, which is known to be NP-complete. We present a simple 12-approximation algorithm for the one-to-all broadcast problem that improves all previously known guarantees for this problem. We then consider the all-to-all broadcast problem where each node sends its own message to all other nodes. For the all-to-all broadcast problem, we present two algorithms with approximation ratios of 20 and 34, improving the best result available in the literature. Finally, we report experimental evaluation of our algorithms. Our studies indicate that our algorithms perform much better in practice than the worst-case guarantees provided in the theoretical analysis and achieve up to 37 percent performance improvement over existing schemes.

关键词： Ad hoc networking approximation algorithms broadcast algorithms wireless scheduling

来源：评论

学校读者我要写书评

暂无评论

Minimizing broadcast latency and redundancy in ad hoc networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2008年第4期16卷 840-851页

作者： Gandhi, Rajiv Mishra, Arunesh Parthasarathy, Srinivasan Rutgers State Univ Dept Comp Sci Camden NJ 08102 USA Univ Wisconsin Dept Comp Sci Madison WI 53706 USA IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA

Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. In this paper, we consider the problem of collision-free broadcasting in ad hoc networks. Our objective is to minimize the latency and the number of transmissions in the broadcast. We show that minimum latency broadcasting is NP-complete for ad hoc networks. We also present a simple distributed collision-free broadcasting algorithm for broadcasting a message. For networks with bounded node transmission ranges, our algorithm simultaneously guarantees that the latency and the number of transmissions are within O(1) times their respective optimal values. Our algorithm and analysis extend to the case when multiple messages are broadcast from multiple sources. Experimental studies indicate that our algorithms perform much better in practice than the analytical guarantees provided for the worst case.

关键词： ad hoc networking approximation algorithms broadcast algorithms wireless scheduling

来源：评论

学校读者我要写书评

暂无评论

Energy efficient broadcast in wireless ad hoc networks with hitch-hiking

引用

MOBILE NETWORKS & APPLICATIONS 2005年第6期10卷 897-910页

作者： Agarwal, M Gao, LX Cho, JH Wu, J Univ Massachusetts Dept Elect & Comp Engn Amherst MA 01002 USA Pohang Univ Sci & Technol Dept Elect & Elect Engn Pohang South Korea Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA

In this paper, we propose a novel concept called Hitch-hiking in order to reduce the energy consumption of broadcast application for wireless networks. Hitch-hiking takes advantage of the physical layer design that facilitates the combining of partial signals to obtain the complete information. The concept of combining partial signals using maximal ratio combiner [15] has been used to improve the reliability of the communication link but has never been exploited to reduce energy consumption in broadcasting over wireless ad hoc networks. We study the advantage of Hitch-hiking for the scenario when the transmission power level of nodes is fixed as well as the scenario when the nodes can adjust their power level. For both scenarios, we show that Hitch-hiking is advantageous and have proposed algorithms to construct broadcast tree with Hitch-hiking taken into consideration. For fixed transmission power case, we propose and analyze a centralized heuristic algorithm called SPWMH (Single Power Wireless Multicast with Hitch-hiking) to construct a broadcast tree with minimum forwarding nodes. For the latter case, we propose a centralized heuristic algorithm called Wireless Multicast with Hitch-hiking (WMH) to construct an energy efficient tree using Hitch-hiking and also present a distributed version of the heuristic. We also evaluate the proposed heuristics through simulation. Simulation results show that Hitch-hiking can reduce the transmission cost of broadcast by as much as 50%. Further, we propose and evaluate a protocol called Power Saving with broadcast Tree (PSBT) that reduces energy consumption of broadcast by eliminating redundancy in receive operation. Finally, we propose an algorithm that takes advantage of both Hitch-hiking and PSBT in conserving energy.

关键词： wireless ad hoc networks broadcast algorithms distributed algorithms maximal ratio combiner simulations

来源：评论

学校读者我要写书评

暂无评论

Record Route Elimination (RRE): An Energy-Efficient broadcast Algorithm

Record Route Elimination (RRE): An Energy-Efficient Broadcas...

引用

3rd International Conference on Networking and Computing (ICNC)

作者： Sandes, Edans Bordim, Jacir L. Melo, Alba C. M. A. Ito, Yasuaki Univ Brasilia Dept Comp Sci ICC Ctr Asa Norte Campus Darcy Ribeiro BR-70910900 Brasilia DF Brazil Hiroshima Univ Sch Engn Dept Informat Engn Hiroshima 730 Japan

ISBN: (纸本)9780769548937;9781467346245

broadcasting is a fundamental task, being used for neighboring discovery in various medium access control and routing protocols. This paper presents a comparative analysis of various broadcast techniques and topology control mechanisms. Overall, nine topology control mechanisms and seven broadcast protocols are combined, generating sixty-three possible solutions. Among the broadcast algorithms studied, two are proposed in this paper: the Record Route Elimination (RRE) and Record Route Elimination with Distance Prediction (RRE-DP). The simulation results show that the RRE and RRE-DP allow for a significant reduction in energy consumption, regardless of the topology control mechanism associated.

关键词： broadcast algorithms energy consumption topology control algorithms

来源：评论

学校读者我要写书评

暂无评论

Safety Requirements of Distributed broadcast 16

Safety Requirements of Distributed Broadcast

引用

16th International Conference on Computer and Automation Engineering (ICCAE)

作者： Dabees, Aysha Karaata, Mehmet Hakan Kuwait Univ Dept Comp Engn Kuwait Kuwait

ISBN: (纸本)9798350370058;9798350370164

In this article, we outline an asynchronous boundary broadcast algorithm that upholds three key principles: boundary safety, propagation 1-safety, and propagation reliability. Boundary safety maintains the integrity of boundary processes by separating completed processes from others. Propagation 1-safety ensures that once a message is sent from a genuine source, it cannot be further disseminated if it originates from an unauthorized source. Propagation reliability guarantees that each process within the system receives a legitimate message exactly once. The algorithm is designed to initiate from any initial configuration and bears significance for the development of secure network protocols and command and control systems.

关键词： broadcast broadcast algorithms Distributed Systems Propagation of Information Reliability Safety Wave algorithms

来源：评论

学校读者我要写书评

暂无评论

A combination of wireless multicast advantage and hitch-hiking

引用

IEEE COMMUNICATIONS LETTERS 2005年第12期9卷 1037-1039页

作者： Thai, MT Li, YS Du, DZ Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

In the minimum energy broadcast problem, each node adjusts its transmission power to minimize the total energy consumption while still delivering data to all the nodes in a network. The minimum energy broadcast problem is proved to be NP-complete. The Wireless Multicast Advantage (WMA) is that a single transmission can be received by all the nodes that are within the transmission range of a transmitting node. The Hitch-hiking model introduced recently in [1] takes advantage of the physical layer to combine partial signals containing the same data in order to decode a complete message. In this letter, we take advantage of both WMA and Hitch-hiking to design an energy-efficient broadcast tree algorithm with Hitch-hiking (BHH). The approximation ratio of BHH is within a factor of O(log n) where n is the number of nodes in the network. The simulation results show that BHH reduces the total energy of the broadcast tree greatly.

关键词： wireless networks energy efficiency broadcast algorithms hitch-hiking

来源：评论

学校读者我要写书评

暂无评论

INCOMPLETE HYPERCUBES

引用

IEEE TRANSACTIONS ON COMPUTERS 1988年第5期37卷 604-608页

作者： KATSEFF, HP AT&T Bell Labs. Holmdel NJ USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions k-dimensional hypercube has 2k vertices these systems are restricted to having exactly 2k computing nodes. Because system sizes must be a power of two there are large gaps in the sizes of systems that can be b..." property="og:description">

Since a k-dimensional hypercube has 2k vertices, these systems are restricted to having exactly 2k computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes, called incomplete hypercubes. Unlike hypercubes, incomplete hypercubes can be used to interconnect systems with any number of processors. The routing and broadcast algorithms for incomplete hypercubes are shown also to be simple and deadlock-free

关键词： Multiprocessor Interconnection Networks Interconnection Topology K Dimensional Hypercube Incomplete Hypercubes Routing broadcast algorithms Deadlock Free Hypercubes Routing System Recovery broadcasting Topology Power System Interconnection Joining Processes Multiprocessing Systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：