HISTORY OF NS-2

HISTORY OF NS-2

ns began development in 1989 as a variant of the REAL network simulator and it is currently maintained by volunteers. Long-running contributions have also come from Sun Microsystems and the UCB Daedelus and Carnegie Mellon Monarch projects

ns-2 was built in C++ and provides a simulation interface through OTcl, an object-oriented dialect of Tcl. 

The user describes a network topology by writing OTcl scripts, and then the main ns-2 program simulates that topology with specified parameters. It runs on Linux, FreeBSD, Solaris, Mac OS X and on Windows using Cygwin. It is licensed for use under version 2 of the GNU General Public License

WHAT IS NS-2?

WHAT IS NS-2?

ns (from network simulator) is a name for series of discrete event network simulators, specifically ns-2 and ns-3. Both simulators are used in the simulation of routing protocols, among others, and are heavily used in ad-hoc networking research, and support popular network protocols, offering simulation results for wired and wireless networks alike.

Both ns-2 and ns-3 are popular in research given their open source model and detailed online documentation

• ns-2 stands for Network Simulator version 2.

NS-2:

• Is a discrete event simulator for networking research

• Work at packet level.

• Provide substantial support to simulate bunch of protocols like TCP, UDP, FTP, HTTP and DSR.

• Simulate wired and wireless network.

• Is primarily Unix based.

• Use TCL as its scripting language.

• ns-2 is a standard experiment environment in research community.

USES OF NETWORK SIMULATORS

USES OF NETWORK SIMULATORS

Network simulators serve a variety of needs. Compared to the cost and time involved in setting up an entire test bed containing multiple networked computers, routers and data links, network simulators are relatively fast and inexpensive. They allow engineers, researchers to test scenarios that might be particularly difficult or expensive to emulate using real hardware - for instance, simulating a scenario with several nodes or experimenting with a new protocol in the network. Network simulators are particularly useful in allowing researchers to test new networking protocols or changes to existing protocols in a controlled and reproducible environment.

Network simulators, as the name suggests are used by researchers, developers and engineers to design various kinds of networks, simulate and then analyze the effect of various parameters on the network performance. A typical network simulator encompasses a wide range of networking technologies and can help the users to build complex networks from basic building blocks such as a variety of nodes and links. With the help of simulators, one can design hierarchical networks using various types of nodes like computers, hubs, bridges, routers, switches, links, mobile units etc.

Various types of Wide Area Network (WAN) technologies like TCP, ATM, IP etc and Local Area Network (LAN) technologies like Ethernet, token rings etc., can all be simulated with a typical simulator and the user can test, analyze various standard results apart from devising some novel protocol or strategy for routing etc. There are a wide variety of network simulators, ranging from the very simple to the very complex. 

Minimally, a network simulator must enable a user to represent a network topology, specifying the nodes on the network, the links between those nodes and the traffic between the nodes. More complicated systems may allow the user to specify everything about the protocols used to handle network traffic. Graphical applications allow users to easily visualize the workings of their simulated environment. Text-based applications may provide a less intuitive interface, but may permit more advanced forms of customization. 

Others, such as GTNets, are programming-oriented, providing a programming framework that the user then customizes to create an application that simulates the networking environment to be tested.

NS2 PROJECT TITLES @ NCCT

 
IEEE 2011 PROJECTS

• Channel-Aware Routing in MANETs with Route Handoff


• Cooperating with Smartness Using Heterogeneous Smart Antennas in Ad-Hoc Networks


• Dynamic Clustering-Based Adaptive Mobile Gateway Management in Integrated VANET - 3G Heterogeneous Wireless Networks


• Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks


• Efficient Target Tracking through Binary-Detection in Sparsely Deployed WSN


• On the Effectiveness of Monitoring for Intrusion Detection in Mobile Ad Hoc Networks


• Optimal Route Selection Method with Satellite System for Cognitive Wireless Network in Disaster Information Network


• Quality of service-based multi-domain routing under multiple quality of service metrics


• Schedulability Analysis for Hard Network Lifetime Wireless Sensor Networks With High Energy First Clustering


• Secured Communication for MANETS in Military


• Self-Reconfigurable Wireless Mesh Networks


• Transient Analysis of IEEE 802.15.4 Sensor Networks

IEEE 2010 PROJECTS

• Balanced Trustworthiness, Safety, and Privacy in Vehicle-to-Vehicle Communications


• Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks


• Two Phase Load Balanced Routing using OSPF

 

ncctchennai@gmail.com, 044-28235816, 9841193224, 9380102891, www.ncct.in 

TWO PHASE LOAD BALANCED ROUTING USING OSPF

TWO PHASE LOAD BALANCED ROUTING USING OSPF

ABSTRACT

The Internet traffic is growing, and its nature changes because of new applications. Multimedia applications require bandwidth reservations that were not needed initially when the file transfers dominated the Internet. P2P applications are making traffic patterns impossible to predict, and the traffic loads generated at nodes need to be routed regardless of the traffic pattern. When the guaranteed node traffic loads are known, bandwidth reservations can be made simple as will be explained in the paper. 

The shortest path routing (SPR) protocols used on the Internet today do not maximize the guaranteed node traffic loads, and do not provide scalable and fast bandwidth reservations. Load balancing can improve the network throughput for arbitrary traffic pattern. In this paper we analyze and implement a routing protocol that is based on load balancing and a commonly used shortest path routing protocol, and is, consequently, termed as LB-SPR. LB-SPR is optimized for an arbitrary traffic pattern, i.e. it does not assume a particular traffic matrix. Optimization assumes only the weights assigned to the network nodes according to their estimated demands. It will be shown that the optimized routing achieves the throughputs which are significantly higher than those provided by the currently used SPR protocols, such as OSPF or RIP. Importantly, LB-SPR calculates the guaranteed traffic loads and so allows fast autonomic bandwidth reservations which are the key for the successful support of triple-play applications, including video and audio applications that require high QoS. 

An actual modification of the TCP/IP stack that includes LB-SPR is also described. Using the signaling mechanisms of the OSPF protocol, the information needed to perform the routing optimization is automatically distributed among the network nodes whenever the network topology changes. The LB-SPR implementation is validated on a sample network using a popular virtualization tool - Xen.

BALANCED TRUSTWORTHINESS, SAFETY, AND PRIVACY IN VEHICLE-TO-VEHICLE COMMUNICATIONS

BALANCED TRUSTWORTHINESS, SAFETY, AND PRIVACY IN VEHICLE-TO-VEHICLE COMMUNICATIONS

ABSTRACT

Vehicular ad hoc networks (VANETs) are being designed to improve traffic safety and efficiency. To meet this goal, the messages disseminated in VANETs must be trustworthy. We propose a privacy-preserving system that guarantees message trustworthiness in vehicle-to-vehicle (V2V) communications. 

Vehicle privacy is provided as long as a vehicle does not attempt to endorse the same message more than once. In spite of a message having been validly endorsed, if it is later found to be false, the system offers the possibility of a posteriori tracing the message generator and its endorsers. 

Our proposal demonstrates a number of distinctive features. The system is equipped with both apriori and a posteriori countermeasures. The threshold used for apriori endorsement can adaptively change according to the message urgency and traffic context, rather than being preset in the system design stage as in existing schemes. The verification of authenticated V2V messages is accelerated by batch message-processing techniques. Simulation results illustrate that the system maintains its performance under various traffic conditions.

ncctchennai@gmail.com, 044-28235816, 9841193224, 9380102891, www.ncct.in