Nowadays, video streaming has became one of the most popular multimedia applications and will be the dominant data traffic in cellular networks. This is a real challenge for mobile network operators because the cellul...
详细信息
Random Linear network coding (RLNC) theoretical results typically assume that packets have equal sizes while in reality, data traffic presents a random packet size distribution. Conventional wisdom considers zero-padd...
详细信息
The earth observation system has evolved from a single satellite platform to a multi-satellite network system. The satellites based on inter-satellite links form a space wireless Ad hoc network system. When the satell...
详细信息
The earth observation system has evolved from a single satellite platform to a multi-satellite network system. The satellites based on inter-satellite links form a space wireless Ad hoc network system. When the satellites move round the earth, the connection of the satellite with ground will transfer from a ground station to another ground station. The connection and disconnection between the satellite and the ground station will bring the problem of network IP layer mobility management and the satellite connection handoff. In order to ensure the continuity of satellite network communication, the mobile and handoff management problem of satellite network must be solved. The mobile and handoff management of satellite network is one of the key technologies especially for the LEO satellite network. There are several methods for satellite network mobile and handoff management, such as mobile IP, Seamless IP Diversity-based Generalized Mobility Architecture (SIGMA). These methods have some defects that there is long handoff delay or high packet loss rate. In this paper, the mobility characteristics of space satellite network are discussed and the cross-layer design and network coding methods are proposed for satellite network handoff management. Through theoretical analysis and simulation, the network cross-layer design and network coding method can effectively improve the satellite network handoff latency, and reduce the packet loss rate, by the scheme the handoff performance is optimized and can be sued as reference for satellite network design.
The recent research studies showed that inter-layered network coding is a promising approach to provide the unequal error protection for scalable video multicast under the channel heterogeneity. The selection of the o...
详细信息
Proof Of Retrievability (POR) is a protocol that supports a data owner to check whether the data stored in cloud servers is available, intact and retrievable. Based on the POR, network coding technique has been applie...
详细信息
network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years...
详细信息
network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fa
Physical-layer network coding (PNC) can significantly improve the throughput of wireless communication systems by exploiting signal superimposition at relays. It is practically challenging to achieve symbol alignment ...
详细信息
ISBN:
(纸本)9781509001330
Physical-layer network coding (PNC) can significantly improve the throughput of wireless communication systems by exploiting signal superimposition at relays. It is practically challenging to achieve symbol alignment in PNC. In this paper, we study the impact of the signal power loss and the inter-symbol-interference (ISI) on the system performance when the symbols are not aligned. We show that when the signal power loss is taken into account during the decoding process, the system performance can be improved significantly. Simulation results also show that by sacrificing spectral efficiency, the PNC system using Gaussian pulses generally achieves higher bit-error-rate (BER) performance than the one using square-root raised-cosine (RRC) pulses when symbol misalignment occurs.
Aiming at the anti-eavesdrop security demand and potential safety hazard in Ad hoc, a secure random linear network coding algorithm was proposed. The algorithm has secure source coding and protecting the coding vector...
详细信息
Aiming at the anti-eavesdrop security demand and potential safety hazard in Ad hoc, a secure random linear network coding algorithm was proposed. The algorithm has secure source coding and protecting the coding vectors. The information source secure coding method and optimizing the finite region is defined to guarantee that the information is properly protected. Different coding vectors protecting schemes were designed for adapting security path and without. We applied the secure random linear network coding algorithm in Ad Hoc networks to meet the demand on anti-eavesdrop. The anti-eavesdrop algorithm based on network coding is simulated and analyzed in NS2 platform, the results shown that comparing with the encryption algorithm, the anti-eavesdrop algorithm based on network coding has better performance in end-to-end delay and encryption speed.
Multi-hop multicast routing can provide better communication performance in multi-hop wireless networks. However, existing multi-hop multicast routing hardly take into account energy efficiency of networks. This paper...
详细信息
Multi-hop multicast routing can provide better communication performance in multi-hop wireless networks. However, existing multi-hop multicast routing hardly take into account energy efficiency of networks. This paper studies the energy-efficient multicast communication aiming at multi-hop wireless networks. Firstly, we analyze energy metric and energy efficiency metric of multi-hop networks. Then the corresponding models are given. Secondly, network coding is used to improve network throughput. Different from previous methods, we here consider that network nodes are satisfied with a certain random distribution. In such a case, it is a challenge to construct the network structure that network coding requires. For the above random network topology, we propose three basic structures of network coding to overcome this problem. Thirdly, we present a flexible energy-efficient multicast routing algorithm for multi-hop wireless networks to extensively exploit the network structure proposed above to maximize network throughput and decrease network energy consumption. Finally, we perform numerical experiments by network simulation. Simulation results indicate that our approach is significantly promising. (C) 2015 Elsevier Inc. All rights reserved.
This article investigates the joint application of compressive sensing (CS) and network coding (NC) to the problem of energy-efficient data gathering in wireless sensor networks. We consider the problem of optimally c...
详细信息
This article investigates the joint application of compressive sensing (CS) and network coding (NC) to the problem of energy-efficient data gathering in wireless sensor networks. We consider the problem of optimally constructing forwarding trees to carry compressed data to projection nodes. Each compressed dataset refers to a weighted aggregation (or sum) of sensed measurements from network sensors collected at one projection node. Projection nodes then forward their received compressed data to the sink, which subsequently recovers the original measurements. This aggregation technique, based on CS, is shown to reduce significantly the number of transmissions in the network. We observe that the presence of multiple forwarding trees gives rise to many-to-many communication patterns in sensor networks that, in turn, can be exploited to perform NC on the compressed data being forwarded on these trees. Such a technique will further reduce the number of transmissions required to gather the measurements, resulting in a better network-wide energy efficiency. This article addresses the problem of NC-aware construction of forwarding/aggregation trees. We present a mathematical model to optimally construct such forwarding trees, which encourage NC operations on the compressed data. Owing to its complexity, we further develop algorithmic methods (both centralized and distributed) for solving the problem and analyze their complexities. We show that our algorithmic methods are scalable and accurate, with worst-case optimality gap not exceeding 3.96% in the studied scenarios. We also show that, when bothNC and compressive data gathering are considered jointly, performance gains (reduction in number of transmissions) of up to 30% may be attained. Finally, we show that the proposed methods distribute the workload of data gathering throughout the network nodes uniformly, resulting in extended network life times.
暂无评论