Source Routing Algorithm Research Articles

MPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing

The capacity of access links has increased dramatically in recent times, and bottlenecks are moving deeper into the Internet core. When bottlenecks occur in a core (or AS-AS peering) link, it is possible to use additional detour paths to improve the end-to-end throughput between a pair of source and destination nodes. We propose and evaluate a new massively multipath (mPath) source routing algorithm to improve end-to-end throughput for high-volume data transfers. We demonstrate that our algorithm is practical by implementing a system that employs a set of proxies to establish one-hop detour paths between the source and destination nodes. Our algorithm can fully utilize the available access link bandwidth when good proxied paths are available, without sacrificing TCP-friendliness, and achieves throughput comparable to TCP when such paths cannot be found. For 40 percent of our test cases on PlanetLab, mPath achieved significant improvements in throughput. Among these, 50 percent achieved a throughput of more than twice that of TCP.

Investigating a Junction-Based Multipath Source Routing Algorithm for VANETs

In this letter we introduce a new routing technique designed exclusively for VANETs and present some initial performance results. The algorithm was named Junction-based Multipath Source Routing (JMSR). Its main characteristics comprise the multiple routes towards the destination, the junction-centric logic and the adoption of source routing mechanisms.

Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus Topology NOC Architecture under CBR Traffic

Network on Chip has emerged as new paradigm for the system designers to design an on chip interconnection network. However, NOC presents a large amount of array of design parameters and decision that are sometimes difficult to tackle. Apart from these issues NOC presents a framework of communication for complex SOC and has been widely accepted by the industries and academia's. Today all the complex VLSI circuitry which requires an on chip communication between them are the part of NOC. The mature concepts of communication network such as routing algorithm, switching technique, flow and congestion control etc in the NOC are the important features on which the performance of NOC depends. This paper introduces the efficient source routing algorithm which generates the minimum hop from source to destination. Performance of NOC network in terms of latency and throughput for minimum hop source routing algorithm is also evaluated.

Modeling and Parameter Estimation of Particle Swarm Optimization Algorithm for Smart Power Grid

This paper analysis the electric power communication network structure and performance requirements. To investigate the power communication backbone network and network power substation general way, and in electric power communication network delay, error rate, network bandwidth demand were analyzed. The for prevalent in electric power communication network is not a fully meshed network, explore artificially cobweb logic change principle and system method, artificial transform sheet mesh to the standard web, and making use of the cobweb, based on the characteristics of network fast routing. In order to better in the smart grid communication network using artificially cobweb routing algorithm, for the smart grid in the presence of irregular mesh network, this paper presents a kind of the mesh network into logical artificially cobweb network general standardization method. The principle of combination of label switching, this paper presents artificially cobweb source routing algorithm, expounds the artificially cobweb routing algorithm of label switching and label update mechanism, and artificially cobweb routing algorithm balancing routing method and routing method is described in detail.

On the impact of temperature on path selection for wireless ad‐hoc sensor networks

SUMMARYTo lengthen the lifetime of the routing paths in wireless ad‐hoc sensor networks, some of the routing algorithms take the utilization of battery of mobile nodes into account. However, the utilization of a battery is decided not only by its output voltage but also by its temperature. To the best of our knowledge, all of the proposed algorithms do not take this temperature effect into account so far. Hence, it results in selecting improper routes. In this article, we will propose a three‐step systematic method that considers the temperature of a mobile node's battery to calculate the battery's utilization. Simulation results show that the battery's temperature is critical to the lifetime of ad‐doc sensor networks if we let the method be applied to the power‐aware source routing (PSR) algorithm and maximum path lifetime routing (MPLR) algorithm. Copyright © 2012 John Wiley & Sons, Ltd.

Power Control DSR Routing in Tunnel Environment Monitoring

As one of important technologies of IOT (Internet of Things), WSN (Wireless Sensor Networks) has been used in tunnel environmental monitoring. Tunnel environment monitoring has its particularity that WSN nodes show linear topologies. Traditional routing algorithms in WSN do not consider the linear topology of sensor nodes in tunnel and are difficult to realize long-time data transmission in limited battery power. In this paper, we propose Power Control Dynamic Source Routing algorithm (PC-DSR) by the thought of cross-layer design. Routing table is established according to the distance between nodes and the residual energy of nodes and optimum transmission power is calculated in order to save nodes’ power and prolong the life-time of the whole networks. Simulation results show that the novel algorithm can save node's transmission power, which increase the WSN lifetime of 12.3%.

Simulation and Implementation of an Attractiveness based On-Demand Routing Algorithm for Wireless Sensor Networks

A sensor network with an on-demand data centric routing strategy is presented. The routing between the sensor nodes and the data sink(s) (base station/s) is based on attractiveness-metric (Pa) gradients for the data forwarding decisions within the network. The performance of Pa based routing was simulated by the multi-agent simulation tool NetLogo and compared with the popular and widely used Dynamic Source Routing (DSR) algorithm. Additionally, to test the long term stability and the performance of the Pa based routing algorithm, several sensor nodes for local temperature and humidity measurement were placed in wine yards to monitor the risk of downy mildew infection.

계층적 QoS 라우팅을 위한 스타 기반의 노드 집단화

본 논문에서는 계층적 QoS 라우팅을 위해 소스 라우팅 방식을 채택하고 있는 전달망에서 적정 경로를 배정하기 위해 필요로 하는 망의 상태 정보를 효율적으로 집단화하는 방법을 제안한다. 이것은 비대칭망에서 집단화 할 링크의 QoS 파라미터가 두 개 이상일 때 기존 스타 집단화 방법이 갖는 집단화된 정보의 부정확성을 줄이기 위한 방법으로, 서비스경계라인을 논리 링크로 갖는 풀 메쉬 토폴로지를 스타 토폴로지로 변형한다. 이를 위해 본 논문에서는 서비스경계라인의 3가지 속성인 분할, 조인 그리고 통합을 정의하며 이 속성들을 이용한 스타 토폴로지로의 변형과 풀 메쉬로의 복원 방법을 제시한다. 제안 방법은 기존 방법과 유사한 공간 복잡도와 시간 복잡도를 갖지만 집단화된 정보의 정확도와 질의 응답 정확도는 기존 방법보다 높다는 것을 실험을 통해 알 수 있었다. In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

Performance of improved dynamic source routing algorithm for military communication logistics

Mobile ad-hoc networks (MANETs) are autonomous, self-configuring and dynamic networks that operate without the support of any fixed infrastructure. Such networks are excellent candidates for military logistics which requires identification of location of sensitive frights and other communication need. Ad hoc routing protocol supports nodes mobility with multi-hop routing overwhelming the limitations of radio coverage in remote locations. Most of the present routing protocols are not designed to adapt congestion which is the dominant reason for packet loss, longer delay and jitter. In this paper, the original DSR protocol was modified to monitor the occurrence of congestion by using multiple resource utilisation thresholds as QoS attributes and trigger multi-path-routing during the periods of congestion to improve QoS. This paper also deals with the effects of mobility on the modified routing protocol. The NS-2 simulation results showed that a significant improvement in performance of modified DSR was achieved and decreases the network congestion with the use of multi-path routing.

A Multipath Analysis of Biswapped Networks

Biswapped networks of the form Bsw(G) have recently been proposed as interconnection networks to be implemented as optical transpose interconnection systems. We provide a systematic construction of κ+1 vertex-disjoint paths joining any two distinct vertices in Bsw(G), where κ≥1 is the connectivity of G. In doing so, we obtain an upper bound of max{2Δ(G)+5, Δκ(G)+Δ(G)+2} on the (κ+1)-diameter of Bsw(G), where Δ(G) is the diameter of G and Δκ(G) the κ-diameter. Suppose that we have a deterministic multipath source routing algorithm in an interconnection network G that finds κ mutually vertex-disjoint paths in G joining any two distinct vertices and does this in time polynomial in Δκ(G), Δ(G) and κ (and independently of the number of vertices of G). Our constructions yield an analogous deterministic multipath source routing algorithm in the interconnection network Bsw(G) that finds κ+1 mutually vertex-disjoint paths joining any two distinct vertices in Bsw(G) so that these paths, all have length bounded as above. Moreover, our algorithm has time complexity polynomial in Δκ(G), Δ(G) and κ. We also show that if G is Hamiltonian, then Bsw (G) is Hamiltonian, and that if G is a Cayley graph, then Bsw(G) is a Cayley graph.

Congestion Aware and Adaptive Dynamic Source Routing Algorithm with Load-balancing in MANETs

The explosive growth in the use of real-time multimedia applications in mobile devices requires quality of service (QoS) support for effective communication. Network congestion is the main reason for packet loss, longer delay and jitter in streaming multimedia applications. Most of the present routing protocols are not designed to adapt congestion. In this paper, the original DSR protocol is modified to define the occurrence of congestion by monitoring and reporting multiple resource utilization thresholds as QoS attributes and use multi-path-routing and load-balancing during the periods of congestion to improve QoS in MANETs for CBR multimedia applications. NS-2 simulation was extensively carried out to evaluate the performance of the modified DSR in terms of throughput, jitter and end-to-end delay. The results were compared with the original DSR in random node movements under varying traffic loads of 10, 15 and 20 CBR traffic flows to completely assess the applicability of the modified DSR. Simulation results showed that the proposed protocol can significantly improve the network performance for low and medium traffic load in multimedia based mobile ad hoc networks by extending the network lifetime and providing fewer packet losses than the original DSR.

NPR – A new QoS-based routing protocol for mobile ad-hoc networks

Ad-hoc on-demand networks have received a significant interest in the literature. Many routing schemes for such networks focus on finding an optimal path. In this paper, however, we consider the routing problem from the viewpoint of sustaining QoS (quality of service) requirement. Some algorithms such as MP-DSR already have considered this problem in terms of the end-to-end reliability requirement. While the Multi-Path Dynamic Source Routing (MP-DSR) algorithm is capable of resolving the issue to a certain extent, it only considers disjoint paths between a pair of source and destination nodes. In reality due to mobility of nodes there may not exist such disjoint paths. In this paper the proposed approach is independent of the nature of the paths, and yet it achieves the required reliability to satisfy QoS requirement.

Bee-Inspired Routing Protocols for Mobile Ad HOC Network (MANET)

Mobile AdHoc networks( MANETs) are receiving a significant amount of attention from researchers. This paper provides a high light on a new and very energy efficient algorithm for routing in Manets BeeAdHoc. This algorithm is a reactive source routing algorithm and consumes less energy as compared to other existing state of art routing algorithms because a fewer control packets for routing are sent as compared to other networks. I. INTRODUCTION

Cross‐Layer Support for Energy Efficient Routing in Wireless Sensor Networks

The Dynamic Source Routing (DSR) algorithm computes a new route when packet loss occurs. DSR does not have an in‐built mechanism to determine whether the packet loss was the result of congestion or node failure causing DSR to compute a new route. This leads to inefficient energy utilization when DSR is used in wireless sensor networks. In this work, we exploit cross‐layer optimization techniques that extend DSR to improve its routing energy efficiency by minimizing the frequency of recomputed routes. Our proposed approach enables DSR to initiate a route discovery only when link failure occurs. We conducted extensive simulations to evaluate the performance of our proposed cross‐layer DSR routing protocol. The simulation results obtained with our extended DSR routing protocol show that the frequency with which new routes are recomputed is 50% lower compared with the traditional DSR protocol. This improvement is attributed to the fact that, with our proposed cross‐layer DSR, we distinguish between congestion and link failure conditions, and new routes are recalculated only for the latter.

On selecting the cost function for source routing

Many proposed source routing algorithms tackle the Multiple Additively Constrained Path (MACP) selection, an NP-complete problem, by transforming it into the shortest path selection problem, which is P-complete, with an integrated cost function that maps the multi-constraints of each link into a single cost. However, how to select an appropriate cost function is an important issue that has rarely been addressed in literature. In this paper, we provide a theoretical framework for picking a cost function that can improve the performance of source routing in terms of complexity, convergence, and probability of finding a feasible path.

Adaptive QoS Routing by Cross-Layer Cooperation in Ad Hoc Networks

QoS provisioning is a complex and challenging issue in mobile ad hoc networks, especially when there are multiple QoS constraints. In this paper, we propose an adaptive QoS routing scheme supported by cross-layer cooperation in ad hoc networks. The cross-layer mechanism provides up-to-date local QoS information for the adaptive routing algorithm, by considering the impacts of node mobility and lower-layer link performance. The multiple QoS requirements are satisfied by adaptively using forward error correction and multipath routing mechanisms, based on the current network status. The complete routing mechanism includes three parts: (1) a modified dynamic source routing algorithm that handles route discovery and the collection of QoS-related parameters; (2) a local statistical computation and link monitoring function located in each node; and (3) an integrated decision-making system to calculate the number of routing paths, coding parity length, and traffic distribution rates. Simulation results are presented to illustrate the overall performance of our scheme. Our results indicate that our adaptive routing scheme provides suitable QoS performance that is less sensitive to network conditions (i.e., node mobility, transmission power, channel characteristics, and the traffic pattern) than a nonadaptive routing strategy.

An intelligent routing and CAC framework for large-scale networks based on cooperative agents

The routing algorithms can be classified into source, distributed and hierarchical routing. Source routing algorithms are conceptually simple, but they suffer from scalability problem. Distributed routing algorithms are more scalable, but loops may occur, which make the routing to fail. Hierarchical routing has been used to cope with the scalability problems of source routing in large internetworks. The hierarchical routing retains many advantages of source routing. It also has some advantages of distributed routing, because the routing computation is shared by many nodes. The traffic control methods for telecommunication networks must be adaptive, flexible, and intelligent. Use of intelligent algorithms based on fuzzy logic, genetic algorithms and neural networks can prove to be efficient for traffic control in telecommunication networks. In this paper, we propose an intelligent routing and Call Admission Control framework, which is based on cooperative agents. The proposed routing algorithm is a combination of source and distributed routing. It uses source routing inside a domain and hop-by-hop routing for inter-domain. The proposed framework is able to avoid flooding and routing loops, reduce the search space, and can be easily scaled-up to cope with large-scale networks. Performance evaluation via simulations shows that the proposed Fuzzy Admission Control and Intra Domain algorithm have better performance than the conventional methods.

An overview of quality of service routing for next-generation high-speed networks: problems and solutions

The upcoming gigabit-per-second high-speed networks are expected to support a wide range of communication-intensive real-time multimedia applications. The requirement for timely delivery of digitized audio-visual information raises new challenges for next-generation integrated services broadband networks. One of the key issues is QoS routing. It selects network routes with sufficient resources for the requested QoS parameters. The goal of routing solutions is twofold: (1) satisfying the QoS requirements for every admitted connection, and (2) achieving global efficiency in resource utilization. Many unicast/multicast QoS routing algorithms have been published, and they work with a variety of QoS requirements and resource constraints. Overall, they can be partitioned into three broad classes: (1) source routing, (2) distributed routing, and (3) hierarchical routing algorithms. We give an overview of the QoS routing problem as well as the existing solutions. We present the strengths and weaknesses of different routing strategies, and outline the challenges. We also discuss the basic algorithms in each class, classify and compare them, and point out possible future directions in the QoS routing area.

Interconnecting high-speed LANs and backbones

Transparent source routing, an algorithm that exploits the best features of the transparent spanning tree and source routing algorithms for medium-access-control (MAC) bridges used in local area network (LAN) interconnections, is presented. The scheme uses optimal routes, is transparent to end stations, and reduces bridge processing overheads. Aspects of the existing transparent spanning tree and source routing algorithms are described. A comparison of the new scheme with the two existing schemes is presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>