Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.

Slides:

Advertisements

Similar presentations

Bandwidth Estimation for IEEE Based Ad Hoc Networks.

Advertisements

ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.

Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.

CloudMoV: Cloud-based Mobile Social TV

On the Node Clone Detection inWireless Sensor Networks.

Toward a Statistical Framework for Source Anonymity in Sensor Networks.

Abstract Cloud data center management is a key problem due to the numerous and heterogeneous strategies that can be applied, ranging from the VM placement.

Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.

Abstract Load balancing in the cloud computing environment has an important impact on the performance. Good load balancing makes cloud computing more.

A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.

Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.

Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs.

Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.

Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.

A Survey of Mobile Cloud Computing Application Models

Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment.

Fast Nearest Neighbor Search with Keywords. Abstract Conventional spatial queries, such as range search and nearest neighbor retrieval, involve only conditions.

Understanding the External Links of Video Sharing Sites: Measurement and Analysis.

Security Evaluation of Pattern Classifiers under Attack.

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.

Incentive Based Data Sharing in Delay Tolerant Mobile Networks.

Improving Network I/O Virtualization for Cloud Computing.

Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.

m-Privacy for Collaborative Data Publishing

PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System

EAACK—A Secure Intrusion-Detection System for MANETs

A Fast Clustering-Based Feature Subset Selection Algorithm for High- Dimensional Data.

Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.

Optimal Client-Server Assignment for Internet Distributed Systems.

Protecting Sensitive Labels in Social Network Data Anonymization.

Hiding in the Mobile Crowd: Location Privacy through Collaboration.

LARS*: An Efficient and Scalable Location-Aware Recommender System.

Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.

Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.

Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.

Identity-Based Distributed Provable Data Possession in Multi-Cloud Storage.

Content Sharing over Smartphone-Based Delay- Tolerant Networks.

Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.

A System for Denial-of- Service Attack Detection Based on Multivariate Correlation Analysis.

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.

Privacy Preserving Delegated Access Control in Public Clouds.

Anomaly Detection via Online Over-Sampling Principal Component Analysis.

A Method for Mining Infrequent Causal Associations and Its Application in Finding Adverse Drug Reaction Signal Pairs.

A Generalized Flow-Based Method for Analysis of Implicit Relationships on Wikipedia.

Keyword Query Routing.

A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.

Bandwidth Distributed Denial of Service: Attacks and Defenses.

Facilitating Document Annotation using Content and Querying Value.

Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks.

Participatory Privacy: Enabling Privacy in Participatory Sensing

Preventing Private Information Inference Attacks on Social Networks.

Video Dissemination over Hybrid Cellular and Ad Hoc Networks.

DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.

Supporting Privacy Protection in Personalized Web Search.

Twitsper: Tweeting Privately. Abstract Although online social networks provide some form of privacy controls to protect a user's shared content from other.

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.

A New Algorithm for Inferring User Search Goals with Feedback Sessions.

Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.

Privacy-Preserving and Content-Protecting Location Based Queries.

Energy-Efficient Protocol for Cooperative Networks.

Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks.

Load Rebalancing for Distributed File Systems in Clouds.

Facilitating Document Annotation Using Content and Querying Value.

Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.

Dynamic Query Forms for Database Queries. Abstract Modern scientific databases and web databases maintain large and heterogeneous data. These real-world.

Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.

Spatial Approximate String Search. Abstract This work deals with the approximate string search in large spatial databases. Specifically, we investigate.

Presentation transcript:

Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks

Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks: energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER, on the other hand, is an energy-efficient routing algorithm which finds routes minimizing the total energy required for end-to-end packet traversal. RMER and RMECR are proposed for networks in which either hop-by- hop or end-to-end retransmissions ensure reliability. Simulation studies show that RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending the operational lifetime of the network. This makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks. In the design of RMECR, we consider minute details such as energy consumed by processing elements of transceivers, limited number of retransmissions allowed per packet, packet sizes, and the impact of acknowledgment packets. This adds to the novelty of this work compared to the existing studies.

Existing System Energy-efficient routing is an effective mechanism for reducing energy cost of data communication in wireless ad hoc networks. Generally, routes are discovered con¬sidering the energy consumed for end-to- end (E2E) packet traversal. Nevertheless, this should not result in finding less reliable routes or overusing a specific set of nodes in the network. Energy-efficient routing in ad hoc networks is neither complete nor efficient without the consideration of reliability of links and residual energy of nodes. Finding reliable routes can enhance quality of the service. Whereas, considering the residual energy of nodes in routing can avoid nodes from being overused and can eventually lead to an increase in the operational lifetime of the network.

Architecture Diagram

System Specification HARDWARE REQUIREMENTS Processor : Intel Pentium IV Ram : 512 MB Hard Disk : 80 GB HDD SOFTWARE REQUIREMENTS Operating System : Windows XP / Windows 7 FrontEnd : Java BackEnd : MySQL 5

Conclusion We presented an in-depth study of energy-aware routing in ad hoc networks, and we proposed a new routing algorithm for wireless ad hoc networks, namely, reliable minimum energy cost routing (RMECR). RMECR can increase the operational lifetime of the network using energy- efficient and reliable routes. In the design of RMECR, we used a detailed energy consumption model for packet transfer in wireless ad hoc networks. RMECR was designed for two types of networks: those in which hop-by-hop retransmis¬sions ensure reliability and those in which end- to-end retransmissions ensure reliability. The general approach that we used in the design of RMECR was used to also devise a state-of-the-art energy-efficient routing algorithm for wireless ad hoc networks, i.e., reliable minimum energy routing (RMER). RMER finds routes minimizing the energy consumed for packet traversal. RMER does not consider the remaining battery energy of nodes, and was used as a benchmark to study the energy- efficiency of the RMECR algorithm. Extensive simulations showed that RMER not only saves more energy compared to existing energy- efficient routing algorithms, but also increases the reliability of wireless ad hoc networks. Furthermore, we observed that RMECR finds routes that their energy-efficiency and reliability are almost similar to that of routes discovered by RMER. However, RMECR also extends the network lifetime by directing the traffic to nodes having more amount of battery energy. We are in the process of implementing the proposed algorithms on a test bed to study the impact of varying conditions on the performance of these algorithms.

THANK YOU