Bad Routing Research Articles

Trying to choose the less bad route: Individual migratory behaviour of Atlantic salmon smolts (Salmo salar L.) approaching a bifurcation between a hydropower station and a navigation canal

Contrary to small- and medium-sized rivers, little attention has been paid to the downstream migration of Atlantic salmon smolts in large-sized rivers and the size-related impact of hydropower stations. From 2014 to 2016, we investigated the downstream migration of n = 72 acoustic-tagged smolts in the Meuse river at a bifurcation zone between a hydropower station equipped with three Kaplan turbines and a navigation canal. A hydrodynamic model that solves the depth-integrated shallow water equations on a Cartesian grid using a finite volume technique was used to infer the influence of water discharge and flow velocity on the smolts' behaviour upstream of the hydroelectric complex. Of the migrating smolts, 41.5% performed back and forth movements before approaching the complex for the first time, sometimes over long distances and at a slow pace, leading to significant delays (3–298 h). Beyond about 250 m3 s−1, the water flow direction changes towards the hydropower station with a gradual acceleration. A median water discharge of 161 m3 s−1 and associated median flow velocity of 0.14 m s−1 tended to favour a more direct and downstream movement towards the hydropower station. On the other hand, the navigation canal was mainly approached at low water discharge (median 132 m3 s−1), due to a higher flow velocity (median 0.11 m s−1) at the entrance. Of the released smolts, only 38.6% passed through the complex, of which 36.4% migrated by the navigation canal and 63.6% by the hydropower station, with a median research time of 04:44. Among all the released individuals, the escapement rate at the end of the study site was 2.9% by the canal and 8.3% by the Meuse river. This site, which offers two non-optimal, unattractive and unsafe migration routes, turns out to be problematic for successful downstream smolt migration.

Citizen science for pedestrian cartography: collection and moderation of walkable routes in cities through mobile gamification

Digital geographical maps can be regarded as a user interface for understanding and navigating the city. Nevertheless, contemporary digital maps over-emphasize the needs of motor vehicles. Pedestrian routes have only been considered as an add-on option in existing digital maps and the respective data collection has not been performed in the field. In this article, we present a mobile application that employs gamification as a means to engage users to collect pragmatic data about walkable routes, which are then processed with the goal of creating a new kind of pedestrian-friendly cartography. Besides the technical infrastructure for collecting and filtering the route traces, the main challenge in user-generated walkable routes is the identification of malicious data, which should be rejected, as well as the rewarding of constructive behavior through peer-review. For this purpose, the mobile application employs a point system in order to identify and discourage the submission of bad routes. A longitudinal (2-months) field study of the mobile application confirmed that gamification facilitates effective data collection for producing pedestrian cartography even with few users and demonstrated that gamification infuses a shared responsibly about the quality of data collection. The visualization of the pedestrian-generated data on a map required a partially manual process, thus, further research should explore the gamification of the data visualization part, too.

Analyzing the applicability of the least risk path algorithm in indoor space

Abstract. Over the last couple of years, applications that support navigation and wayfinding in indoor environments have become one of the booming industries. However, the algorithmic support for indoor navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. In outdoor space, several alternative algorithms have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behavior (e.g. simplest paths, least risk paths). The need for indoor cognitive algorithms is highlighted by a more challenged navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). Therefore, the aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as proposed by Grum (2005) is duplicated and tested in a complex multi-story building. Several analyses compare shortest and least risk paths in indoor and in outdoor space. The results of these analyses indicate that the current outdoor least risk path algorithm does not calculate less risky paths compared to its shortest paths. In some cases, worse routes have been suggested. Adjustments to the original algorithm are proposed to be more aligned to the specific structure of indoor environments. In a later stage, other cognitive algorithms will be implemented and tested in both an indoor and combined indoor-outdoor setting, in an effort to improve the overall user experience during navigation in indoor environments.

Reinforcement Swap Attack against Directed Diffusion in Wireless Sensor Networks

In this paper, we introduce a new attack, Reinforcement Swap Attack, against Directed Diffusion based WSNs, which exploits the vulnerabilities of Directed Diffusion specifications. Its main idea is the disruption of configuration information, such as routing information to misuse route establishment along the network. Our approach is to swap Directed Diffusion reinforcement rule which means that the good route is excluded and the bad route is included. Moreover, our attack is activated and deactivated periodically to prolong its lifetime and hence brings down the target network. For the proposed attack, we present analysis, simulation, and experimental measurements. We show that the system achieves maximal damage on system performance represented by many metrics.

Integrated Routing and Storage for Messaging Applications in Mobile Ad Hoc Networks

This paper is motivated by the observation that traditional ad hoc routing protocols are not an adequate solution for messaging applications (e.g., e-mail) in mobile ad hoc networks. Routing in ad hoc mobile networks is challenging mainly because of node mobility – the more rapid the rate of movement, the greater the fraction of bad routes and undelivered messages. For applications that can tolerate delays beyond conventional forwarding delays, we advocate a relay-based approach to be used in conjunction with traditional ad hoc routing protocols. This approach takes advantage of node mobility to disseminate messages to mobile nodes. The result is the Mobile Relay Protocol (MRP), which integrates message routing and storage in the network; the basic idea is that if a route to a destination is unavailable, a node performs a controlled local broadcast (a relay) to its immediate neighbors. In a network with sufficient mobility – precisely the situation when conventional routes are likely to be non-existent or broken – it is quite likely that one of the relay nodes to which the packet has been relayed will encounter a node that has a valid, short (conventional) route to the eventual destination, thereby increasing the likelihood that the message will be successfully delivered. Our simulation results under a variety of node movement models demonstrate that this idea can work well for applications that prefer reliability over latency.

Deregulating the bus industry in Britain: a rejoinder

Abstract In our critique for the Buses White Paper, we argued that ‘competition for licences’ could achieve most of the benefits of competition without the major disadvantages of ‘competition on the road’. In response to the comments of Beesley and Glaister, we explain how comprehensive franchising of good and bad routes alike would encourage effective competition, whilst providing conditions for the transparent continuation of cross‐subsidy where that was the choice of the local authority in question. We correct their misrepresentation of our arguments on the desirability of cross‐subsidy and on the case for minibuses, and explain why we believe that such cost savings as are achieved will be mainly at the expense of staff or customer service. Finally, we restate the case for believing that a unified planned timetable will provide a better service for a given level of resources than will uncoordinated competitive services.