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

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

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.

Grid-based internet worm behavior simulator

The traditional network simulator has function and performance limitation when simulating Internet worms,so we designed the grid-based Internet worm behavior simulator (IWBS Grid).IWBS Grid makes use of the real Internet topology,link and routing information,and simulates the worm behavior at the packet event-driven level;and proposes a high-performance Internet worms behavior simulation platform by right of the grid computing capability,resource and task management,and so on.The experimental results show that IWBS grid surpasses the traditional simulator in simulating capability,and the technology to track the worm propagation in packet level can propose the valuable information for the further study on worms.

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.

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.

APPLICATIONS OF FAST SIMULATED ANNEALING IN NEURAL NETWORKS

ＡＰＰＬＩＣＡＴＩＯＮＳＯＦＦＡＳＴＳＩＭＵＬＡＴＥＤＡＮＮＥＡＬＩＮＧＩＮＮＥＵＲＡＬＮＥＴＷＯＲＫＳ￥ＹｉＬｉｎＣＡＯ；ＱｉｎｇＺｈａｎｇ；ＬＵＳｈｕ；ＴｉｎｇＹＡＮＧ（ＤｅｐａｒｔｍｅｎｔｏｆＣｈｅｍｉｓｔｒｙ，ＨｅｎａｎＮｏｒｍａｌＵｎｉｖｅ...

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.

Effect of Transmission Range on Ad Hoc on Demand Distance Vector Routing Protocol

The necessary background as well as the details of simulation was presented to simulate and evaluate the performance of the ad hoc on-demand distance vector routing protocol in mobile ad hoc network with the help of the network simulator NS2 using the common transmission range to deliver the data packets at the destination node. The number of participating nodes played an important role to predict the conditions for the best performance of the protocol with respect to throughput, delay, packet delivery ratio, drop packets, consumed and residual energy of the network. Further, the efforts can be put to control the transmission range dynamically and overheads for reducing the energy consumption in the network and improving its lifetime of the nodes and the lifespan of the network.

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

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.

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.

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.

Hardware-in-the-loop simulation system for space information networks

Thanks to the recent advances in SIS(Space Information Science)and increasingly mature technologies,network simulations have attracted much attention,which play vital roles in research on validation of the correctness of SIN’s(Space Information Network)solutions.In this paper,we constitute an architecture of a hardware-in-the-loop simulation system,where we use a server to act as a real satellite of SINs.Moreover,we model the channel of the satellite network relying on real cables and servers by referring to the Corazza model.Furthermore,based on the data of real weather events,we propose a coordinate mode for reducing LEO’s(Low Earth Orbit)communication delay and validate the efficiency of our proposed method on simulation platform by simplifying the problem to a shortest path problem.

The research of traffic density extraction method under vehicular ad hoc network environment

Purpose–Traffic density is one of the most important parameters to consider in the traffic operationfield.Owing to limited data sources,traditional methods cannot extract traffic density directly.In the vehicular ad hoc network(VANET)environment,the vehicle-to-vehicle(V2V)and vehicle-to-infrastructure(V2I)interaction technologies create better conditions for collecting the whole time-space and refined traffic data,which provides a new approach to solving this problem.Design/methodology/approach–On that basis,a real-time traffic density extraction method has been proposed,including lane density,segment density and network density.Meanwhile,using SUMO and OMNet11 as traffic simulator and network simulator,respectively,the Veins framework as middleware and the two-way coupling VANET simulation platform was constructed.Findings–Based on the simulation platform,a simulated intersection in Shanghai was developed to investigate the adaptability of the model.Originality/value–Most research studies use separate simulation methods,importing trace data obtained by using from the simulation software to the communication simulation software.In this paper,the tight coupling simulation method is applied.Using real-time data and history data,the research focuses on the establishment and validation of the traffic density extraction model.

Proactive planning of bandwidth resource using simulation-based what-if predictions for Web services in the cloud

Resource planning is becoming an increasingly important and timely problem for cloud users.As more Web services are moved to the cloud,minimizing network usage is often a key driver of cost control.Most existing approaches focus on resources such as CPU,memory,and disk I/O.In particular,CPU receives the most attention from researchers,but the bandwidth is somehow neglected.It is challenging to predict the network throughput of modem Web services,due to the factors of diverse and complex response,evolving Web services,and complex network transportation.In this paper,we propose a methodology of what-if analysis,named Log2Sim,to plan the bandwidth resource of Web services.Log2Sim uses a lightweight workload model to describe user behavior,an automated mining approach to obtain characteristics of workloads and responses from massive Web logs,and traffic-aware simulations to predict the impact on the bandwidth consumption and the response time in changing contexts.We use a real-life Web system and a classic benchmark to evaluate Log2Sim in multiple scenarios.The evaluation result shows that Log2Sim has good performance in the prediction of bandwidth consumption.The average relative error is 2%for the benchmark and 8% for the real-life system.As for the response time,Log2Sim cannot produce accurate predictions for every single service request,but the simulation results always show similar trends on average response time with the increase of workloads in different changing contexts.It can provide sufficient information for the system administrator in proactive bandwidth planning.