NS2 IEEE PROJECT 2012
NS2-IEEE PROJECT TITLES
Neutral Information Technology
No.1/18, OVM Complex, 2nd Floor,
Twad Board Colony, Natham Main Road,
Near E.M.G.Yadava Women’s College, Thiruppalai,
Madurai – 625 014.
Mobile : 9176449746
Phone: 0452 – 2683133
Email: info@neutralin.com
Website: www.neutralin.com
NS2-IEEE 2012 TITLES
1. Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network
2. ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing
3. Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs
4. Balancing the Tradeoffs between Query Delay and Data Availability in MANETs
5. Detection and Localization of Multiple Spoofing Attackers in Wireless Networks
6. TAM: A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks
7. The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks
8. CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks
9. Fast Data Collection in Tree-Based Wireless Sensor Networks
10. Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
11. Hop-By-Hop Routing In Wireless Mesh Networks with Bandwidth Guarantees
12. Cut Detection in Wireless Sensor Networks
NS2-IEEE 2011 TITLES download
1. Fast Detection of Mobile Replica Node Attacks In Wireless Sensor Networks Using Sequential Hypothesis Testing – June 2011
NS2-IEEE 2010 TITLES
1. SSUM: Smart Server Update Mechanism for Maintaining Cache Consistency In Mobile Environments – June 2010
2. Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes – July 2010
3. Optimize Storage Placement in Sensor Networks- Oct 2010
4. Minimizing Delay and Maximizing Lifetime for Wireless Sensor Networks with Any Cast– April 2010
5. Mitigating Selective Forwarding Attacks with A Channel-Aware Approach In WMNS- May 2010
6. A Cooperative Diversity-Based Robust Mac Protocol In Wireless Ad Hoc Networks- May 2010
CONFERENCE PAPERS 2010
7. A Fault Tolerant Communication Architecture Supporting Critical Monitoring With Wireless Sensor Networks– March 2010
NS2-IEEE 2012 TITLES – MOBILE COMPUTING
ABSTRACT
1 Fast Data Collection in Tree-Based Wireless Sensor Networks – Jan. 2012 How fast can information be collected from a wireless sensor network organized as tree. To address this, we explore and evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as convergecast. We first consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule length) to complete a convergecast. Next, we combine scheduling with transmission power control to mitigate the effects of interference, and show that while power control helps in reducing the schedule length under a single frequency, scheduling transmissions using multiple frequencies is more efficient. We give lower bounds on the schedule length when interference is completely eliminated, and propose algorithms that achieve these bounds.
2 Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks– Jan 2012 This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with POR.
3 Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network- Feb 2012 In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation.
4 Hop-By-Hop Routing In Wireless Mesh Networks with Bandwidth Guarantees – Feb 2012 Wireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known bottleneck metric in wired networks, is neither concave nor additive in wireless networks. We propose a new path weight which captures the available path bandwidth information. We formally prove that our hop-by-hop routing protocol based on the new path weight satisfies the consistency and loop-freeness requirements. The consistency property guarantees that each node makes a proper packet forwarding decision, so that a data packet does traverse over the intended path.
DEPENDABLE SECURE COMPUTING – IEEE 2012
ABSTRACT
1 ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing – Jul-Aug 2012 In wireless sensor networks, an adversary can physically capture and compromise sensor nodes and then mount a variety of attacks. To minimize the damage incurred by compromised nodes, the system should detect and revoke them as soon as possible. Proposed a zone-based node compromise detection scheme in sensor networks. The main idea of the proposed scheme is to use sequential hypothesis testing to detect suspect regions in which compromised nodes are likely placed.
2 Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs The multihop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks, and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions.
PARALLEL DISTRIBUTED SYSTEMS– IEEE 2012
ABSTRACT
1 Balancing the Tradeoffs between Query Delay and Data Availability in MANETs – April 2012 To propose data replication techniques to address query delay and data availability issues. As both metrics are important for mobile nodes, propose a technique to balance the tradeoffs between data availability and query delay under different system settings and requirements.
2 Detection and Localization of Multiple Spoofing Attackers in Wireless Networks Wireless spoofing attacks are easy to launch and can significantly impact the performance of networks. Although the identity of a node can be verified through cryptographic authentication, conventional security approaches are not always desirable because of their overhead requirements. In this paper, we propose to use spatial information, a physical property associated with each node, hard to falsify, and not reliant on cryptography, as the basis for (1) detecting spoofing attacks; (2) determining the number of attackers when multiple adversaries masquerading as a same node identity; and (3) localizing multiple adversaries. We propose to use the spatial correlation of received signal strength (RSS) inherited from wireless nodes to detect the spoofing attacks. We then formulate the problem of determining the number of attackers as a multi-class detection problem. Cluster-based mechanisms are developed to determine the number of attackers. When the training data is available, we explore using Support Vector Machines (SVM) method to further improve the accuracy of determining the number of attackers. In addition, we developed an integrated detection and localization system that can localize the positions of multiple attackers. We evaluated our techniques through two testbeds using both an 802.11 (WiFi) network and an 802.15.4 (ZigBee) network in two real office buildings.
3 Cut Detection in Wireless Sensor Networks A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut.” Aim is detecting cuts by the remaining nodes of a wireless sensor network. Proposed algorithm allows 1) every node to detect when the connectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut.
4 The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient data accumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However, in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment and authentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates a new security challenge: in the basic probabilistic and q-composite key predistribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network by deploying a replicated mobile sink preloaded with some compromised keys.
NETWORK AND SERVICE MANAGEMENT– IEEE 2012
ABSTRACT
1 TAM: A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks Ad-hoc networks are becoming an effective tool for many mission critical applications such as troop coordination in a combat field, situational awareness, etc. These applications are
Characterized by the hostile environment that they serve in and by the multicast-style of communication traffic. Therefore, authenticating the source and ensuring the integrity of the message traffic become a fundamental requirement for the operation and management of the network. However, the limited computation and communication resources, the large scale deployment and the unguaranteed connectivity to trusted authorities make known
solutions for wired and single-hop wireless networks inappropriate. This paper presents a new Tiered Authentication scheme for Multicast traffic (TAM) for large scale dense ad-hoc networks.
COMMUNICATIONS– IEEE 2012
ABSTRACT
1 CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks The link quality variation of wireless channels has been a challenging issue in data communications until recent explicit exploration in utilizing this characteristic. The same broadcast transmission may be perceived significantly differently, and usually independently, by receivers at different geographic locations. Furthermore, even the same stationary receiver may experience drastic link quality fluctuation over time. The combination of link-quality variation with the broadcasting nature of wireless channels has revealed a direction in the research of wireless networking, namely, cooperative communication. Research on cooperative communication started to attract interests in the
community at the physical layer but more recently its importance and usability have also been realized at upper layers of the network protocol stack. In this article, we tackle the problem of opportunistic data transfer in mobile ad hoc networks. Our solution is called Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN).
NS2-IEEE 2011 TITLES
MOBILE COMPUTING
ABSTRACT
1 FAST DETECTION OF MOBILE REPLICA NODE ATTACKS IN WIRELESS SENSOR NETWORKS USING SEQUENTIAL HYPOTHESIS TESTING – June 2011 Unattended nature of wireless sensor networks leads to mobile replica node attack. An adversary can capture and compromise sensor nodes, make replicas of them, and then mount a variety of attacks with these replicas. These replica node attacks are dangerous because they allow the attacker to leverage the compromise of a few nodes to exert control over much of the network. Previous works on replica detection rely on fixed sensor locations and hence do not work in mobile sensor networks. The proposed work is a fast and effective mobile replica node detection scheme using the Sequential Probability Ratio Test.
NS2-IEEE 2010 TITLES
MOBILE COMPUTING
ABSTRACT
1 SSUM: SMART SERVER UPDATE MECHANISM FOR MAINTAINING CACHE CONSISTENCY IN MOBILE ENVIRONMENTS – JUNE 2010
This paper proposes a cache consistency scheme based on a previously proposed architecture for caching database data in MANETs. The original scheme for data caching stores the queries that are submitted by requesting nodes in special nodes, called query directories (QDs), and uses these queries to locate the data (responses) that are stored in the nodes that requested them, called caching nodes (CNs). The consistency scheme is server-based in which control mechanisms are implemented to adapt the process of caching a data item and updating it by the server to its popularity and its data update rate at the server. The system implements methods to handle disconnections of QD and CN nodes from the network and to control how the cache of each node is updated or discarded when it returns to the network. Estimates for the average response time of node requests and the average node bandwidth utilization are derived in order to determine the gains (or costs) of employing our scheme in the MANET. Moreover, ns2 simulations were performed to measure several parameters, like the average data request response time, cache update delay, hit ratio, and bandwidth utilization. The results demonstrate the advantage of the proposed scheme over existing systems.
2 SECURE DATA COLLECTION IN WIRELESS SENSOR NETWORKS USING RANDOMIZED DISPERSIVE ROUTES – JULY 2010 Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes formed by these attacks. We argue that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once an adversary acquires the routing algorithm, it can compute the same routes known to the source, and hence endanger all information sent over these routes. In this paper, we develop mechanisms that generate randomized multipath routes. Under our design, the routes taken by the “shares” of different packets change over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the routes generated by our mechanisms are also highly dispersive and energy-efficient, making them quite capable of bypassing black holes at low energy cost. Extensive simulations are conducted to verify the validity of our mechanisms.
3 OPTIMIZE STORAGE PLACEMENT IN SENSOR NETWORKS- OCT 2010 Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introduced in this paper to store the data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all data to a central place for archiving and reduce the communication cost induced by the network query. The objective of this paper is to address the storage node placement problem aiming to minimize the total energy cost for gathering data to the storage nodes and replying queries. We examine deterministic placement of storage nodes and present optimal algorithms based on dynamic programming. Further, we give stochastic analysis for random deployment and conduct simulation evaluation for both deterministic and random placements of storage nodes.
NETWORKING
4 MINIMIZING DELAY AND MAXIMIZING LIFETIME FOR WIRELESS SENSOR NETWORKS WITH ANY CAST– April 2010 In this paper, we are interested in minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks for which events occur infrequently. In such systems, most of the energy is consumed when the radios are on, waiting for a packet to arrive. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of these energy-constrained wireless sensor networks. However, sleep-wake scheduling could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An interesting line of work attempts to reduce these delays by developing ¿anycast¿-based packet forwarding schemes, where each node opportunistically forwards a packet to the first neighboring node that wakes up among multiple candidate nodes. In this paper, we first study how to optimize the anycast forwarding schemes for minimizing the expected packet-delivery delays from the sensor nodes to the sink. Based on this result, we then provide a solution to the joint control problem of how to optimally control the system parameters of the sleep-wake scheduling protocol and the anycast packet-forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet-delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under practical scenarios where there are obstructions, e.g., a lake or a mountain, in the coverage area of the wireless sensor network
WIRELESS COMMUNICATIONS
5 MITIGATING SELECTIVE FORWARDING ATTACKS WITH A CHANNEL-AWARE APPROACH IN WMNS- MAY 2010 In this paper, we consider a special case of denial of service (DoS) attack in wireless mesh networks (WMNs) known as selective forwarding attack (a.k.a gray hole attacks). With such
an attack, a misbehaving mesh router just forwards a subset of the packets it receives but drops the others. While most of the existing studies on selective forwarding attacks focus on attack detection under the assumption of an error-free wireless channel, we consider a more practical and challenging scenario that packet dropping may be due to an attack, or normal loss events such as medium access collision or bad channel quality. Specifically, we develop a channel aware detection (CAD) algorithm that can effectively identify the selective forwarding misbehavior from the normal channel losses. The CAD algorithm is based on two strategies, channel estimation and traffic monitoring. If the monitored loss rate at certain hops exceeds the estimated normal loss rate, those nodes involved will be identified as attackers. Moreover, we carry out analytical studies to determine the optimal detection thresholds that minimize the summation of false alarm and missed detection probabilities. We also compare our CAD approach with some existing solutions, through extensive computer simulations, to demonstrate the efficiency of discriminating selective forwarding attacks from normal channel losses.
PARALLEL AND DISTRIBUTED SYSTEMS
6 A COOPERATIVE DIVERSITY-BASED ROBUST MAC PROTOCOL IN WIRELESS AD HOC NETWORKS- MAY 2010 In interference-rich and noisy environment, wireless communication is often hampered by unreliable communication links. Recently, there has been active research on cooperative communication that improves the communication reliability by having a collection of radio terminals transmit signals in a cooperative way. This paper proposes a medium access control (MAC) algorithm, called Cooperative Diversity MAC (CD-MAC), which exploits the cooperative communication capability of the physical (PHY) layer to improve robustness in wireless ad hoc networks. In CD-MAC, each terminal proactively selects a partner for cooperation and lets it transmit simultaneously so that this mitigates interference from nearby terminals and thus improves the network performance. For practicability, CD-MAC is designed based on the widely adopted IEEE 802.11 MAC. For accurate evaluation, this study presents and uses a realistic reception model by taking bit error rate (BER), derived from Intersil HFA3861B radio hardware, and the corresponding frame error rate (FER) into consideration. System-level simulation study shows that CD-MAC significantly outperforms the original IEEE 802.11 MAC in terms of packet delivery ratio and end-to-end delay.
CONFERENCE PAPERS
7 A FAULT TOLERANT COMMUNICATION ARCHITECTURE SUPPORTING CRITICAL MONITORING WITH WIRELESS SENSOR NETWORKS– MARCH 2010 This paper deals with an integrated MAC and Routing protocol, able to manage faults occurring in Wireless Sensor Network (WSN). To this end, the protocol design has been inspired by the cross-layer principle to minimize both the signaling overhead and power consumption. After an accurate functional characterization, the performance is presented for the most relevant figures (recovering efficiency and latency, as well as the length of established end-to-end paths). The satisfactory results suggest the application to more complex scenarios where the nodes mobility is allowed.
Comments are closed.