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

JOURNAL OF COMMUNICATIONS AND networkS 2008年第4期10卷 367-370页

作者： Ephremides, Anthony Jaggi, Sidharth Ho, Tracey Shrader, Brooke Chung, Sae-Young Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Univ Maryland Syst Res Inst College Pk MD 20742 USA Chinese Univ Hong Kong Hong Kong Hong Kong Peoples R China CALTECH Pasadena CA 91125 USA Korea Adv Inst Sci & Technol Sch EECS Taejon South Korea

In less than ten years network coding has grown from a simple cute idea to an almost revolutionary research trend that has galvanized both the Information-theoretic Community (where it was born) and the networking Com... 详细信息

关键词： Road network coding Communities

来源：评论

学校读者我要写书评

暂无评论

network coding

引用

PROCEEDINGS OF THE IEEE 2011年第3期99卷 363-365页

作者： Li, Baochun Wu, Yunnan Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada Microsoft Corp Redmond WA 98052 USA

network coding means that bits in information flows do not have to be delivered as commodities; they can be mixed however we wish, as long as the receiving hosts have received sufficient "evidence" or "... 详细信息

关键词： network coding Special issues and sections

来源：评论

学校读者我要写书评

暂无评论

network coding /

引用

2012年

作者： edited by Khaldoun Al Agha.

来源：内蒙古大学图书馆图书评论

学校读者我要写书评

暂无评论

RSTrS: A Reliable and Stable Data Transmission Scheme via OLSR and network coding in FANET

引用

IEEE SENSORS JOURNAL 2025年第3期25卷 5529-5546页

作者： Song, Bo Yin, Jun Qiu, Xiulin Ke, Yaqi Yu, Wanxin Xu, Lei Huang, Bo Yang, Yuwang Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Peoples R China Nanjing Univ Postsand Telecommun Jiangsu Key Lab Broadband Wireless Commun & Intern Nanjing 210046 Peoples R China Jiangsu Univ Sci & Technol Sch Automat Zhenjiang 212100 Peoples R China Harbin Inst Technol Harbin SONG Peoples R China

Flying ad hoc networks (FANETs) use unmanned aerial vehicles (UAVs) to build a wireless network with special properties. The transmission of data between UAVs in FANETs has become a key area of research. However, they are confronted with many challenges and difficulties, which are due to the high mobility of UAVs, the frequent packet losses, and the weak links between UAVs, all affecting the reliability of the data delivery. Several enhancements exist to address the above issues, but most of these are simple improvements over traditional mobile ad hoc networks (MANETs) approaches such as vehicular ad hoc networks (VANETs) and wireless sensor networks (WSNs), and cannot be fully adapted to FANETs with their unique properties, even ignoring the requirements for data transmission between UAVs. In light of these limitations, we propose a novel transmission scheme based on an optimized link state routing (OLSR) protocol and network coding for efficient and reliable data transmission in FANET. Compared to the state-of-the-art, the novelty of this scheme is to improve and integrate two coding algorithms into the transmission process based on the characteristics of FANET. In addition, it considers factors such as link stability, coding gain, and node congestion during the multipoint relay (MPR) election phase, thereby enhancing the transmission performance of FANET. Experimental results showed that the proposed approach compensates for the existing methods' inability to manage high mobility and frequent topology changes, and addresses the issues of unstable link election and substantial packet loss.

关键词： Routing Reliability Routing protocols Data communication Encoding network coding Heuristic algorithms Autonomous aerial vehicles Ad hoc networks Packet loss Flying ad hoc network (FANET) network coding optimized link state routing (OLSR) reliable transmission unmanned aerial vehicle (UAV)

来源：评论

学校读者我要写书评

暂无评论

On the network coding-based D2D collaborative recovery scheme for scalable video broadcasting

引用

JOURNAL OF network AND COMPUTER APPLICATIONS 2025年 239卷

作者： Wang, Lei Sun, Jie Chen, Liang Yin, Jun Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing 210003 Peoples R China Nanjing Univ Posts & Telecommun Sch Internet Things Nanjing 210003 Peoples R China

This paper examines the collaborative recovery issue for the scalable video broadcasting (SVB) system, where two proximate user nodes are able to maintain a local out-of-band device-to-device (D2D) pair to cooperatively recover their lost broadcasted packets. Traditional error protection methods, such as Forward Error Correction (FEC) and error concealment, often require the source node to dynamically adjust its broadcast content based on feedback from user nodes. However, in many practical SVB scenarios, such as mobile TV broadcasting systems and satellite-based video broadcast virtual file systems, user nodes are merely recipients of broadcast messages and cannot feasibly report their reception status back to the source node (i.e., feedback-free). To address these challenges, we propose the network coding based Collaborative recovery scheme for SVB, named NC2-SVB. NC2-SVB deviates from previous studies by employing a feedback-free transmission model, wherein the source node neither receives updates on reception status nor channel conditions from the user nodes, nor does it dynamically modify its broadcast content. By utilizing the designed coding window sliding mechanism and the collaborative video layer scheduling algorithm, each user node can independently maintain a sliding coding window, generate optimal network coded packets, and collaborate recovery for the partner in a timely manner. The theoretical bounds of reliability and decoding delay for NC2-SVB have been analyzed. Experimental results demonstrate that NC2-SVB, compared to existing schemes, enhances the collaboration throughput, achieves higher decoding rates, offers lower decoding delays, as well as improved video playback quality.

关键词： network coding Scalable video broadcasting D2D communication Collaborative recovery

来源：评论

学校读者我要写书评

暂无评论

Secure Data Delivery With Certificateless Homomorphic network coding Signature Scheme for Autonomous Aerial Vehicle networks

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第8期12卷 9604-9613页

作者： Huang, Hao Wang, Xiaofen Dai, Hong-Ning Cao, Sheng Zhang, Ke Au, Man Ho Zhou, Rang Univ Elect Sci & Technol China Sch Comp Sci & Engn Sch Cyber Secur Chengdu 611731 Peoples R China Hong Kong Baptist Univ Dept Comp Sci Hong Kong Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Chengdu Univ Technol Coll Comp Sci & Cyber Secur Chengdu 610059 Sichuan Peoples R China

With highly mobile and flexible-configurable, autonomous aerial vehicles (AAVs) are becoming crucial wireless communication infrastructures. To improve the reliability and throughput of data delivery for wireless networks, network coding, as a progressive technology, can be applied in AAV networks. However, network coding incurs a security problem called pollution attacks for AAV networks. Although homomorphic network coding signature can prevent pollution attacks, existing schemes are not suitable for AAV networks due to cumbersome certificate management, the key-escrow issue, or insecurity. In this article, we propose an efficient certificateless homomorphic network coding signature scheme for secure transmission of AAV networks, which can avoid certificate management and the key-escrow issue. Then our scheme is proven to be secure against adaptive chosen identity-and-subspace attacks in the random oracle model, thus our scheme can guarantee data integrity and authenticity to resist pollution attacks. We provide a performance evaluation for the proposed scheme and prior research, and experimental results illustrate the efficiency and feasibility of our scheme for practical application, reducing the verification overhead by 42.918% for a 72-dimensional data vector.

关键词： Autonomous aerial vehicles network coding Vectors Pollution Resists Internet of Things Routing protocols Electronic mail Throughput Routing Autonomous aerial vehicle (AAV) networks certificateless homomorphic signature network coding pollution attacks

来源：评论

学校读者我要写书评

暂无评论

A Novel Method to Solve the Maximum Weight Clique Problem for Instantly Decodable network coding

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2025年第3期24卷 2181-2192页

作者： Mei, Zhonghui Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210003 Peoples R China

Minimizing the decoding delay, the completion time, or the delivery time of instantly decodable network coding (IDNC) can all be approximated to a maximum weight clique (MWC) problem, which is well known to be NP hard. Due to its good tradeoff between performance and computational complexity, a heuristic approach named as maximum weight vertex (MWV) search is widely employed to select MWC for IDNC. However, in MWV, when there are few coding connection edges among the adjacent vertices of a vertex, its modified vertex weight cannot well reflect the weight of the MWC containing the vertex, which leads to incorrect selection of MWC. This paper proposes a new method to calculate the modified weight of a vertex by summing the weights of the vertices in the approximate maximum weight path (A-MWP) generated by this vertex. Since the vertices in an A-MWP can form a maximal clique, the proposed modified vertex weight may well indicate the weight of the MWC containing the vertex. The proposed algorithm has the same computational complexity as the MWV algorithm. Simulation results show that when employing any of the three performance metrics of IDNC, our proposed algorithm can achieve better system performance than the MWV algorithm.

关键词： Receivers Decoding Delays Approximation algorithms Search problems Schedules network coding Weight measurement Velocity measurement Time measurement Instantly decodable network coding (IDNC) maximum weight clique (MWC) problem wireless broadcast

来源：评论

学校读者我要写书评

暂无评论

Bison: A Binary Sparse network coding Based Contents Sharing Scheme for D2D-Enabled Mobile Edge Caching network

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2025年第2期24卷 677-695页

作者： Peng, Cheng Yin, Jun Wang, Lei Xiao, Fu Nanjing Univ Posts & Telecommun Sch Comp Jiangsu High Technol Res Key Lab Wireless Sensor Nanjing 210049 Peoples R China Nanjing Univ Posts & Telecommun Sch Internet Things Jiangsu Key Lab Broadband Wireless Commun & Inter Nanjing 210049 Peoples R China

Mobile edge caching network (MEN), which enables popular or reusable content caching and sharing among adjacent mobile edge devices, has become a promising solution to reduce the traffic and burden over backhaul links. network coding (NC), represented by classical random linear network coding (RLNC), is utilized to facilitate content delivery and increase throughput in MEN. However, as the harsh decoding condition results in unacceptable time and storage overhead, classical RLNC schemes struggle to be widely deployed in practice. In this work, we propose a cost-effective NC-based content-sharing scheme based on binary sparse network coding (BSNC), called Bison, for D2D-enabled MEN. Based on the shared relationship between the binary sparse coded block (BSCB), Bison first designs a caching maintenance module to characterize the sharing progress and maintain the caching state of each edge node. Then, Bison defines a matching metric named neighbor utility to evaluate neighbors' matching values by considering nodes' demand and content decodability. Guiding by the metric, Bison achieves the most beneficial matching relationship among edge nodes through a proposed online matching policy. Finally, Bison devises a coded block delivery strategy to enable the sharing of valuable content between two matched edge nodes. Extensive experiments in simulations and real-world Android testbeds demonstrate its effectiveness and efficiency, wherein Bison is at least 30% less than the RLNC-based scheme on time consumption and at least 10% less than the classical BSNC-based scheme on storage overhead. The results also show that our matching policy and coded block delivery strategy can perform with a low response latency on edge and mobile devices.

关键词： Decoding Peer-to-peer computing network coding Cloud computing Encoding Device-to-device communication Costs Binary sparse network coding (BSNC) content sharing D2D MEN utility evaluation

来源：评论

学校读者我要写书评

暂无评论

A network-coding-Based Functional Test Method for Routers in 3-D Mesh NoCs

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第8期12卷 9940-9953页

作者： Wei, Chen Cui, Xiaole Peking Univ Shenzhen Grad Sch Sch Elect & Comp Engn Shenzhen 518055 Peoples R China

The 3-D Mesh network-on-Chip (NoC) is widely used as the communication backbone of the 3-D multiprocessor system-on-chips (MPSoCs) and chiplet-based 3-D integrated systems, which enable the efficient computation paradigm in Internet of Things (IoT) scenarios. The functional test is a good choice for the 3-D Mesh NoCs to detect the defects introduced in manufacture process, because it reuses the at-speed on-chip network and consumes little hardware overhead. However, the test time of the functional test in 3-D Mesh NoCs grows dramatically with the NoC size. In order to reduce the test time on the premise of ensuring fault coverage, this work proposes a functional test method leveraging the exclusive OR (xor) network coding (NC) technique. In this work, thexor NC function is embedded in the routers by the extension modules with an additional area overhead less than 3%, and an efficient functional test process based on the embeddedxor NC function is proposed. The proposed functional test process covers all the straight and turning paths, and all the working modes of the routers are tested. The time complexity of the proposed method only increases linearly with the NoC size, which manifests that the proposed test method is applicable for the large-scale 3-D Mesh NoCs.

关键词： Three-dimensional displays IP networks Internet of Things System-on-chip Circuit faults Turning Topology network coding Built-in self-test network topology 3-D mesh network on Chip (NoC) functional test network coding (NC) NoC

来源：评论

学校读者我要写书评

暂无评论

Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2025年第2期71卷 895-913页

作者： Liu, Hedongliang Wei, Hengjia Wachter-Zeh, Antonia Schwartz, Moshe Tech Univ Munich Sch Computat Informat & Technol D-80333 Munich Germany Peng Cheng Lab Shenzhen 518055 Peoples R China Xi An Jiao Tong Univ Sch Math & Stat Xian 710049 Peoples R China Pazhou Lab Huangpu Guangzhou 510555 Peoples R China McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. The conditions on the support constraints are identical to those for MDS codes and MRD codes. The required field size for an [n, k](q)(m) LRS codes with support-constrained generator matrix is q >= l+1 and m >= max(l is an element of[l]){k-1+log(q) k,n(l)} , where l is the number of blocks and n(l) is the size of the l-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network.

关键词： Codes Generators Measurement Sparse matrices Reed-Solomon codes network coding Sufficient conditions Polynomials Wireless communication Systematics GM-MDS sum-rank metric support constraints linearized Reed-Solomon codes multi-source network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：