Link Cost Metric Research Articles

Effective Resource Planning for Interference Aware Throughput Maximization of Wireless Body Area Networks

Cross-layer design is an in-depth analysis area in especially wireless Body Area networks and is necessary under energy and throughput limitations. To improve network performance the all the layer increases energy consumption; thus, the collaborations connecting these layers ought to be examined. This study develops an optimal interrupt aware connection planning and power management policy that assist a certain data rate on each connection in the network, including signal to interference and noise ratio(SINR) and highest transmission power controls at one another node or center.in each connection as link cost metrics Creating an interrupt-aware development problem by considering the power of each node in the routing path and the associated delay in each connection.the problem is to discover an scheduling link planning, power management and routing policy that maximizes the life span and throughput and minimizes the end-to-end delay as well as the energy link cost subject to definite controls. To provide mathematical guides to our schemes and relationships between the parameters. In our proposed work is an advance step towards our distributed joint planning, power management and routing algorithm for wireless Body Area networks utilizing cross layer design.

Effective Resource Planning for Interference Aware Throughput Maximization of Wireless Body Area Networks

Cross-layer design is an in-depth analysis area in especially wireless Body Area networks and is necessary under energy and throughput limitations. To improve network performance the all the layer increases energy consumption; thus, the collaborations connecting these layers ought to be examined. This study develops an optimal interrupt aware connection planning and power management policy that assist a certain data rate on each connection in the network,including signal to interference and noise ratio(SINR) and highest transmission power controls at one another node or center.in each connection as link cost metrics Creating an interrupt-aware development problem by considering the power of each node in the routing path and the associated delay in each connection.the problem is to discover an scheduling link planning, power management and routing policy that maximizes the life span and throughput and minimizes the end-to-end delay as well as the energy link cost subject to definite controls. To provide mathematical guides to our schemes and relationships between the parameters. In our Proposed work is an advance step towards our distributed joint planning, power management and routing algorithm for wireless Body Area networks utilizing cross layer design.

A Topology Control Strategy with Reliability Assurance for Satellite Cluster Networks in Earth Observation.

This article investigates the dynamic topology control problem of satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites’ relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime.

Dependable and Energy Economical Direction Finding Protocol for MANET Based on Link Cost Metric using Mobile Agents

Dependable and Energy Economical Direction Finding Protocol for MANET Based on Link Cost Metric using Mobile Agents

Capacity and interference aware link scheduling with channel assignment in wireless mesh networks

Wireless mesh networks (WMNs) are receiving lot of attention in recent years due to the unique features such as low cost and easy deployment. The optimal routing in these networks depends on the link capacities determined by link scheduling. To increase the throughput and network capacity, use of multiple channels and interfaces has been introduced in these networks. But the presence of interference limits the use of link and channel assignment in these types of networks. In this paper, we present a novel approach for link scheduling and channel assignment (CA) to improve the overall capacity and throughput of WMNs. The problem of link scheduling and CA is formulated as a Linear Programming (LP) problem with associated constraints. Links are sorted and placed in a particular group based upon link cost metric (LCM). The LCM value is used to group the links together and placed in appropriate group for CA. As the links are sorted and placed in appropriate groups the corresponding entries are made in Link Assignment Matrix (LAM). Once the links are grouped using LCM, then CA for these links is done and corresponding entries are made in Channel Assignment Matrix (CAM). Two algorithms, one for link scheduling and other for CA, are proposed. Simulation results show that proposed scheme outperforms the earlier approaches with respect to packet delivery fraction, end-to-end delay, aggregate throughput, fairness index and packet loss rate.

ALiSR

A mobile ad hoc network (MANET) represents a system of wireless mobile nodes having random mobility and self-organization into an arbitrary and temporary network, allowing people and devices to seamlessly interact without preexisting communication infrastructure. The lifetime of a MANET depends on the durability of the battery resources of the mobile hosts. Earlier, several routing protocols have been proposed specifically for MANET, but most have not focused on the limitations of battery resources. The failure of these resources severely impacts a communications system during natural disasters and in crucial communication environments. This paper proposes a Mobile Agent (MA) based link stability aware energy efficient routing protocol that can increase the lifetime of the mobile hosts. A new link cost metric (LCM) is defined that is used during routing decisions. LCM is a measure of node and path stability. Simulation results indicate that this new link stability aware energy efficient protocol can extend the lifetime of a MANET and can be used in various mission critical applications.

Distributed on-demand routing for LEO satellite systems

Notwithstanding the limited commercial success of the first narrowband low earth orbit (LEO) satellite systems, the interest of the scientific community in this type of systems has been revived on the basis of the current trend toward the migration to all IP-based services. LEO systems can play a pivotal role in providing services to areas where there is no substantial terrestrial infrastructure. Above all, LEO satellite systems can be used as backbone networks to interconnect autonomous systems worldwide. Such an approach provides flexibility in managing the resulting integrated network infrastructure and supporting innovative applications. In this context, routing data from the source all the way to the destination constitutes a daunting challenge. In this paper, a location-assisted on-demand routing (LAOR) protocol is proposed and evaluated. The proposed protocol introduces for the first time in satellite systems the concept of on-demand routing. However, its implementation is tailored to the requirements imposed by the characteristics of the topology of LEO satellite systems. The performance of the LAOR protocol is assessed for different link-cost metrics and compared to the one of centralized routing protocols proposed in the literature so far. Simulation studies further document and confirm the positive characteristics of the proposed protocol.

A MIXED-METRIC ROUTING WITH OPTIMAL FLOW DISTRIBUTION FOR MPLS NETWORKS

This paper proposes a new routing system for IP network traffic engineering. In this system, the link cost metrics are chosen to reflect the congestion level in terms of the number of flows traversing a given link as well as its residual bandwidth. This cost is used in the design of a dynamic routing for MPLS networks. At the same time, an optimal distribution of network flows is found, and used to impose a balanced traffic loading overall network links. This in turns, have led to a bounded network delay performance. Results have shown robustness of the proposed routing technique over networks with arbitrary topologies and heavy traffic demands.

Routing bandwidth guaranteed paths with local restoration in label switched networks

The emerging multiprotocol label switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites. This basic label switched path (LSP) routing is often enhanced using restoration routing which sets up alternate LSPs to guarantee uninterrupted connectivity in case network links or nodes along primary path fail. We address the problem of distributed routing of restoration paths, which can be defined as follows: given a request for a bandwidth guaranteed LSP between two nodes, find a primary LSP, and a set of backup LSPs that protect the links along the primary LSP. A routing algorithm that computes these paths must optimize the restoration latency and the amount of bandwidth used. We introduce the concept of "backtracking" to bound the restoration latency. We consider three different cases characterized by a parameter called backtracking distance D: 1) no backtracking (D=0); 2) limited backtracking (D=k); and 3) unlimited backtracking (D=/spl infin/). We use a link cost model that captures bandwidth sharing among links using various types of aggregate link-state information. We first show that joint optimization of primary and backup paths is NP-hard in all cases. We then consider algorithms that compute primary and backup paths in two separate steps. Using link cost metrics that capture bandwidth sharing, we devise heuristics for each case. Our simulation study shows that these algorithms offer a way to tradeoff bandwidth to meet a range of restoration latency requirements.

Alternate link routing for traffic engineering in packet‐oriented ISL networks

AbstractThe implementation of a satellite communication network consisting of intersatellite links provides a highly interconnected backbone in the space segment, increasing the network flexibility and reliability, while, on the other hand, introducing numerous issues related to network dimensioning, efficient resource management, adaptive routing, etc. In this paper we study two forwarding policies based on alternate link routing (ALR) and compare their performance with that of a simple forwarding policy employing shortest path routing (SPR) without options. All forwarding policies compared in this study are operating on routing tables calculated with the Dijkstra shortest path algorithm, capable of adapting to traffic load and propagation delay on the links through the appropriately selected link cost metric. Using an ISL network simulator, we demonstrate that both ALR forwarding policies can efficiently handle traffic load sharing among alternative routes, significantly reducing peak values of link load which is a central goal of ISL network dimensioning. Copyright © 2001 John Wiley & Sons, Ltd.

Adaptive feedback compensation for distributed load-based routing systems in datagram packet-switched communications networks

Routing systems for datagram packet-switched networks' iteratively applying Shortest Path First (SPF) algorithms on load-based link cost metrics exhibit poor stabilization and convergence properties at moderate traffic loads without the addition of experimentally determined Bertsekas Additive Bias Factors to aid in damping undesirable oscillations. Routing systems which iteratively apply SPF Algorithms on load-varying link costs implicitly assume routing assignments can be independently modified without affecting the validity of cost estimates on other links. Even under stationary offered loads, this assumption is less accurate as the load increases due to nonlinear dynamical interactions among traffic flows. Failure to compensate for this independence assumption in iterative SPF computations leads to dynamical instabilities above moderate offered loads. Unfortunately, while Bertsekas Additive Bias Factors improve stability, they also reduce the sensitivity of the routing system to network congestion. As alleviation of traffic congestion is often an important service requirement for a routing system, this is a serious drawback. This paper is motivated by a search for techniques to improve the convergence of routing systems upon near-optimum sets of routing assignments for current traffic conditions, without introducing a loss of congestion sensitivity. Due to the limitations of Markov Chain Models of packet-switching networks for our application, a network simulation is developed which provides a more accurate reflection of network dynamics, as it incorporates bounded queue and minimum interarrival time constraints. Utilizing this simulation, it is demonstrated that a Genetic Algorithm which estimates the near-optimal number of routing assignment changes allowed by the Dijkstra SPF Algorithm during each routing update interval, enables substantial performance advantages for networks operated at or above moderate offered loads. This adaptive feedback compensation technique achieves these performance improvements by avoiding the Kauffman and Eigen Catastrophes, although additional processing and slight increases in routing update packet lengths are required. In a broader context, the technology of adaptive feedback compensation should prove a relevant to a variety of real-time distributed adaptive control applications.