Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

An energy efficient routing mechanism for wireless sensor networks

Abstract: In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient routing protocol. Since the sensor nodes have limited available power, energy conservation is a critical issue in wireless sensor network for nodes and network life. Most of the existing routing protocols for sensor networks don't turn off the radio frequency completely. They speed up the energy consumption. LEACH (low energy adaptive clustering hierarchy) is a clustering-based protocol that non-cluster-head nodes will turn off their RF completely until their pre-allocated time slot. However, LEACH has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster-head. In this paper, we propose a MECH (maximum energy cluster head) routing protocol. It has self-configuration and hierarchical tree routing properties. MECH improves LEACH in several aspects. MECH constructs clusters based on radio range and the number of cluster members. The cluster topology in the network is distributed more equally, through our cluster constructing. We also propose a hierarchical tree routing method that reduces the distance of cluster-head to the base station.

Analysis of the MED oscillation problem in BGP

Abstract: The multi exit discriminator (MED) attribute of the border gateway protocol (BGP) is widely used to implement "cold potato routing" between autonomous systems. However, the use of MED in practice has led to BGP persistent oscillation. The MED oscillation problem has been described with example configurations and complicated, step-by-step evaluation of dynamic route computations performed at multiple routers. Our work presents the first rigorous analysis of the MED oscillation problem. We employ the stable paths problem (SPP) formalism that allows a static analysis of the interaction of routing policies. We give a formal definition of MED induced routing anomalies (MIRA) and show that, in general, they can span multiple autonomous systems. However, if we assume that the BGP configurations between autonomous systems follows a common model based on customer/provider and peer/peer relationships, then we show that the scope of any MIRA is always contained within a single autonomous system. Contrary to widely held assumptions, we show that a MIRA can occur even in a fully meshed IBGP configuration. We also show that a stable BGP routing may actually violate the stated semantics of the MED attribute.

Cross-layer optimization in TCP/IP networks

Abstract: TCP-AQM can be interpreted as distributed primal-dual algorithms to maximize aggregate utility over source rates. We show that an equilibrium of TCP/IP, if exists, maximizes aggregate utility over both source rates and routes, provided congestion prices are used as link costs. An equilibrium exists if and only if this utility maximization problem and its Lagrangian dual have no duality gap. In this case, TCP/IP incurs no penalty in not splitting traffic across multiple paths. Such an equilibrium, however, can be unstable. It can be stabilized by adding a static component to link cost, but at the expense of a reduced utility in equilibrium. If link capacities are optimally provisioned, however, pure static routing, which is necessarily stable, is sufficient to maximize utility. Moreover single-path routing again achieves the same utility as multi-path routing at optimality.

Performance evaluation of load-balanced clustering of wireless sensor networks

Abstract: Wireless sensor networks have received increasing attention in recent few years. In many military and civil applications of sensor networks, sensors are constrained in onboard energy supply and are left unattended. Energy, size and cost constraints of such sensors limit the communication range. Therefore, multi-hop wireless connectivity is required to forward data on their behalf to a remote command site. In this paper, we investigate the performance of an algorithm to network these sensors into well defined clusters with less-energy-constrained gateway nodes acting as clusterheads as well as to balance the load among these gateways. Load balanced clustering increases the system stability and improves the communication between different nodes in the system. To evaluate the efficiency of this approach, we studied the performance of sensor networks by applying various different routing protocols. Simulation results shows that irrespective of the routing protocol used, this approach improves the lifetime of the system.

DDR: distributed dynamic routing algorithm for mobile ad hoc networks

Abstract: This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic, routing (DDR). Although DDR benefits from classical concepts like zone and forest, unlike previous solutions it achieves several goals at the same time. Firstly, it provides different mechanisms to drastically reduce routing complexity and improve delay performance. Secondly, it is an infrastructureless in a strong sense: it does not even require a physical location information. Finally, zone naming is performed dynamically and broadcasting is reduced noticeably.