Ring Routing Research Articles

Widening of existing bridges on State Highway 16 in Auckland

The State Highway 16 Causeway upgrade project is one of the packages in the Waterview Connection project portfolio, which forms the final section of the 48 km Western Ring Route in Auckland, New Zealand. The project improves, widens and raises an approximately 4·8 km long section of the existing motorway, to provide additional capacity and to safeguard it against coastal erosion and flooding. Two existing bridges on the motorway, Whau River Bridge and Causeway Bridge, are being widened and upgraded to extend their usable lives. Both bridges are a mix of structural forms, presenting many technical and logistical challenges for design and construction, in terms of the integration of further widening work and the assessment of the existing structural elements. This paper discusses the innovative approach taken towards the complex bridge widening, how durability, constructability and traffic management have been taken into consideration and how the results of assessments, including non-linear seismic ‘pushover’ analyses, have been used to confirm the functionality of the bridges in the final scheme.

«Дороги души Державной»: проект развития автотранспортной инфраструктуры и придорожного сервиса в Центральном федеральном округе

The development Program project of road transport and tourism infrastructure «The roads of Power´s Soul» is presented in the article. The program was developed by the Coordinating Council for the development of tourism in the Central Federal District (CFD) of the Association of interregional social and economic interaction «Central Federal District» and the Russian State University of Tourism and Service.
 
 The urgency of the creation of generalizing, integral tourism and tourist services development programs for all regions of the CFD is justified in the article.
 
 It was noted that tourism is the rapidly growing sector of the economy CFD. But comprehensive solution of issues related to creation of the new tourism products cannot be provided by the only development of the infrastructure. This hinders the development of effective promotion tools, introduction of innovative technologies, staff training in the tourism and service of district. The creation of a unified tourism space is the one of the main directions of the tourism sector development in the Central Federal District.
 
 Such approach can only be implemented within a unified inter-regional program of tourism development in district and creating a tourist cluster with the active participation of each subject of the CFD.
 
 The program development project of road transport and tourism infrastructure in 2015 - 2025 is proposed in the article. The goals, objectives, stages, outcomes of the program are defined. The scheme of the complex federal automobile segmented tourist ring route through the territory of all the regions - subjects of the CFD is proposed. The main results of a comprehensive analysis of tourist routs, facilities and activities recommended for inclusion in the program are rep-
 
 resented. The criteria for selection of destinations and also companies and organizations of tourism infrastructure for inclusion in the Program are substantiated. It is concluded that practical implementation of developed Program is very important; it might be very effective for the tourism development in the Central Federal District and Russia as a whole.

Ring Routing: An Energy-Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink

In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.

CLEVER: Cluster-based Energy-aware Virtual Ring Routing in randomly deployed wireless sensor networks

Energy-aware routing is an important remedy to face the quick failure of energy-constrained nodes in Wireless Sensor Networks. Network clustering with electing energy-powerful nodes as cluster heads is a perfect solution. However, such clustering requires ideal nodes placement to afford best performances. Manual nodes placement is not always possible, the sensors can be randomly deployed. In such networks, the cluster heads cannot always communicate directly. In this paper, we present a novel clustering strategy for randomly deployed heterogeneous sensors, in which a cluster is defined as a set of energy-powerful nodes placed at the range of each other. The proposed protocol, called CLEVER (Cluster-based Energy-aware Virtual Ring Routing), uses virtual identity-based routing for intra and inter-cluster communications. The experimental results show that CLEVER increases drastically the network lifetime and optimizes efficiently sensors energy.

Balancing Load via Small Coalitions in Selfish Ring Routing Games

This paper concerns the asymmetric atomic selfish routing game for load balancing in ring networks. In the selfish routing, each player selects a path in the ring network to route one unit traffic between its source and destination nodes, aiming at a minimum maximum link load along its own path. The selfish path selections by individuals ignore the system objective of minimizing the maximum load over all network links. This selfish ring load (SRL) game arises in a wide variety of applications in decentralized network routing, where network performance is often measured by the price of anarchy (PoA), the worst-case ratio between the maximum link loads in an equilibrium routing and an optimal routing. It has been known that the PoA of SRL with respect to classical Nash Equilibrium (NE) cannot be upper bounded by any constant, showing large loss of efficiency at some NE outcome. In an effort to improve the network performance in the SRL game, we generalize the model to so-called SRL with collusion (SRLC) which allows coordination within any coalition of up to k selfish players on the condition that every player of the coalition benefits from the coordination. We prove that, for m-player game on n-node ring, the PoA of SRLC is n - 1 when k ≤ 2, drops to 2 when k = 3 and is at least 1 + 2/m for k ≥ 4. Our study shows that on one hand, the performance of ring networks, in terms of maximum load, benefits significantly from coordination of self-interested players within small-sized coalitions; on the other hand, the equilibrium routing in SRL might not reach global optimum even if any number of players can coordinate.

The Price of Anarchy for Selfish Ring Routing is Two

We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum latency among all players as social cost. This important social cost function is much less understood than the average latency. We show that the price of anarchy is at most two, when the network is a ring and the link latencies are linear. Our bound is tight. This is the first sharp bound for the maximum latency objective.

Stability vs. optimality in selfish ring routing

We study asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pairs over links with linear latencies. We show that there exists an optimal solution that is a 9-approximate Nash equilibrium, significantly improving the existing upper bound of 54 on the instability factor. We present fast implementation of the best response dynamics for computing a Nash equilibrium. Furthermore, we perform empirical study on the price of stability, narrowing the gap between the lower and upper bounds to 0.7436.

Ring and Clustering Routing Strategy Based on Data Filed in Sensor Network

Ring and Clustering Routing Strategy Based on Data Filed in Sensor Network

Multipath Ring Routing in Wireless Sensor Networks

In the past years, the routing problems of wireless sensor network (WSN) have attracted great interest, and many routing protocols for WSN have being proposed. However, these routing protocols pay little attention to the transmission reliability. Therefore, this paper proposes a new multipath ring routing algorithm for WSNs. The proposed algorithm utilizes ring level to separate sensor nodes into several sections, which can improve the reliability of the data transmission. Using the multipath ring routing data delivery improves as an average of 27.58% to leach routing and 113.06% to directing routing.

A ring-based multicast routing topology with QoS support in wireless mesh networks

Wireless mesh networking (WMN) is an emerging technology for future broadband wireless access. The proliferation of the mobile computing devices that are equipped with cameras and ad hoc communication mode creates the possibility of exchanging real-time data between mobile users in wireless mesh networks. In this paper, we argue for a ring-based multicast routing topology with support from infrastructure nodes for group communications in WMNs. We study the performance of multicast communication over a ring routing topology when 802.11 with RTS/CTS scheme is used at the MAC layer to enable reliable multicast services in WMNs. We propose an algorithm to enhance the IP multicast routing on the ring topology. We show that when mesh routers on a ring topology support group communications by employing our proposed algorithms, a significant performance enhancement is realized. We analytically compute the end-to-end delay on a ring multicast routing topology. Our results show that the end-to-end delay is reduced about 33 %, and the capacity of multicast network (i.e., maximum group size that the ring can serve with QoS guarantees) is increased about 50 % as compared to conventional schemes. We also use our analytical results to develop heuristic algorithms for constructing an efficient ring-based multicast routing topology with QoS guarantees. The proposed algorithms take into account all possible traffic interference when constructing the multicast ring topology. Thus, the constructed ring topology provides QoS guarantees for the multicast traffic and minimizes the cost of group communications in WMNs.

Unfavored Ring Route Revealed

RETURN TO ISSUEPREVNewsNEXTUnfavored Ring Route RevealedCite this: Chem. Eng. News 2012, 90, 10, 5Publication Date (Print):March 5, 2012Publication History Published online29 March 2013Published inissue 5 March 2012https://doi.org/10.1021/cen-09010-notw1Copyright © 2012 Chemical & Engineering NewsArticle Views9Altmetric-Citations-LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InReddit PDF (305 KB) SUBJECTS:Antimicrobial agents,Bacteria,Crystal structure,Organic chemistry,Peptides and proteins Get e-Alerts

Pairwise cooperations in selfish ring routing for minimax linear latency

This paper studies the selfish routing game in ring networks with a load-dependent linear latency on each link. We adopt the asymmetric atomic routing model. Each player selfishly chooses a route to connect his source-destination pair, aiming at the lowest latency of his route, while the system objective is to minimize the maximum latency among all routes of players. The effectiveness of these routing games is often measured by the price of anarchy (PoA), the worst-case ratio between the maximum latencies in a Nash equilibrium (NE) and in a system optimum, where NE refers to a “stable state” among all players, from which no player has the incentive to deviate unilaterally. In classical setting, no cooperation is allowed and 16 stands as the current best upper bound on the PoA of such selfish ring routing. In this paper we show that the PoA is at most 10.16 provided cooperations within pairs of players are allowed, where any two players could change their routes simultaneously if neither would experience a longer latency and at least one would experience a shorter latency.

Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks

We present the Virtual Cord Protocol (VCP), which exploits virtual coordinates to provide efficient and failure tolerant routing and data management in sensor networks. VCP maintains a virtual cord interconnecting all the nodes in the network and which, operating similar to a Distributed Hash Table (DHT), provides means for inserting data fragments into sensor nodes and retrieving them. Furthermore, it supports service discovery using indirections. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always provides a path toward the destination. Second, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the shortest path (achieving a stretch ratio of less than 125 percent) with very low overhead. We also extended VCP with data replication mechanisms to improve failure handling. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g., Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The presented results outline the capabilities of VCP to handle such cases more efficiently compared to other protocols. We also compared the capabilities to reliably store and retrieve data in the network to Geographic Hash Tables (GHTs). VCP, in the worst case, performs similar to GHTs, but outperforms this protocol in most cases, especially when complex routing is involved.

A combinatorial optimization algorithm for solving the branchwidth problem

In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced by Robertson and Seymour in their series of papers that proved the Graph Minors Theorem. Branch decompositions have proven to be useful in solving many NP-hard problems, such as the traveling salesman, independent set, and ring routing problems, by means of combinatorial algorithms that operate on branch decompositions. We develop an implicit enumeration algorithm for the optimal branch decomposition problem and examine its performance on a set of classical graph instances.

Energy-aware Virtual Ring Routing in Wireless Sensor Networks

Virtual Ring Routing (VRR) is an ad-hoc routing protocol that avoids flooding the network. It uses location independent identifiers for packet routing. However, VRR does not take into consideration the amount of energy in nodes, leading to the failure of several nodes in the network. To resolve this problem, we have adopted a hierarchical Distributed Hash Table in the VRR architecture. In the resulting architecture, the energy powerful sensors are responsible for most message traffic. Weak sensors are then utilized less frequently than powerful sensors. The experimental results show that Coral-based VRR consumes less energy than VRR and extends the network lifetime.

Forecasting Red Tides Using a Novel Multi-Metric Adaptive Routing Algorithm in Underwater Wireless Sensor Networks

The red tide phenomenon has resulted in millions of whelk, fish and oyster deaths in ocean water. Current approaches to monitor red tides include satellite imagery, onboard monitoring and monitoring using buoys. These approaches capture surface information at the expense of huge cost. A costeffective alternative to monitor red tides is deploying terrestrial-underwater Wireless Sensor Networks to monitor and forecast red tides. A novel multi-metric adaptive routing algorithm is implemented. Multiple metrics such as packet age, depth of the sensor node, average energy level of the network, number of hops to the base node are considered. Depending on the value of the calculated metrics; an almost ring routing technique, centralized routing technique, or distributed routing technique is deployed. The metrics are reestimated after the data is sent. Once the data reaches the base node, a comparison is made with dynamic threshold values for the contributing factors and, accordingly, a decision is made and a red tide warning is issued, if needed.

Virtual position-based ring routing protocol for wireless sensor network

A virtual position-based ring routing protocol was presented. This protocol can serve as the infrastructure of a large-scale and data-oriented service in wireless sensor network. This protocol used distributed Hash table to manage data. The idea of using virtual position lead to the benefit that less redundant routing information was generated, and thus the routing paths were optimized. This benefit also reduced nodes' working load and improve data transmission efficiency. Detailed simulation and comparison with relative protocol show that this protocol achieves good efficiency and scalability.

Custom topology rotary clock router with tree subnetworks

Increasing demands on computing power have spurred the development of faster, higher-density Integrated Circuits (ICs), compounding power and complexity concerns in design budgets. The clock distribution network is a significant contributor to such power and complexity concerns. Resonant rotary clocking is a relatively new technology that realizes several benefits over current clocking methods, including power, frequency, and variation tolerance, yet lacks the automation tools to promote increased use. Towards this end, an automated rotary clock routing methodology is presented that generates custom topology rotary ring routes with tree subnetworks. In addition to the benefits of adiabatic clocking, the presented custom topology router permits 38.6% shorter wirelengths on average for register tapping, compared to traditional prescribed skew, binary tree routing.

The price of atomic selfish ring routing

We study selfish routing in ring networks with respect to minimizing the maximum latency. Our main result is an establishment of constant bounds on the price of stability (PoS) for routing unsplittable flows with linear latency. We show that the PoS is at most 6.83, which reduces to 4.57 when the linear latency functions are homogeneous. We also show the existence of a (54,1)-approximate Nash equilibrium. Additionally we address some algorithmic issues for computing an approximate Nash equilibrium.

Routing to reduce the cost of wavelength conversion

We consider all-optical networks that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their capacity usage. We investigate the effect of allowing reroutings on the number of necessary wavelength converters. We disprove a claim of Wilfong and Winkler [G. Wilfong, P. Winkler, Ring routing and wavelength translation, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’98, 1998, pp. 333–341] according to which reroutings do not have any effect on the number of necessary wavelength converters on bidirected networks. We show that there exist (bidirected) networks on n nodes that require Θ(n) converters without reroutings, but only O(1) converters if reroutings are allowed. We also address the cases of undirected networks and networks with shortest-path routings. In each case, we resolve the complexity of computing optimal placements of converters.