Combination of ecoprofile and least-cost model for eco-network planning

Abstract

The protecting requirements and functional connectivity of species in isolated habitat patches are crucial factors of eco-network planning. This study aimed to improve the method of eco-network planning for species conservation. Ecoprofiling was used to group the species by similar behavior types, namely, choice of ecosystem, area requirement, and short distance dispersal abilities. A least-cost model was used to simulate the optimal corridor location to maintain functional connectivity. A combination of ecoprofile and least-cost model was hired to develop an eco-network that promoted species conservation. A case study was also conducted in Beijing, China. In addition to the required ecosystem, habitat area is an important parameter for habitat extraction. Habitat area can remove noise habitat patches because of lacking area. Short-distance dispersal can be used to identify corridor requirements and avoid unnecessary building requirements. Species with various dispersal abilities exhibit significant differences in terms of corridor length and location requirement. Habitat isolation is the main threat for weakly mobile species, and habitat loss is the major risk of mobile species protection. Different species groups also exhibit distinct landscape pattern demands for an eco-network, and the eco-network planning based on specific species can not protect other species. We proposed that a combination of ecoprofile and least-cost model improved the efficiency of species conservation by eco-network planning.

Evolution and Optimization of an Ecological Network in an Arid Region Based on MSPA-MCR: A Case Study of the Hexi Corridor

“…Network analysis methods have been widely used to evaluate the connectivity of ecological corridors in the internal structure of ecological networks [49]. Three network structure indices, the network closure (α), line point rate (β), and network connectivity (γ) were used to describe the connectivity of ecological networks [50,51].…”

Construction and Optimization of an Ecological Network in the Comprehensive Land Consolidation Project of a Small Rural Town in Southeast China

“…This study used new framework to establish an optimization mechanism of an ecological network. The network analysis method can be studied through a graphical theory approach, analyzing the quality of ecological patches and corridors, and studying the integrity and stability of ecological networks [65]. In many previous studies, only textual assessments were made based on the optimized networks [49,66].…”

Research on the Spatial Structure of County Greenway Network Based on Gravitation-Resistance Measurement—A Case Study of Ning’an in China

“…The basic definition of the widely used landscape connectivity theory was mainly proposed by Taylor et al Landscape connectivity is the degree of promoting or hindering the movement of organisms between source patches in a certain ecological process, forming a network in the mode of resource nodes and corridors [33]. In the process of landscape connection, landscape resistance refers to the influence of elements on ecological flow rate, and the resistance increases with the increase of the frequency of crossing various landscape boundaries [33,34]. It can be seen that the theory of landscape connectivity is to explore the organic relationship between similar patches or heterogeneous patches in the process of function and ecology [34].…”

“…In the process of landscape connection, landscape resistance refers to the influence of elements on ecological flow rate, and the resistance increases with the increase of the frequency of crossing various landscape boundaries [33,34]. It can be seen that the theory of landscape connectivity is to explore the organic relationship between similar patches or heterogeneous patches in the process of function and ecology [34]. This kind of organic connection may be the direct exchange of material and energy between the elements or the species exchange between biological groups [35].…”