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.

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.

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.

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.

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.

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.

A STUDY OF EXPERT SYSTEM FOR SECTION EXTRUSION PROCESS BASED ON FINITE ELEMENT METHOD SIMULATION

The samples obtained by Finite Element Method (FEM) simulation for section extrusion process have been trained on BP Neural Networks. The mapping relationsbetween die's geometrical parameters and energetic parameters, such as stress and strain generated in the die are established. The extrusion process model and its expert system are also determined. The excellent expansibility this system possesses provides a new prospect for the future development of expert system for section extrusion dies.

基于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.

挖掘机节能用变量泵BP神经网络控制系统研究

从节能角度出发,提出了一种新的液压挖掘机节能用变量泵控制方法———BP神经网络控制方法,在油门一定的条件下,根据发动机转速(外部负载)的变化,控制系统实时调整变量泵的排量,从而实现发动机与变量泵的合理匹配。基于此方法进行了台架试验,结果证明新型控制系统优于传统的PID控制方法。

分布式自选举动态陈列蜜罐系统的设计与实现(英文)

Traditional honeypot is in fact a "passive proactive" defense mechanism because it may lose the value entirely once the adversary has detected the existence of the static trap and bypassed it.Our work focuses on a Self-Election dynamic honeypot framework which aims to bewilder attackers by coordinating and switching roles periodically to form a huge dynamic puzzle.In this paper,we discuss the UDP Spokesman synchronization scheme and the Self-Election coordination method,perform the framework simulation of the dynamic array honeypot with NS2,carry out the prototype implementation by Java,and then validate the effectiveness and feasibility on the simulation and prototype system.The promising results of applying this framework to mitigate the effects of attacks are shown and analyzed.Our work demonstrates that the Self-Election dynamic array honeypot system is feasible and effective for proactive network confrontation.

Combined heat and mass transfer by mixed convection MHD flow along a porous plate with chemical reaction in presence of heat source

An exact and a numerical solutions to the problem of a steady mixed convective MHD flow of an incompressible viscous electrically conducting fluid past an infinite vertical porous plate with combined heat and mass transfer are presented.A uniform magnetic field is assumed to be applied transversely to the direction of the flow with the consideration of the induced magnetic field with viscous and magnetic dissipations of energy.The porous plate is subjected to a constant suction velocity as well as a uniform mixed stream velocity.The governing equations are solved by the perturbation technique and a numerical method.The analytical expressions for the velocity field,the temperature field,the induced magnetic field,the skin-friction,and the rate of heat transfer at the plate are obtained.The numerical results are demonstrated graphically for various values of the parameters involved in the problem.The effects of the Hartmann number,the chemical reaction parameter,the magnetic Prandtl number,and the other parameters involved in the velocity field,the temperature field,the concentration field,and the induced magnetic field from the plate to the fluid are discussed.An increase in the heat source/sink or the Eckert number is found to strongly enhance the fluid velocity values.The induced magnetic field along the x-direction increases with the increase in the Hartmann number,the magnetic Prandtl number,the heat source/sink,and the viscous dissipation.It is found that the flow velocity,the fluid temperature,and the induced magnetic field decrease with the increase in the destructive chemical reaction.Applications of the study arise in the thermal plasma reactor modelling,the electromagnetic induction,the magnetohydrodynamic transport phenomena in chromatographic systems,and the magnetic field control of materials processing.

RED-DTB: A Dual Token Bucket Based Queue Management Algorithm

Improving the Quality of Service (QoS) of Internet traffic is widely recognized as a critical issue for the next-generation networks. In this paper, we present a new algorithm for the active queue management, namely RED-DTB. This buffer control technique is used to enforce approximate fairness among a large number of concurrent Internet flows. Like RED (Random Early Detection) algorithm, the RED-DTB mechanism can be deployed to actively respond to the gateway congestion, keep the gateway in a healthy state, and protect the fragile flows from being stolen bandwidth by greedy ones. The algorithm is based on the so-called Dual Token Bucket (DTB) pattern. That is, on the one hand, every flow is rate-limited by its own token bucket, to ensure that it can not consume more than its fair share of bandwidth; On the other hand, to make some compensations to less aggressive flows, such as connections with larger round trip time or smaller sending window, and to gain a relatively higher system utilization coefficient, all flows, depending on their individual behavior, may have a chance to fetch tokens from the public token bucket when they run out of their own share of tokens. The algorithm is analyzed and evaluated by simulations, and is proved to be effective in protecting the gateway buffer and controlling the fair allocation of bandwidth among flows.

Effects of thermophoresis particle deposition and of the thermal conductivity in a porous plate with dissipative heat and mass transfer

Network simulation method（NSM） is used to solve the laminar heat and mass transfer of an electricallyconducting,heat generating/absorbing fluid past a perforated horizontal surface in the presence of viscous and Joule heating problem. The governing partial differential equations are non-dimensionalized and transformed into a system of nonlinear ordinary differential similarity equations,in a single independent variable,畏. The resulting coupled,nonlinear equations are solved under appropriate transformed boundary conditions. Computations are performed for a wide range of the governing flow parameters,viz Prandtl number,thermophoretic coeffcient（a function of Knudsen number）,thermal conductivity parameter,wall transpiration parameter and Schmidt number. The numerical details are discussed with relevant applications. The present problem finds applications in optical fiber fabrication,aerosol filter precipitators,particle deposition on hydronautical blades,semiconductor wafer design,thermo-electronics and problems including nuclear reactor safety.