Dynamic channel estimation-aware routing protocol in mobile cognitive radio networks for smart IIoT applications

Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue（HMQ） routing strategy and global forward-predicting hybrid minimum degree and queue（HMDQ） routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.

Cooperative Channel and Optimized Route Selection in Adhoc Network

Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.Due to its instability in usage and the fact that numerous nodes communicate data concur-rently,adequate channel and forwarder selection is essential.In this proposed design for a Cognitive Radio Cognitive Network(CRCN),we gain the confidence of each forwarding node by contacting one-hop and second level nodes,obtaining reports from them,and selecting the forwarder appropriately with the use of an optimization technique.At that point,we concentrate our efforts on their channel,selection,and lastly,the transmission of data packets via the designated forwarder.The simulation work is validated in this section using the MATLAB program.Additionally,steps show how the node acts as a confident forwarder and shares the channel in a compatible method to communicate,allowing for more packet bits to be transmitted by conveniently picking the channel between them.We cal-culate the confidence of the node at the start of the network by combining the reliability report for thefirst hop and the reliability report for the secondary hop.We then refer to the same node as the confident node in order to operate as a forwarder.As a result,we witness an increase in the leftover energy in the output.The percentage of data packets delivered has also increased.

Joint channel assignment and cross-layer routing protocol for multi-radio multi-channel Ad Hoc networks

To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.

LSTDA: Link Stability and Transmission Delay Aware Routing Mechanism for Flying Ad-Hoc Network (FANET)

The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face challenges in avoiding transmission loss and delay while ensuring stable communication.The proposed protocol introduces a novel link stability with network corridors priority node selection to check and ensure fair communication in the entire network.The protocol uses a Red-Black(R-B)tree to achieve maximum channel utilization and an advanced relay approach.The paper evaluates LSTDA in terms of End-to-End Delay(E2ED),Packet Delivery Ratio(PDR),Network Lifetime(NLT),and Transmission Loss(TL),and compares it with existing methods such as Link Stability Estimation-based Routing(LEPR),Distributed Priority Tree-based Routing(DPTR),and Delay and Link Stability Aware(DLSA)using MATLAB simulations.The results show that LSTDA outperforms the other protocols,with lower average delay,higher average PDR,longer average NLT,and comparable average TL.

Distributed Low-Complexity Channel Assignment for Opportunistic Routing

Opportunistic Routing (OR) involves multiple forwarding candidates to relay packets by taking advantage of the broadcast nature and multi-user diversity of a wireless medium. Compared with Traditional Routing (TR), OR is more suitable in the case of an unreliable wireless link and can evidently improve the end-to-end throughput of Wireless Mesh Networks (WMNs). In this paper, we focus on OR in Multi-Radio Multi-Channel WMNs (MRMC-WMNs). This problem has not been well examined and is considerably more challenging than the OR in single-radio wireless networks considered in the existing literature. First, we validate the advantage of OR in MRMC-WMNs. Second, we propose Low-complexity Channel Assignment for Opportunistic Routing (LcCAOR), which assigns channels to flows according to the interference state of every node. Third, we implement the LcCOAR in a fully distributed manner. The simulation result shows that compared with OR in Single-Radio Single-Channel WMNs (SRSC-WMNs), the proposed OR can significantly enhance the throughput to 87.11% and 100.3% in grid and tree WMNs, respectively.

A TRUST MECHANISM-BASED CHANNEL ASSIGNMENT AND ROUTING SCHEME IN COGNITIVE WIRELESS MESH NETWORKS WITH INTRUSION DETECTION

Cognitive Wireless Mesh Networks(CWMN) is a novel wireless network which combines the advantage of Cognitive Radio(CR) and wireless mesh networks.CWMN can realize seamless in-tegration of heterogeneous wireless networks and achieve better radio resource utilization.However,it is particularly vulnerable due to its features of open medium,dynamic spectrum,dynamic topology,and multi-top routing,etc..Being a dynamic positive security strategy,intrusion detection can provide powerful safeguard to CWMN.In this paper,we introduce trust mechanism into CWMN with intrusion detection and present a trust establishment model based on intrusion detection.Node trust degree and the trust degree of data transmission channels between nodes are defined and an algorithm of calcu-lating trust degree is given based on distributed detection of attack to networks.A channel assignment and routing scheme is proposed,in which selects the trusted nodes and allocates data channel with high trust degree for the transmission between neighbor nodes to establish a trusted route.Simulation re-sults indicate that the scheme can vary channel allocation and routing dynamically according to network security state so as to avoid suspect nodes and unsafe channels,and improve the packet safe delivery fraction effectively.

AN ALGORITHM FOR VLSI CHANNEL ROUTING USING NEURAL NETWORK

The algorithm for VLSI channel routing using Hopfield neural model is discussed inthis paper.The basic methods of mapping VLSI channel routing problem to Hopfield neural net-work,constructing energy function,setting initial neural status,and selecting various parametersare proposed.Finally,some experimental results are given.

A NEW AD HOC ROUTING ALGORITHM BASED ON MINIMIZING THE CHANNEL HANDOFF

How to improve the performance of the wireless Ad Hoc network by utilizing the spectrum resources efficiently has become a hot research topic in recent years. In this paper we propose a reactive routing algorithm that supports multiple channels to improve the performance of the Ad Hoc network based on the minimizing of the channel handoff. Our approach allocates the communication channel during the route discovery, and notifies the allocated channel information to the corresponding node in the route reply packets. Each node in the route tries its best to choose the same channel with the upstream node without interference. The simulation results show that our algorithm performs better than the K-hop distinct protocols in both average delays and network throughputs

A ROUTING PROTOCOL BASED ON INTERFERENCE-AWARE AND CHANNEL-LOAD IN MULTI-RADIO MULTI-CHANNEL AD HOC NETWORKS

Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency spectrum and can also reduce interference. In this paper, after analyzing several current protocols in Multi-Radio Multi-Channel (MR-MC) ad hoc networks, a new multi-channel routing metric called Integrative Route Metric (IRM) is designed. It takes channel load, inter-flow, and intra-flow interference into consideration. In addition, an MR-MC routing protocol based on Interference-Aware and Channel-Load (MR-IACL) is also presented. The MR-IACL can assign channels and routings for nodes according to channel load and interference degree of links, and optimize channel distribution dynamically to satisfy the features of topology changing and traffic frequent fluctuation during network running. The simulation results show that the new protocol outperforms others in terms of network throughput, end-to-end delay, routing overhead, and network lifetime.

Crosstalk and Wire Length Reduction in the Non-Manhattan Channel Routing

A novel framework for non-Manhattan channel routing considering crosstalk and wire length reduction is proposed. To handle crosstalk and wire length reduction problem, an improved non-Manhattan router in the gridded routing model is developed, and a novel rerouting algorithm based on segment-rerouting technique and layer reassignment is presented. Simulation exDeriments demonstrate that our algorithm achieves verv good results.

Distributed Contact Plan Design for Multi-Layer Satellite-Terrestrial Network

In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to configure lots of the potential contacts into contact plans. What's more, a huge contact plan makes the computing more complex, which further increases computing time. As a result, how to design an efficient contact plan becomes crucial for multi-layer satellite network, which usually has a large scaled topology. In this paper, we propose a distributed contact plan design scheme for multi-layer satellite network by dividing a large contact plan into several partial parts. Meanwhile, a duration based inter-layer contact selection algorithm is proposed to handle contacts disruption problem. The performance of the proposed design was evaluated on our Identifier/Locator split based satellite-terrestrial network testbed with 79 simulation nodes. Experiments showed that the proposed design is able to reduce the data delivery delay.

Analysis of dynamic wave model for flood routing in natural rivers

Flooding is a common natural disaster that causes enormous economic, social, and human losses. Of various flood routing methods, the dynamic wave model is one of the best approaches for the prediction of the characteristics of floods during their propagations in natural rivers because all of the terms of the momentum equation are considered in the model. However, no significant research has been conducted on how the model sensitivity affects the accuracy of the downstream hydrograph. In this study, a comprehensive analysis of the input parameters 9f the dynamic wave model was performed through field applications in natural rivers and routing experiments in artificial channels using the graphical multi-parametric sensitivity analysis （GMPSA）. The results indicate that the effects of input parameter errors on the output results are more significant in special situations, such as lower values of Manning＇s roughness coefficient and/or a steeper bed slope on the characteristics of a design hydrograph, larger values of the skewness factor and/or time to peak on the channel characteristics, larger values of Manning＇s roughness coefficient and/or the bed slope on the space step, and lower values of Manning＇s roughness coefficient and/or a steeper bed slope on the time step and weighting factor.

A New Approach to VC Routing in ATM Networks

A new ant-algorithm-based routing approach is proposed for the VC routing problem with considering the comprehensive effect between the resource utilization and the load balance in ATM networks. In the approach, the backup paths are calculated first, and then an ant algorithm based on the ability of ants to find the shortest path between their nest and the food source during their searching food, is constructed to optimize the VC global route. Simulation results show that the proposed approach can realize VC routing effectively according to the current traffic states in the networks and the user-specified delay requirements.

Application of Flood Routing Model for Flood Mitigation in Orashi River, South-East Nigeria

The study focused on the application of Flood Routing Models for Flood Mitigation in Orashi River, South-East Nigeria. Flood data were collected for the study area and subjected to statistical analysis. Three flood Routingmodels were comparatively applied including Muskingum model, Level Pool model and Modified Pul’s model. Assumed routing period of 2.3 hours which helped to check excessive flood at the downstream section of the river was used. Also a dimensionless weighting factor of 0.15 was also adopted. Muskingum model and Level Pool model which represent linear relationship between measured outflow and predicted outflow for specified inflow and time change of one hour gave high and positive values of coefficients of correlations of 0.9769 and 0.9732 respectively. The Modified Pul’s model which also represents a linear relationship between measured outflow and predicted outflow for specified inflow and a time change for one hour showed the highest coefficient of correlation of 0.9984 and lowest standard error of 0.1749. Though, flood models of the Muskingum method and Level Pool method exhibited good correlation, their prediction differed significantly with the corresponding models of original data sets because of high standard error and thus not adequate for field application in similar rivers. A design application was carried out using the Modified Pul’s model. The values obtained for routed storage capacity was 348 m3 while the designed capacity was 354 m3. It is recommended that dredging of the river is carried out to achieve the designed capacity. This would eliminate the risk of flooding. The results of the study will serve useful purposes in predicting flood events and design of flood control works in similar basins.

Cross-layer routing protocol design for high mobility multi-hop cognitive radio networks

In multi-hop cognitive radio networks （ CRNs）, the heterogeneous environment increases the complexity of common control channel （CCC） formation and routing protocol design. In this paper, we consider the on-demand routing protocol transmits over CCC. However, since CR transceivers （secondary users） have different available channel sets and it must vacate the licensed channel when a primary user arrives, forming a CCC becomes a main challenge in routing protocol design for CRNs. Our proposed CCC formation algorithm is based on a spectrum-tree structure, which consists of all cluster heads in CRNs. The cluster heads are with smaller moving range and lower mobility, and also act as a router in the whole network which maintains information of its cluster. Hence, a route is constituted in part by a set of cluster-head identity （ID） numbers, which represent the spe- cific cluster heads the path traverses, and in part by a set of member nodes ID numbers, which are included in the clusters containing the source and destination nodes. Due to high mobility and dynamic available spectrum, we define the stability parameters of path as two parts. One stability parameter is mobility factor, which represents the probability that a pairwise node can keep in communication range for the next flow transmission. The another stability parameter is spectrum opportunistic （SOP） factor, which represents the probability that a pairwise links can obtain the assigned spectrum band for the next flow transmission. Simulation results show that CCC formation algorithm produces a high probability of CCC formation, and the proposed routing protocol performs better than typical routing protocols.

High-efficiency calculation method for watershed rainfallrunoff routing using one-dimensional dynamic wave equations

Efficiency in solving the Saint-Venant equations for watershed rainfall-runoff routing is important in flood hydrology. This paper presents a high-efficiency numerical solution of one-dimensional dynamic wave equations(HEDWE) for watershed rainfall-runoff routing, in which the full momentum equation is written as a quadratic equation with only one unknown variable Q, water depth is derived from the continuity equation using the two-step predictorcorrector method, and the discrete scheme is the explicit upwind scheme. The results of numerical tests showed the HEDWE approach has several major advantages. 1) It is a stable numerical method, even for an initially dry area. 2) Its computational efficiency is higher than 4.76E+05 times/s. 3) It can be used for overland flow, river flow, and combinations thereof. The primary disadvantages of the HEDWE approach are its unsuitability for rapidly varying flow, such as dam-break floods.

抗战时期西北国际通道初探

西北国际通道是抗战时期经中国西北地区运输外国援华物资、援华人员和中国易货物资的重要国际通道,西北国际通道的开辟与运行对于中国抗日战争胜利发挥了极为重要的历史作用。学界对西北国际通道研究十分关注,现有研究对其基本概念如名称、路线、里程认识并不一致。文章依据通道地理位置及运输状况将其定名为西北国际通道;通过梳理抗战时期报纸、期刊、书籍等资料,分析得出通道有三条线路,公路线起自今哈萨克斯坦萨雷奥泽克车站,终于兰州,航空线为阿拉木图至兰州,驿运线为印度列城至中国新疆叶城;以修建维护通道的新疆公路局、西北公路局等机构资料为依据,考订西北国际通道公路线里程为2934公里。

局部降温对输水渠道水华抑制的影响分析

南水北调中线工程自通水以来,发挥着巨大的社会和经济效益,已成为京津地区的主力水源。中线工程输水的水质理化指标相对稳定,但局部渠段存在藻类异常增殖现象,有水华爆发的风险。针对出现的藻类异常增殖问题,在通冷风这一改变局部气象条件的工程措施基础上,建立了澎河—沙河渡槽段平面二维水动力和水质模型,研究了通风位置、通风温度和通风时长等因素对输水渠道水温和藻类的影响。研究表明:水温和叶绿素a浓度均与通风位置、通风温度和通风时长有关,通风温度越低、通风时长越长,平均水温和叶绿素a浓度下降幅度越大,平均水温最高可下降约2℃,叶绿素a浓度最大可降低约54.5%,且仅上游和全渠段通风均可有效降低水温和抑制藻类生长,仅下游通风对水温和藻类的影响较小。因此,采取局部降温的方式可以起到一定的降低叶绿素a浓度的作用,综合考虑藻类抑制效果和工程成本,在水华易爆发渠段的上游通冷风是行之有效的工程措施。

基于动态平衡布局的输电网潮流图自动生成方法

为解决输电网潮流图自动生成中厂站布局与线路布线问题,提出基于动态平衡布局的输电网潮流图自动生成方法。针对厂站布局,首先,在力导向算法的基础上引入基于图纸中心点的惩罚函数,以解决力导向算法布局不均匀的问题,提高布局的均布度;然后,利用厂站分布率参数控制算法平衡次数,引导厂站向图纸边界运动,解决布局自动适应给定图幅大小的问题;最后,通过位置映射变换将围绕图纸中心点的椭圆分布转换为矩形分布,解决引入惩罚函数布局均匀但不符合传统输电网潮流图绘制习惯的问题。针对线路布线提出以构建通道树为中心的布线方法,有效降低布线交点个数,提升布线效果。所提布局与布线算法在实际工程应用中取得了良好的效果,通过案例验证了输电网潮流图自动生成的正确性和有效性。