An ant colony algorithm based on cross-layer design for routing and wavelength assignment in optical satellite networks

Wen, Guoli; Zhang, Qi; Wang, Houtian; Tian, Qinghua; Tao, Ying

doi:10.1109/cc.2017.8014348

Cited by 28 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to further improve the picking efficiency, the ant colony algorithm is applied to plan the optimal picking path of the end of the bud picker ( Jiang et al., 2015 ; Wang et al., 2020 ; Lin et al., 2020 ). The information track persistence parameter is adaptively changed ( Wen et al., 2017 ; Deng et al., 2018 ; Wang L. et al., 2018 ), and the other parameters of the ant colony algorithm are screened out after many experiments (see Table 2 for details).…”

Section: Resultsmentioning

confidence: 99%

Design of an efficient combined multipoint picking scheme for tea buds

Chen

et al. 2022

Front. Plant Sci.

View full text Add to dashboard Cite

Herein, a combined multipoint picking scheme was proposed, and the sizes of the end of the bud picker were selectively designed. Firstly, the end of the bud picker was abstracted as a fixed-size picking box, and it was assumed that the tea buds in the picking box have a certain probability of being picked. Then, the picking box coverage and the greedy algorithm were designed to make as few numbers of picking box set as possible to cover all buds to reduce the numbers of picking. Furthermore, the Graham algorithm and the minimum bounding box were applied to fine-tune the footholds of each picking box in the optimal coverage picking box set, so that the buds were concentrated in the middle of the picking boxes as much as possible. Moreover, the geometric center of each picking box was taken as a picking point, and the ant colony algorithm was used to optimize the picking path of the end of the bud picker. Finally, by analyzing the influence of several parameters on the picking performance of the end of the bud picker, the optimal sizes of the picking box were calculated successfully under different conditions. The experimental results showed that the average picking numbers of the combined multipoint picking scheme were reduced by 31.44%, the shortest picking path was decreased by 11.10%, and the average consumed time was reduced by 50.92% compared to the single-point picking scheme. We believe that the proposed scheme can provide key technical support for the subsequent design of intelligent bud-picking robots.

show abstract

Section: Resultsmentioning

confidence: 99%

Design of an efficient combined multipoint picking scheme for tea buds

Chen

et al. 2022

Front. Plant Sci.

View full text Add to dashboard Cite

show abstract

“…In the pathfinding process, they behave very similarly, that is, the satellite node selects the path according to the QoS information and STF of link, and the ants select the path according to the link pheromone. In addition, ACO has the characteristics of positive feedback mechanism, strong robustness, distributed computing, and low complexity, which can find a better solution for solving multiconstrained optimization problems 30‐33 . Therefore, it is feasible to apply the ACO algorithm to the satellite network to solve the multiservice and load problem in this article.…”

Section: The Sor‐msg Algorithm In Lsnmentioning

confidence: 99%

Service‐oriented routing with Markov space‐time graph in low earth orbit satellite networks

Dai

Liao

Chen

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Low earth orbit (LEO) satellite network has been more and more widely used because of its advantages of low delay, low overhead, and flexible networking. However, the reliability and effectiveness of data transmission are affected by the specific characteristics of LEO satellite networks (LSN), such as time‐varying topology, uneven distribution of service demands, and multiple types of service. In this article, a service‐oriented routing with Markov space‐time graph (SOR‐MSG) in LSN is proposed to improve the reliability and effectiveness of information transmission. First, for the time‐varying topology, a Markov space‐time graph (MSG) model is constructed by calculating the connectivity time and connectivity probability between satellite node states. Then, in light of the uneven distribution of service demands, the space‐time factor (STF) is defined to balance the network load by scheduling the intersatellite link with lower loads. After that, we formulate the general routing problem caused by different quality of service (QoS) requirements for multimedia services and uneven load distribution and propose a multi‐QoS optimization objective function according to delay, remaining bandwidth, packet loss rate, and STF. Following this, based on the established MSG, the state transition rule and pheromone updating rule are optimally adjusted to select the next hop node, so as to finally determine the best information transmission path. Finally, the simulation results show that the SOR‐MSG algorithm can not only adapt to dynamically changing topologies and meet multiservice QoS requirements but also well balance the network load.

show abstract

“…On the other hand, other researches focus on the routing from the perspective of the satellite networks, they just concern on the routing algorithms on satellite networks only, with ignoring the terrestrial network. Wen et al [17], Houtian et al [18], and Dong et al [19] consider the optical LEO satellite network and present the corresponding ant-colony algorithms for routing and wavelength assignment. Liu et al [20], Cheng et al [21], and Yan et al [22] introduce kinds of optimizations on routing problem of the LEO network.…”

Section: Related Workmentioning

confidence: 99%

SDN-Based End-to-End Fragment-Aware Routing for Elastic Data Flows in LEO Satellite-Terrestrial Network

Guo

Dong³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

The wide coverage of satellite networks and the large bandwidth of terrestrial networks have led to an increasing research on the integration of the two networks (ISTN) for complementary advantages. However, most researches on routing mainly focus on the internal routing of the satellite network. Due to the point-to-area coverage of the channel characteristics between the satellites and the ground stations, the heterogeneity of ISTN has increased, which makes that the routing algorithm of the traditional satellite networks cannot be applied to the end-to-end routing of ISTN. Meanwhile, the data flows with elastic quality of service attribute make the routing pre-assign and resource allocation in ISTN much more complicated, which has been rarely researched before. In this paper, we first describe the unified network architecture based on software-defined network and model the data flow. Then, based on the considerations of latency, capacity, wavelength fragmentation, and load balancing, a heuristic service-oriented path computation algorithm for elastic data flows is proposed for the complex heterogeneity of the ISTN. The simulation shows that, the end-to-end routing mechanism can reduce the blocking rate of the ISTN, and our proposed algorithm greatly reduces the wavelength fragmentation and bandwidth consumption, and has a better performance on load balancing, with a slight disadvantage in latency when the network load is high. INDEX TERMS Low earth orbit satellites, quality of service, wavelength routing, optical fiber networks. I. INTRODUCTION

show abstract

An ant colony algorithm based on cross-layer design for routing and wavelength assignment in optical satellite networks

Cited by 28 publications

References 0 publications

Design of an efficient combined multipoint picking scheme for tea buds

Design of an efficient combined multipoint picking scheme for tea buds

Service‐oriented routing with Markov space‐time graph in low earth orbit satellite networks

SDN-Based End-to-End Fragment-Aware Routing for Elastic Data Flows in LEO Satellite-Terrestrial Network

Contact Info

Product

Resources

About