The accuracy of Fastloc-GPS locations and implications for animal tracking

Over recent years, a major breakthrough in marine animal tracking has occurred with the advent of Fastloc-GPS that provides highly accurate location data even for animals that only surface briefly such as sea turtles, marine mammals and penguins. We assessed the accuracy of Fastloc-GPS locations using fixed trials of tags in which >45 000 locations were obtained. Procedures for determining the speed of travel and heading were developed by simulating tracks and then adding Fastloc-GPS location errors. The levels of detail achievable for speed and heading estimates were illustrated by using empirical Fastloc-GPS data for a green turtle (Chelonia mydas, Linnaeus, 1758) travelling over 3000 km across the Indian Ocean. The accuracy of Fastloc-GPS locations varied as a function of the number of GPS satellites used in the location calculation. For example, when Fastloc-GPS locations were calculated using 4 GPS satellites, 50% of locations were within 36 m and 95% within 724 m of the true position. These values improved to 18 and 70 m, respectively, when 6 satellites were used. Simulations indicated that for animals travelling around 2·5 km h-1 (e.g. turtles, penguins and seals) and depending on the number of satellites used in the location calculation, robust speed and heading estimates would usually be obtained for locations only 1-6 h apart. Fastloc-GPS accuracy is several orders of magnitude better that conventional Argos tracking or light-based geolocation and consequently will allow new insights into small-scale movement patterns of marine animals.

Stability analysis and resource allocation for space-based multi-access systems

In space-based networks, the data relay satellites can assist low-earth-orbit satellites in relaying data to other satellites or the ground station and improve the real time system throughput. To take full advantage of transmission resource of the cooperative relays, this paper proposes a multiple access and resource allocation strategy, in which relays can receive and transmit simultaneously according to channel characteristics of space-based systems. Based on the queueing theoretic formulation, the stability of the proposed protocol is analyzed and the maximum stable throughput region is derived, which would provide the appropriate guidance for the design of the system optimal control. Simulation results exhibit multiple factors that affect the stable throughput and verify the theoretical analysis.

Playing with other(ed) species: games, representation, and nonhuman animals

During the writing of this essay, the controversial nonhuman animal rights organisation PETA (People for the Ethical Treatment of Animals) sent out a tweet linking to an online article about the recent PC and Playstation 4 console game No Man’s Sky, in which players are positioned as explorers of countless virtual planets. Encountering the wide array of creatures indigenous to these worlds, players of this game are offered the choice of whether ‘to document them and name them or slaughter them en masse’ (Francisco, ‘PETA’). While an environmental agenda appears to be far from the game designers’ minds, PETA’s Marketing Vice President Joel Bartlett interprets No Man’s Sky as ‘counting on our natural empathy … we have a natural sense of exploration that has been important to human history’ (Francisco, ‘PETA’). Indeed, PETA has immersed itself in the gaming industry by creating its own simple online games in-house, such as the provocative Mario Kills Tanooki, which opposes what it sees as the unethical messages conveyed by Nintendo’s popular Super Mario Bros. franchise. These instances of the intersection of exploration, ethics, empathy, and play raise important questions regarding the potential role(s) of gaming in furthering (or hindering) the welfare of nonhuman animals. This issue becomes more and more urgent not only in a time of ongoing climate change, environmental degradation, and the continued endangerment of countless species around the planet, but also in a time when the gaming industry and the adoption of game design principles in many others grows apace.

Time cumulative complexity modeling and analysis for space-based networks

In this paper, the notion of the cumulative time varying graph (C-TVG) is proposed to model the high dynamics and relationships between ordered static graph sequences for space-based information networks (SBINs). In order to improve the performance of management and control of the SBIN, the complexity and social properties of the SBIN's high dynamic topology during a period of time is investigated based on the proposed C-TVG. Moreover, a cumulative topology generation algorithm is designed to establish the topology evolution of the SBIN, which supports the C-TVG based complexity analysis and reduces network congestions and collisions resulting from traditional link establishment mechanisms between satellites. Simulations test the social properties of the SBIN cumulative topology generated through the proposed C-TVG algorithm. Results indicate that through the C-TVG based analysis, more complexity properties of the SBIN can be revealed than the topology analysis without time cumulation. In addition, the application of attack on the SBIN is simulated, and results indicate the validity and effectiveness of the proposed C-TVG and C-TVG based complexity analysis for the SBIN.

SAT-GRD: An ID/Loc split network architecture interconnecting satellite and ground networks

Since the satellite network plays an irreplaceable role in many fields, how to interconnect it with the ground network has received an unprecedented attention. However, with much more requirements imposed to the current terrestrial network, many serious problems caused by the IP dual-role exposed. In this context, their direct interconnection seems not the most appropriate way. Thus, in this paper, SAT-GRD, an incrementally deployable ID/Loc split network architecture is proposed, aiming to integrate the satellite and ground networks efficiently. Specifically, SAT-GRD separates the identity of both the host and network from the location. Then, it isolates the host from the network, and further divides the whole network into core and edge networks. These make SAT-GRD much more flexible and scalable to achieve heterogeneous network convergence and avoid problems resulting from the overloaded semantics of IP addresses. In addition, much work has been done to implement the proof-of-concept prototype of SAT-GRD, and experimental results prove its feasibility.