This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors ha...This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors harvest renewable energy and are equipped with batteries and data buffers.The ground sensor model takes into account sensor data buffer and battery limitations.An asymptotically globally optimal method of joint UAV 3D trajectory optimization and data transmission schedule is developed.The developed method maximizes the amount of data transmitted to the UAV without losses and too long delays and minimizes the propulsion energy of the UAV.The developed algorithm of optimal trajectory optimization and transmission scheduling is based on dynamic programming.Computer simulations demonstrate the effectiveness of the proposed algorithm.展开更多
A hybrid scheduling algorithm based on genetic algorithm is proposed in this paper for reconnaissance satellite data transmission.At first,based on description of satellite data transmission request,satellite data tra...A hybrid scheduling algorithm based on genetic algorithm is proposed in this paper for reconnaissance satellite data transmission.At first,based on description of satellite data transmission request,satellite data transmission task model and satellite data transmission scheduling problem model are established.Secondly,the conflicts in scheduling are discussed.According to the meaning of possible conflict,the method to divide possible conflict task set is given.Thirdly,a hybrid algorithm which consists of genetic algorithm and heuristic information is presented.The heuristic information comes from two concepts,conflict degree and conflict number.Finally,an example shows the algorithm's feasibility and performance better than other traditional展开更多
Today,Internet of Things(IoT)is a technology paradigm which convinces many researchers for the purpose of achieving high performance of packets delivery in IoT applications such as smart cities.Interconnecting various...Today,Internet of Things(IoT)is a technology paradigm which convinces many researchers for the purpose of achieving high performance of packets delivery in IoT applications such as smart cities.Interconnecting various physical devices such as sensors or actuators with the Internet may causes different constraints on the network resources such as packets delivery ratio,energy efficiency,end-to-end delays etc.However,traditional scheduling methodologies in large-scale environments such as big data smart cities cannot meet the requirements for high performance network metrics.In big data smart cities applications which need fast packets transmission ratio such as sending priority packets to hospitals for an emergency case,an efficient schedulingmechanism ismandatory which is the main concern of this paper.In this paper,we overcome the shortcoming issues of the traditional scheduling algorithms that are utilized in big data smart cities emergency applications.Transmission information about the priority packets between the source nodes(i.e.,people with emergency cases)and the destination nodes(i.e.,hospitals)is performed before sending the packets in order to reserve transmission channels and prepare the sequence of transmission of theses priority packets between the two parties.In our proposed mechanism,Software Defined Networking(SDN)with centralized communication controller will be responsible for determining the scheduling and processing sequences for priority packets in big data smart cities environments.In this paper,we compare between our proposed Priority Packets Deadline First scheduling scheme(PPDF)with existing and traditional scheduling algorithms that can be used in urgent smart cities applications in order to illustrate the outstanding network performance parameters of our scheme such as the average waiting time,packets loss rates,priority packets end-to-end delay,and efficient energy consumption.展开更多
With the development of rapid-response Earth-observing techniques, the demand for reducing a requirements-tasking-effects cycle from 1 day to hours grows rapidly. For instance, a satellite user always wants to receive...With the development of rapid-response Earth-observing techniques, the demand for reducing a requirements-tasking-effects cycle from 1 day to hours grows rapidly. For instance, a satellite user always wants to receive requested data in near real-time to support their urgent mis- sions, such as dealing with wildfires, volcanoes, flooding events, etc. In this paper, we try to reduce data transmission time for achieving this goal. The new feature of a responsive satellite is that users can receive signals from it directly. Therefore, the traditional satellite control and operational tech- niques need to be improved to accommodate these changes in user needs and technical upgrading. With that in mind, a data transmission topological model is constructed. Based on this model, we can deal with the satellite data transmission problem as a multi-constraint and multi-objective path- scheduling problem. However, there are many optional data transmission paths for each target based on this model, and the shortest path is preferred. In addition, satellites represent scarce resources that must be carefully scheduled in order to satisfy as many consumer requests as possible. To efficiently balance response time and resource utilization, a K-shortest path genetic algorithm is proposed for solving the data transmission problem. Simulations and analysis show the feasibility and the adaptability of the proposed approach.展开更多
The scheduling of earth observation satellites(EOSs)data transmission is a complex combinatorial optimization problem. Current researches mainly deal with this problem on the assumption that the data transmission mode...The scheduling of earth observation satellites(EOSs)data transmission is a complex combinatorial optimization problem. Current researches mainly deal with this problem on the assumption that the data transmission mode is fixed, either playback or real-time transmission. Considering the characteristic of the problem, a multi-satellite real-time and playback data transmission scheduling model is established and a novel algorithm based on quantum discrete particle swarm optimization(QDPSO)is proposed. Furthermore, we design the longest compatible transmission chain mutation operator to enhance the performance of the algorithm. Finally, some experiments are implemented to validate correctness and practicability of the proposed algorithm.展开更多
An agile earth-observing satellite equipped with multimode cameras capable of transmitting observation data to other satellites is developed to rapidly respond to requests with multiple observation modes.This gives ri...An agile earth-observing satellite equipped with multimode cameras capable of transmitting observation data to other satellites is developed to rapidly respond to requests with multiple observation modes.This gives rise to the Multisatellite Multimode Crosslink Scheduling(MMCS)problem,which involves allocating observation requests to agile satellites,selecting appropriate timing and observation modes for the requests,and transmitting the data to the ground station via the satellite communication system.Herein,a mixed integer programming model is introduced to include all complex time and operation constraints.To solve the MMCS problem,a two-stage heuristic method,called Fast insertion Tabu Search with Conflict-avoidance(FTS-C)heuristic,is developed.In the first stage,a conflict-avoidance insertion algorithm is designed to generate a high-quality initial solution by considering the requests transmission and download.Further,the tabu search-based second stage optimizes the initial solution.Finally,an extensive empirical study based on a real-world situation demonstrates that FTS-C can generate a solution with higher quality in less time than other state-of-the-art algorithms and the CPLEX solver.展开更多
With the emerging diverse applications in data centers,the demands on quality of service in data centers also become diverse,such as high throughput of elephant flows and low latency of deadline-sensitive flows.Howeve...With the emerging diverse applications in data centers,the demands on quality of service in data centers also become diverse,such as high throughput of elephant flows and low latency of deadline-sensitive flows.However,traditional TCPs are ill-suited to such situations and always result in the inefficiency(e.g.missing the flow deadline,inevitable throughput collapse)of data transfers.This further degrades the user-perceived quality of service(QoS)in data centers.To reduce the flow completion time of mice and deadline-sensitive flows along with promoting the throughput of elephant flows,an efficient and deadline-aware priority-driven congestion control(PCC)protocol,which grants mice and deadline-sensitive flows the highest priority,is proposed in this paper.Specifically,PCC computes the priority of different flows according to the size of transmitted data,the remaining data volume,and the flows’deadline.Then PCC adjusts the congestion window according to the flow priority and the degree of network congestion.Furthermore,switches in data centers control the input/output of packets based on the flow priority and the queue length.Different from existing TCPs,to speed up the data transfers of mice and deadline-sensitive flows,PCC provides an effective method to compute and encode the flow priority explicitly.According to the flow priority,switches can manage packets efficiently and ensure the data transfers of high priority flows through a weighted priority scheduling with minor modification.The experimental results prove that PCC can improve the data transfer performance of mice and deadline-sensitive flows while guaranting the throughput of elephant flows.展开更多
随着电力调度脉冲编码调制(PCM)设备的逐步退运,电网公司将逐步采用光传输设备替代调度PCM设备。在设备更换的过渡期,存在大量光传输设备与PCM设备混用的情况。为解决电力调度传输网络中存在的E1与互联网协议(IP)分组业务转换难度大、...随着电力调度脉冲编码调制(PCM)设备的逐步退运,电网公司将逐步采用光传输设备替代调度PCM设备。在设备更换的过渡期,存在大量光传输设备与PCM设备混用的情况。为解决电力调度传输网络中存在的E1与互联网协议(IP)分组业务转换难度大、转换速率低的问题,提出了1种基于网络切片的IP over E1方法。首先,将要传输的数据打包成IP数据。然后,基于网络切片技术,将IP数据包切片后,封装成E1帧。在此基础上,通过E1链路进行数据传输,在接收端通过E1数据帧拆解完成IP数据包的重组发送。最后,将所提方法在某省电力公司进行实例运行,IP over E1转换准确率为99.86%。其结果验证了该方法的有效性。该方法可有效提高IP over E1转换速度和准确率。展开更多
With the growing popularity of 3G-powered devices, there are growing demands on energy-efficient data trans- mission strategies for various embedded systems. Different from the past work in energy-efficient real-time ...With the growing popularity of 3G-powered devices, there are growing demands on energy-efficient data trans- mission strategies for various embedded systems. Different from the past work in energy-efficient real-time task scheduling, we explore strategies to maximize the amount of data transmitted by a 3G module under a given battery capacity. In particular, we present algorithms under different workload configurations with and without timing constraint considerations. Experiments were then conducted to verify the validity of the strategies and develop insights in energy-efficient data transmission.展开更多
基金funding from the Australian Government,via Grant No.AUSMURIB000001 associated with ONR MURI Grant No.N00014-19-1-2571。
文摘This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors harvest renewable energy and are equipped with batteries and data buffers.The ground sensor model takes into account sensor data buffer and battery limitations.An asymptotically globally optimal method of joint UAV 3D trajectory optimization and data transmission schedule is developed.The developed method maximizes the amount of data transmitted to the UAV without losses and too long delays and minimizes the propulsion energy of the UAV.The developed algorithm of optimal trajectory optimization and transmission scheduling is based on dynamic programming.Computer simulations demonstrate the effectiveness of the proposed algorithm.
文摘A hybrid scheduling algorithm based on genetic algorithm is proposed in this paper for reconnaissance satellite data transmission.At first,based on description of satellite data transmission request,satellite data transmission task model and satellite data transmission scheduling problem model are established.Secondly,the conflicts in scheduling are discussed.According to the meaning of possible conflict,the method to divide possible conflict task set is given.Thirdly,a hybrid algorithm which consists of genetic algorithm and heuristic information is presented.The heuristic information comes from two concepts,conflict degree and conflict number.Finally,an example shows the algorithm's feasibility and performance better than other traditional
基金This study is supported through Taif University Researchers Supporting Project Number(TURSP-2020/150),Taif University,Taif,Saudi Arabia.
文摘Today,Internet of Things(IoT)is a technology paradigm which convinces many researchers for the purpose of achieving high performance of packets delivery in IoT applications such as smart cities.Interconnecting various physical devices such as sensors or actuators with the Internet may causes different constraints on the network resources such as packets delivery ratio,energy efficiency,end-to-end delays etc.However,traditional scheduling methodologies in large-scale environments such as big data smart cities cannot meet the requirements for high performance network metrics.In big data smart cities applications which need fast packets transmission ratio such as sending priority packets to hospitals for an emergency case,an efficient schedulingmechanism ismandatory which is the main concern of this paper.In this paper,we overcome the shortcoming issues of the traditional scheduling algorithms that are utilized in big data smart cities emergency applications.Transmission information about the priority packets between the source nodes(i.e.,people with emergency cases)and the destination nodes(i.e.,hospitals)is performed before sending the packets in order to reserve transmission channels and prepare the sequence of transmission of theses priority packets between the two parties.In our proposed mechanism,Software Defined Networking(SDN)with centralized communication controller will be responsible for determining the scheduling and processing sequences for priority packets in big data smart cities environments.In this paper,we compare between our proposed Priority Packets Deadline First scheduling scheme(PPDF)with existing and traditional scheduling algorithms that can be used in urgent smart cities applications in order to illustrate the outstanding network performance parameters of our scheme such as the average waiting time,packets loss rates,priority packets end-to-end delay,and efficient energy consumption.
基金supported in part by the National Natural Science Foundation of China (Nos. 61174159, 61101184)
文摘With the development of rapid-response Earth-observing techniques, the demand for reducing a requirements-tasking-effects cycle from 1 day to hours grows rapidly. For instance, a satellite user always wants to receive requested data in near real-time to support their urgent mis- sions, such as dealing with wildfires, volcanoes, flooding events, etc. In this paper, we try to reduce data transmission time for achieving this goal. The new feature of a responsive satellite is that users can receive signals from it directly. Therefore, the traditional satellite control and operational tech- niques need to be improved to accommodate these changes in user needs and technical upgrading. With that in mind, a data transmission topological model is constructed. Based on this model, we can deal with the satellite data transmission problem as a multi-constraint and multi-objective path- scheduling problem. However, there are many optional data transmission paths for each target based on this model, and the shortest path is preferred. In addition, satellites represent scarce resources that must be carefully scheduled in order to satisfy as many consumer requests as possible. To efficiently balance response time and resource utilization, a K-shortest path genetic algorithm is proposed for solving the data transmission problem. Simulations and analysis show the feasibility and the adaptability of the proposed approach.
基金supported by the National Natural Science Foundation of China(6110118461174159)
文摘The scheduling of earth observation satellites(EOSs)data transmission is a complex combinatorial optimization problem. Current researches mainly deal with this problem on the assumption that the data transmission mode is fixed, either playback or real-time transmission. Considering the characteristic of the problem, a multi-satellite real-time and playback data transmission scheduling model is established and a novel algorithm based on quantum discrete particle swarm optimization(QDPSO)is proposed. Furthermore, we design the longest compatible transmission chain mutation operator to enhance the performance of the algorithm. Finally, some experiments are implemented to validate correctness and practicability of the proposed algorithm.
基金supported by the National Natural Science Foundation of China(No.72001212)the Hunan Provincial Innovation Foundation for Postgraduate(No.CX20200022).
文摘An agile earth-observing satellite equipped with multimode cameras capable of transmitting observation data to other satellites is developed to rapidly respond to requests with multiple observation modes.This gives rise to the Multisatellite Multimode Crosslink Scheduling(MMCS)problem,which involves allocating observation requests to agile satellites,selecting appropriate timing and observation modes for the requests,and transmitting the data to the ground station via the satellite communication system.Herein,a mixed integer programming model is introduced to include all complex time and operation constraints.To solve the MMCS problem,a two-stage heuristic method,called Fast insertion Tabu Search with Conflict-avoidance(FTS-C)heuristic,is developed.In the first stage,a conflict-avoidance insertion algorithm is designed to generate a high-quality initial solution by considering the requests transmission and download.Further,the tabu search-based second stage optimizes the initial solution.Finally,an extensive empirical study based on a real-world situation demonstrates that FTS-C can generate a solution with higher quality in less time than other state-of-the-art algorithms and the CPLEX solver.
基金supported part by the National Natural Science Foundation of China(61601252,61801254)Public Technology Projects of Zhejiang Province(LG-G18F020007)+1 种基金Zhejiang Provincial Natural Science Foundation of China(LY20F020008,LY18F020011,LY20F010004)K.C.Wong Magna Fund in Ningbo University。
文摘With the emerging diverse applications in data centers,the demands on quality of service in data centers also become diverse,such as high throughput of elephant flows and low latency of deadline-sensitive flows.However,traditional TCPs are ill-suited to such situations and always result in the inefficiency(e.g.missing the flow deadline,inevitable throughput collapse)of data transfers.This further degrades the user-perceived quality of service(QoS)in data centers.To reduce the flow completion time of mice and deadline-sensitive flows along with promoting the throughput of elephant flows,an efficient and deadline-aware priority-driven congestion control(PCC)protocol,which grants mice and deadline-sensitive flows the highest priority,is proposed in this paper.Specifically,PCC computes the priority of different flows according to the size of transmitted data,the remaining data volume,and the flows’deadline.Then PCC adjusts the congestion window according to the flow priority and the degree of network congestion.Furthermore,switches in data centers control the input/output of packets based on the flow priority and the queue length.Different from existing TCPs,to speed up the data transfers of mice and deadline-sensitive flows,PCC provides an effective method to compute and encode the flow priority explicitly.According to the flow priority,switches can manage packets efficiently and ensure the data transfers of high priority flows through a weighted priority scheduling with minor modification.The experimental results prove that PCC can improve the data transfer performance of mice and deadline-sensitive flows while guaranting the throughput of elephant flows.
文摘随着电力调度脉冲编码调制(PCM)设备的逐步退运,电网公司将逐步采用光传输设备替代调度PCM设备。在设备更换的过渡期,存在大量光传输设备与PCM设备混用的情况。为解决电力调度传输网络中存在的E1与互联网协议(IP)分组业务转换难度大、转换速率低的问题,提出了1种基于网络切片的IP over E1方法。首先,将要传输的数据打包成IP数据。然后,基于网络切片技术,将IP数据包切片后,封装成E1帧。在此基础上,通过E1链路进行数据传输,在接收端通过E1数据帧拆解完成IP数据包的重组发送。最后,将所提方法在某省电力公司进行实例运行,IP over E1转换准确率为99.86%。其结果验证了该方法的有效性。该方法可有效提高IP over E1转换速度和准确率。
基金supported by the Excellent Research Projects of "National Taiwan University" under Grant No. 99R80304
文摘With the growing popularity of 3G-powered devices, there are growing demands on energy-efficient data trans- mission strategies for various embedded systems. Different from the past work in energy-efficient real-time task scheduling, we explore strategies to maximize the amount of data transmitted by a 3G module under a given battery capacity. In particular, we present algorithms under different workload configurations with and without timing constraint considerations. Experiments were then conducted to verify the validity of the strategies and develop insights in energy-efficient data transmission.