Static routing

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

A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

Abstract: Multicast routing is to find a tree which is rooted from a source node and contains all multicast destinations. There are two requirements of multicast routing in many multimedia applications: optimal network cost and bounded delay. The network cost of a tree is defined as the sum of the cost of all links in the tree. The bounded delay of a routing tree refers to the feature that the accumulated delay from the source to any destination along the tree shall not exceed a prespecified bound. This paper presents a distributed heuristic algorithm which generates routing trees having a suboptimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages and convergence time, and flexible in dynamic membership changes. A large amount of simulations have been done to show the network cost of the routing trees generated by our algorithm is similar to, or even better than, other existing algorithms.

STOD-RP: A Spectrum-Tree Based On-Demand Routing Protocol for Multi-Hop Cognitive Radio Networks

Abstract: A unique challenge for routing in cognitive radio networks is the collaboration between the route selection and spectrum decision. To solve this problem, in this paper a Spectrum-Tree base On-Demand routing protocol (STOD-RP) is proposed where a spectrum-tree is built in each spectrum band. The formation of the spectrum-tree addresses the cooperation between spectrum decision and route selection in an efficient way. In addition, a new route metric is proposed as well as a fast and efficient spectrum-adaptive route recovery method. Simulation results show that our proposed STOD-RP reduces the control overhead and shortens the average end-to-end delay significantly.

Systems and Methods for Fractional Routing Redundancy

Abstract: Systems and methods for fractional routing are described. An exemplary method may include receiving, by a first router, data information regarding routing by a first portion of a third router, receiving, by a second router, data information regarding routing by a second portion of a third router, wherein the data information regarding routing by the first portion and data information regarding routing by the second portion is not the same, routing, by the first router, data associated with the routing by the first portion of the third router, and routing by the second router, data associated with the routing by the second portion of the third router.

Shortcut Tree Routing in ZigBee Networks

Abstract: ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. Due to characteristics such as low data rate, low price, and low power consumption, ZigBee is expected to be used in wireless sensor networks for remote monitoring, home control, and industrial automation. Since one of the most important goals is to reduce the installation and running cost, ZigBee stack is embedded in small and cheap micro-controller units. Since tree routing does not require any routing tables to send the packet to the destination, it can be used in ZigBee end devices that have limited resources. However, tree routing has the problem that the packets follow the tree topology to the destination even if the destination is located nearby. We propose the shortcut tree routing protocol to reduce the routing cost of ZigBee tree routing by using the neighbor table that is originally defined in the ZigBee standard. While following the ZigBee tree routing algorithm, we suggest forwarding the packet to the neighbor node if it can reduce the routing cost to the destination. Simulation results show that the shortcut tree routing algorithm saves more than 30 percent of the hop count compared with ZigBee tree routing.

On greedy geographic routing algorithms in sensing-covered networks

Abstract: Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks that provide sensing coverage over a geographic area (e.g., surveillance or object tracking systems). Our geometric analysis and simulation results demonstrate that existing greedy geographic routing algorithms can successfully find short routing paths based on local states in sensing-covered networks. In particular, we derive theoretical upper bounds on the network dilation of sensing-covered networks under greedy geographic routing algorithms. Furthermore, we propose a new greedy geographic routing algorithm called Bounded Voronoi Greedy Forwarding (BVGF) that allows sensing-covered networks to achieve an asymptotic network dilation lower than 4:62 as long as the communication range is at least twice the sensing range. Our results show that simple greedy geographic routing is an effective routing scheme in many sensing-covered networks.