Routing In Multi-hop Networks Research Articles

A consensus-based approach to reputational routing in multi-hop networks

When it comes to the security of the Internet of Things (IoT), securing their communications is paramount. In multi-hop networks, nodes relay information amongst themselves, opening the data up to tampering by an intermediate device. To detect and avoid such malicious entities, we grant nodes the ability to analyse their neighbours behaviour. Through the use of consensus-based validation, based upon the blockchain's miners, all nodes can agree on the trustworthiness of all devices in the network. By expressing this through a node's reputation, it is possible to identify malicious devices and isolate them from network activities. By incorporating this metric into a multi-hop routing protocol such as AODV, we can influence the path selection process. Instead of defining the best route based upon overall length, we can choose the most reputable path available, thus traversing trustworthy devices. By performing extensive analyses through multiple simulated scenarios, we can identify a decrease in packet drop rates compared to AODV by approximately 48% and 38% when subjected to black hole attacks with 30 and 100 node networks respectively. Furthermore, by subjecting our system to varying degrees of grey holes, we can confirm its adaptability to different types of threats.

An Improved Routing Approach for Enhancing QoS Performance for D2D Communication in B5G Networks

Device-to-device (D2D) communication is one of the eminent promising technologies in Beyond Fifth Generation (B5G) wireless networks. It promises high data rates and ubiquitous coverage with low latency, energy, and spectral efficiency among peer-to-peer users. These advantages enable D2D communication to be fully realized in a multi-hop communication scenario. However, to ideally implement multi-hop D2D communication networks, the routing aspect should be thoroughly addressed since a multi-hop network can perform worse than a conventional mobile system if wrong routing decisions are made without proper mechanisms. Thus, routing in multi-hop networks needs to consider device mobility, battery, link quality, and fairness, which issues do not exist in orthodox cellular networking. Therefore, this paper proposed a mobility, battery, link quality, and contention window size-aware routing (MBLCR) approach to boost the overall network performance. In addition, a multicriteria decision-making (MCDM) method is applied to the relay devices for optimal path establishment, which provides weights according to the evaluated values of the devices. Extensive simulation results under various device speed scenarios show the advantages of the MBLCR compared to conventional algorithms in terms of throughput, packet delivery ratio, latency, and energy efficiency.

Self-organization scheme for balanced routing in large-scale multi-hop networks

We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated as an optimization problem in which the global objective function strikes a balance between route costs and node loads. We apply belief propagation (its min-sum version) to solve the network optimization problem and obtain a distributed algorithm whereby the nodes collectively discover globally optimal routes by performing low-complexity computations and exchanging messages with their neighbours. We prove that the proposed method converges to the global optimum after a finite number of local exchanges of messages. Finally, we demonstrate numerically our framework’s efficacy in balancing the node loads and study the trade-off between load reduction and total cost minimization.

Routing in Multi-Hop Cellular Device-to-Device (D2D) Networks: A Survey

In recent years, device-to-device (D2D) communication has attained significant attention in the research community. The advantages of D2D communication can be fully realized in multi-hop communication scenario. The integration of cellular and multi-hop networks not only provides guaranteed quality of service and reliability as a traditional cellular network, but also has the flexibility and adaptability as a multi-hop network. Routing in such multi-hop cellular D2D networks is a critical issue, since the multi-hop network can perform worse than a traditional cellular network if wrong routing decisions are made. This is because routing in these multi-hop networks needs to take care of the node mobility, dynamic network topology, and network fragmentation, which did not exist in traditional cellular networking. This paper provides a comprehensive survey of routing in multi-hop D2D networks. Some future research directions for the routing in D2D networks are also discussed at the end of this paper.

Energy Efficient Routing of Wireless Sensor Networks Using Virtual Backbone and life time Maximization of Nodes

Different approaches have been proposed based on routing in WSN (Wireless Sensor Nodes) for Energy Efficient routing in Multi hop Networks and some localized based on geographical routing schemes have been also proposed. The key concept in virtual backbone scheduling is to minimize the energy consumption and more throughputs. To achieve QOS and fault tolerance of these backbone nodes in Multi hop Networks requires stable links. Hence existing localized routing in virtual backbone scheduling cannot guarantee the energy efficient routes. In this paper we propose an energy efficient routing for Virtual Back Bone Nodes (VBS) in which it maximizes the node life and turns off it’s radio when they are in sleep mode, in order to consume less energy. A concept of Restricted Back Bone Neighborhood Routing is proposed, which assures the efficient routing with minimum energy consumption of nodes and also implemented the critical transmission radius for Backbone nodes.

Priority based Dynamic Packet Assignment for Multipath Routing in Multihop Networks

With the prevalence of wireless video applications, QoS of wireless video transmission in resource-limited wireless networks attract more and more researchers’ attention. In network layer, how to perform video packet assignment in multipath routing is a key issue. In this paper, we develop a simple but efficient, priority based dynamic assignment algorithm for multipath routing. The idea of this algorithm is to assign packet to a suitable path dynamically based on the priority of a video packet, quality difference between different paths and coding structure of the streaming video sequence. Simulation results show that our novel algorithm outperforms single path routing algorithm and other multipath routing algorithms significantly in packet receiving and average PSNR performance.

Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks

Opportunistic networking aims at exploiting sporadic radio links to improve the connectivity of multihop networks and to foster data transmissions. The broadcast nature of wireless channels is an important feature that can be exploited to improve transmissions by using several potential receivers. Opportunistic relaying is thus the first brick for opportunistic networking. However, the advantage of opportunistic relaying may be degraded due to energy increase related to having multiple active receivers. This paper proposes a thorough analysis of opportunistic relaying efficiency under different realistic radio channel conditions. The study is intended to find the best tradeoff between two objectives: energy and latency minimizations, with a hard reliability constraint. We derive an optimal bound, namely, the Pareto front of the related optimization problem, which offers a good insight into the benefits of opportunistic routings compared with classicalmultihop routing schemes. Meanwhile, the lower bound provides a framework to optimize the parameters at the physical layer, MAC layer, and routing layer from the viewpoint of cross layer during the design or planning phase of a network.

Auction in multi-path multi-hop routing

We model the multi-path multi-hop routing in networks with selfish nodes as an auction and provide a novel solution from the game-theoretical perspective. We design a mechanism that results in Nash equilibria rather than the traditional strategy proofness, which alleviates the over-payment problem of the widely used VCG mechanism. Through theoretical analysis, the proposed protocol is shown to be effective.