Hop-count Constraint Research Articles

SMA: SRv6-Based Multidomain Integrated Architecture for Industrial Internet

With the increasing requirements of industrial production efficiency, the Industrial Internet has played a very important role in the fourth industrial revolution. However, the current Industrial Internet still has many drawbacks, especially in terms of network systems, such as low network expansion, inconvenient troubleshooting, and low data transmission efficiency. For this motivation, a novel SRv6-based multidomain integrated architecture (SMA) for the Industrial Internet has been proposed. Multilayer controllers are deployed in the SMA, and a software-defined network controller that generates the transmission path is replaced by SMA nodes, which realizes the high network scalability and efficient data transmission of the Industrial Internet. The faulty node in the SMA can be quickly and accurately identified through the periodic detection actively sent by the controller node in the domain and the passive feedback of the SMA nodes, and the generated SMA node trusted set (SNTS) can be used for forwarding path generation. A Bellman–Ford algorithm with a hop count constraint based on the total number of SNTS nodes is proposed, which effectively avoids long-path forwarding and improves network resource utilization. Through theoretical analysis, the safety and scalability of the SMA have been fully verified. The simulation results of the SMA on the experimental platform show that the SMA is superior to the existing Industrial Internet network structure in terms of troubleshooting efficiency of faulty nodes, network throughput, and data communication overhead. In the Industrial Internet, when the proportion of SMA nodes reaches 30%, the SMA controller can control nearly 80% of the traffic. In addition, the maximum link utilization rate will be greatly reduced, which means better adjustment of network load balance.

Hop-Limit Path Mapping Algorithm for Virtual Network Embedding

Virtual network (VN) mapping which deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realizing network virtualization. While a variety of state-of-the-art algorithms have attempted to address this issue from different aspects, the challenge still remains for mapping virtual link with hop count constraint. This paper presents a fast approximation path mapping algorithm to address this issue by formulating such virtual link mapping problem as a path-flow mathematical programming model, which aims to minimize the maximum link load factor. Through the use of the primal–dual method, a fully polynomial time approximation algorithm is proposed to solve this model. The experimental results show that the proposed algorithm can effectively solve the problem of path mapping with hop limit.

Minimum Power Architecture of Relay-Based Network with Bandwidth and Hop-Count Constraints

Energy bills are on the rise and with the recent attention to saving the global environment. Saving energy (minimizing energy consumption) is becoming a standard issue for all industrial and commercial applications. Moreover, provisioning of quality of service (QoS) for multimedia traffic in wireless networks is complicated due to user mobility and limited wireless resources. Bandwidth (throughput) and hop count and are the important parameters in QoS requirements. In this article, a novel QoS constrained minimum power cellular ad hoc augmented network (QCMP CAHAN) architecture is proposed for next generation wireless networks. The QCMP CAHAN architecture is proposed to find the optimal minimum power route under bandwidth and hop-count constraints (QoS constraints). The QCMP CAHAN has a hybrid architecture, in which each mobile terminal (MT) of CDMA cellular networks has ad hoc communication capability. The QCMP CAHAN is an evolutionary approach to traditional cellular networks. We show that the total energy consumed by the MTs is lower in the case of QCMP CAHAN than in the case of traditional cellular networks. As the ad hoc communication range of each MT increases, the total transmitted energy in QCMP CAHAN decreases. However, due to the increased number of hops involved in information delivery between source and destination, the end-to-end delay increases. The maximum end-to-end hop count will be limited to a specified tolerable value, and QCMP CAHAN has ability to adapt to various hop-count constraints for different services. A MT in QCMP CAHAN will not relay any message when its ad hoc communication range is zero, and if this is the case for all MTs, then QCMP CAHAN reduces to the traditional cellular networks. Moreover, the bandwidth constrained problem in QCMP CAHAN is described as a nonlinear programming problem to minimize the total power consumption. We solved the bandwidth constrained problem in QCMP CAHAN by allocating optimum traffic rates on different routes between source and destination.

Flexible architecture of relay-based wireless network for network lifetime extension with hop-count constraint

In relay-based wireless networks, messages need to be forwarded via intermediate relay mobile terminals (MTs). However, because of various transmission distances and unbalanced traffic load, some relay MTs may tend to drain their batteries faster than others. After a certain number of MTs deplete their battery energy, the peer-to-peer communication may become disconnected. Depletion of the battery energy of any relay MT will degrade the performance of the relay-based wireless networks. The network lifetime is defined as the time at which an MT runs out of its battery energy for the first time within the entire network. Moreover, with commercial development of cellular systems proceeding, the research community turns its attention to the next generation systems. It is clear that next generation wireless networks will be heterogeneous wireless networks with a hierarchical overlay of networks of potentially different technologies. However, maintaining quality of service (QoS) in the heterogeneous environments of the future turns out to be a challenging task. In this article, a novel QoS constrained network lifetime extension cellular ad hoc augmented network (QCLE CAHAN) architecture is proposed for next generation wireless networks. The QCLE CAHAN architecture is proposed to achieve the maximum network lifetime under the end-to-end hop-count constraint (QoS constraint). QCLE CAHAN has a hybrid architecture, in which each MT of CDMA cellular networks has ad hoc communication capability. QCLE CAHAN is an evolutionary approach to traditional cellular networks. QCLE CAHAN can dynamically balance battery energy across MTs and extend the network lifetime. QCLE CAHAN can regulate the number of hops between the base station and the MT to adapt to the end-to-end QoS requirements for different services. We show that the network lifetime is much higher in the case of QCLE CAHAN than in the case of traditional cellular networks.

QoS Aware Power and Hop Count Constraints Routing Protocol with Mobility Prediction for MANET Using SHORT

A mobile ad hoc network (MANET) is composed of mobile nodes, which do not have any fixed wired communication infrastructure. This paper proposes a protocol called “Delay, Jitter, Bandwidth, Cost, Power and Hop count Constraints Routing Protocol with Mobility Prediction for Mobile Ad hoc Network using Self Healing and Optimizing Routing Technique (QPHMP-SHORT)”. It is a multiple constraints routing protocol with self healing technique for route discovery to select a best routing path among multiple paths between a source and a destination as to increase packet delivery ratio, reliability and efficiency of mobile communication. QPHMP-SHORT considers the cost incurred in channel acquisition and the incremental cost proportional to the size of the packet. It collects the residual battery power of each node for each path; selects multiple paths, which have nodes with good battery power for transmission to satisfy the power constraint. QPHMP-SHORT uses Self-Healing and Optimizing Routing Technique (SHORT) to select a shortest best path among multiple selected paths by applying hops count constraint. It also uses the mobility prediction formula to find the stability of a link between two nodes.

Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing

The minimum-energy multicast tree problem aims to construct a multicast tree rooted at the source node and spanning all the destination nodes such that the sum of transmission power at non-leaf nodes is minimized. However, aggressive power assignment at non-leaf nodes, although conserving more energy, results in multicast trees that suffer from higher hop count and jeopardizes delay-sensitive applications, signifying a clear tradeoff between energy efficiency and delay. This article formulates these issues as a constrained Steiner tree problem, and describes a distributed constrained Steiner tree algorithm, which jointly conserves energy and bounds delay for multicast routing in ad hoc networks. In particular, the proposed algorithm concurrently constructs a constrained Steiner tree, performs transmission power assignment at non-leaf nodes, and strives to minimize the sum of transmission power of non-leaf nodes, subject to the given maximum hop count constraint. Simulation results validate the effectiveness and reveal the characteristics of the proposed algorithm.

Connectivity, Power, and Energy in a Multihop Cellular-Packet System

In this paper, we study a large network of subscriber stations (SSs) with certain common wireless capabilities and base stations (BSs) having direct connections to the wired infrastructure in addition to common wireless capabilities. SSs can communicate with the outside world only through the BSs. Connections to SSs without a direct (i.e., a single hop) wireless connection to any BS are established, if possible, through other SSs serving as wireless repeaters. The locations of the SSs and the BSs follow independent homogeneous planar Poisson processes. The propagation channels exhibit signal attenuation with distance and log-normal shadowing. We evaluate exactly the probability of an SS to have a direct wireless connection to any of the BSs and a lower bound on the t-hop (t arbitrary) outage probability of an SS. We then define the minimal hop-count routing algorithm and calculate the mean number of hops for routes connecting SSs to BSs, when a maximum hop-count constraint is imposed. We compute next the probability distribution of the transmit power under the assumption of perfect power control. We conclude by calculating a bound for the total mean transmit energy required to transfer a data packet from an SS to a BS over a minimal hop-count route and show that this energy is significantly lower than the corresponding value in a single-hop network operating at the same outage probability

A hub-spoke air cargo network design model with hop-count constraint

A hub-spoke air cargo network design model with hop-count constraint