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

作者： Singh, Harveer University of Ottawa

学位级别：master

Network coding is an emerging technology that intelligently exploits the store/forward nature of routers to increase the efficiency of the network. Though the concept works in theory, the segregation of coding and routing decisions makes them inapplicable in almost any practical environment. coding-aware routing takes the network coding a step further to lessen its disadvantages by allowing interlayer communication while making routing decisions. However, most of the existing work exploits coding benefits only for fixed wireless networks, making them dependent on the types of network medium, topology and mobility and thus inapplicable for wired and mobile Ad Hoc networks. The aim of this thesis is to present a generalized algorithm that can detect any possible coding opportunity in a network of any medium, topology and mobility while making routing decisions. We have tested and evaluated our algorithm in six different network topology settings i.e. small wired, big wired, small Ad Hoc network with regular trajectories, big Ad Hoc network with regular trajectories, small Ad Hoc with random trajectories and big Ad Hoc with random trajectories. Improved performance in network throughput, mean queue size and mean end-to-end delay confirms the validity of our algorithm

关键词： Networks Network coding coding aware routing Ad Hoc Networks

来源：评论

学校读者我要写书评

暂无评论

OQMCAR: An enhanced network coding-aware routing algorithm based on queue state and local topology

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2015年第8期9卷 2875-2893页

作者： Lu, Cunbo Xiao, Song Miao, Yinbin Xidian Univ Sch Commun Engn Xian 710071 Peoples R China

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

关键词： coding aware routing packet coding algorithm queue state unified framework multiple rates

来源：评论

学校读者我要写书评

暂无评论

A Low-Jitter Wireless Transmission Based on Buffer Management in coding-aware routing

引用

FUTURE INTERNET 2015年第3期7卷 307-328页

作者： Lu, Cunbo Wan, Liangtian Xidian Univ Sch Commun Engn Xian 710071 Shanxi Peoples R China Hohai Univ Dept Informat & Commun Syst Changzhou 213022 Jiangsu Peoples R China

It is significant to reduce packet jitter for real-time applications in a wireless network. Existing coding-aware routing algorithms use the opportunistic network coding (ONC) scheme in a packet coding algorithm. The ONC scheme never delays packets to wait for the arrival of a future coding opportunity. The loss of some potential coding opportunities may degrade the contribution of network coding to jitter performance. In addition, most of the existing coding-aware routing algorithms assume that all flows participating in the network have equal rate. This is unrealistic, since multi-rate environments often appear. To overcome the above problem and expand coding-aware routing to multi-rate scenarios, from the view of data transmission, we present a low-jitter wireless transmission algorithm based on buffer management (BLJCAR), which decides packets in coding node according to the queue-length based threshold policy instead of the regular ONC policy as used in existing coding-aware routing algorithms. BLJCAR is a unified framework to merge the single rate case and multiple rate case. Simulations results show that the BLJCAR algorithm embedded in coding-aware routing outperforms the traditional ONC policy in terms of jitter, packet delivery delay, packet loss ratio and network throughput in network congestion in any traffic rates.

关键词： coding aware routing delay jitter buffer management unified framework multiple rates

来源：评论

学校读者我要写书评

暂无评论

TCAR: A new network coding-aware routing mechanism based on local topology detection

引用

Journal of Central South University 2014年第8期21卷 3178-3185页

作者：王伟平吴伟关庆娟王建新 School of Information Science and Engineering Central South University

Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most existing relay mechanisms based on inter-session network such as COPE, relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets. However, transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms. It is observed that coding opportunity at relay node is much more related with the local topology, and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density. Based on this, a new coding-aware routing mechanism, named TCAR, is proposed. TCAR ignores the oppommity of encoding three or more than three packets together. Each relay node maintains an encoding mapping table being established according to the result of its local topology detection, which can be used to calculate the path cost during routing setup phase, and determine that which two packets can be encoded together during the packets forwarding phase. In TCAR, instead of periodic messages collection, each relay nodes just need once local topology detection, and the encoding determination is much simpler than that of the former mechanisms. Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing, TCAR achieves 12% and 7% throughput gains, and keeps the minimum end to end delay.

关键词： inter-session network coding coding aware routing wireless network

来源：评论

学校读者我要写书评

暂无评论

C²AR: coding and Capacity aware routing for Wireless Ad Hoc Networks

C<SUP>2</SUP>AR: Coding and Capacity Aware Routing for Wirel...

引用

2010 IEEE International Conference on Communications

作者： Jhang, Ming-Fong Lin, Sheng-Wei Liao, Wanjiun Natl Taiwan Univ Dept Elect Engn Taipei 10764 Taiwan Natl Taiwan Univ Grad Inst Commun Engn Taipei Taiwan

ISBN: (纸本)9781424464043

Network coding is an efficient technique to increase network capacity. COPE is a promising forwarding mechanism which can utilize network coding in a practical way. Different routing algorithms utilizing COPE may have different gains from network coding. In this paper, we discuss the importance of coding-aware routing and the tradeoff between load-balanced and coding-aware routing. We then propose a new coding-aware routing scheme, called C(2)AR, which combines the advantages of load-balancing and network coding, and conduct ns-2 simulations to evaluate the performance of our proposed scheme. The simulation results show that our proposed scheme has significant improvement over coding-oblivious routing.

关键词： coding aware routing load balancing wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：