NS2 IEEE Projects Abstracts 2011 @ NCCT

NS2 IEEE Projects Abstracts 2011  @ NCCT

  

CHANNEL-AWARE ROUTING IN MANETS WITH ROUTE HANDOFF

ABSTRACT

In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper proposes a novel channel adaptive routing protocol which extends the Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol to accommodate channel fading. 

Specifically, the proposed Channel-Aware AOMDV (CA-AOMDV) uses the channel average nonfading duration as a routing metric to select stable links for path discovery, and applies a preemptive handoff strategy to maintain reliable connections by exploiting channel state information. Using the same information, paths can be reused when they become available again, rather than being discarded. 

We provide new theoretical results for the downtime and lifetime of a live-die-live multiple path system, as well as detailed theoretical expressions for common network performance measures, providing useful insights into the differences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance over AOMDV

COOPERATING WITH SMARTNESS: USING HETEROGENEOUS SMART ANTENNAS IN AD-HOC NETWORKS

ABSTRACT

The ability of smart antennas to improve performance in a typically constrained ad-hoc network environment, has helped them garner significant attention over the last few years. However, not much light has been shed on wireless ad-hoc networks that have nodes with varying antenna capabilities. While homogeneous ad-hoc networks with all nodes having the same antenna capabilities will have certain applications, we argue that ad-hoc networks with nodes having heterogeneous antenna capabilities are more likely to be the norm due to a variety of motivating factors. In the context of such heterogeneous smart antenna networks (HSANs), we investigate and motivate the need for a simple form of node cooperation called retransmit diversity.

We show that while such a simple form of node cooperation cannot bring significant benefits to homogeneous omni-directional and smart antenna networks, they can bring several folds improvement to heterogeneous smart antenna networks. We then present several key properties pertaining to node cooperation in HSANs. In the process, we identify a fundamental trade-off between exploiting smart antenna gain and cooperation gain, that undermines the ability of HSANs to leverage node cooperation to their maximum potential. 

To address this tradeoff, we then present an adaptive cooperation mechanism and incorporate this mechanism through the design of a simple but efficient MAC protocol. The performance of the MAC protocol is evaluated through ns2 simulations.

DYNAMIC CLUSTERING-BASED ADAPTIVE MOBILE GATEWAY MANAGEMENT IN INTEGRATED VANET – 3G HETEROGENEOUS WIRELESS NETWORKS

ABSTRACT

Coupling the high data rates of IEEE 802.11p-based VANETs and the wide coverage area of 3GPP networks (e.g., UMTS), this paper envisions a VANET-UMTS integrated network architecture. In this architecture, vehicles are dynamically clustered according to different related metrics. From these clusters, a minimum number of vehicles, equipped with IEEE 802.11p and UTRAN interfaces, are selected as vehicular gateways to link VANET to UMTS. 

Issues pertaining to gateway selection, gateway advertisement and discovery, service migration between gateways (i.e., when serving gateways lose their optimality) are all addressed and an adaptive mobile gateway management mechanism is proposed. 

Simulations are carried out using NS2 to evaluate the performance of the envisioned architecture incorporating the proposed mechanisms. Encouraging results are obtained in terms of high data packet delivery ratios and throughput, reduced control packet overhead, and minimized delay and packet drop rates.

DYNAMIC CONflICT-FREE QUERY SCHEDULING FOR WIRELESS SENSOR NETWORKS

ABSTRACT

With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance query services in such networks. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networks and workloads, DCQS is specifically designed for query services supporting in-network data aggregation. 

DCQS has several important features. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedence constraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads and rate changes without explicitly reconstructing the transmission schedule. In addition, we provide an analytical capacity bound for DCQS in terms of query completion rate. 

This bound enables DCQS to handle overload through rate control. NS2 simulation results demonstrate that DCQS significantly outperforms a representative TDMA protocol (DRAND) and the 802.11 protocol in terms of query latency, throughput, and energy efficiency.

ON THE EFFECTIVENESS OF MONITORING FOR INTRUSION DETECTION IN MOBILE AD HOC NETWORKS

ABSTRACT

Several intrusion detection techniques (IDTs) proposed for mobile ad hoc networks rely on each node passively monitoring the data forwarding by its next hop. This paper presents quantitative evaluations of false positives and their impact on monitoring-based intrusion detection for ad hoc networks. 

Experimental results show that, even for a simple three-node configuration, an actual adhoc network suffers from high false positives; these results are validated by Markov and probabilistic models. However, this false positive problem cannot be observed by simulating the same network using popular ad hoc network simulators, such as ns-2, OPNET or Glomosim. To remedy this, a probabilistic noise generator model is implemented in the Glomosim simulator. 

With this revised noise model, the simulated network exhibits the aggregate false positive behavior similar to that of the experimental testbed. Simulations of larger (50-node) ad hoc networks indicate that monitoring-based intrusion detection has very high false positives. These false positives can reduce the network performance or increase the overhead. In a simple monitoring-based system where no secondary and more accurate methods are used, the false positives impact the network performance in two ways: reduced throughput in normal networks without attackers and inability to mitigate the effect of attacks in networks with attackers.

EFfiCIENT TARGET TRACKING THROUGH BINARY-DETECTION IN SPARSELY DEPLOYED WSN

ABSTRACT

The problem of tracking moving objects with help of wireless sensor network (WSN) has been studied in past. Most of the solutions rely on the use of specialized and expensive sensors, and on dense deployment of sensors. These techniques are infeasible for applications in low budget domains. In this paper, we propose two novel techniques to track targets using binary sensing that does not need overlapping sensing regions. These techniques can track a target, and estimate the distance it has traversed on the basis of the time that target spends in the vicinity of sensors. In the first technique, the path traced by a moving target is approximated by tangent estimations to three circles, each representing range of a sensor. It allows us to convert the original problem into a semi definite program. The other tracking scheme identifies a band of small width where the target is guaranteed to lie. The band is first approximated using the distance travelled after coming out of vicinity of one sensor and before entering the vicinity of second sensor. This band is then reduced using the distance travelled inside the vicinity of the sensors. We simulated the two methods in NS2 and evaluate both the methods.

OPTIMAL ROUTE SELECTION METHOD WITH SATELLITE SYSTEM FOR COGNITIVE WIRELESS NETWORK IN DISASTER INFORMATION NETWORK 

ABSTRACT 

Cognitive wireless network consisted of multiple different types of wireless interface is one of efficient wireless transmission methods for Disaster Information Network, because it solves single wireless network problems like characteristics of wireless frequency or congestion form the use of same radio frequency.  However, even if Disaster Information Network consisted of Cognitive Wireless Network, some of wireless node might be broken after severe disaster is happened. Therefore, it is necessary  to consider about additional functions which the system never die. In this paper, we introduce Satellite System for optimal transmission control method in Cognitive Wireless Network in order to consider with severe disaster. 

First, as our previous study, proper wireless link and route selection is held by Extend AHP and Extend AODV with Min-Max AHP value methods for optimal transmission control in Cognitive Wireless Network.  Then, check-alive function, alternate data transmission function, possible alternative route suggestion, and network reconfiguration are introduced to our proposed Disaster Information Network by using Satellite System.  

In the simulation, ns2 are used for the computational results to the effectiveness of the suggested transmission methods in the hybrid system of cognitive wireless and satellite network system. 

QUALITY OF SERVICE-BASED MULTI-DOMAIN ROUTING UNDER MULTIPLE QUALITY OF SERVICE METRICS

ABSTRACT

Applications such as voice and video require network paths that satisfy several different quality of service (QoS) metrics, such as delay, jitter, packet loss rate and availability. The calculation of paths under multiple QoS metrics, such as the above four metrics, is a difficult problem since these metrics are in general incompatible. The authors propose a simple method for combining the above four QoS metrics into a single composite QoS metric which can be used as a link cost in Dijkstra’s algorithm in order to calculate a path. 

The authors evaluated the proposed method in a multi-domain routing environment where domain reachability information is available through a service oriented architecture paradigm, and they show that it outperforms two commonly used methods. The results are also applicable to routing within a single domain.

TRANSIENT ANALYSIS OF IEEE 802.15.4 SENSOR NETWORKS

ABSTRACT

We study the delay performance of a sensor network, whose nodes access the medium by using the unslotted MAC protocol specified by the IEEE 802.15.4 standard. Unlike previous works, which focus on the average throughput and delay analysis, we develop a detailed model that allows us to obtain the delivery delay distribution of messages sent by concurrently contending sensors toward a central controller. 

We carry out a transient analysis that is of particular interest when sensor networks are deployed to provide coverage for real-time applications, and we study both single- and multi-hop network topologies. We validate our analytical results against simulation results obtained through ns2.

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

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 

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.  

EFFICIENT MULTICAST ALGORITHMS FOR MULTICHANNEL WIRELESS MESH NETWORKS

ABSTRACT

The wireless mesh network is an emerging technology that provides high quality service to end users as the “last mile” of the Internet. Furthermore, multicast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes. However, unlike other wireless networks, such as sensor networks and MANETs, where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, wireless mesh networks need to maximize throughput. 

This paper proposes two multicast algorithms: the Level Channel Assignment (LCA) algorithm and the Multichannel Multicast (MCM) to improve the throughput for multichannel and multi-interface mesh networks. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. We also demonstrate that using partially overlapping channels can further diminish the interference. 

Furthermore, additional interfaces help to increase the bandwidth, and multiple gateways can further shorten the total hop count distance. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.

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

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