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

IEEE Wireless Communications and networking Conference (WCNC)

作者： Garrido, Pablo Aguero, Ramon Univ Cantabria Dept Commun Engn E-39005 Santander Spain

ISBN: (纸本)9781538617342

Multicast services are believed to play a relevant role in next wireless networking scenarios. In this paper we exploit Tunable Sparse network coding techniques to increase reliability of multicast communications. We show that the proposed network coding scheme yields a better performance than state-of-the-art solutions, which are traditionally based on retransmissions. We first use a model to analytically compare the two approaches. Then, we validate and broaden this analysis by means of an experimental campaign over a testbed deployed with Commercial Of-The-Shelf devices. This platform, comprising low cost devices (Raspberry-PI), allows us to assess the feasibility of the proposed solution, which offers a relevant gain in terms of performance.

关键词： Multicast Communications random linear network coding Sparse network coding Measurements

来源：评论

学校读者我要写书评

暂无评论

Transport layer performance combining multipath and network coding in mobile satellite networks

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND networkING 2017年第6期35卷 583-603页

作者： Giambene, Giovanni Doanh Kim Luong Van Anh Le de Cola, Tomaso Muhammad, Muhammad Univ Siena CNIT Dept Informat Engn & Math Sci Via Roma 56 I-53100 Siena Italy German Aerosp Ctr DLR Inst Commun & Nav D-82234 Oberpfaffenhofen Germany

Satellite networks are expected to support multimedia traffic flows, offering high capacity with quality of service guarantees. In this paper, we consider future satellite networks able to exploit multiple paths to reach mobile users also by means of a terrestrial complementary coverage. The interest is to exploit the path diversity by adopting network coding at a shim layer between Internet protocol and media access control. We have proposed several variants of network-coding schemes with different organizations in terms of interflow and intraflow encoding, where the packets generated by the encoder are split and sent on different paths. Our path-based network coding (PBNC) techniques have been combined with multipath transmission control protocol (MPTCP) and TCP at transport layer, thus obtaining PBNC-MPTCP and PBNC-TCP. We have evaluated the performance of these techniques by means of Ns-2 simulations. A cross-layer criterion has been adopted to determine the settings of the encoders. Our PBNC-based schemes have shown better goodput performance than a benchmark scheme considering 2 different scenarios (one with symmetrical paths and one with unbalanced paths) in the presence of GOOD/BAD mobile channels.

关键词： mobile satellite systems multipath TCP random linear network coding TCP

来源：评论

学校读者我要写书评

暂无评论

Packing and Covering Properties of Subspace Codes for Error Control in random linear network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第5期56卷 2097-2108页

作者： Gadouleau, Maximilien Yan, Zhiyuan Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

Codes in the projective space and codes in the Grass-mannian over a finite field-referred to as subspace codes and constant-dimension codes (CDCs), respectively-have been proposed for error control in random linear network coding. For subspace codes and CDCs, a subspace metric was introduced to correct both errors and erasures, and an injection metric was proposed to correct adversarial errors. In this paper, we investigate the packing and covering properties of subspace codes with both metrics. We first determine some fundamental geometric properties of the projective space with both metrics. Using these properties, we then derive bounds on the cardinalities of packing and covering subspace codes, and determine the asymptotic rates of optimal packing and optimal covering subspace codes with both metrics. Our results not only provide guiding principles for the code design for error control in random linear network coding, but also illustrate the difference between the two metrics from a geometric perspective. In particular, our results show that optimal packing CDCs are optimal packing subspace codes up to a scalar for both metrics if and only if their dimension is half of their length (up to rounding). In this case, CDCs suffer from only limited rate loss as opposed to subspace codes with the same minimum distance. We also show that optimal covering CDCs can be used to construct asymptotically optimal covering subspace codes with the injection metric only.

关键词： Constant-dimension codes (CDCs) covering error control codes injection metric network coding packing random linear network coding subspace codes subspace metric

来源：评论

学校读者我要写书评

暂无评论

Lossless coding of Correlated Sources With Actions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第2期63卷 1237-1252页

作者： Sabag, Oron Permuter, Haim H. Cohen, Asaf Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel Ben Gurion Univ Negev Dept Commun Syst Engn IL-8410501 Beer Sheva Israel

This paper studies the problem of the distributed compression of correlated sources with an action-dependent joint distribution. This class of problems is, in fact, an extension of the Slepian-Wolf model, but where cost-constrained actions taken by the encoder or the decoder affect the generation of one of the sources. The purpose of this paper is to study the impact of actions on the achievable rates. In particular, two cases where transmission occurs over a rate-limited link are studied;case A for actions taken at the decoder and case B where actions are taken at the encoder. A complete single-letter characterization of the set of achievable rates is given in both cases. Furthermore, a network coding setup for the case where actions are taken at the encoder is investigated. The sources are generated at different nodes of the network and are required at a set of terminal nodes, yet transmission occurs over a general, acyclic, directed network. For this setup, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided. For this scenario, random linear network coding is proved to be optimal, even though this is not a classical multicast problem. In addition, two binary examples are investigated and demonstrate how actions taken at different nodes of the system have a significant effect on the achievable rate region, when compared with a naive time-sharing strategy.

关键词： Actions correlated sources distributed compression network coding random linear network coding Slepian-wolf source coding

来源：评论

学校读者我要写书评

暂无评论

Throughput Optimization with random network coding in Cooperative Wireless network 1

Throughput Optimization with Random Network Coding in Cooper...

引用

1st International Conference on Electronics Instrumentation & Information Systems (EIIS)

作者： Hu, Guojie Xu, Kui Xu, Youyun PLA Univ Sci & Technol Coll Commun Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9781538608432

In this paper, we focus on the cooperative strategy for multi-source multi-relay system. In order to overcome unreliable wireless channels, we introduce a certain diversity degree by limiting the number of original packets included in one transmission no more than the number of sources. We applied two diversity schemes, which called spatial diversity combined random linear network coding (SDRLNC) and simple spatial diversity (SSD), respectively. We derived bounds of throughput for these two schemes, respectively. Through simulation we got the conclusion that, given a series of parameters, the SDRLNC scheme always has a better performance and there always exists an optimal diversity degree for both schemes for the purpose of obtaining the optimal throughput.

关键词： Diversity degree optimal throughput upper bound lower bound erasure probability random linear network coding

来源：评论

学校读者我要写书评

暂无评论

On Expected Transmissions for Wireless random linear coding

On Expected Transmissions for Wireless Random Linear Coding

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Qureshi, Jalaluddin Malik, Adeel Foh, Chuan Heng Namal Coll Dept Elect Engn Mianwali Pakistan Univ Surrey ICS Guildford Surrey England

ISBN: (纸本)9781538616291

In this paper we revisit the problem of deriving the expected number of transmissions for multicasting random linear coded (RLC) packets on single-hop wireless channels. We show by deriving the closed form expression for an instance of the problem that previous analytical formulation does not accurately model the true expected number of transmissions, especially for smaller finite field size. Our understanding is that similar to the wireless multi-hop network, the problem of deriving an exact closed form expression for the expected number of transmissions for a single-hop RLC wireless network is a complex open problem. As it is unknown whether a scalable closed form expression for the problem exists, we then propose a computationally efficient Monte Carlo method to derive a good approximation of the expected number of transmissions.

关键词： random linear network coding Markov Chain Wireless Multicasting Expected Transmissions Monte Carlo Method

来源：评论

学校读者我要写书评

暂无评论

coding Schemes for Heterogeneous Communication Links Using Channel Bundling 8th

引用

8th EAI International Conference on Mobile networks and Management (MONAMI)

作者： Eichhorn, Vanessa Muehleisen, Maciej Timm-Giel, Andreas Hamburg Univ Technol Inst Commun Networks ComNets Hamburg Germany

ISBN: (纸本)9783319527123;9783319527116

Communication over geostationary satellite links is improved by introducing end-to-end Forward Error Correction (FEC) and simultaneous transmissions over two links (channel bundling). The main objective of this work is to investigate to which degree the goodput and the reliability can be enhanced using the mentioned techniques. The performances of the two FEC schemes Reed-Solomon Codes and random linear network coding are compared. Uncorrelated and correlated packet errors are considered, the latter with a Gilbert-Elliot channel model. Experiments are conducted in a testbed consisting of a single PC with virtual network interfaces to determine the influence of various parameter settings on performance. Results are compared against a scenario with one link offering the same capacity as the two links together. It is concluded that using two heterogeneous links is beneficial for the goodput and losses for generation sizes larger than 20 for three correlated lost packets on average.

关键词： Forward Error Correction random linear network coding Reed-Solomon codes Gilbert-Elliot channel model Satellite communication

来源：评论

学校读者我要写书评

暂无评论

A Construction of Orbit Codes 1

引用

5th International Castle Meeting on coding Theory and Applications (ICMCTA)

作者： Climent, Joan-Josep Requena, Veronica Soler-Escriva, Xaro Univ Alacant Dept Matemat Ap Correus 99 Alacant 03080 Spain Univ Miguel Hernandez Elche Dept Estadist Matemat & Informat Avda Univ S-N Alicante 03202 Spain

ISBN: (数字)9783319662787

ISBN: (纸本)9783319662787;9783319662770

Given a finite field F-q, a constant dimension code is a set of k-dimensional subspaces of F-q(n). Orbit codes are constant dimension codes which are defined as orbits when the action of a subgroup of the general linear group on the set of all subspaces of F-q(n) is considered. In this paper we present a construction of an Abelian non-cyclic orbit code whose minimum subspace distance is maximal.

关键词： random linear network coding Subspace codes Grassmannian Group action General linear group

来源：评论

学校读者我要写书评

暂无评论

Broadcasting in Noisy Radio networks 17

Broadcasting in Noisy Radio Networks

引用

36th ACM Symposium on Principles of Distributed Computing (PODC)

作者： Censor-Hillel, Keren Haeupler, Bernhard Hershkowitz, D. Ellis Zuzic, Goran Technion IL-32000 Haifa Israel Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450349925

The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this model, the strong assumption is made that node v receives a message from a neighbor if and only if exactly one of its neighbors broadcasts. We relax this assumption by introducing a new noisy radio network model in which random faults occur at senders or receivers. Specifically, for a constant noise parameter p is an element of[0, 1), either every sender has probability p of transmitting noise or every receiver of a single transmission in its neighborhood has probability p of receiving noise. We first study single-message broadcast algorithms in noisy radio networks and show that the Decay algorithm [Bar-Yehuda et al., 1992] remains robust in the noisy model while the diameter-linear algorithm of Gasieniec et al., 2007 does not. We give a modified version of the algorithm of Gasieniec et al., 2007 that is robust to sender and receiver faults, and extend both this modified algorithm and the Decay algorithm to robust multi-message broadcast algorithms, broadcasting Omega (1/log n log log n). and Omega (1/log n). messages per round, respectively. We next investigate the extent to which (network) coding improves throughput in noisy radio networks. In particular, we study the coding cap - the ratio of the throughput of coding to that of routing - in noisy radio networks. We address the previously perplexing result of Alon et al. 2014 that worst case coding throughput is no better than worst case routing throughput up to constants: we show that the worst case throughput performance of coding is, in fact, superior to that of routing - by a Theta (log (n)) gap - provided receiver faults are introduced. However, we show that sender faults have little effect on throughput. In particular, we show that any coding or routing scheme for the noiseless setting can be transformed to be robust to sender faul

关键词： radio networks robust radio networks network gossip random linear network coding network coding gaps

来源：评论

学校读者我要写书评

暂无评论

An Attribute & network coding-based Secure Multicast Protocol for Firmware Updates in Smart Grid AMI networks 26

An Attribute & Network Coding-based Secure Multicast Protoco...

引用

26th International Conference on Computer Communication and networks (ICCCN)

作者： Tonyali, Samet Akkaya, Kemal Saputro, Nico Cheng, Xiuzhen Florida Int Univ Dept Elect & Comp Engn Miami FL 33174 USA George Washington Univ Dept Comp Sci Washington DC 20052 USA

ISBN: (纸本)9781509029914

Smart meters operate based on their firmware ruling the hardware. The firmware occasionally needs to be updated to fix bugs and improve the services. Since the smart meter firmware is proprietary, the update file should be communicated to the smart meters in a secure way. In addition, the firmware update may target a specific subgroup of the smart meters rather than all of them in which case access control is required. In this paper, we address the problem of updating the smart meter firmware securely in an IEEE 802.11s-based AMI network and develop a secure and reliable multicast-over-broadcast protocol by making use of ciphertext-policy attributebased signcryption (CP-ABSC) to provide not only confidentiality and access control but also message authentication. CP-ABSC is employed to signcrypt both the firmware update file and the firmware update request based on an access tree such that the signcrypted update file and request can be designcrypted by the smart meters possessing the attributes that can satisfy the access tree. The preliminary tests showed that increased size of the request due to signcryption reduces reliability of the protocol. Therefore, we employ random linear network coding along with CP-ABSC in order to increase the reliability and use the bandwidth and processing resources efficiently. We assessed the performance of the proposed protocol under ns-3 network simulator. The simulation results have shown that the protocol can accomplish the process of downloading a firmware update without needing any human intervention while consuming less bandwidth when compared to a baseline that employs unicasting.

关键词： smart grid advanced metering infrastructure IEEE 802.11s secure firmware update multicast-over-broadcast attribute based signcryption random linear network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：