Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.

A new look at fault-tolerant network routing

Abstract: We model a communication network as a graph in which a processor is a node and a communication link is an edge. A routing for such a network is a fixed path, or route, between each pair of nodes. Given a network with a predefined routing, we study the effects of faulty components on the routing. Of particular interest is the number of routes along which a message must travel between any two non-faulty nodes. This problem is analyzed for specific families of graphs and for classes of routings. We also give some bounds for general versions of the problem. Finally, we conclude with one of the most important contributions of this paper, a list of interesting and apparently difficult open problems.

Secure cell relay routing protocol for sensor networks

Abstract: Past researches on sensor network routing have been focused on efficiency and effectiveness of data dissemination. Few of them consider security issues during the design time of routing protocols. Security is very important for many sensor network applications. Studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. In this paper, we propose an efficient key management scheme and a novel secure routing protocol—Secure cell relay (SCR) for sensor networks. We also present an effective key setup scheme for sensor nodes deployed in the later stage. We analyze the security of SCR under various attacks and show that SCR is very effective in defending against several sophisticated attacks, including selective forwarding, sinkhole, wormhole, Sybil, hello flooding, and clone attacks. SCR is an energy-efficient routing protocol with acceptable security overhead. Our simulations demonstrate that with all the security primitives, SCR still has lower energy consumption and higher delivery ratio than a popular routing protocol—directed diffusion. Copyright © 2006 John Wiley & Sons, Ltd.

Secure Routing for Mobile Ad hoc Networks

Abstract: Buttyan L.et al.found out a security flaw in Aridane and proposed a secure routing protocol,EndairA, which can resist attacks of active-1-1 according to ref[9].But unfortunately we discover an as yet unknown active-0-1 attack,"man-in-the-middle attack",which EndairA can't resist.So we propose a new secure routing protocol,En- dairALoc.Analysis shows that EndairALoc can not only inherit security of EndairA,but also resist"man-in-the-mid- dle attack"and even wormhole attack.Furthermore EndairALoc uses pairwise secret keys instead of public keys Endai- rA used,so compared with EndairA,EndairALoc can save more energy in the process of routing establishment.

A novel delay-oriented shortest path routing protocol for mobile ad hoc networks

Abstract: In wireless ad hoc mobile network, a host which desires to communicate with another host may need some intermediate nodes to relay data packets. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with minimum hops approach is often adapted. However, by considering employing the medium access control (MAC) protocol, the minimum transfer delay from source to destination may be achieved by choosing a longer path but with less contention delay. We propose an efficient delay-oriented routing protocol for mobile ad hoc wireless networks. The expected access contention delay of the IEEE 802.11 protocol is analyzed to support the routing decision. Simulation results show that the derived path length in the proposed delay-oriented routing protocol is slightly higher than that of the conventional shortest path with minimum hops approach but it can significantly reduce both the average transfer delay and packet loss rate.

Single Row Routing

Abstract: The automated design of multilayer printed circuit boards is of great importance in the physical design of complex electronic systems. Wire routing is a crucial step in the design process. In this paper, the single row routing problem is considered. First, we discuss the relevance of single row routing in the context of the general routing problem. Then, we show that relaxing the restriction that backward moves are not allowed can result in smaller street congestions when there are at least four tracks in each street. Next, we obtain an O((2k)!kn log k) algorithm to determine whether or not an instance involving n nodes can be laid out (without backward moves) when only k tracks per street are available. With the additional restriction that wires are not permitted to cross streets, an efficient (O(n2)) algorithm is obtained. This restricted problem is shown to be related to a furnace assignment problem.