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

90th IEEE Vehicular Technology Conference (IEEE VTC-Fall)

作者： Dhakal, Sagar Prakash, Saurav Yona, Yair Talwar, Shilpa Himayat, Nageen Intel Labs Santa Clara CA 94022 USA Qualcomm Inc San Diego CA USA

ISBN: (纸本)9781728112206

In wireless mobile edge computing platforms, such as those supported by vehicular networks, location specific machine learning models can be trained by distributing computations using resources available at the edge. The computational and communication resources at the wireless edge are heterogeneous and unreliable, which can lead to straggler effects that significantly slow down recursive learning tasks, such as gradient descent. In this paper we propose a coded computation framework, which utilizes statistical knowledge of resource heterogeneity to determine optimal encoding and load balancing of training data using random linear codes, while avoiding an explicit step for decoding gradients. Results show that the proposed coding framework speeds up the training time for linear regression models, by up to ten times, when compared with repetition coding schemes.

关键词： gradient descent linear regression random linear coding distributed computing machine learning

来源：评论

学校读者我要写书评

暂无评论

Notes on "Exact Decoding Probability Under random linear Network coding"

引用

IEEE COMMUNICATIONS LETTERS 2012年第5期16卷 720-721页

作者： Zhao, Xubo Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China China Univ Petr Coll Sci Qingdao Peoples R China

In a recent letter, Trullols-Cruces et al. derived the exact decoding probability P-ns(K, N) that a receiver node obtained N linearly independent coded packets among K (K >= N) received coded packets, when the source node uses a random linear coding scheme over a Galois Field GF(q). They discussed P-ns(K, N) both in the case of the source node sending the random linear combination of the original packets, including all-zero combinations, as well as the case of excluding all-zero combinations. However, their derivations are a bit complicated. In this note, we demonstrate simple derivations of the exact decoding probability P-ns(K, N) in both cases. Furthermore, we point out that there is a more succinct expression of P-ns(K, N) for the latter case.

关键词： random linear coding wireless networks decoding probability

来源：评论

学校读者我要写书评

暂无评论

random linear Coded Distributed Caching for Video Streaming over D2D 14

Random Linear Coded Distributed Caching for Video Streaming ...

引用

14th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)

作者： Pedersen, Hasti A. Sassatelli, Lucile Aparicio-Pardo, Ramon Univ Calif San Diego San Diego CA 92103 USA Univ Cote Azur CNRS I3S Sophia Antipolis France

ISBN: (纸本)9783903176010

In distributed file systems, random-linear-coding (RLC) reduces scheduler complexity and download time by eliminating the coupon collector problem [1]. Similar benefits for video streaming in Distributed Video Caching and Sharing (DVCS) systems require segmentation of videos into codeblocks, over which RLC can be applied, to ensure videos' quality. This research proposes RLC-based DVCS (RLC-DVCS), and shows that RLC reduces complexity of the distributed video caching decision from which video chunks to how many RLC chunks to cache at each mobile device, and better facilitates distributability of content among devices (more mobile devices dedicating fewer resources each). All while increasing the number of video requests served ontime from DVCS, despite the challenges of video streaming. RLC-DVCS utilizes optimization and approximation methods for video segmentation, cache selection and allocation, to ensure videos' quality and cache more videos of highest request probability by reducing distributed size of each video. Using lagrangian relaxation allows for distributed RLC-DVCS where each mobile device decides how many RLC chunks to cache with limited coordination from other devices or a centralized scheduler. Monte Carlo evaluation of the proposed methods shows that RLC-DVCS achieves higher recovery probability than symmetric allocation of RLC chunks across mobile devices or un-coded DVCS.

关键词： random linear coding Network coding Mobile Device Caching Wireless Networks Video Quality of Experience

来源：评论

学校读者我要写书评

暂无评论

Stable Throughput for Multicast With random linear coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第1期57卷 267-281页

作者： Cogill, Randy Shrader, Brooke Ephremides, Anthony Univ Virginia Dept Syst & Informat Engn Charlottesville VA 22904 USA MIT Lincoln Lab Lexington MA 02420 USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from a single queue. We juxtapose this to a coding strategy that is simply a form of classical random linear coding. We show that there are configurations for which the stable throughput region of the scheduling strategy is a strict subset of the corresponding throughput region of the coding strategy. This analysis is performed for both time-invariant and time-varying channels. The analysis is also performed both with and without accounting for the impact on throughput of including coding overhead symbols in each encoded packet. Additionally, we compare coding strategies that only code within individual queues against a coding strategy that codes across separate queues. The strategy that codes across queues simply sends packets from all queues to all receivers. As a result, this strategy sends many packets to unnecessary recipients. We show, surprisingly, that there are cases where the strategy that codes across queues can achieve the same throughput region achievable by coding within individual queues.

关键词： Cross-layer control multicast queueing systems random linear coding wireless networks

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Visible Light Communications for the Internet of Things

Bidirectional Visible Light Communications for the Internet ...

引用

作者： Alexis Duque INSA de Lyon

学位级别：博士

With the exponential growth of the Internet of Things (IoT), people now expect every household appliance to be smart and connected. At the same time, smart- phones have become ubiquitous in our daily life. Their continuous performance improvement and their compatibility with a broad range of radio protocols as WiFi, Bluetooth Low Energy (BLE) or Near Field Communication (NFC) make them the most convenient way to interact with these smart objects. However, provid- ing wireless connectivity with BLE or NFC means adding an extra chipset and an antenna, increasing the object size and price. Also, this kind of hardware modifi- cation is not without impact: even if the radio chip cost is negligible for a single unit, it may become huge when millions of products are sold. On the other hand, previous works already have demonstrated the possibility of receiving information through visible light using an unmodified smartphone thanks to its camera. Also, LED-to-LED communication for smart devices like toys has been shown previously. However, past efforts in light-emitting diode (LED) to camera communication for IoT device-to-device communication have been limited. In this work, we address this question and design LightIoT, a bidirectional visible-light communication (VLC) system between a low-cost, low-power colored LED that is part of an IoT device and an off-the-shelf smartphone. The IoT device is thus able to send and receive information through its LED, while the smart- phone uses its camera to receive data and its flashlight to send information. We implement and experimentally evaluate a LED-to-camera VLC system, de- signed specifically for small LEDs. The proposed solution exploits the rolling shutter effect of unmodified smartphone cameras and an original decoding al- gorithm, achieving a throughput of nearly 2 kb/s in ordinary illumination condi- tions. Based on the insight gained from an extensive experimental study, we model, for the first time in the literature, the

关键词： Visible Light Communication Internet of Things Smartphone Optical Camera Communication Wireless Communication random linear coding LED-to-Camera Communication

来源：评论

学校读者我要写书评

暂无评论

Multicast Queueing Delay: Performance Limits and Order-Optimality of random linear coding

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2011年第5期29卷 1075-1083页

作者： Cogill, Randy Shrader, Brooke Univ Virginia Dept Syst & Informat Engn Charlottesville VA 22904 USA MIT Lincoln Lab Lexington MA 02420 USA

In this work we analyze the average queue backlog for transmission of a single multicast flow consisting of M destination nodes in a wireless network. In the model we consider, the channel between every pair of nodes is an independent identically distributed packet erasure channel. We first develop a lower bound on the average queue backlog achievable by any transmission strategy;for a single-hop multicast transmission, our bound indicates that the queue size must scale as at least Omega(ln(M)). Next, we generalize this result to a multihop network and obtain a lower bound on the queue backlog as it relates to the minimum-cut capacity of the network. We then analyze the queue backlog for a strategy in which random linear coding is performed over groups of packets in the queue at the source node of a single-hop multicast. We develop an upper bound on the average queue backlog for the packet-coding strategy to show that the queue size for this strategy scales as O(ln(M)). Our results demonstrate that in terms of the queue backlog for single-hop multicast, the packet coding strategy is order-optimal with respect to the number of receivers.

关键词： multicast queue backlog queueing delay random linear coding packet coding packet erasure network min-cut capacity

来源：评论

学校读者我要写书评

暂无评论

Optimal transmission for scalable video coded streaming in cellular wireless networks with the cooperation of local peer-to-peer network

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2017年第4期13卷

作者： Feng, Guangsheng Lin, Junyu Zhao, Qian Wang, Huiqiang Lv, Hongwu Li, Bingyang Su, DongDong Harbin Engn Univ Coll Comp Sci & Technol Harbin Peoples R China Chinese Acad Sci Inst Informat Engn Beijing 100093 Peoples R China Harbin Univ Commerce Sch Comp & Informat Engn Harbin Peoples R China

We study the problem of transmitting scalable video coded streams in a hybrid scenario including a global cellular network and a local peer-to-peer network. Given desirable channel condition in cellular downlink, some cellular user equipments can fetch the video chunks via the cellular base station directly, and also provide relay service via the local peer-to-peer network for other user equipments unable to meet their basic video quality. To take the advantage of channel diversity gains, the method of random linear coding is adopted to generate linear combinations of the video chunks for transmission in both the cellular and peer-to-peer networks. To optimize the cellular and peer-to-peer transmission arrangement, we first formulate it as a mixed integer nonlinear programming problem, which becomes more complicated when the number of user equipments increases. Then, we convert it to a quasi-convex optimization problem by approximating the indicator function with a continuous step function, and it can be solved by a centralized approach. Furthermore, a primal-dual decomposition approach is developed and a distributed algorithm is proposed accordingly. Simulation results show that the proposed approach achieves a near-optimal solution.

关键词： Cellular networks peer-to-peer network scalable video coding random linear coding multicast

来源：评论

学校读者我要写书评

暂无评论

How to tune sparse network coding over wireless links

How to tune sparse network coding over wireless links

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Garrido, Pablo Lucani, Daniel E. Aguero, Ramon Univ Cantabria Santander Spain Aalborg Univ Dept Elect Syst Aalborg Denmark

ISBN: (纸本)9781509041831

Despite their high computational complexity, random linear Network coding (RLNC) techniques have been shown to offer a good robustness against packet erasure wireless channels. Some approaches have been recently proposed to reduce such computational burden, for both encoder and decoder elements. One of those approaches are the so-called Tunable Sparse Network coding (TSNC) techniques, which advocate limiting the number of packets that are combined to build a coded packet. They also propose dynamically adapting the corresponding sparsity level, as the transmission evolves, although an optimum tuning policy has not been yet found. In this paper we present a TSNC implementation that exploits a novel analytical model to estimate the probability of generating an innovative packet (linearly independent combination), given the current status at the decoder. Taking advantage of the model's accuracy, the proposed scheme offers a better trade-off between computational complexity and network performance. Furthermore, we broaden the analysis of TSNC techniques by thoroughly assessing their behavior over wireless networks using the ns-3 platform. The results yield a remarkable complexity reduction (approximate to 3.33x less complexity), without jeopardizing network performance.

关键词： random linear coding Sparse coding Network coding

来源：评论

学校读者我要写书评

暂无评论

Reading Damaged Scripts: Partial Packet Recovery Based on Compressive Sensing for Efficient random linear Coded Transmission

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第8期64卷 3296-3310页

作者： Mohammadi, Mohammad Sadegh Zhang, Qi Dutkiewicz, Eryk Aarhus Univ Dept Engn DK-8200 Aarhus Denmark Macquarie Univ Sydney NSW 2109 Australia Univ Technol Sydney Sch Comp & Commun Ultimo NSW 2007 Australia

random linear coding (RLC) can improve the performance of multicast transmissions in terms of throughput and energy efficiency. However, RLC and linear codes in general cannot necessarily attain the optimal performance in arbitrary networks. In this regard, partial packet recovery can be considered as a nonlinear strategy to complement such approaches for more general networks. In this paper, we propose a partial packet recovery scheme that benefits from the sparsity of bit errors in partially corrupted RLC packets. As opposed to many previous schemes, it performs without introducing preliminary checksums or preambles, demanding physical layer soft information, or requesting post-redundancy from the transmitter. It relies only on algebraic coding and data processing techniques, the existing knowledge at the receiver, and the conventional acknowledgment messages in RLC. By reconstructing and utilizing the partially corrupted packets that are usually discarded, it can reduce the average number of transmitted RLC packets required for successful decoding by typically 50%, which improves throughput and energy efficiency at the transmitter. We formulate our partial packet recovery in the form of a sparse recovery problem, present its different solutions using compressive sensing theory, discuss their complexity, and present and evaluate a Markov chain model for its performance.

关键词： Partial packet recovery compressive sensing random linear coding efficient transmission

来源：评论

学校读者我要写书评

暂无评论

Enhanced Opportunistic random linear Source/Network coding with Cross-Layer Techniques over Wireless Mesh Networks 7

Enhanced Opportunistic Random Linear Source/Network Coding w...

引用

IFIP Wireless Days (WD)

作者： Gomez, David Garrido, Pablo Rodriguez, Eduardo Aguero, Ramon Munoz, Luis Univ Cantabria Santander Spain

ISBN: (纸本)9781479966066

In this paper we thoroughly study, by means of simulation, the combination of source and network random linear coding to provide reliable communications over wireless mesh networks. We assume that intermediate nodes code the packets they have previously stored before forwarding them. We also analyze the possibilities that are brought about by opportunistic listening and forwarding, combining them with the use of cross-layer information. We study the performance of the proposed scheme by means of an extensive simulation campaign carried out over the ns-3 platform;the results show that the coding functionality at the intermediate nodes leads to additional performance enhancements. In addition, they also demonstrate the potential benefits of integrating cross-layer techniques.

关键词： random linear coding Network coding Source coding Cross-Layer Wireless Mesh Networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：