A Cooperative Security Monitoring Mechanism Aided by Optimal Multiple Slave Cluster Heads for UASNs

As each cluster head(CH)sensor node is used to aggregate,fuse,and forward data from different sensor nodes in an underwater acoustic sensor network(UASN),guaranteeing the data security in a CH is very critical.In this paper,a cooperative security monitoring mechanism aided by multiple slave cluster heads(SCHs)is proposed to keep track of the data security of a CH.By designing a low complexity“equilateral triangle algorithm(ETA)”,the optimal SCHs(named as ETA-based multiple SCHs)are selected from the candidate SCHs so as to improve the dispersion and coverage of SCHs and achieve largescale data security monitoring.In addition,by analyzing the entire monitoring process,the close form expression of the probability of the failure attack identification for the SCHs with respect to the probability of attack launched by ordinary nodes is deduced.The simulation results show that the proposed optimal ETA-based multiple SCH cooperation scheme has lower probability of the failure attack identification than that of the existing schemes.In addition,the numerical simulation results are consistent with the theoretical analysis results,thus verifying the effectiveness of the proposed scheme.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

Energy Efficient Unequal Fault Tolerance Clustering Approach

For achieving Energy-Efficiency in wireless sensor networks(WSNs),different schemes have been proposed which focuses only on reducing the energy consumption.A shortest path determines for the Base Station(BS),but fault tolerance and energy balancing gives equal importance for improving the network lifetime.For saving energy in WSNs,clustering is considered as one of the effective methods for Wireless Sensor Networks.Because of the excessive overload,more energy consumed by cluster heads(CHs)in a cluster based WSN to receive and aggregate the information from member sensor nodes and it leads to failure.For increasing the WSNs’lifetime,the CHs selection has played a key role in energy consumption for sensor nodes.An Energy Efficient Unequal Fault Tolerant Clustering Approach(EEUFTC)is proposed for reducing the energy utilization through the intelligent methods like Particle Swarm Optimization(PSO).In this approach,an optimal Master Cluster Head(MCH)-Master data Aggregator(MDA),selection method is proposed which uses the fitness values and they evaluate based on the PSO for two optimal nodes in each cluster to act as Master Data Aggregator(MDA),and Master Cluster Head.The data from the cluster members collected by the chosen MCH exclusively and the MDA is used for collected data reception from MCH transmits to the BS.Thus,the MCH overhead reduces.During the heavy communication of data,overhead controls using the scheduling of Energy-Efficient Time Division Multiple Access(EE-TDMA).To describe the proposed method superiority based on various performance metrics,simulation and results are compared to the existing methods.

Research on the Development Model of University Archives Cultural Products Based on Deep Learning

The products of an archival culture in colleges and universities are the final result of the development of archival cultural resources,and the development of archival cultural effects in colleges and universities should be an important part of improving the artistic level of libraries.The existing RippleNet model doesn’t consider the influence of key nodes on recommendation results,and the recommendation accuracy is not high.Therefore,based on the RippleNet model,this paper introduces the influence of complex network nodes into the model and puts forward the Cn RippleNet model.The performance of the model is verified by experiments,which provide a theoretical basis for the promotion and recommendation of its cultural products of universarchives,solve the problem that RippleNet doesn’t consider the influence of key nodes on recommendation results,and improve the recommendation accuracy.This paper also combs the development course of archival cultural products in detail.Finally,based on the Cn-RippleNet model,the cultural effect of university archives is recommended and popularized.

QoS Constrained Network Coding Technique to Data Transmission Using IoT

The research work presents,constrained network coding technique to ensure the successful data transmission based composite channel cmos technology using dielectric properties.The charge fragmentation and charge splitting are two components of the filtered switch domino(FSD)technique.Further behavior of selected switching is achieved using generator called conditional pulse generator which is employed in Multi Dynamic Node Domino(MDND)technique.Both FSD and MDND technique need wide area compared to existing single nodekeeper domino technique.The aim of this research is to minimize dissipation of power and to achieve less consumption of power.The proposed research,works by introducing the method namely Interference and throughput aware Optimized Multicast Routing Protocol(IT-OMRP).The main goal of this proposed research method is to introduce the system which can forward the data packets towards the destination securely and successfully.To achieve the bandwidth and throughput in optimized data transmission,proposed multicast tree is selected by Particle Swarm Optimization which will select the most optimal host node as the branches of multi cast tree.Here node selection is done by considering the objectives residual energy,residual bandwidth and throughput.After node selection multi cast routing is done with the concern of interference to ensure the reliable and successful data transmission.In case of transmission range size is higher than the coverage sense range,successful routing is ensured by selecting secondary host forwarders as a backup which will act as intermediate relay forwarders.The NS2 simulator is used to evaluate research outcome from which it is proved that the proposed technique tends to have increased packet delivery ratio than the existing work.

The Design of Urban Traffic in Ferizaj through Operational Research

Cities are undergoing rapid changes continuously due to the high demands of this era, and simultaneously affect several life fields, namely urban transport. High demands are triggering people to travel more frequently than ever;thus, they utilize public transportation more and private transportation less as the latter ceased to fulfill all the transportation needs. Thus, public transportation demand has been increasing greatly alongside citizens’ needs. Nonetheless, many cities lack proper urban traffic planning and organization, while some lack an urban transport service. Ferizaj, a city in Kosovo, is one of the cities that lacks an urban traffic designation;hence, this paper presents a designed urban traffic model, precisely suitable to fulfill the urban transportation need for Ferizaj city. This model is designed under the utilization of applied mathematics’ techniques and operational research. Several factors have been considered, following the geographical distribution of the population, existing roads, and residents’ needs. Consequently, the Solver program has been used as an optimization tool to find the shortest path and most economical paths, added in the discussion part. Besides, the likelihood of the designed urban traffic model’s application in Ferizaj is discussed, considering its viability and application conditions. This study presents mathematical constraints to design a model of the bus network in Ferizaj through Solver. We have used mathematical optimization methods, graph theory, the simulation model through the Solver computer program for network minimal distances and presenting the first model of the Urban traffic network in Ferizaj.

Sample Numbers and Optimal Lagrange Interpolation of Sobolev Spaces W_(1)^(r)

This paper investigates the optimal recovery of Sobolev spaces W_(1)^(r)[-1,1],r∈N in the space L_(1)[-1,1].They obtain the values of the sampling numbers of W_(1)^(r)[-1,1]in L_(1)[-1,1]and show that the Lagrange interpolation algorithms based on the extreme points of Chebyshev polynomials are optimal algorithms.Meanwhile,they prove that the extreme points of Chebyshev polynomials are optimal Lagrange interpolation nodes.

Optimization of the Deployment of Temperature Nodes Based on Linear Programing in the Internet of Things

The Internet of Things emphasizes the concept of objects connected with each other, which includes all kinds of wireless sensor networks. An important issue is to reduce the energy consumption in the sensor networks since sensor nodes always have energy constraints. Deployment of thousands of wireless sensors in an appropriate pattern will simultaneously satisfy the application requirements and reduce the sensor network energy consumption. This article deployed a number of sensor nodes to record temperature data. The data was then used to predict the temperatures of some of the sensor node using linear programming. The predictions were able to reduce the node sampling rate and to optimize the node deployment to reduce the sensor energy consumption. This method can compensate for the temporarily disabled nodes. The main objective is to design the objective function and determine the constraint condition for the linear programming. The result based on real experiments shows that this method successfully predicts the values of unknown sensor nodes and optimizes the node deployment. The sensor network energy consumption is also reduced by the optimized node deployment.

A practical interconnection network RP(k) and its routing algorithms

Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus net-work. Especially when the number of nodes in an optimal node group is between 6 and 100, the diam-eter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Further-more based on the RP(k) network we design a set of routing algorithms which are point-to-point rout-ing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [ k/2] +2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.

Air route network optimization in fragmented airspace based on cellular automata

Air route network optimization,one of the essential parts of the airspace planning,is an effective way to optimize airspace resources,increase airspace capacity,and alleviate air traffic congestion.However,little has been done on the optimization of air route network in the fragmented airspace caused by prohibited,restricted,and dangerous areas（PRDs）.In this paper,an air route network optimization model is developed with the total operational cost as the objective function while airspace restriction,air route network capacity,and non-straight-line factors（NSLF） are taken as major constraints.A square grid cellular space,Moore neighbors,a fixed boundary,together with a set of rules for solving the route network optimization model are designed based on cellular automata.The empirical traffic of airports with the largest traffic volume in each of the 9 flight information regions in China's Mainland is collected as the origin-destination（OD） airport pair demands.Based on traffic patterns,the model generates 35 air routes which successfully avoids 144 PRDs.Compared with the current air route network structure,the number of nodes decreases by 41.67%,while the total length of flight segments and air routes drop by 32.03% and 5.82% respectively.The NSLF decreases by 5.82% with changes in the total length of the air route network.More importantly,the total operational cost of the whole network decreases by 6.22%.The computational results show the potential benefits of the model and the advantage of the algorithm.Optimization of air route network can significantly reduce operational cost while ensuring operation safety.