• Title/Summary/Keyword: one-hop path recovery

Search Result 2, Processing Time 0.017 seconds

Resilient Routing Overlay Network Construction with Super-Relay Nodes

  • Tian, Shengwen;Liao, Jianxin;Li, Tonghong;Wang, Jingyu;Cui, Guanghai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1911-1930
    • /
    • 2017
  • Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

Efficient Energy and Position Aware Routing Protocol for Wireless Sensor Networks

  • Shivalingagowda, Chaya;Jayasree, P.V.Y;Sah, Dinesh.K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1929-1950
    • /
    • 2020
  • Reliable and secure data transmission in the application environment assisted by the wireless sensor network is one of the major challenges. Problem like blind forwarding and data inaccessibility affect the efficiency of overall infrastructure performance. This paper proposes routing protocol for forwarding and error recovery during packet loss. The same is achieved by energy and hops distance-based formulation of the routing mechanism. The reachability of the intermediate node to the source node is the major factor that helps in improving the lifetime of the network. On the other hand, intelligent hop selection increases the reliability over continuous data transmission. The number of hop count is factor of hop weight and available energy of the node. The comparison over the previous state of the art using QualNet-7.4 network simulator shows the effectiveness of proposed work in terms of overall energy conservation of network and reliable data delivery. The simulation results also show the elimination of blind forwarding and data inaccessibility.