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

A unification of network coding and tree-packing (routing) theorems

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第6期52卷 2398-2409页

作者： Wu, Yunnan Jain, Kamal Kung, Sun-Yuan Microsoft Res Redmond WA 98052 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

Given a network of lossless links with rate constraints, a source node, and a set of destination nodes, the multicast capacity is the maximum rate at which the source can transfer common information to the destinations. The multicast capacity cannot exceed the capacity of any cut separating the source from a destination;the minimum of the cut capacities is called the cut bound. A fundamental theorem in graph theory by Edmonds established that if all nodes other than the source are destinations, the cut bound can be achieved by routing. In general, however, the cut bound cannot be achieved by routing. Ahlswede et al established that the cut bound can be achieved by performing network coding, which generalizes routing by allowing information to be mixed. This paper presents a unifying theorem that includes Edmonds' theorem and Ahlswede et al.'s theorem as special cases. Specifically, it shows that the multicast capacity can still be achieved even if information mixing is only allowed on edges entering relay nodes. This unifying theorem is established via a graph theoretic hardiviring theorem, together with the network coding theorems for multicasting. The proof of the hardwiring theorem implies a new proof of Edmonds' theorem.

关键词： flow multicast network coding routing Steiner tree

来源：评论

学校读者我要写书评

暂无评论

network coding Aware Routing Protocol for Lossy Wireless networks

Network Coding Aware Routing Protocol for Lossy Wireless Net...

引用

5th International Conference on Wireless Communications, networking and Mobile Computing

作者： Wei, Xin Zhao, Li Xi, Ji Wang, Qingyun Southeast Univ Sch Informat Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781424436927

In this paper, network coding aware routing protocol for lossy wireless networks is proposed. It considers both potential coding opportunity in available route discovery process and link delivery ratio in optimal route selection. In route discovery process, it detects whether current flow can be coded with established flows in networks. And when more than one coding schemes exists in some intermediate node, it can determine coding scheme with the highest priority. Besides, in optimal path selection process, it adopts an improved ETX metric to estimate and choose the path which has lowest transmission count. Simulation results show that our proposed protocol can effectively improve the throughput of lossy wireless networks.

关键词： network coding routing lossy wireless networks

来源：评论

学校读者我要写书评

暂无评论

network coding with Remix Qualification for Multicasting in Delay-Tolerant networks

Network Coding with Remix Qualification for Multicasting in ...

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Hsu, Yu-Feng Hu, Chih-Lin Natl Cent Univ Dept Commun Engn Tao Yuan Taiwan

ISBN: (纸本)9781467359399;9781467359382

In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc networks. However, multicasting with replication-based methodologies can induce considerable message traffic and longer delivery delay time, thereby being vulnerable upon system performance. This paper exploits the potential of network coding to design an efficient network-coding multicast mechanism in delay-tolerant networks. In this design, intermediate nodes in a network can perform a specific remix qualification approach which can not only alleviate the dependency problem among coded blocks but also generate more innovative coded blocks for restoring the original message by destination nodes. Simulation results show that the proposed mechanism is able to achieve cost-effective performance as compared with the naive network-coding and the replication-based delivery mechanisms for message multicasting in delay-tolerant networks.

关键词： computer networks delay tolerant networks mobile ad hoc networks multicast communication network coding telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

network coding for TCP throughput enhancement over a multi-hop wireless network

Network coding for TCP throughput enhancement over a multi-h...

引用

3rd International Conference on Communication System Software and Middleware and Workshop

作者： David, P. Samuel Kumar, Anurag Indian Inst Technol Dept Elect Commun Engn Madras 600036 Tamil Nadu India

ISBN: (纸本)9781424417964

The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance of TCP controlled bulk transfers over a chain topology multi-hop wireless network. The nodes use a CSMA/CA mechanism, such as IEEE 802.11's DCF, to perform distributed packet scheduling. The reverse flowing TCP ACKs are sought to be X-ORed with forward flowing TCP data packets. We find that, without any modification to the MAC protocol, the gain from network coding is negligible. The inherent coordination problem of carrier sensing based random access in multi-hop wireless networks dominates the performance. We provide a theoretical analysis that yields a throughput bound with network coding. We then propose a distributed modification of the IEEE 802.11 DCF, based on tuning the back-off mechanism using a feedback approach. Simulation studies show that the proposed mechanism when combined with network coding, improves the performance of a TCP session by more than 100%.

关键词： multi-hop wireless networks network coding TCP performance over wireless networks

来源：评论

学校读者我要写书评

暂无评论

network coding Techniques in Cooperative Cognitive networks

Network Coding Techniques in Cooperative Cognitive Networks

引用

Global Information Infrastructure and networking Symposium (GIIS)

作者： Papadopoulos, Athanasios Chatzidiamantis, Nestor D. Georgiadis, Leonidas Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki Greece

ISBN: (纸本)9781538672723

In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance improvement of Primary user transmissions, while at the same time obtaining more transmission opportunities for its own transmissions. Specifically, we examine the possibility of improving the overall system performance by employing network coding techniques. The objective is to achieve this while affecting Primary user transmissions only positively, namely: 1) avoid network coding operations at the Primary transmitter in order avoid increase of its complexity and storage requirements, 2) keep the order of packets received by the Primary receiver the same as in the non cooperative case and 3) induce packet service times that are stochastically smaller than packet service times induced in the non-cooperative case. A network coding algorithm that operates without knowledge of channel and packet arrival rate statistics, is investigated in terms of achieved throughput region. It is shown that the proposed algorithm enlarges Secondary user throughput as compared to the case where the Secondary transmitter acts as a simple relay, while leaving the Primary user stability region unaffected.

关键词： Radio transmitters Throughput Receivers network coding Relays Encoding

来源：评论

学校读者我要写书评

暂无评论

network coding-aware Channel Allocation and Routing in Cognitive Radio networks

Network Coding-aware Channel Allocation and Routing in Cogni...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Shu, Zhihui Zhou, Jiazhen Yang, Yaoqing (Lamar) Sharif, Hamid Qian, Yi Univ Nebraska Lincoln Dept Comp & Elect Engn Omaha NE 68182 USA

ISBN: (纸本)9781467309219;9781467309202

In this paper, we investigate a network coding-aware channel allocation and routing scheme for multi-hop cognitive radio networks. We consider network coding and channel availability in cognitive radio networks and maximize the throughput by allocating the channel and link rate appropriately. First, we model the activities of the primary users and the interference among the secondary users in a cognitive radio network and show how to implement network coding in the multi-hop cognitive radio network. Second, we formulate an optimization problem to maximize the throughput of the network. It takes advantage of the network coding opportunities and considers the channel availability constraint. By solving this optimization problem, we can determine how to allocate channels and rates of links in different channel availability scenarios. Furthermore, we compare the performance of our scheme with the coding oblivious routing for different scenarios of channel availability and maximum number of channels in a random wireless network. Our work brings insights on the benefits of network coding-aware routing in multi-hop cognitive radio networks.

关键词： channel allocation cognitive radio interference suppression network coding telecommunication network routing

来源：评论

学校读者我要写书评

暂无评论

network coding Assisted Cooperative Relay Scheme for Sender-oriented Broadcast in VANETs

Network Coding Assisted Cooperative Relay Scheme for Sender-...

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Wu, Celimuge Ohzahata, Satoshi Kato, Toshihiko Univ Electrocommun Grad Sch Informat Syst Chofu Tokyo 182 Japan

ISBN: (纸本)9781467359399;9781467359382

In vehicular ad hoc networks (VANETs), a multi-hop broadcast protocol is required to disseminate traffic warning information. Reducing broadcast message overhead while maintaining a high dissemination ratio is a very challenging task. In this paper, we study how to improve the performance of sender-oriented broadcast protocols using network coding. We propose a scheme which uses network coding to improve the packet dissemination ratio without increasing the message overhead. In the proposed scheme, the source node specifies two relay nodes. With cooperation between two relay nodes, the proposed scheme significantly increases the packet reception ratio by utilizing the broadcast nature of wireless channel. We show the effectiveness of the proposed scheme by using both theoretical analysis and computer simulations.

关键词： network coding relay V2V Trunk Node Scheme Computer Simulation broadcast message Theoretical analysis Dissemination Packet

来源：评论

学校读者我要写书评

暂无评论

network coding-Aware IEEE 802.11 MAC Protocol Using Batch Transmissions and Multiple Reverse Direction Exchanges

Network Coding-Aware IEEE 802.11 MAC Protocol Using Batch Tr...

引用

IEEE International Conference on Communications (ICC)

作者： Palacios-Trujillo, Raul Dabi, Biniam Hailu Alonso-Zarate, Jesus Granelli, Fabrizio Fitzek, Frank H. P. da Fonseca, Nelson L. S. Univ Estadual Campinas Inst Comp Campinas SP Brazil Ctr Tecnol Telecomunicac Catalunya Catalunya Spain Univ Trento Dept Comp Sci & Informat Engn Trento Italy Tech Univ Dresden Commun Networks Grp Dresden Germany

ISBN: (纸本)9781479966646

It has been shown in the literature that network coding (NC) can boost the performance of wireless networks. However, to really obtain the potential gain of NC, efficient Medium Access Control (MAC) protocols that operate with awareness of the NC functions are necessary. In this paper, we propose a novel NC-aware MAC protocol for IEEE 802.11 wireless networks that combines k-batch transmissions and multiple receiver-initiated reverse direction exchanges involving NC data to boost the overall network performance. The proposed protocol allows any node to transmit a burst of data packets in a single channel access invocation. Then, an intermediate node can transmit an NC data packet when receiving a valid data packet from a source node, without contending for channel access. Both analytical and simulation results presented in this paper show the high throughput and energy efficiency of the proposed protocol with gains ranging from 33% to 298% when compared to existing mechanisms based on the IEEE 802.11 Standard.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding Parallelization Based on Matrix Operations for Multicore Architectures

Network Coding Parallelization Based on Matrix Operations fo...

引用

IEEE International Conference on Ubiquitous Wireless Broadband (ICUWB)

作者： Wunderlich, Simon Cabrera, Juan Fitzek, Frank H. P. Pedersen, Morten V. Tech Univ Dresden Chair Commun Networks Dresden Germany Aalborg Univ Dept Elect Syst Aalborg Denmark

ISBN: (纸本)9781467365550

network coding has the potential to improve the performance of current and future communication systems (including transportation and storage) and is currently even considered for communication architectures between the individual processors on same board or different boards in close proximity. Despite the fact that single core implementations show already comparable coding speeds with standard coding approaches, this paper pushes network coding to the next level by exploiting multicore architectures. The disruptive idea presented in the paper is to break with current software implementations and coding approaches and to adopt highly optimized dense matrix operations from the high performance computation field for network coding in order to increase the coding speed. The paper presents the novel coding approach for multicore architectures and shows coding speed gains on a commercial platform such as the Raspberry Pi2 with four cores in the order of up to one full magnitude. The speed increase gain is even higher than the number of cores of the Raspberry Pi2 since the newly introduced approach exploits the cache architecture way better than by-the-book matrix operations.

关键词： Decoding Encoding Libraries Multicore processing network coding Throughput

来源：评论

学校读者我要写书评

暂无评论

network coding-based Distributed network Formation Game for Multi-source Multicast networks

Network Coding-based Distributed Network Formation Game for ...

引用

IEEE International Conference on Communications (ICC)

作者： Kwon, Minhae Park, Hyunggon Ewha Womans Univ Dept Elect & Elect Engn Seoul South Korea

ISBN: (纸本)9781467389990

In this paper, we propose a distributed solution based on game-theoretic approaches to the topology formation problem for mobile wireless sensor networks with multi-source multicast flows. Our solution significantly reduces computational complexity by taking advantage of network coding. Finding an optimal topology for network coding in multi-source multicast flows is NP-hard problem, so the proposed algorithm provides a suboptimal solution with low computational complexity. We formulate the problem of distributed network topology formation as a network formation game by considering the nodes in the network as players that can take actions for making outgoing links. The proposed game, which consists of multiple players and multicast flows, can be decomposed into independent link formation games played by only two players with a unicast flow. The proposed algorithm is also guaranteed to converge, i.e., a stable network topology can be always formed. Our simulation results confirm that the computational complexity of the proposed solution is low enough for practical deployment in large-scale mobile, wireless sensor networks.

关键词： Games network topology network coding Topology Ad hoc networks Computational complexity Silicon

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：