EECLP: AWireless Sensor Networks Energy Efficient Cross-Layer Protocol

Recent advancements in wireless communications have allowed the birth of novel wireless sensor networks(WSN).A sensor network comprises several micro-sensors deployed randomly in an area of interest.A micro-sensor is provided with an energy resource to supply electricity to all of its components.However,the disposed energy resource is limited and battery replacement is generally infeasible.With this restriction,the sensors must conserve energy to prolong their lifetime.Various energy conservation strategies for WSNs have been presented in the literature,from the application to the physical layer.Most of these solutions focus only on optimizing a single layer in terms of energy consumption.In this research,a novel cross-layer technique for WSNs’effective energy usage is presented.Because most energy consumption factors exist in the Medium Access Control(MAC)layer and network layer,our EECLP protocol(Energy Efficient Cross-Layer Protocol for Wireless Sensor Networks)integrates these two layers to satisfy energy efficiency criteria.To gain access to the transmission channel,we implement a communication regime at the MAC layer based on CSMA/CA(Carrier Sense Multiple Access/Collision Avoidance)techniques.Next,depending on the activity and a standby period,we employ the RTS/CTS(Request to Send/Clear to Send)method to prevent collisions and resolve hidden node concerns by utilizing the network allocation vector(NAV)to calculate the transmission duration.Employing a greedy strategy,we establish chains amongst cluster members to mitigate the issue of high energy consumption in routing data.An objective function was utilized to determine the optimal cross-chain path based on the distances to the base station(BS)and residual energy(RE).The simulation,testing,and comparison of the proposed protocol to peer protocols have shown superior outcomes and a prolonged network lifespan.Using the suggested protocol,the network lifetime increases by 10%compared to FAMACO(Fuzzy and Ant Colony Optimization based MAC/Routing Cross-layer)protocol,and it increases by 90%and 95%compared to IFUC(Improved Fuzzy Unequal Clustering)and UHEED(Unequal Hybrid Energy Efficient and Distributed)protocols successively.

Cascading Delays for the High-Speed Rail Network Under Different Emergencies:A Double Layer Network Approach

High-speed rail(HSR) has formed a networked operational scale in China. Any internal or external disturbance may deviate trains’ operation from the planned schedules, resulting in primary delays or even cascading delays on a network scale. Studying the delay propagation mechanism could help to improve the timetable resilience in the planning stage and realize cooperative rescheduling for dispatchers. To quickly and effectively predict the spatial-temporal range of cascading delays, this paper proposes a max-plus algebra based delay propagation model considering trains’ operation strategy and the systems’ constraints. A double-layer network based breadth-first search algorithm based on the constraint network and the timetable network is further proposed to solve the delay propagation process for different kinds of emergencies. The proposed model could deal with the delay propagation problem when emergencies occur in sections or stations and is suitable for static emergencies and dynamic emergencies. Case studies show that the proposed algorithm can significantly improve the computational efficiency of the large-scale HSR network. Moreover, the real operational data of China HSR is adopted to verify the proposed model, and the results show that the cascading delays can be timely and accurately inferred, and the delay propagation characteristics under three kinds of emergencies are unfolded.

Exploring the Multi-Layer Structural Properties of the Bus-Subway Transportation Network of Shanghai

Buses and subways are essential to urban public transportation systems and an important engine for activating high-quality urban development. Traditional multi-modal transportation networks focus on the structural feature mining of single-layer networks or each layer, ignoring the structural association of multi-layer networks. In this paper, we examined the multi-layer structural property of the bus-subway network of Shanghai at both global and nodal scales. A dual-layer model of the city’s bus and subway system was built. Single-layer complex network indicators were also extended. The paper also explored the spatial coupling properties of the city’s bus and subway system and identified its primary traffic nodes. It was found that 1) the dual-layer network increased the network’s connectivity to a certain extent and broke through the spatial limitation in terms of physical structure, making the connection between any two locations more direct. 2) The dual-layer network changed the topological characteristics of the transit network, increasing the centrality value and bit order in degree centrality, betweenness centrality, and closeness centrality to different degrees, and making each centrality tend to converge to the city center in spatial distribution. Enhancing the management of critical network nodes would help the integrated public transportation system operate more effectively and provide higher-quality services.

Application of Convolutional Neural Networks in Classification of GBM for Enhanced Prognosis

The lethal brain tumor “Glioblastoma” has the propensity to grow over time. To improve patient outcomes, it is essential to classify GBM accurately and promptly in order to provide a focused and individualized treatment plan. Despite this, deep learning methods, particularly Convolutional Neural Networks (CNNs), have demonstrated a high level of accuracy in a myriad of medical image analysis applications as a result of recent technical breakthroughs. The overall aim of the research is to investigate how CNNs can be used to classify GBMs using data from medical imaging, to improve prognosis precision and effectiveness. This research study will demonstrate a suggested methodology that makes use of the CNN architecture and is trained using a database of MRI pictures with this tumor. The constructed model will be assessed based on its overall performance. Extensive experiments and comparisons with conventional machine learning techniques and existing classification methods will also be made. It will be crucial to emphasize the possibility of early and accurate prediction in a clinical workflow because it can have a big impact on treatment planning and patient outcomes. The paramount objective is to not only address the classification challenge but also to outline a clear pathway towards enhancing prognosis precision and treatment effectiveness.

Research on Physical Layer Security in Cognitive Wireless Networks with Multiple Eavesdroppers Based on Resource Allocation Algorithm

With the rapid development of the Internet of Things (IoT), non-Orthogonal Multiple Access (NOMA) technology and cognitive wireless network are two promising technologies to improve the spectral efficiency of the system, which have been widely concerned in the field of wireless communication. However, due to the importance of ownership and privacy protection, the IoT system must provide corresponding security mechanisms. From the perspective of improving the transmission security of CR-NOMA system based on cognitive wireless network, and considering the shortcomings of traditional relay cooperative NOMA system, this paper mainly analyzes the eavesdropping channel model of multi-user CR-NOMA system and derives the expressions of system security and rate to improve the security performance of CR-NOMA system. The basic idea of DC planning algorithm and the scheme of sub-carrier power allocation to improve the transmission security of the system were introduced. An algorithm for DC-CR-NOMA was proposed to maximize the SSR of the system and minimize the energy loss. The simulation results show that under the same complexity, the security and speed of the system can be greatly improved compared with the traditional scheme.

A Tractable Approach to Analyzing the Physical-Layer Security in K-Tier Heterogeneous Cellular Networks

This study proposes a tractable approach to analyze the physical-layer security in the downlink of a multi-tier heterogeneous cellular network. This method is based on stochastic geometry, has low computational complexity, and uses the two-dimensional Poisson point process to model the locations of K-tier base stations and receivers, including those of legitimate users and eavesdroppers. Then, the achievable secrecy rates for an arbitrary user are determined and the upper and lower bounds of secrecy coverage probability derived on the condition that cross-tier interference is the main contributor to aggregate interference. Finally, our analysis results reveal the innate connections between information-theoretic security and the spatial densities of legitimate and malicious nodes.

A Physical Layer Network Coding Based Tag Anti-Collision Algorithm for RFID System

In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.

Cooperative Jamming for Physical Layer Security in Hybrid Satellite Terrestrial Relay Networks

To integrate the satellite communications with the LTE/5G services, the concept of Hybrid Satellite Terrestrial Relay Networks(HSTRNs) has been proposed. In this paper, we investigate the secure transmission in a HSTRN where the eavesdropper can wiretap the transmitted messages from both the satellite and the intermediate relays. To effectively protect the message from wiretapping in these two phases, we consider cooperative jamming by the relays, where the jamming signals are optimized to maximize the secrecy rate under the total power constraint of relays. In the first phase, the Maximal Ratio Transmission(MRT) scheme is used to maximize the secrecy rate, while in the second phase, by interpolating between the sub-optimal MRT scheme and the null-space projection scheme, the optimal scheme can be obtained via an efficient one-dimensional searching method. Simulation results show that when the number of cooperative relays is small, the performance of the optimal scheme significantly outperforms that of MRT and null-space projection scheme. When the number of relays increases, the performance of the null-space projection approaches that of the optimal one.

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.

STUDY ON STRATEGY OF DYNAMIC JOINT ROUTING AND RESOURCE ALLOCATION IN LAYERED OPTICAL TRANSPORT NETWORKS

A layered network model for optical transport networks is proposed in this paper,which involves Internet Protocol(IP) ,Synchronous Digital Hierarchy(SDH) and Wavelength Division Mul-tiplexing(WDM) layers. The strategy of Dynamic Joint Routing and Resource Allocation(DJRRA) and its algorithm description are also presented for the proposed layered network model. DJRRA op-timizes the bandwidth usage of interface links between different layers and the logic links inside all layers. The simulation results show that DJRRA can reduce the blocking probability and increase network throughput effectively,which is in contrast to the classical separate sequential routing and resource allocation solutions.

Laplacian energy maximizationfor multi-layer air transportation networks

To increase airspace capacity, alleviate flight delay,and improve network robustness, an optimization method of multi-layer air transportation networks is put forward based on Laplacian energy maximization. The effectiveness of taking Laplacian energy as a measure of network robustness is validated through numerical experiments. The flight routes addition optimization model is proposed with the principle of maximizing Laplacian energy. Three methods including the depth-first search( DFS) algorithm, greedy algorithm and Monte-Carlo tree search( MCTS) algorithm are applied to solve the proposed problem. The trade-off between system performance and computational efficiency is compared through simulation experiments. Finally, a case study on Chinese airport network( CAN) is conducted using the proposed model. Through encapsulating it into multi-layer infrastructure via k-core decomposition algorithm, Laplacian energy maximization for the sub-networks is discussed which can provide a useful tool for the decision-makers to optimize the robustness of the air transportation network on different scales.

Intra-layer synchronization in duplex networks

This paper explores the intra-layer synchronization in duplex networks with different topologies within layers and different inner coupling patterns between, within, and across layers. Based on the Lyapunov stability method, we prove theoretically that the duplex network can achieve intra-layer synchronization under some appropriate conditions, and give the thresholds of coupling strength within layers for different types of inner coupling matrices across layers. Interestingly,for a certain class of coupling matrices across layers, it needs larger coupling strength within layers to ensure the intra-layer synchronization when the coupling strength across layers become larger, intuitively opposing the fact that the intra-layer synchronization is seemly independent of the coupling strength across layers. Finally, numerical simulations further verify the theoretical results.

Resource Allocation for Physical Layer Security in Heterogeneous Network with Hidden Eavesdropper

The tremendous performance gain of heterogeneous networks(Het Nets) is at the cost of complicated resource allocation. Considering information security, the resource allocation for Het Nets becomes much more challenging and this is the focus of this paper. In this paper, the eavesdropper is hidden from the macro base stations. To relax the unpractical assumption on the channel state information on eavesdropper, a localization based algorithm is first given. Then a joint resource allocation algorithm is proposed in our work, which simultaneously considers physical layer security, cross-tier interference and joint optimization of power and subcarriers under fairness requirements. It is revealed in our work that the considered optimization problem can be efficiently solved relying on convex optimization theory and the Lagrangian dual decomposition method is exploited to solve the considered problem effectively. Moreover, in each iteration the closed-form optimal resource allocation solutions can be obtained based on the Karush-Kuhn-Tucker(KKT) conditions. Finally, the simulation results are given to show the performance advantages of the proposed algorithm.

Deep Learning Based Physical Layer Security of D2D Underlay Cellular Network

In order to improve the physical layer security of the device-to-device(D2D)cellular network,we propose a collaborative scheme for the transmit antenna selection and the optimal D2D pair establishment based on deep learning.Due to the mobility of users,using the current channel state information to select a transmit antenna or establish a D2D pair for the next time slot cannot ensure secure communication.Therefore,in this paper,we utilize the Echo State Network(ESN)to select the transmit antenna and the Long Short-Term Memory(LSTM)to establish the D2D pair.The simulation results show that the LSTMbased and ESN-based collaboration scheme can effectively improve the security capacity of the cellular network with D2D and increase the life of the base station.

Finding optimal Bayesian networks by a layered learning method

It is unpractical to learn the optimal structure of a big Bayesian network(BN)by exhausting the feasible structures,since the number of feasible structures is super exponential on the number of nodes.This paper proposes an approach to layer nodes of a BN by using the conditional independence testing.The parents of a node layer only belong to the layer,or layers who have priority over the layer.When a set of nodes has been layered,the number of feasible structures over the nodes can be remarkably reduced,which makes it possible to learn optimal BN structures for bigger sizes of nodes by accurate algorithms.Integrating the dynamic programming(DP)algorithm with the layering approach,we propose a hybrid algorithm—layered optimal learning(LOL)to learn BN structures.Benefitted by the layering approach,the complexity of the DP algorithm reduces to O(ρ2^n?1)from O(n2^n?1),whereρ<n.Meanwhile,the memory requirements for storing intermediate results are limited to O(C k#/k#^2 )from O(Cn/n^2 ),where k#<n.A case study on learning a standard BN with 50 nodes is conducted.The results demonstrate the superiority of the LOL algorithm,with respect to the Bayesian information criterion(BIC)score criterion,over the hill-climbing,max-min hill-climbing,PC,and three-phrase dependency analysis algorithms.

Analysis on Connectivity of Inter-Orbit-Links in a MEO/LEO Double-Layer Satellite Network

As an important scheme of future global mobile satellite communication systems to provide multimedia service, a Double-Layer Satellite Network （DLSN） with MEO satellites and LEO satellites is proposed. The Inter-Orbit-Links （IOLs） between layers is an essential factor, which affects the performances of the DLSN systems. Considering certain constellation parameters, the geometric characteristics of IOLs are described and the connectivity of MEO satellites and LEO satellites in the DLSN is analyzed. By computer simulation, the results show that IOLs should be selectively established according to certain parameters rather than the simple in-sight principle.

Layered learning of soccer robot based on artificial neural network

Discusses the application of artificial neural network for MIROSOT, introduces a layered model of BP network of soccer robot for learning basic behavior and cooperative behavior, and concludes from experimental results that the model is effective.

THE APPLICATION OF ARTIFICIAL NEURAL NETWORKS TO INVESTIGATION ON THE THICKNESS OF INTERMETALLIC LAYER UNDER SOLID-LIQUID PRESSURE BONDING OF STEEL AND ALUMINIUM

Artificial neural networks (ANN), being a sophisticated type of information processing system by imitating the neural system of human brain, can be used to investigate the effects of concentration of flux solution, temperature of liquid aluminium, temperture of tools and pressure on thickness of the intermetallic layer at the interface between steel and aluminium under solid-liquid pressure bonding of steel and aluminium perfectly. The optimum thickness has been determined according to the value of the optimum shearing strength.

A CROSS-LAYER STRATEGY FOR COOPERATIVE DIVERSITY IN WIRELESS SENSOR NETWORKS

We investigate the problem of how to minimize the energy consumption in multi-hop Wireless Sensor Network (WSN),under the constraint of end-to-end reliability Quality of Seervice (QoS) requirement.Based on the investigation,we jointly consider the routing,relay selection and power allocation algorithm,and present a novel distributed cross-layer strategy using opportunistic relaying scheme for cooperative communication.The results show that under the same QoS requirement,the proposed cross-layer strategy performs better than other cross-layer cooperative communication algorithms in energy efficiency.We also investigated the impact of several parameters on the energy efficiency of the cooperative communication in WSNs,thus can be used to provide guidelines to decide when and how to apply cooperation for a given setup.

A Kind of Second-Order Learning Algorithm Based on Generalized Cost Criteria in Multi-Layer Feed-Forward Neural Networks

A kind of second order algorithm--recursive approximate Newton algorithm was given by Karayiannis. The algorithm was simplified when it was formulated. Especially, the simplification to matrix Hessian was very reluctant, which led to the loss of valuable information and affected performance of the algorithm to certain extent. For multi layer feed forward neural networks, the second order back propagation recursive algorithm based generalized cost criteria was proposed. It is proved that it is equivalent to Newton recursive algorithm and has a second order convergent rate. The performance and application prospect are analyzed. Lots of simulation experiments indicate that the calculation of the new algorithm is almost equivalent to the recursive least square multiple algorithm. The algorithm and selection of networks parameters are significant and the performance is more excellent than BP algorithm and the second order learning algorithm that was given by Karayiannis.