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.

Backtracking Routing Mechanism for Improving Link Failure Recovery

Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail, but multiple failure links may bring routing loop for the mechanism. Backtracking routing algorithm based on inverse shortest path tree rooted at destination is presented. The feasible restoration routing is obtained through searching from the start of the failure link and tracing back to the leaves of the shortest path tree with the destination as the root. The packets are forwarded from the mounted point with smaller sequence to the mount point with bigger sequence to decrease the possible of loop in case of multi-failures. The simulations and analysis indicate that backtracking routing algorithm improves the network survivability especially for large network, at the cost of the computation complexity in the same order as failure insensitive routing.

Optimized transmission coordination mechanisms for opportunistic routing

The successful rate of transmission coordination of opportunistic routing （OK） is analyzea systematically, and then two efficient transmission coordination mechanisms （TCMs） are proposed for OR： a batch sliding window-based TCM and a bit map-based TCM, to reduce the total number of packet transmissions and improve end-to-end throughput for OR. The batch sliding window-based TCM avoids the oscillation of the successful rate of transmission coordination by transmitting packets in continuous batch mode so as to improve the average successful rate of transmission coordination efficiently, while the bit map-based TCM improves end-to-end throughput of OR by reducing the overhead of transmission coordination. Exhaustive simulations show that the average end-to-end throughput gains of the two proposed TCMs are 15.4% and 6.4% over the batch map-based TCM, respectively.

Enhanced Security with Improved Defensive Routing Mechanism in Wireless Sensor Networks

In recent scenario of Wireless Sensor Networks(WSNs),there are many application developed for handling sensitive and private data such as military information,surveillance data,tracking,etc.Hence,the sensor nodes of WSNs are distributed in an intimidating region,which is non-rigid to attacks.The recent research domains of WSN deal with models to handle the WSN communications against malicious attacks and threats.In traditional models,the solution has been made for defending the networks,only to specific attacks.However,in real-time applications,the kind of attack that is launched by the adversary is not known.Additionally,on developing a security mechanism for WSN,the resource constraints of sensor nodes are also to be considered.With that note,this paper presents an Enhanced Security Model with Improved Defensive Routing Mechanism(IDRM)for defending the sensor network from various attacks.Moreover,for efficient model design,the work includes the part of feature evaluation of some general attacks of WSNs.The IDRM also includes determination of optimal secure paths and Node security for secure routing operations.The performance of the proposed model is evaluated with respect to several factors;it is found that the model has achieved better security levels and is efficient than other existing models in WSN communications.It is proven that the proposed IDRM produces 74%of PDR in average and a minimized packet drop of 38%when comparing with the existing works.

Considerations on Novel Network Routing Mechanism

Routing is the cornerstone of network architecture, and a new routing mechanism is a requisite for constructing new network architecture. The current routing mechanism of the Internet layer is basically the single next-hop routing mechanism, which is the root of transmission congestion in the network. To solve this congestion problem, a fundamental measure is to change the route selection mode of current routing mechanism to allow parallel transmission over multiple routes. Currently, Border Gateway Protocol (BGP) is the only inter-domain routing protocol used in the Internet, but the routing system using BGP suffers scalability problem. To solve the scalability issue of the current inter-domain routing system, a new hierarchical routing system, i.e. Scalable Inter-Domain Routing Architecture (s-idra), is suggested. In addition to scalability, the current routing system is facing other challenges including security, Quality of Service (QoS), multicasting, mobility and dynamic network topology. Therefore, the research on routing protocols, especially the protocol for the new network architecture, is still a tough task and has a long way to go.

QMCR:A Q-Learning-Based Multi-Hop Cooperative Routing Protocol for Underwater Acoustic Sensor Networks

Routing plays a critical role in data transmission for underwater acoustic sensor networks(UWSNs)in the internet of underwater things(IoUT).Traditional routing methods suffer from high end-toend delay,limited bandwidth,and high energy consumption.With the development of artificial intelligence and machine learning algorithms,many researchers apply these new methods to improve the quality of routing.In this paper,we propose a Qlearning-based multi-hop cooperative routing protocol(QMCR)for UWSNs.Our protocol can automatically choose nodes with the maximum Q-value as forwarders based on distance information.Moreover,we combine cooperative communications with Q-learning algorithm to reduce network energy consumption and improve communication efficiency.Experimental results show that the running time of the QMCR is less than one-tenth of that of the artificial fish-swarm algorithm(AFSA),while the routing energy consumption is kept at the same level.Due to the extremely fast speed of the algorithm,the QMCR is a promising method of routing design for UWSNs,especially for the case that it suffers from the extreme dynamic underwater acoustic channels in the real ocean environment.

Practical network coding-aware routing protocol for multi-hop wireless networks

Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.

Load balancing strategy of heterogeneous wireless networks based on multi-hop routing algorithm of ad hoc network

Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.

MILITARY MULTI-HOP ROUTING PROTOCOL

Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant. In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept tbr reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.

(EERSM): Energy-Efficient Multi-Hop Routing Technique in Wireless Sensor Networks Based on Combination between Stationary and Mobile Nodes

In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve its impact is the energy constraint since sensor nodes have small battery, small memory and less data processing with low computational capabilities. However, many researches efforts have focused on how to prolong the battery lifetime of sensor nodes by proposing different routing, MAC, localization, data aggregation, topology construction techniques. In this paper, we will focus on routing techniques which aim to prolonging the network lifetime. Hence, we propose an Energy-Efficient Routing technique in WSNs based on Stationary and Mobile nodes (EERSM). Sensing filed is divided into intersected circles which contain Mobile Nodes (MN). The proposed data aggregation technique via the circular topology will eliminate the redundant data to be sent to the Base Station (BS). MN in each circle will rout packets for their source nodes, and move to the intersected area where another MN is waiting (sleep mode) to receive the transmitted packet, and then the packet will be delivered to the next intersected area until the packet is arrived to the BS. Our proposed EERSM technique is simulated using MATLAB and compared with conventional multi-hop techniques under different network models and scenarios. In the simulation, we will show how the proposed EERSM technique overcomes many routing protocols in terms of the number of hops counted when sending packets from a source node to the destination (i.e. BS), the average residual energy, number of sent packets to the BS, and the number of a live sensor nodes verse the simulation rounds.

Microstructure evolution and mechanical properties of ZK60 magnesium alloy produced by SSTT and RAP route in semi-solid state

The microstructure evolution and mechanical properties of a ZK60 magnesium alloy produced by the semi-solid thermal transformation （SSTT） route and the recrystallization and partial melting （RAP） route were studied, respectively. The microstructure evolution during partial remelting was studied at different temperatures for different time. The tensile mechanical properties of thixoformed components by the two routes at room temperature were examined. The results show that coalescence is dominant in the SSTT alloy and Ostwald ripening is dominant in the RAP alloy. Compared with the SSTT route, the RAP route can produce finer semi-solid microstructure under the similar isothermal holding condition. The microstructure of the RAP alloy is much more spheroidized compared with the SSTT alloy. Thixoforming for the ZK60 magnesium alloy produced by the SSTT and RAP route results in successful filling of the die, and the thixoforming process improves the mechanical properties of ZK60 magnesium alloy. The RAP alloy shows significantly advantageous mechanical properties over that of the SSTT alloy.

Influence of rolling route on microstructure and mechanical properties of AZ31 magnesium alloy during asymmetric reduction rolling

Four different routes of asymmetric reduction rolling were conducted on AZ31 magnesium alloy to investigate their effect on the microstructure evolution and mechanical properties. Route A is the forward rolling; while during routes B and C the sheets are rotated 180o in rolling direction and normal direction, respectively; route D is the unidirectional rolling. The strain states of rolled sheets were analyzed by the finite element method, while the microstructure and texture were observed using optical microscopy, X-ray diffraction and electron back-scattered diffraction techniques, and the mechanical properties were measured by tensile test. The results show that route D produced the largest effective strain. Compared with other samples, sample D exhibited a homogeneous microstructure with fine grains as well as a weak and tilted texture, in corresponding, it performed excellent tensile properties, which suggested that route D was an effective way to enhance the strength and plasticity of AZ31 sheet.

Scalable and Identifier/Locator-Splitting Routing Protocol for Mobile Ad Hoc Networks

In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：

A Novel Distributed LDoS Attack Scheme against Internet Routing

LDoS （Low-rate Denial of Service） attack, exploiting the flaws in the congestion avoidance mechanism of TCP protocol,is periodic, stealthy, and with high efficiency. Since BGP uses TCP as a transport protocol, it is subject to LDoS attacks as well. LDoS attacks can cause table reset, route flapping of BGP protocol. A deliberately constructed distributed low-rate DOS attacks can even generate surge of updates throughout the Internet. In this paper, we investigate the promotion of attack efficiency of this novel attack, and then propose an attack model to simulate the LDoS attack. Experiments prove that this attack model can exponentially lower the attack costs and improve the attack effect.

Geological conditions and key rock mechanics issues in the Western Route of South-to-North Water Transfer Project

In terms of special geological conditions of the Western Route of South-to-North Water Transfer Project, the classification method for surrounding rocks is discussed by combining with the construction method of tunnel boring machine （TBM）. The classification standard of surrounding rocks is put forward on the basis of physical simulations and engineering practices. Damage, deformation and evolution of surrounding rocks induced by TBM excavation are discussed. Meanwhile, the long-term deformation mechanisms and stability of surrounding rocks are also studied. On this basis, a three-dimensional constitutive model for interbedded sandstone slate and a fiat shell-joint element-foundation system for calculating internal forces of segment lining are established. The deformation features of surrounding rocks of deep and steep interbedded sandstone slate and their influences on internal forces of segment lining are presented. Finally, the design methods of segment lining constructed in deep and steep flysch are proposed.

Energy Efficient Constrained Shortest Path First-Based Joint Resource Allocation and Route Selection for Multi-Hop CRNs

Cognitive radio networks(CRNs) are expected to improve spectrum utilization efficiently by allowing secondary users(SUs) to opportunistically access the licensed spectrum of primary users(PUs).In CRNs,source and destination SUs may achieve information interaction in an ad hoc manner.In the case that no direct transmission link between the SU transmission pairs is available,multi-hop relay SUs can be applied to forward information for the source and destination SUs,resulting in multi-hop CRNs.In this paper,we consider a multi-hop CRN consisting of multiple PUs,SU transmission pairs and relay SUs.Stressing the importance of transmission hops and the tradeoff between data rate and power consumption,we propose an energy efficient constrained shortest path first(CSPF)-based joint resource allocation and route selection algorithm,which consists of two sub-algorithms,i.e.,CSPF-based route selection sub-algorithm and energy efficient resource allocation sub-algorithm.More specifically,we first apply CSPF-based route selection sub-algorithm to obtain the shortest candidate routes(SCRs) between the SU pair under the transmission constraints.Then,an energy efficient resource allocation problem of the SCRs is formulated and solved by applying iterative algorithm and Lagrange dual method.Simu-lation results demonstrate the effectiveness of the proposed algorithm.

Detection of Insider Selective Forwarding Attack Based on Monitor Node and Trust Mechanism in WSN

The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.

Mechanism of Thaumasite Formation in Concrete

Significant efforts have been made in revealing the mechanism of thaumasite formation in concrete, which continues to be fraught with ambiguities and dissension. Chemical method was employed to synthesize pure C3S, C2S, C3A, ettringite, and thaumasite, and X-ray diffraction（XRD）, Raman spectroscopy and infrared spectroscopy（IR） were used to identify thaumasite from other hydrates. To investigate the direct route of thaumasite formation, C3S, C2S, gypsum, and calcium carbonate were used to prepare a cement paste so that the interference of ettringite formation can be avoided. The indirect route of thaumasite formation was also studied by considering the effect of C3A or ettringite content on thaumasite formation. Results show that thaumasite can be definitely generated in the absence of aluminium-bearing minerals or ettringite under appropriate conditions, while the ettringite presence promotes the thaumasite formation. No evidences support the heterogeneous nucleation route in this work. It is concluded that the method mentioned in this work can surely be used to investigate the mechanism of thaumasite formation, and thaumasite can form by both direct and woodfordite routes.

A Survey on Routing Algorithms for Opportunistic Mobile Social Networks

Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.

Packet Drop Battling Mechanism for Energy Aware Detection in Wireless Networks

Network security and energy consumption are deemed to be two important components of wireless and mobile ad hoc networks(WMANets).There are various routing attacks which harm Ad Hoc networks.This is because of the unsecure wireless communication,resource constrained capabilities and dynamic topology.In order to cope with these issues,Ad Hoc On-Demand Distance Vector(AODV)routing protocol can be used to remain the normal networks functionality and to adjust data transmission by defending the networks against black hole attacks.The proposed system,in this work,identifies the optimal route from sender to collector,prioritizing the number of jumps,the battery life,and security,which are fundamental prerequisites.Researches have proposed various plans for detecting the shortest route,as well as ensuring energy conversions and defense against threats and attacks.In this regard,the packet drop attack is one of the most destructive attack against WMANet communication and hence merits special attention.This type of attack may allow the attacker to take control of the attacked hubs,which may lost packets or transmitted information via a wrong route during the packets journey from a source hub to a target one.Hence,a new routing protocol method has been proposed in this study.It applies the concept of energy saving systems to conserve energy that is not required by the system.The proposed method for energy aware detection and prevention of packet drop attacks in mobile ad hoc networks is termed the Ad Hoc On-Demand and Distance Vector–Packet Drop Battling Mechanism(AODV–PDBM).