TO GET MORE DETAILS ABOUT THE LISTED IEEE 2010 PROJECT TITLE, REGISTER HERE

We provide NS2 Projects assistant for B.E, B.Tech, M.E/M.Tech, M.S students. We assist project network simulator tool like NS2. For more information on NS2 Project, please call us 09600095047. We will also develop you own concepts & IEEE papers in NS2. IEEE 2010 NS2 projects are available.

SSUM: SMART SERVER UPDATE MECHANISM FOR MAINTAINING CACHE CONSISTENCY IN MOBILE ENVIRONMENTS

SSUM: Smart Server Update Mechanism For Maintaining Cache Consistency In Mobile Environments

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.

OPTIMIZE STORAGE PLACEMENT IN SENSOR NETWORKS

Optimize Storage Placement In Sensor Networks

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.

A COOPERATIVE DIVERSITY-BASED ROBUST MAC PROTOCOL IN WIRELESS AD HOC NETWORKS

A Cooperative Diversity-Based Robust Mac Protocol In Wireless Ad Hoc Networks
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.

MINIMIZING DELAY AND MAXIMIZING LIFETIME FOR WIRELESS SENSOR NETWORKS WITH ANY CAST

Minimizing Delay And Maximizing Lifetime For Wireless Sensor Networks With Any Cast
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

A FAULT TOLERANT COMMUNICATION ARCHITECTURE SUPPORTING CRITICAL MONITORING WITH WIRELESS SENSOR NETWORKS


A Fault Tolerant Communication Architecture Supporting Critical Monitoring With Wireless Sensor Networks
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.