Geographic separation and genetic differentiation of populations are not coupled with niche differentiation in threatened Kaiser's spotted newt (Neurergus kaiseri)

The combination of niche modelling and landscape genetics (genomics) helps to disentangle processes that have shaped population structure in the evolutionary past and presence of species. Herein, we integrate a comprehensive genomic dataset with ecological parameters and niche modelling for the threatened Kaiser's newt, a newt species adapted to mountain spring-ponds in Iran. Genomic analysis suggests the existence of two highly differentiated clades North and South of the Dez River. Genetic variation between the two clades (76.62%) was much greater than within clades (16.25%), suggesting that the Dez River prevented gene flow. River disconnectivity, followed by geographic distance, contributed mostly to genetic differentiation between populations. Environmental niche and landscape resistance had no significant influence. Though a significant difference between climatic niches occupied by each clade at the landscape-scale, habitat niches at the local-scale were equivalent. 'Niche similarity analysis' supported niche conservatism between the two clades despite the southward shift in the climatic niche of the Southern clade. Accordingly, populations of different clades may occupy different climatic niches within their ancestral niche. Our results indicate that the change of climatic conditions of geographically and genetically separated populations does not necessarily result in the shift of an ecological niche

Phylogeny and species delimitation of near Eastern Neurergus newts (Salamandridae) based on genome-wide RADseq data analysis

We reconstruct the molecular phylogeny of Near Eastern mountain brook newts of the genus Neurergus (family Salamandridae) based on newly determined RADseq data, and compare the outcomes of concatenation-based phylogenetic reconstruction with species-tree inference. Furthermore, we test the current taxonomy of Neurergus (with four species: Neurergus strauchii, N. crocatus, N. kaiseri, and N. derjugini) against coalescent-based species-delimitation approaches of our genome-wide genetic data set. While the position of N. strauchii as sister species to all other Neurergus species was consistent in all of our analyses, the phylogenetic relationships between the three remaining species changed depending on the applied method. The concatenation approach, as well as quartet-based species-tree inference, supported a topology with N. kaiseri as the closest relative to N. derjugini, while full-coalescent species-tree inference approaches supported N. crocatus as sister species of N. derjugini. Investigating the individual signal of gene trees highlighted an extensive variation among gene histories, most likely resulting from incomplete lineage sorting. Coalescent-based species-delimitation models suggest that the current taxonomy might underestimate the species richness within Neurergus and supports seven species. Based on the current sampling, our analysis suggests that N. strauchii, N. derjugini and N. kaiseri might each be subdivided into further species. However, as amphibian species are known to be composed of deep conspecific lineages that do not always warrant species status, these results need to be cautiously interpreted in an integrative taxonomic framework. We hypothesize that the rather shallow divergences detected within N. kaiseri and N. derjugini likely reflect an ongoing speciation process and thus require further investigation. On the contrary, the much deeper genetic divergence found between the two morphologically and geographically differentiated subspecies of N. strauchii leads us to propose that N. s. barani should be considered a distinct species, Neurergus barani Öz, 1994

Conservation needs to evolve to survive in the post‐pandemic world

The conservation of biodiversity—and the vital ecosystem services it generates—is one of the greatest challenges humanity faces, yet the field faces drastic funding cuts as society realigns its priorities in the face of the COVID‐19 pandemic. Here, we argue that diverting attention from conservation would, however, increase the risk of further global health crises because the emergence of novel infectious diseases is partially driven by global environmental change. As the discrepancy between conservation needs and society's willingness to pay for them grows, conservation will have to evolve to stay relevant in the age global change‐induced human infectious disease

A conservation roadmap for the subterranean biome

The 15th UN Convention on Biological Diversity (CBD) (COP15) will be held in Kunming, China in October 2021. Historically, CBDs and other multilateral treaties have either alluded to or entirely overlooked the subterranean biome. A multilateral effort to robustly examine, monitor, and incorporate the subterranean biome into future conservation targets will enable the CBD to further improve the ecological effectiveness of protected areas by including groundwater resources, subterranean ecosystem services, and the profoundly endemic subsurface biodiversity. To this end, we proffer a conservation roadmap that embodies five conceptual areas: (1) science gaps and data management needs; (2) anthropogenic stressors; (3) socioeconomic analysis and conflict resolution; (4) environmental education; and (5) national policies and multilateral agreements.Peer reviewe

Non-cooperative beaconing control in vehicular ad hoc networks

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonThe performance of many protocols and applications of Vehicular Ad hoc Networks (VANETs), depends on vehicles obtaining enough fresh information on the status of their neighbouring vehicles. This should be fulfilled by exchanging Basic Safety Messages (BSMs) also called beacons using a shared channel. In dense vehicular conditions, many of the beacons are lost due to channel congestion. Therefore, in such conditions, it is necessary to control channel load at a level that maximizes BSM dissemination. To address the problem, in this thesis algorithms for adaptation of beaconing to control channel load are proposed. First, a position-based routing protocol for VANETs is proposed and the requirement of adaptive beaconing to increase the performance of the protocol is indicated. The routing protocol is traffic-aware and suitable for city environments and obtains real-time traffic information in a completely ad hoc manner without any central or dedicated control, such as traffic sensors, roadside units, or information obtained from outside the network. The protocol uses an ant-based algorithm to find a route that has optimum network connectivity. Using information included in small control packets called ants, vehicles calculate a weight for every street segment that is proportional to the network connectivity of that segment. Ant packets are launched by vehicles in junction areas. To find the optimal route between a source and destination, a source vehicle determines the path on a street map with the minimum total weight for the complete route. The correct functionality of the protocol design has been verified and its performance has been evaluated in a simulation environment. Moreover, the performance of the protocol in different vehicular densities has been studied and indicated that in dense vehicular conditions the performance of the protocol degrades due to channel load created by uncontrolled periodic beaconing. Then, the problem of beaconing congestion control has been formulated as non-cooperative games, and algorithms for finding the equilibrium point of the games have been presented. Vehicles as players of the games adjust their beacon rate or power or both, based on the proposed algorithms so that channel load is controlled at a desired level. The algorithms are overhead free and fairness in rate or power or both rate and power allocation are achieved without exchanging excess information in beacons. Every vehicle just needs local information on channel load while good fairness is achieved globally. In addition, the protocols have per-vehicle parameters, which makes them capable of meeting application requirements. Every vehicle can control its share of bandwidth individually based on its dynamics or requirements, while the whole usage of the bandwidth is controlled at an acceptable level. The algorithms are stable, computationally inexpensive and converge in a short time, which makes them suitable for the dynamic environment of VANETs. The correct functionality of the algorithms has been validated in several high density scenarios using simulations

Non-cooperative beacon power control for VANETs

In vehicle-to-vehicle communication, every vehicle broadcasts its status information periodically in its beacons to create awareness for surrounding vehicles. However, when the wireless channel is congested by beaconing activity, many beacons are lost due to packet collision. This paper presents a distributed beacon transmission power control algorithm to control channel usage at a desired level. The algorithm is based on game theory, for which the existence and uniqueness of the Nash equilibrium is proven. The proposed algorithm is then compared with other congestion control mechanisms using simulation. The results of the simulations indicate that the proposed algorithm is stable and performs better than the others in terms of fairness, bandwidth usage, and the ability to meet application requirements.</p

Traffic-aware VANET routing for city environments-A protocol based on ant colony optimization

This paper presents a traffic-aware position-based routing protocol for vehicular ad hoc networks (VANETs) suitable for city environments. The protocol is an enhanced version of the geographical source routing (GSR) protocol. The proposed protocol, named efficient GSR, uses an ant-based algorithm to find a route that has optimum network connectivity. It is assumed that every vehicle has a digital map of the streets comprised of junctions and street segments. Using information included in small control packets called ants, the vehicles calculate a weight for every street segment proportional to the network connectivity of that segment. Ant packets are launched by the vehicles in junction areas. In order to find the optimal route between a source and a destination, the source vehicle determines the path on a street map with the minimum total weight for the complete route. The correct functionality of the proposed protocol has been verified, and its performance has been evaluated in a simulation environment. The simulation results show that the packet delivery ratio is improved by more than 10&amp;#x0025; for speeds up to 70&amp;#x00A0;km/h compared with the VANET routing protocol based on ant colony optimization (VACO) that also uses an ant-based algorithm. In addition, the routing control overhead and end-to-end delay are also reduced.</p