The delay tolerant network(DTN) is an emerging concept, which is used to describe the network, where the communication link may disrupt frequently. To cope with this problem, the DTN uses the store-carry-forward(SCF) ...The delay tolerant network(DTN) is an emerging concept, which is used to describe the network, where the communication link may disrupt frequently. To cope with this problem, the DTN uses the store-carry-forward(SCF) transmission mode. With this policy, the messages in the DTN are transmitted based on the nodes' cooperation. However, the nodes may be selfish, so the source has to pay certain rewards for others to get their help. This paper studies the optimal incentive policy to maximize the source's final utility. First, it models the message spreading process as several ordinary differential equations(ODEs) based on the meanfield approximation. Then, it mathematically gets the optimal policy and explores the structure of the policy. Finally, it checks the accuracy of the ODEs model and shows the advantages of the optimal policy through simulation and theoretical results respectively.展开更多
In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such ...In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.展开更多
Without considering security, existing message scheduling mechanisms may expose critical messages to malicious threats like confidentiality attacks. Incorporating confidentiality improvement into message scheduling, t...Without considering security, existing message scheduling mechanisms may expose critical messages to malicious threats like confidentiality attacks. Incorporating confidentiality improvement into message scheduling, this paper investigates the problem of scheduling aperiodc messages with time-critical and security-critical requirements. A risk-based security profit model is built to quantify the security quality of messages; and a dynamic programming based approximation algorithm is proposed to schedule aperiodic messages with guaranteed security performance. Experimental results illustrate the efficiency and effectiveness of the proposed algorithm.展开更多
An adaptive mechanism is presented to reduce bandwidth usage and to optimize the use of computing resources of heterogeneous computer mixes utilized in CSCD to reach the goal of collaborative design in distributed-syn...An adaptive mechanism is presented to reduce bandwidth usage and to optimize the use of computing resources of heterogeneous computer mixes utilized in CSCD to reach the goal of collaborative design in distributed-synchronous mode. The mechanism is realized on a C/S architecture based on operation information sharing. Firstly, messages are aggregated into packets on the client. Secondly, an outgoing-message weight priority queue with traffic adjusting technique is cached on the server. Thirdly, an incoming-message queue is cached on the client. At last, the results of implementing the proposed scheme in a simple collaborative design environment are presented.展开更多
The satellite-based automatic identification system (AIS) receiver has to encounter the frequency offset caused by the Doppler effect and the oscillator instability. This paper proposes a non-coherent sequence detecti...The satellite-based automatic identification system (AIS) receiver has to encounter the frequency offset caused by the Doppler effect and the oscillator instability. This paper proposes a non-coherent sequence detection scheme for the satellite-based AIS signal transmitted over the white Gaussian noise channel. Based on the maximum likelihood estimation and a Viterbi decoder, the proposed scheme is capable of tolerating a frequency offset up to 5% of the symbol rate. The complexity of the proposed scheme is reduced by the state-complexity reduction, which is based on per-survivor processing. Simulation results prove that the proposed non-coherent sequence detection scheme has high robustness to frequency offset compared to the relative scheme when messages collision exists.展开更多
基金supported by the National Nature Science Foundation of China(61871388)
文摘The delay tolerant network(DTN) is an emerging concept, which is used to describe the network, where the communication link may disrupt frequently. To cope with this problem, the DTN uses the store-carry-forward(SCF) transmission mode. With this policy, the messages in the DTN are transmitted based on the nodes' cooperation. However, the nodes may be selfish, so the source has to pay certain rewards for others to get their help. This paper studies the optimal incentive policy to maximize the source's final utility. First, it models the message spreading process as several ordinary differential equations(ODEs) based on the meanfield approximation. Then, it mathematically gets the optimal policy and explores the structure of the policy. Finally, it checks the accuracy of the ODEs model and shows the advantages of the optimal policy through simulation and theoretical results respectively.
基金Projects(61272139,61070199,61103182)supported by the National Natural Science Foundation of ChinaProject(2013ZX01028001-002)supported by the National Science and Technology Major Projects of China+1 种基金Project(2011AA01A103)supported by theNational High-Tech Research and Development Plan of ChinaProject(11JJ7003)supported by Hunan Provincial Natural ScienceFoundation of China
文摘In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.
基金supported by the National Natural Science Foundation of China (60673142)the National High Technology Research and Development Progrm of China (863 Program) (2006AA01Z1732007AA01Z131)
文摘Without considering security, existing message scheduling mechanisms may expose critical messages to malicious threats like confidentiality attacks. Incorporating confidentiality improvement into message scheduling, this paper investigates the problem of scheduling aperiodc messages with time-critical and security-critical requirements. A risk-based security profit model is built to quantify the security quality of messages; and a dynamic programming based approximation algorithm is proposed to schedule aperiodic messages with guaranteed security performance. Experimental results illustrate the efficiency and effectiveness of the proposed algorithm.
基金This project was supported by National "863" High Technology Research and Development Program of China(2001AA412010).
文摘An adaptive mechanism is presented to reduce bandwidth usage and to optimize the use of computing resources of heterogeneous computer mixes utilized in CSCD to reach the goal of collaborative design in distributed-synchronous mode. The mechanism is realized on a C/S architecture based on operation information sharing. Firstly, messages are aggregated into packets on the client. Secondly, an outgoing-message weight priority queue with traffic adjusting technique is cached on the server. Thirdly, an incoming-message queue is cached on the client. At last, the results of implementing the proposed scheme in a simple collaborative design environment are presented.
文摘The satellite-based automatic identification system (AIS) receiver has to encounter the frequency offset caused by the Doppler effect and the oscillator instability. This paper proposes a non-coherent sequence detection scheme for the satellite-based AIS signal transmitted over the white Gaussian noise channel. Based on the maximum likelihood estimation and a Viterbi decoder, the proposed scheme is capable of tolerating a frequency offset up to 5% of the symbol rate. The complexity of the proposed scheme is reduced by the state-complexity reduction, which is based on per-survivor processing. Simulation results prove that the proposed non-coherent sequence detection scheme has high robustness to frequency offset compared to the relative scheme when messages collision exists.
