A study on IP-based hierarchical routing strategy in network simulation

The intrinsic routing policy of NS2—a network simulation tool— based on flat or hierarchical address has the disadvantage such as small topology scale,high resource consumption,low efficiency and so on.This paper proposes an IP based hierarchical routing strategy in network simulation to extend the topology scale and improve performance in simulating.Firstly,a stratification mechanism to identify IP address of nodes is described.Then,an algorithm of packet transmitting method(PTM) is presented for packet forwarding in the same subnet.Finally,algorithms of region partition(RP),routing computation based on region division(RCBRD) and routing distribution(RD) is proposed to implement regional segmentation,route calculation and route distribution for forwarding packets in different subnets respectively.The experiment results show that under the same condition,compared with plane address,the topology scale of the network simulation is extended two times and the consumption of time and memory during simulation is reduced by approximately 73%and 45.8% respectively.Compared with hierarchical address,the topology scale of the network simulation is expanded by more than 50%,and the consumption of time and memory is reduced by about 59.2% and 25% respectively.In addition,along with the growth of the node size,the proportion of reducing total simulation time and memory consumption would gradually increase.

Urban Growth Modeling Using Neural Network Simulation: A Case Study of Dongguan City, China

Dongguan is an important industrial city, located in the Pearl River Delta, South China. Recently, Dongguan city experienced a rapid urban growth with the locational advantage by transforming from traditional agricultural region to modern manufacturing metropolis. The urban transformation became the usual change in China under the background of urbanization which belongs to one trend of globalization in the 21st century. This paper tries to analyze urban growth simulation based on remotely sensed data of previous years and the related physical and socio-economic factors and predict future urban growth in 2024. The study examined and compared the land use/cover (LUC) changes over time based on produced maps of 2004, 2009, and 2014. The results showed that water and forest area decreased since the past years. In contrast, the urban land increased from 2004 to 2014, and this increasing trend will continue to the future years through the urbanization process. Having understood the spatiotemporal trends of urban growth, the study simulated the urban growth of Dongguan city for 2024 using neural network simulation technique. Further, the figure of merit (FoM) of simulated map of 2014 map was 8.86%, which can be accepted in the simulation and used in the prediction process. Based on the consideration of water body and forest, the newly growth area is located in the west, northeast, and southeast regions of Dongguan city. The finding can help us to understand which areas are going to be considered in the future urban planning and policy by the local government.

Design for the simulation of space based information network

Ongoing research is described that is focused upon modelling the space base information network and simulating its behaviours： simulation of spaced based communications and networking project. Its objective is to demonstrate the feasibility of producing a tool that can provide a performance evaluation of various eonstellation access techniques and routing policies. The architecture and design of the simulation system are explored. The algorithm of data routing and instrument scheduling in this project is described. Besides these, the key methodologies of simulating the inter-satellite link features in the data transmissions are also discussed. The performance of both instrument scheduling algorithm and routing schemes is evaluated and analyzed through extensive simulations under a typical scenario.

3-D fracture network dynamic simulation based on error analysis in rock mass of dam foundation

Accurate 3-D fracture network model for rock mass in dam foundation is of vital importance for stability,grouting and seepage analysis of dam foundation.With the aim of reducing deviation between fracture network model and measured data,a 3-D fracture network dynamic modeling method based on error analysis was proposed.Firstly,errors of four fracture volume density estimation methods(proposed by ODA,KULATILAKE,MAULDON,and SONG)and that of four fracture size estimation methods(proposed by EINSTEIN,SONG and TONON)were respectively compared,and the optimal methods were determined.Additionally,error index representing the deviation between fracture network model and measured data was established with integrated use of fractal dimension and relative absolute error(RAE).On this basis,the downhill simplex method was used to build the dynamic modeling method,which takes the minimum of error index as objective function and dynamically adjusts the fracture density and size parameters to correct the error index.Finally,the 3-D fracture network model could be obtained which meets the requirements.The proposed method was applied for 3-D fractures simulation in Miao Wei hydropower project in China for feasibility verification and the error index reduced from 2.618 to 0.337.

Network simulation task partition method in heterogeneous computing environment

To reduce the running time of network simulation in heterogeneous computing environment,a network simulation task partition method,named LBPHCE,is put forward.In this method,the network simulation task is partitioned in comprehensive consideration of the load balance of both routing computing simulation and packet forwarding simulation.First,through benchmark experiments,the computation ability and routing simulation ability of each simulation machine are measured in the heterogeneous computing environment.Second,based on the computation ability of each simulation machine,the network simulation task is initially partitioned to meet the load balance of packet forwarding simulation in the heterogeneous computing environment,and then according to the routing computation ability,the scale of each partition is fine-tuned to satisfy the balance of the routing computing simulation,meanwhile the load balance of packet forwarding simulation is guaranteed.Experiments based on PDNS indicate that,compared to traditional uniform partition method,the LBPHCE method can reduce the total simulation running time by 26.3%in average,and compared to the liner partition method,it can reduce the running time by 18.3%in average.

Spanning tree-based algorithm for hydraulic simulation of large-scale water supply networks

With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by expanding the traditional loop-equation theory through utilization of the advantages of the graph theory in efficiency. The utilization of the spanning tree technique from graph theory makes the proposed algorithm efficient in calculation and simple to use for computer coding. The algorithms for topological generation and practical implementations are presented in detail in this paper. Through the application to a practical urban system, the consumption of the CPU time and computation memory were decreased while the accuracy was greatly enhanced compared with the present existing methods.

Construction of Network Fault Simulation Platform and Event Samples Acquisition Techniques for Event Correlation

Event correlation is one key technique in network fault management. For the event sample acquisition problem in event correlation, a novel approach is proposed to collect the samples by constructing network simulation platform. The platform designed can set kinds of network faults according to user's demand and generate a lot of network fault events, which will benefit the research on efficient event correlation techniques.

Simulation of natural gas transmission pipeline network system performance

Simulation has proven to be an effective tool for analyzing pipeline network systems （PNS） in order to determine the design and operational variables which are essential for evaluating the performance of the system. This paper discusses the use of simulation for performance analysis of transmission PNS. A simulation model was developed for determining flow and pressure variables for different configuration of PNS. The mathematical formulation for the simulation model was derived based on the principles of energy conservation, mass balance, and compressor characteristics. For the determination of the pressure and flow variables, solution procedure was developed based on iterative Newton Raphson scheme and implemented using visual C＋＋6. Evaluations of the simulation model with the existing pipeline network system showed that the model enabled to determine the operational variables with less than ten iterations. The performances of the compressor working in the pipeline network system xvhich includes energy consumption, compression ratio and discharge pressure were evaluated to meet pressure requirements ranging from 4000-5000 kPa at various speed. Results of the analyses from the simulation indicated that the model could be used for performance analysis to assist decisions regarding the design and optimal operations of transmission PNS.

Redundancy Elimination in GPRS network

The mechanisms of TCP’s retransmission and reset will result in redundant packets. These redundant packets are often sent unnecessarily to the user over a slow last-hop link delaying useful traffic. This is a problem for wide-area wireless links, such as General Packet Radio Service (GPRS), because unnecessary transmissions waste already limited radio bandwidth, battery power at the mobile terminal and incurs monetary cost due to charging by data volume. The paper first describes a GPRS model, then discusses how to eliminate the redundant packets in GPRS network and presents the simulation results in Network Simulation 2 (NS 2). The more traffic is, the more the network can benefit. In heavy traffic, it can even get more than 30% improvement in throughput. Average delay and loss percent are also lowered.

Analysis and verification of network profile

The elements of network profile are proposed.Based on the network traffic distribution model,the network profile includes the application request rate,the branch transfer probability,the ratio of application requests,and the probability distribution of the requested objects.Based on the evaluation method of network performance reliability,four simulation cases are constructed in OPNET software,and the results show the four elements of profile have impacts on the network reliability.

Simulation Laboratory and Critical Appraisal of Development Tool

In order to carry out the different network question meaning the research to like the protocol interaction,the network dynamics' function,the measurable quantity waits for it is the necessary delivery is including.Thus,the network simulation may use in showing or quite interesting network performance and so on.Part two aim is provides the type of development tool,including consider such as cost,ease to use and limitations of software packages.The report is to meets the system specification requirement immediately the available component.

RECURRENT NEURAL NETWORK-BASED PORTFOLIO INVESTMENT

Instead of existing methods,a recurrent neural network is conceived to deal with three stages of portfolio management.Mainly,a deterministic annealing neural network is proposed for the approach to portfolio problem,which is a kind of quadratic programming.Finally,through a real example,we verify that the neural network model proposed in this paper is a good tool to solve the portfolio problem.

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

A new algorithm for wireless sensor network based on NS-2

Considering wireless sensor network characteristics,this paper uses network simulator,version2(NS-2)algorithm to improve Ad hoc on-demand distance vector(AODV)routing algorithm,so that it can be applied to wireless sensor networks.After studying AODV routing protocol,a new algorithm called Must is brought up.This paper introduces the background and algorithm theory of Must,and discusses the details about how to implement Must algorithm.At last,using network simulator(NS-2),the performance of Must is evaluated and compared with that of AODV.Simulation results show that the network using Must algorithm has perfect performance.

Ranking important nodes in complex networks by simulated annealing

In this paper, based on simulated annealing a new method to rank important nodes in complex networks is presented.First, the concept of an importance sequence（IS） to describe the relative importance of nodes in complex networks is defined. Then, a measure used to evaluate the reasonability of an IS is designed. By comparing an IS and the measure of its reasonability to a state of complex networks and the energy of the state, respectively, the method finds the ground state of complex networks by simulated annealing. In other words, the method can construct a most reasonable IS. The results of experiments on real and artificial networks show that this ranking method not only is effective but also can be applied to different kinds of complex networks.

Recent Implementations in LASP 3.0:Global Neural Network Potential with Multiple Elements and Better Long-Range Description

LASP(large-scale atomistic simulation with neural network potential)software developed by our group since 2018 is a powerful platform(www.lasphub.com)for performing atomic simulation of complex materials.The software integrates the neural network(NN)potential technique with the global potential energy surface exploration method,and thus can be utilized widely for structure prediction and reaction mechanism exploration.Here we introduce our recent update on the LASP program version 3.0,focusing on the new functionalities including the advanced neuralnetwork training based on the multi-network framework,the newly-introduced S^(7) and S^(8) power type structure descriptor(PTSD).These new functionalities are designed to further improve the accuracy of potentials and accelerate the neural network training for multipleelement systems.Taking Cu-C-H-O neural network potential and a heterogeneous catalytic model as the example,we show that these new functionalities can accelerate the training of multi-element neural network potential by using the existing single-network potential as the input.The obtained double-network potential Cu CHO is robust in simulation and the introduction of S^(7) and S^(8) PTSDs can reduce the root-mean-square errors of energy by a factor of two.

基于Network Simulator的“无线传感器网络”实践教学研究

“无线传感器网络”是物联网工程专业一门实践性很强的核心课程,与学生的学习效果和实践内容设计有着密切联系。文章针对无线传感器网络课程理论教学过程中内容生涩,网络协议和网络算法众多,学生不易理解的情况,提出对“无线传感器网络”课程若干教学方法的总结,并使用Network Simulator模拟软件辅助课堂教学,以可视化方式将理论教学与仿真实验结合起来,使学生通过实验增强对理论知识的理解,锻炼实践能力。

APPLICATIONS OF FAST SIMULATED ANNEALING IN NEURAL NETWORKS

Fast simulated annealing is implemented into the learning process of neural network to replace the traditional back-propagation algorithm. The new procedure exhibits performance fast in learning and accurate in prediction compared to the traditional neural networks. Two numerical data sets were used to illustrate its use in chemistry.

CAND-IDS: A Novel Context Aware Intrusion Detection System in Cooperative Wireless Sensor Networks by Nodal Node Deployment

Cooperative wireless sensor networks have drastically grown due to node co-opera- tive in unaltered environment. Various real time applications are developed and deployed under cooperative network, which controls and coordinates the flow to and from the nodes to the base station. Though nodes are interlinked to give expected state behavior, it is vital to monitor the malicious activities in the network. There is a high end probability to compromise the node behavior that leads to catastrophes. To overcome this issue a Novel Context Aware-IDS approach named Context Aware Nodal Deployment-IDS (CAND-IDS) is framed. During data transmission based on node properties and behavior CAND-IDS detects and eliminates the malicious nodes in the explored path. Also during network deployment and enhancement, node has to follow Context Aware Cooperative Routing Protocol (CCRP), to ensure the reliability of the network. CAND-IDS are programmed and simulated using Network Simulator software and the performance is verified and evaluated. The simulation result shows significant improvements in the throughput, energy consumption and delay made when compared with the existing system.

Research of NS dataflow mechanism and its analyzer implementation

This paper analyzes the main elements in NS network simulator, makes adetailed view of dataflow management in a link, a node, and an agent, respectively, and introducesthe information described by its trace file. Based on the analysis of transportation and treatmentof different packets in NS, a dataflow state machine is proposed with its states exchange triggeringevents and a dataflow analyzer is designed and implemented according to it. As the machine statefunctions, the analyzer can make statistic of total transportation flux of a specified dataflow andoffer a general fluctuation diagram. Finally, a concrete example is used to test its performance.