Time synchronization is a prerequisite for ensuring determinism in time-sensitive networking(TSN).While time synchronization errors cannot be overlooked,pursuing minimal time errors may incur unnecessary costs.Using c...Time synchronization is a prerequisite for ensuring determinism in time-sensitive networking(TSN).While time synchronization errors cannot be overlooked,pursuing minimal time errors may incur unnecessary costs.Using complex network theory,this study proposes a hierarchy for TSN and introduces the concept of bounded time error.A coupling model between traffic scheduling and time synchronization is established,deriving functional relationships among end-to-end delay,delay jitter,gate window,and time error.These relationships illustrate that time errors can trigger jumps in delay and delay jitter.To evaluate different time errors impact on traffic scheduling performance,an end-to-end transmission experiment scheme is designed,along with the construction of a TSN test platform implementing two representative cases.Case A is a closed TSN domain scenario with pure TSN switches emulating closed factory floor network.Case B depicts remote factory interconnection where TSN domains link via non-TSN domains composed of OpenFlow switches.Results from Case A show that delay and delay jitter on a single node are most significantly affected by time errors,up to one gating cycle.End-to-end delay jitter tends to increase with the number of hops.When the ratio of time error bound to window exceeds 10%,the number of schedulable traffic flows decreases rapidly.Case B reveals that when time error is below 1μs,the number of schedulable traffic flows begins to increase significantly,approaching full schedulability at errors below 0.6μs.展开更多
Emerging long-range industrial IoT applications(e.g.,remote patient monitoring)have increasingly higher requirements for global deterministic delay.Although many existing methods have built deterministic networks in s...Emerging long-range industrial IoT applications(e.g.,remote patient monitoring)have increasingly higher requirements for global deterministic delay.Although many existing methods have built deterministic networks in small-scale networks through centralized computing and resource reservation,they cannot be applied on a global scale.The emerging mega-constellations enable new opportunities for realizing deterministic delay globally.As one constellation(e.g.,Starlink)might be managed by a single operator(e.g.,SpaceX),packets can be routed within deterministic number of hops.Moreover,the path diversity brought by the highly symmetrical network structure in mega-constellations can help to construct a congestion free network by routing.This paper leverages these unique characteristics of mega-constellations to avoid the traditional network congestion caused by multiple inputs and single output,and to determine the routing hops,and thus realizing a global deterministic network(DETSPACE).The model based on the 2D Markov chain theoretically verifies the correctness of DETSPACE.The effectiveness of DETSPACE in different traffic load con-ditions is also verified by extensive simulations.展开更多
A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the...A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the principle of particle swarm optimization (PSO) and artificial immune system (AIS).The algorithm was analyzed in detail and proper swarm size,evolving generations,gene-exchange individual order,and gene-exchange proportion in molecule were obtained for better algorithm performances.According to the test results,the appropriate parameters are about 50 swarm individuals,over 3 000 evolving generations,20%-25% gene-exchange proportion in molecule with gene-exchange taking place between better fitness affinity individuals.The algorithm is practical and effective in maximizing the coverage probability with given number of sensors and minimizing sensor numbers with required coverage probability in sensor placement.It can reach a better result quickly,especially with the proper calculation parameters.展开更多
The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has bec...The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.展开更多
With the rapid growth of connected devices,traditional edge-cloud systems are under overload pressure.Using mobile edge computing(MEC)to assist unmanned aerial vehicles(UAVs)as low altitude platform stations(LAPS)for ...With the rapid growth of connected devices,traditional edge-cloud systems are under overload pressure.Using mobile edge computing(MEC)to assist unmanned aerial vehicles(UAVs)as low altitude platform stations(LAPS)for communication and computation to build air-ground integrated networks(AGINs)offers a promising solution for seamless network coverage of remote internet of things(IoT)devices in the future.To address the performance demands of future mobile devices(MDs),we proposed an MEC-assisted AGIN system.The goal is to minimize the long-term computational overhead of MDs by jointly optimizing transmission power,flight trajecto-ries,resource allocation,and offloading ratios,while utilizing non-orthogonal multiple access(NOMA)to improve device connectivity of large-scale MDs and spectral efficiency.We first designed an adaptive clustering scheme based on K-Means to cluster MDs and established commu-nication links,improving efficiency and load balancing.Then,considering system dynamics,we introduced a partial computation offloading algorithm based on multi-agent deep deterministic pol-icy gradient(MADDPG),modeling the multi-UAV computation offloading problem as a Markov decision process(MDP).This algorithm optimizes resource allocation through centralized training and distributed execution,reducing computational overhead.Simulation results show that the pro-posed algorithm not only converges stably but also outperforms other benchmark algorithms in han-dling complex scenarios with multiple devices.展开更多
针对6G时代空天地一体化网络架构中空基网络无人集群对时延敏感型业务提出的确定性传输需求,提出一种基于跨层优化的确定性无人集群网络协议——LPCO(link-scheduling and path-planning based on cross-layer optimization)。该协议在...针对6G时代空天地一体化网络架构中空基网络无人集群对时延敏感型业务提出的确定性传输需求,提出一种基于跨层优化的确定性无人集群网络协议——LPCO(link-scheduling and path-planning based on cross-layer optimization)。该协议在中心节点控制的集中式架构下,融合链路状态感知、业务需求感知、显式路径规划和周期时隙调度等关键模块,实现了网络层路径选择与MAC层时隙分配的联合调度,构建了端到端的跨层协同优化机制。具体方法包括:在中心控制节点完成对全网拓扑感知后,通过基于链路过期时间(link expiration time, LET)进行链路预测,利用QoS加权目标函数实现路径规划,结合TDMA对路径节点动态分配时隙,确保关键业务在无人集群网络下的低延迟传输和高可靠性。通过在NS3仿真平台中与典型路由协议OLSR和DSDV对比验证,仿真实验结果表明:LPCO相较OLSR与DSDV协议,时敏业务的平均端到端时延分别降低了43.6%、40.7%;时敏业务的分组投递率提升了69.3%、73.5%;瞬时时延抖动控制在3 ms以内,部分数据包抖动接近0,在无人集群网络中展现出确定性服务保障能力与鲁棒性。展开更多
This paper analyzes PROFIBUS-DP network delay in detail and presents the calculational formula of its maximum time-delay, which is significant to the research of PROFIBUS-DP. At the same time, the paper puts forward a...This paper analyzes PROFIBUS-DP network delay in detail and presents the calculational formula of its maximum time-delay, which is significant to the research of PROFIBUS-DP. At the same time, the paper puts forward a method of simplifying the network induced time-varying indeterminate system according to the features of the network. Through the analysis of a pump-control-motor system which is composed of PROFIBUS-DP network, it illustrates the network＇s influence on the performance of control systems. This method helps to design and analyze the network＇s influence on the performance of control systems, which is of considerable practical value in a time when network control systern is widely used.展开更多
With the vigorous development of automobile industry,in-vehicle network is also constantly upgraded to meet data transmission requirements of emerging applications.The main transmission requirements are low latency an...With the vigorous development of automobile industry,in-vehicle network is also constantly upgraded to meet data transmission requirements of emerging applications.The main transmission requirements are low latency and certainty especially for autonomous driving.Time sensitive networking(TSN)based on Ethernet gives a possible solution to these requirements.Previous surveys usually investigated TSN from a general perspective,which referred to TSN of various application fields.In this paper,we focus on the application of TSN to the in-vehicle networks.For in-vehicle networks,we discuss all related TSN standards specified by IEEE 802.1 work group up to now.We further overview and analyze recent literature on various aspects of TSN for automotive applications,including synchronization,resource reservation,scheduling,certainty,software and hardware.Application scenarios of TSN for in-vehicle networks are analyzed one by one.Since TSN of in-vehicle network is still at a very initial stage,this paper also gives insights on open issues,future research directions and possible solutions.展开更多
Recently,an approach for the rapid detection of small oscillation faults based on deterministic learning theory was proposed for continuous-time systems.In this paper,a fault detection scheme is proposed for a class o...Recently,an approach for the rapid detection of small oscillation faults based on deterministic learning theory was proposed for continuous-time systems.In this paper,a fault detection scheme is proposed for a class of nonlinear discrete-time systems via deterministic learning.By using a discrete-time extension of deterministic learning algorithm,the general fault functions(i.e.,the internal dynamics)underlying normal and fault modes of nonlinear discrete-time systems are locally-accurately approximated by discrete-time dynamical radial basis function(RBF)networks.Then,a bank of estimators with the obtained knowledge of system dynamics embedded is constructed,and a set of residuals are obtained and used to measure the differences between the dynamics of the monitored system and the dynamics of the trained systems.A fault detection decision scheme is presented according to the smallest residual principle,i.e.,the occurrence of a fault can be detected in a discrete-time setting by comparing the magnitude of residuals.The fault detectability analysis is carried out and the upper bound of detection time is derived.A simulation example is given to illustrate the effectiveness of the proposed scheme.展开更多
Ultra-reliable and low-latency communications(URLLC) has become a fundamental focus of future industrial wireless sensor net-works(IWSNs). With the evolution of automation and process control in industrial environment...Ultra-reliable and low-latency communications(URLLC) has become a fundamental focus of future industrial wireless sensor net-works(IWSNs). With the evolution of automation and process control in industrial environments, the need for increased reliabilityand reduced latencies in wireless communications is even pronounced. Furthermore, the 5G systems specifically target the URLLCin selected areas and industrial automation might turn into a suitable venue for future IWSNs, running 5G as a high speed inter-process linking technology. In this paper, a hybrid multi-channel scheme for performance and throughput enhancement of IWSNsis proposed. The scheme utilizes the multiple frequency channels to increase the overall throughput of the system along with theincrease in reliability. A special purpose frequency channel is defined, which facilitates the failed communications by retransmis-sions where the retransmission slots are allocated according to the priority level of failed communications of different nodes. Ascheduler is used to formulate priority based scheduling for retransmission in TDMA based communication slots of this channel.Furthermore, in carrier-sense multiple access with collision avoidance(CSMA/CA) based slots, a frequency polling is introducedto limit the collisions. Mathematical modelling for performance metrics is also presented. The performance of the proposed schemeis compared with that of IEEE802.15.4e, where the performance is evaluated on the basis of throughput, reliability and the num-ber of nodes accommodated in a cluster. The proposed scheme offers a notable increase in the reliability and throughput over theexisting IEEE802.15.4e Low Latency Deterministic Networks(LLDN) standard.展开更多
The comparison of networks with different orders strongly depends on the stability analysis of graph features in evolving systems. In this paper, we rigorously investigate the stability of the weighted spectral distri...The comparison of networks with different orders strongly depends on the stability analysis of graph features in evolving systems. In this paper, we rigorously investigate the stability of the weighted spectral distribution（i.e., a spectral graph feature） as the network order increases. First, we use deterministic scale-free networks generated by a pseudo treelike model to derive the precise formula of the spectral feature, and then analyze the stability of the spectral feature based on the precise formula. Except for the scale-free feature, the pseudo tree-like model exhibits the hierarchical and small-world structures of complex networks. The stability analysis is useful for the classification of networks with different orders and the similarity analysis of networks that may belong to the same evolving system.展开更多
An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing(CS-NCES)is proposed in this paper.Along with considering the correlations of data spatial and temporal,the algorit...An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing(CS-NCES)is proposed in this paper.Along with considering the correlations of data spatial and temporal,the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing.The source node firstly encodes the data,then compresses the coding data by cot-npressed sensing over finite fields.Compared with the network coding scheme,simulation results show that CS-NCES reduces the energy consumption about 25.30/0-34.50/0 and improves the efficiency of data reconstruction about 1.56%-5.98%.The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks,but also improve the network performance.展开更多
基金supported in part by the Science and Technology Research and Development Foundation of China Academy of Railway Sciences Corporation Limited(Grant No.2023YJ364)in part by National Key R&D Program of China(Grant No.2022YFC3803700)in part by the project of Beijing Laboratory of Advanced Information Networks.
文摘Time synchronization is a prerequisite for ensuring determinism in time-sensitive networking(TSN).While time synchronization errors cannot be overlooked,pursuing minimal time errors may incur unnecessary costs.Using complex network theory,this study proposes a hierarchy for TSN and introduces the concept of bounded time error.A coupling model between traffic scheduling and time synchronization is established,deriving functional relationships among end-to-end delay,delay jitter,gate window,and time error.These relationships illustrate that time errors can trigger jumps in delay and delay jitter.To evaluate different time errors impact on traffic scheduling performance,an end-to-end transmission experiment scheme is designed,along with the construction of a TSN test platform implementing two representative cases.Case A is a closed TSN domain scenario with pure TSN switches emulating closed factory floor network.Case B depicts remote factory interconnection where TSN domains link via non-TSN domains composed of OpenFlow switches.Results from Case A show that delay and delay jitter on a single node are most significantly affected by time errors,up to one gating cycle.End-to-end delay jitter tends to increase with the number of hops.When the ratio of time error bound to window exceeds 10%,the number of schedulable traffic flows decreases rapidly.Case B reveals that when time error is below 1μs,the number of schedulable traffic flows begins to increase significantly,approaching full schedulability at errors below 0.6μs.
基金This work is supported by National Key Research and Development Plan of China(2022YFB3105204).
文摘Emerging long-range industrial IoT applications(e.g.,remote patient monitoring)have increasingly higher requirements for global deterministic delay.Although many existing methods have built deterministic networks in small-scale networks through centralized computing and resource reservation,they cannot be applied on a global scale.The emerging mega-constellations enable new opportunities for realizing deterministic delay globally.As one constellation(e.g.,Starlink)might be managed by a single operator(e.g.,SpaceX),packets can be routed within deterministic number of hops.Moreover,the path diversity brought by the highly symmetrical network structure in mega-constellations can help to construct a congestion free network by routing.This paper leverages these unique characteristics of mega-constellations to avoid the traditional network congestion caused by multiple inputs and single output,and to determine the routing hops,and thus realizing a global deterministic network(DETSPACE).The model based on the 2D Markov chain theoretically verifies the correctness of DETSPACE.The effectiveness of DETSPACE in different traffic load con-ditions is also verified by extensive simulations.
基金Project(2008BA00400)supported by the Foundation of Department of Science and Technology of Jiangxi Province,China
文摘A novel immune-swarm intelligence (ISI) based algorithm for solving the deterministic coverage problems of wireless sensor networks was presented.It makes full use of information sharing and retains diversity from the principle of particle swarm optimization (PSO) and artificial immune system (AIS).The algorithm was analyzed in detail and proper swarm size,evolving generations,gene-exchange individual order,and gene-exchange proportion in molecule were obtained for better algorithm performances.According to the test results,the appropriate parameters are about 50 swarm individuals,over 3 000 evolving generations,20%-25% gene-exchange proportion in molecule with gene-exchange taking place between better fitness affinity individuals.The algorithm is practical and effective in maximizing the coverage probability with given number of sensors and minimizing sensor numbers with required coverage probability in sensor placement.It can reach a better result quickly,especially with the proper calculation parameters.
文摘The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.
基金supported by the Gansu Province Key Research and Development Plan(No.23YFGA0062)Gansu Provin-cial Innovation Fund(No.2022A-215).
文摘With the rapid growth of connected devices,traditional edge-cloud systems are under overload pressure.Using mobile edge computing(MEC)to assist unmanned aerial vehicles(UAVs)as low altitude platform stations(LAPS)for communication and computation to build air-ground integrated networks(AGINs)offers a promising solution for seamless network coverage of remote internet of things(IoT)devices in the future.To address the performance demands of future mobile devices(MDs),we proposed an MEC-assisted AGIN system.The goal is to minimize the long-term computational overhead of MDs by jointly optimizing transmission power,flight trajecto-ries,resource allocation,and offloading ratios,while utilizing non-orthogonal multiple access(NOMA)to improve device connectivity of large-scale MDs and spectral efficiency.We first designed an adaptive clustering scheme based on K-Means to cluster MDs and established commu-nication links,improving efficiency and load balancing.Then,considering system dynamics,we introduced a partial computation offloading algorithm based on multi-agent deep deterministic pol-icy gradient(MADDPG),modeling the multi-UAV computation offloading problem as a Markov decision process(MDP).This algorithm optimizes resource allocation through centralized training and distributed execution,reducing computational overhead.Simulation results show that the pro-posed algorithm not only converges stably but also outperforms other benchmark algorithms in han-dling complex scenarios with multiple devices.
文摘针对6G时代空天地一体化网络架构中空基网络无人集群对时延敏感型业务提出的确定性传输需求,提出一种基于跨层优化的确定性无人集群网络协议——LPCO(link-scheduling and path-planning based on cross-layer optimization)。该协议在中心节点控制的集中式架构下,融合链路状态感知、业务需求感知、显式路径规划和周期时隙调度等关键模块,实现了网络层路径选择与MAC层时隙分配的联合调度,构建了端到端的跨层协同优化机制。具体方法包括:在中心控制节点完成对全网拓扑感知后,通过基于链路过期时间(link expiration time, LET)进行链路预测,利用QoS加权目标函数实现路径规划,结合TDMA对路径节点动态分配时隙,确保关键业务在无人集群网络下的低延迟传输和高可靠性。通过在NS3仿真平台中与典型路由协议OLSR和DSDV对比验证,仿真实验结果表明:LPCO相较OLSR与DSDV协议,时敏业务的平均端到端时延分别降低了43.6%、40.7%;时敏业务的分组投递率提升了69.3%、73.5%;瞬时时延抖动控制在3 ms以内,部分数据包抖动接近0,在无人集群网络中展现出确定性服务保障能力与鲁棒性。
文摘This paper analyzes PROFIBUS-DP network delay in detail and presents the calculational formula of its maximum time-delay, which is significant to the research of PROFIBUS-DP. At the same time, the paper puts forward a method of simplifying the network induced time-varying indeterminate system according to the features of the network. Through the analysis of a pump-control-motor system which is composed of PROFIBUS-DP network, it illustrates the network＇s influence on the performance of control systems. This method helps to design and analyze the network＇s influence on the performance of control systems, which is of considerable practical value in a time when network control systern is widely used.
文摘With the vigorous development of automobile industry,in-vehicle network is also constantly upgraded to meet data transmission requirements of emerging applications.The main transmission requirements are low latency and certainty especially for autonomous driving.Time sensitive networking(TSN)based on Ethernet gives a possible solution to these requirements.Previous surveys usually investigated TSN from a general perspective,which referred to TSN of various application fields.In this paper,we focus on the application of TSN to the in-vehicle networks.For in-vehicle networks,we discuss all related TSN standards specified by IEEE 802.1 work group up to now.We further overview and analyze recent literature on various aspects of TSN for automotive applications,including synchronization,resource reservation,scheduling,certainty,software and hardware.Application scenarios of TSN for in-vehicle networks are analyzed one by one.Since TSN of in-vehicle network is still at a very initial stage,this paper also gives insights on open issues,future research directions and possible solutions.
基金This work was supported by the National Science Fund for Distinguished Young Scholars(No.61225014)the National Major Scientific Instruments Development Project(No.61527811)+2 种基金the National Natural Science Foundation of China(Nos.61304084,61374119)the Guangdong Natural Science Foundation(No.2014A030312005)the Space Intelligent Control Key Laboratory of Science and Technology for National Defense.
文摘Recently,an approach for the rapid detection of small oscillation faults based on deterministic learning theory was proposed for continuous-time systems.In this paper,a fault detection scheme is proposed for a class of nonlinear discrete-time systems via deterministic learning.By using a discrete-time extension of deterministic learning algorithm,the general fault functions(i.e.,the internal dynamics)underlying normal and fault modes of nonlinear discrete-time systems are locally-accurately approximated by discrete-time dynamical radial basis function(RBF)networks.Then,a bank of estimators with the obtained knowledge of system dynamics embedded is constructed,and a set of residuals are obtained and used to measure the differences between the dynamics of the monitored system and the dynamics of the trained systems.A fault detection decision scheme is presented according to the smallest residual principle,i.e.,the occurrence of a fault can be detected in a discrete-time setting by comparing the magnitude of residuals.The fault detectability analysis is carried out and the upper bound of detection time is derived.A simulation example is given to illustrate the effectiveness of the proposed scheme.
文摘Ultra-reliable and low-latency communications(URLLC) has become a fundamental focus of future industrial wireless sensor net-works(IWSNs). With the evolution of automation and process control in industrial environments, the need for increased reliabilityand reduced latencies in wireless communications is even pronounced. Furthermore, the 5G systems specifically target the URLLCin selected areas and industrial automation might turn into a suitable venue for future IWSNs, running 5G as a high speed inter-process linking technology. In this paper, a hybrid multi-channel scheme for performance and throughput enhancement of IWSNsis proposed. The scheme utilizes the multiple frequency channels to increase the overall throughput of the system along with theincrease in reliability. A special purpose frequency channel is defined, which facilitates the failed communications by retransmis-sions where the retransmission slots are allocated according to the priority level of failed communications of different nodes. Ascheduler is used to formulate priority based scheduling for retransmission in TDMA based communication slots of this channel.Furthermore, in carrier-sense multiple access with collision avoidance(CSMA/CA) based slots, a frequency polling is introducedto limit the collisions. Mathematical modelling for performance metrics is also presented. The performance of the proposed schemeis compared with that of IEEE802.15.4e, where the performance is evaluated on the basis of throughput, reliability and the num-ber of nodes accommodated in a cluster. The proposed scheme offers a notable increase in the reliability and throughput over theexisting IEEE802.15.4e Low Latency Deterministic Networks(LLDN) standard.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61402485,61303061,and 71201169)
文摘The comparison of networks with different orders strongly depends on the stability analysis of graph features in evolving systems. In this paper, we rigorously investigate the stability of the weighted spectral distribution（i.e., a spectral graph feature） as the network order increases. First, we use deterministic scale-free networks generated by a pseudo treelike model to derive the precise formula of the spectral feature, and then analyze the stability of the spectral feature based on the precise formula. Except for the scale-free feature, the pseudo tree-like model exhibits the hierarchical and small-world structures of complex networks. The stability analysis is useful for the classification of networks with different orders and the similarity analysis of networks that may belong to the same evolving system.
文摘An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing(CS-NCES)is proposed in this paper.Along with considering the correlations of data spatial and temporal,the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing.The source node firstly encodes the data,then compresses the coding data by cot-npressed sensing over finite fields.Compared with the network coding scheme,simulation results show that CS-NCES reduces the energy consumption about 25.30/0-34.50/0 and improves the efficiency of data reconstruction about 1.56%-5.98%.The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks,but also improve the network performance.
