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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

88 篇 期刊文献
49 篇 会议
2 篇 学位论文
1 册 图书

馆藏范围

140 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

135 篇 工学
- 80 篇 计算机科学与技术...
- 77 篇 电气工程
- 65 篇 信息与通信工程
- 16 篇 电子科学与技术（可...
- 9 篇 软件工程
- 6 篇 仪器科学与技术
- 2 篇 机械工程
- 2 篇 交通运输工程
- 2 篇 船舶与海洋工程
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物工程
26 篇 理学
- 19 篇 数学
- 3 篇 生物学
- 2 篇 物理学
- 1 篇 化学
- 1 篇 海洋科学
- 1 篇 系统科学
4 篇 管理学
- 4 篇 管理科学与工程(可...
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 教育学
- 1 篇 教育学
1 篇 农学
- 1 篇 作物学
1 篇 军事学
- 1 篇 军队指挥学

主题

140 篇 linear network c...
23 篇 network coding
12 篇 wireless sensor ...
6 篇 throughput
6 篇 multicasting (co...
6 篇 weakly secure
5 篇 data transmissio...
5 篇 linear codes
5 篇 fountain codes
4 篇 routing
4 篇 decoding
4 篇 multicast networ...
4 篇 receivers
4 篇 network security
4 篇 wireless network...
3 篇 wireless broadca...
3 篇 lt codes
3 篇 compressed sensi...
3 篇 analog network c...
3 篇 data packets & p...

机构

7 篇 chinese univ hon...
5 篇 soochow univ dep...
3 篇 queens univ dept...
3 篇 chinese univ hon...
3 篇 univ puerto rico...
3 篇 chinese univ hon...
3 篇 shenzhen res ins...
3 篇 chinese univ hon...
3 篇 temple univ dept...
3 篇 south china univ...
3 篇 n hop technol lt...
2 篇 new jersey inst ...
2 篇 soochow univ sch...
2 篇 univ texas austi...
2 篇 mcgill univ dept...
2 篇 department of co...
2 篇 nanjing univ pos...
2 篇 beihang univ sch...
2 篇 chinese univ hon...
2 篇 univ sci & techn...

作者

7 篇 lu kejie
7 篇 wang jin
6 篇 yang shenghao
5 篇 zhu yanqin
5 篇 zhao ruimin
4 篇 yin hoover h. f.
3 篇 medard muriel
3 篇 wu jie
3 篇 sun qifu tyler
3 篇 zhou qiaoqiao
3 篇 labeau fabrice
3 篇 long keping
3 篇 li lingzhi
3 篇 kim il-min
3 篇 liau andrew
3 篇 ostovari pouya
3 篇 li shuo-yen robe...
3 篇 yousefi shahram
3 篇 wang xiumin
2 篇 zhou jingya

语言

137 篇 英文
3 篇 其他

检索条件"主题词=linear network coding"

共 140 条记录，以下是71-80 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Cache Content Placement Using Triangular network coding

Cache Content Placement Using Triangular Network Coding

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Ostovari, Pouya Khreishah, Abdallah Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9781467359399;9781467359382

Video is one of the main causes of the dramatic increase in data traffic over cellular networks. Caching is an effective mechanism that decreases the download rate from base stations and, as a result, the load on the base station, by storing the most popular files or videos on the caches and providing them to the users. The problem of efficient content placement on the caches is known as an NP-complete problem. In this paper, we study the role of network coding by increasing the amount of available data to the users through the cache nodes. We propose a network coding-based content placement method, and we compare it to the best uncoded content placement and the best triangular network coding strategies. Our method not only increases the amount of available data to the users, but also results in a fair distribution of data.

关键词： linear network coding triangular network coding caching content placement wireless networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Cache Management and Routing for Secure Content Delivery in Information-Centric networks with network coding 15

Optimal Cache Management and Routing for Secure Content Deli...

引用

15th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) / 16th IEEE International Conference on Ubiquitous Computing and Communications (IUCC)

作者： Ding, Weiwei Wang, Jin Lu, Kejie Zhao, Ruimin Wang, Xiumin Zhu, Yanqin Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China Shanghai Key Lab Intelligent Informat Proc Shanghai Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR USA South China Univ Technol Sch Comp Sci & Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538637906

Information-Centric network (ICN) is one of the most promising network architecture to handle the problem of rapid increase of data traffic because it allows in-network cache. ICNs with linear network coding (LNC) can greatly improve the performance of content caching and delivery. In this paper, we propose a Secure Content Caching and Routing (SCCR) framework based on Software Defined network (SDN) to find the optimal cache management and routing for secure content delivery, which aims to firstly minimize the total cost of cache and bandwidth consumption and then minimize the usage of random chunks to guarantee information theoretical security (ITS). Specifically, we firstly propose the SCCR problem and then introduce the main ideas of the SCCR framework. Next, we formulate the SCCR problem to two linear Programming (LP) formulations and design the SCCR algorithm based on them to optimally solve the SCCR problem. Finally, extensive simulations are conducted to evaluate the proposed SCCR framework and algorithms.

关键词： infiirmation-centric network linear network coding security cache management routing

来源：评论

学校读者我要写书评

暂无评论

Tree-structured Data Regeneration with network coding in Distributed Storage Systems

Tree-structured Data Regeneration with Network Coding in Dis...

引用

IEEE 17th International Workshop on Quality of Service

作者： Li, Jun Yang, Shuang Wang, Xin Xue, Xiangyang Li, Baochun Fudan Univ Sch Comp Sci Shanghai Peoples R China Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada

ISBN: (纸本)9781424438754

Distributed storage systems, built on peer-to-peer networks, can provide large-scale data storage and high data reliability by redundant schemes, such as replica, erasure codes and linear network coding. Redundant data may get lost due to the instability of distributed systems, such as permanent node departures, hardware failures, and accidental deletions. In order to maintain data availability, it is necessary to regenerate new redundant data in another node, referred to as a newcomer. Regeneration is expected to be finished as soon as possible, because the regeneration time can influence the data reliability and availability of distributed storage systems. It has been acknowledged that linear network coding can regenerate redundant data with less network traffic than replica and erasure codes. However, previous regeneration schemes are all star-structured regeneration schemes, in which data are transferred directly from existing storage nodes, referred to as providers, to the newcomer, so the regeneration time is always limited by the path with the narrowest bandwidth between newcomer and provider, due to bandwidth heterogeneity. In this paper, we exploit the bandwidth between providers and propose a tree-structured regeneration scheme using linear network coding. In our scheme, data can be transferred from providers to the newcomer through a regeneration tree, defined as a spanning tree covering the newcomer and all the providers. In a regeneration tree, a provider can receive data from other providers, then encode the received data with the data this provider stores, and finally send the encoded data to another provider or to the newcomer. We prove that a maximum spanning tree is an optimal regeneration tree and analyze its performance. In a trace-based simulation, the results show the tree-structured scheme can reduce the regeneration time by 75%-82% and improve data availability by 73%-124%.

关键词： Distributed Storage System linear network coding Maximum Spanning Tree

来源：评论

学校读者我要写书评

暂无评论

coding for a network Coded Fountain

Coding for a Network Coded Fountain

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Yang, Shenghao Yeung, Raymond W. Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781457705953

Batched sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network nodes required to apply BATS codes are independent of the number of packets for transmission. It is verified theoretically for certain cases and demonstrated numerically for the general cases that BATS codes achieve rates very close to the capacity of linear operator channels.

关键词： BATS code Complexity theory Decoding Encoding Generators network coding Optimization Peer to peer computing batched sparse code communication complexity communication networks computation capability decoding encoding-decoding complexity fountain codes intermediate network nodes linear codes linear network coding linear operator channel network coding packet transmission telecommunication channels

来源：评论

学校读者我要写书评

暂无评论

Applying Loss-rate Driven network coding to Transmission Control Protocol

Applying Loss-rate Driven Network Coding to Transmission Con...

引用

6th International Conference on Ubiquitous and Future networks (ICUFN)

作者： Tsai, Yihjia Chiang, Chaoyuan Tamkang Univ Dept Comp Sci & Informat Engn Taipei Taiwan

ISBN: (纸本)9781479934942

Transmission control is an important issue in the Internet or other computer networks today. The retransmission scheme in TCP cannot have the best throughput in the network scenarios with more wireless links or complicated topologies. Some related works proposed the solution by network coding. network coding is suitable for generate the redundant data for error correction. In this paper, we discussed such solutions. Then we proposed the loss-rate driven coding, LRC, for transmission control. The proposed mechanism can minimize the coding operations. Applying LRC to TCP will have lower power consumption and lower computing resource requirement.

关键词： linear network coding transmission control TCP

来源：评论

学校读者我要写书评

暂无评论

Throughput and Fairness-Aware Dynamic network coding in Wireless Communication networks

Throughput and Fairness-Aware Dynamic Network Coding in Wire...

引用

6th International Symposium on Resilient Control Systems (ISRCS)

作者： Ostovari, Pouya Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9781479905034

network coding (NC) techniques have received a lot of attention from the research community for providing reliable broadcasting in error-prone wireless networks. The most common NC approach is segment coding, in which the packets are partitioned into segments, and linear NC is performed inside each segment. In order to increase the throughput of NC and decrease the decoding delay, dynamic coding schemes have been recently proposed. However, these methods incur many feedback messages. In this paper, we propose two dynamic NC schemes that achieve the maximum throughput and reduce the number of required feedback messages. Moreover, we propose a fair dynamic NC scheme that performs a trade-off between the throughput and the fairness in terms of decoding delay and the number of decodable packets at different destination nodes. Our simulation results show that our proposed dynamic NC method provides the same throughput as the ARQ for network coding (ANC) method, with up to 90% less feedback messages. Moreover, our fair dynamic NC can increase decoding delay fairness by about 80%.

关键词： linear network coding broadcasting reliability wireless networks error-prone channel fairness decoding delay

来源：评论

学校读者我要写书评

暂无评论

A network coding Based Multicast Routing in Mobile Ad-hoc Wireless networks 8

引用

FTRA 8th International Conference on Multimedia and Ubiquitous Engineering (MUE)

作者： Le The Dung An, Beongku Hongik Univ Grad Sch Dept Elect & Comp Engn Seoul South Korea Hongik Univ Dept Comp & Informat Commun Engn Seoul South Korea

ISBN: (纸本)9783642549007;9783642548994

Nowadays, network coding is an emerging approach used to increase network throughput. However, in mobile ad-hoc wireless networks, due to dynamic network topology, it is difficult to make coding decision at intermediate nodes. In this paper, we discuss how to increase coding opportunities and the challenges of network coding in mobile ad-hoc wireless networks. From those issues, we propose a network coding based Multicast Routing, called NCMR, in mobile ad-hoc wireless networks. NCMR is especially well-suited for providing reliable, high speed multimedia applications. In our study, the performance of our proposed NCMR is evaluated in terms of packet delivery ratio, end-to-end delay, network congestion via different scenarios by using OPNET.

关键词： mobile ad-hoc wireless networks multicast routing linear network coding decoding failure

来源：评论

学校读者我要写书评

暂无评论

On the Flow Anonymity Problem in network coding

On the Flow Anonymity Problem in Network Coding

引用

9th International Wireless Communications and Mobile Computing Conference (IWCMC)

作者： Atya, Ahmed Osama Fathy ElBatt, Tamer Youssef, Moustafa Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA

ISBN: (纸本)9781467324809

In this paper, we aim at protecting the privacy of the communicating parties while ensuring the authenticity of source nodes. In particular, we exploit intra-flow network coding to preserve the anonymity of communicating parties. Towards this objective, we propose an anonymity preservation scheme, namely closed group anonymity (CGA) that preserves the anonymity of the communicating parties via mixing their flows. Afterwards, we explore an instance of the Authentication-Privacy Trade-off in the context of network coding. We analyze the trade-off with the aid of the proposed anonymity scheme and a previously proposed Source Authentication Scheme using network coding (SANC). We present simulation results showing that the proposed algorithm successfully leverages network coding to preserve anonymity against traffic analysis attacks. Finally, we not only confirm the fundamental authentication-privacy trade-off in the context of intra-flow network coding but also parameterize it via introducing a tunable parameter to dynamically control, and potentially balance, this trade-off depending on the security provisions dictated by the operational scenario and application of interest.

关键词： linear network coding flow anonymity privacy traffic analysis attack simulations

来源：评论

学校读者我要写书评

暂无评论

Joint Opportunistic Scheduling and network coding for Bidirectional Relay Channel

Joint Opportunistic Scheduling and Network Coding for Bidire...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Shaqfeh, Mohammad Zafar, Ammar Alnuweiri, Hussein Alouini, Mohamed-Slim Texas A&M Univ Qatar Dept Elect & Comp Engn Doha Qatar King Abdullah Univ Sci & Technol KAUST CEMSE Div Thuwal Saudi Arabia

ISBN: (纸本)9781479904464

In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

关键词： Bidirectional relay block-fading linear network coding multi-user diversity opportunistic scheduling

来源：评论

学校读者我要写书评

暂无评论

An efficient Soliton-like network coding protocol for the resource-constrained Y-network

An efficient Soliton-like network coding protocol for the re...

引用

13th Canadian Workshop on Information Theory (CWIT)

作者： Liau, Andrew Kim, Il-Min Yousefi, Shahram Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada

ISBN: (纸本)9781479906345

Originally designed for point-to-point transmissions, fountain codes are capacity-achieving codes over a binary erasure channel. On the other hand, network coding is an optimal multi-hop data dissemination protocol whose high decoding complexity makes it too expensive for resource-constrained applications. Soliton-like rateless coding (SLRC) has previously combined network and fountain coding paradigms such that a less complex decoder can be applied. Specifically, the coding done at an intermediate relay node allows a belief propagation decoder to be efficiently applied. We extend the SLRC protocol and propose the Improved Soliton-like Rateless coding (ISLRC) protocol. In ISLRC, the relay applies intelligent coding and shapes the degree distribution such that performance is better than SLRC. In addition, ISLRCs performance gains are achieved using fewer resources than SLRC while maintaining all the key properties of SLRC. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.

关键词： Distributed LT codes Fountain codes linear network coding LT codes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共14页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：