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

SCHEDULABILITY ANALYSIS FOR HARD NETWORK LIFETIME WIRELESS SENSOR NETWORKS WITH HIGH ENERGY FIRST CLUSTERING

SCHEDULABILITY ANALYSIS FOR HARD NETWORK LIFETIME WIRELESS SENSOR NETWORKS WITH HIGH ENERGY FIRST CLUSTERING

ABSTRACT

Network lifetime predictability is an essential system requirement for the type of wireless sensor network (WSN) used in safety-critical and highly-reliable applications. All sensor nodes in these time-critical WSNs should meet the lifetime constraint at any time instance, else it may cause severe consequences that involve economic losses, or even fatalities. In the literature, clustering sensors into groups is a popular strategy to maximize the network lifetime, but none of the clustering algorithms address the predictability issue for time-criticalWSNs. 

In this paper, the High Energy First (HEF) clustering algorithm is chosen as a design reference model, which is proved in this paper to be an optimal clustering policy under certain ideal conditions. To address network lifetime predictability in practice, the network lifetime bounds and feasibility test for the HEF are developed via the worst case energy consumption analysis. 

The network simulator 2 (NS2) is used to verify the proposed network lifetime predictability model, and the results show that the derived bounds of the predictability provide accurate estimations of the system lifetime

SELF-RECONFIGURABLE WIRELESS MESH NETWORKS

SELF-RECONFIGURABLE WIRELESS MESH NETWORKS

ABSTRACT

During their lifetime, multi-hop wireless mesh networks (WMNs) experience frequent link failures caused by channel interference, dynamic obstacles and/or applications’ bandwidth demands. These failures cause severe performance degradation in WMNs or require expensive, manual network management for their real-time recovery. This paper presents an Autonomous network Reconfiguration System (ARS) that enables a multi-radio WMN to autonomously recover from local link failures to preserve network performance. 

By using channel and radio diversities in WMNs, ARS generates necessary changes in local radio and channel assignments in order to recover from failures. Next, based on the thus-generated configuration changes, the system cooperatively reconfigures network settings among local mesh routers. ARS has been implemented and evaluated extensively on our IEEE 802.11-based WMN test-bed as well as through ns-2-based simulation. 

Our evaluation results show that ARS outperforms existing failure-recovery schemes in improving channel-efficiency by more than 90%and in the ability of meeting the applications’ bandwidth demands by an average of 200%.

SECURED COMMUNICATION FOR MANETS IN MILITARY

SECURED COMMUNICATION FOR MANETS IN MILITARY 

ABSTRACT

A new way to increase the security of data transmission of mobile ad hoc networks [MANETS] is presented in this work. There is a massive increase in using MANETS for unmanned army system for both surveillance and future combat operations. This has necessitated the development of innovative MANET solutions catering to the reliability, security and scalability needs of the defense communications environment.  Security and reliability are crucial aspects of MANET, especially in security sensitive applications like military. 

Secure Message Transmission SMT[1] protocol  secure the data transmission phase by tailoring an end-to-end secure data forwarding protocol to the MANET communication requirements and increases the reliability through  transmitting the messages in multiple paths with minimal redundancy. This work increases the through the removal of Byzantine Faults [8] in the multiple paths. A binary search probing technique which is resilient to Byzantine failures caused by individual or colluding nodes is incorporated in the SMT protocol to provide more secured transmission. The fault detection algorithm bounds logarithmically (log n –n the number of nodes in the path), so the delay is reduced drastically. 

The simulated implementation of the work in NS2 shows the marginal increase in the throughput. The delay and jitter variants can also be improved if the nodes location can be predicted. Predicting the nodes location and reducing the unnecessary traffic with the aid of Spatial and Temporal mining is the second phase of this work.