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

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

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.
Optimizing Cloud Resources for Delivering IPTV Services Through Virtualization.
Toward a Statistical Framework for Source Anonymity in Sensor 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.
Personalized QoS-Aware Web Service Recommendation and Visualization.
WARNINGBIRD: A Near Real-time Detection System for Suspicious URLs in Twitter Stream.
Crowdsourcing Predictors of Behavioral Outcomes. Abstract Generating models from large data sets—and deter¬mining which subsets of data to mine—is becoming.
Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs.
Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.
A Survey of Mobile Cloud Computing Application Models
Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment.
Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.
Incentive Based Data Sharing in Delay Tolerant Mobile Networks.
BestPeer++: A Peer-to-Peer Based Large-Scale Data Processing Platform.
Improving Network I/O Virtualization for Cloud Computing.
Privacy Preserving Data Sharing With Anonymous ID Assignment
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
m-Privacy for Collaborative Data Publishing
Tweet Analysis for Real-Time Event Detection and Earthquake Reporting System Development.
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.
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.
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.
Document Clustering for Forensic Analysis: An Approach for Improving Computer Inspection.
A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.
Bandwidth Distributed Denial of Service: Attacks and Defenses.
Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks.
Clustering Sentence-Level Text Using a Novel Fuzzy Relational Clustering Algorithm.
Participatory Privacy: Enabling Privacy in Participatory Sensing
Preventing Private Information Inference Attacks on Social Networks.
Video Dissemination over Hybrid Cellular and 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.
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.
m-Privacy for Collaborative Data Publishing
Attribute-Based Encryption With Verifiable Outsourced Decryption.
A New Algorithm for Inferring User Search Goals with Feedback Sessions.
Data Mining with Big Data. Abstract Big Data concerns large-volume, complex, growing data sets with multiple, autonomous sources. With the fast development.
Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Security Analysis of a Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption Scheme.
Privacy-Preserving and Content-Protecting Location Based Queries.
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.
Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.
Spatial Approximate String Search. Abstract This work deals with the approximate string search in large spatial databases. Specifically, we investigate.
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
Presentation transcript:

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

Abstract We propose a model for the energy consumption of a node as a function of its throughput in a wireless CSMA network. We first model a single-hop network, and then a multi-hop network. We show that operating the CSMA network at a high throughput is energy inefficient since unsuccessful carrier sensing attempts increase the energy consumption per transmitted bit. Operating the network at a low throughput also causes energy inefficiency because of increased sleeping duration. Achieving a balance between these two opposite operating regimes, we derive the energy-optimum carrier-sensing rate and the energy-optimum throughput which maximize the number of transmitted bits for a given energy budget. For the single-hop case, we show that the energy-optimum total throughput increases as the number of nodes sharing the channel increases. For the multi-hop case, we show that energy-optimum throughput decreases as the degree of the conflict graph corresponding to the network increases. For both cases, the energy-optimum throughput reduces as the power required for carrier-sensing increases. The energy-optimum throughput is also shown to be substantially lower than the maximum throughput and the gap increases as the degree of the conflict graph increases for multi-hop networks.

Existing System To improve the battery lifetimes of wireless devices and due to environmental considerations, the energy efficiency of wireless communication protocols has to be improved. There are many wireless communications pro¬tocols that employ a variant of the carrier sense multiple access protocol (CSMA) due to its simple and distributed nature (e.g., the IEEE for WLANs, IEEE for WPANs and B-MAC for sensor networks [1]). We here find the optimum carrier-sensing rate and throughput which maximizes the number of transmitted bits in a wireless CSMA network for a fixed energy budget. Recently, carrier-sensing rate adaptation algorithms have been devised to achieve throughput-optimality in a CSMA network [2]. In these algorithms, each node senses the chan¬nel at a rate which increases with its packet queue length (or virtual queue length). As packet queues grow, the nodes may sense the channel at arbitrarily high rates. However, the increased energy consumption due to such increased carrier-sensing rate has not been investigated to the best of our knowledge. We here aim to quantify the relationship between sensing rate, throughput and energy consumption in a CSMA 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

C ONCLUSION We proposed an energy consumption model of a node in a CSMA network. The proposed model shows that the num¬ber of failed carrier sensing attempts significantly increases at high throughputs causing energy waste. On the con¬trary, at low throughputs, nodes sleep during most of their lifetimes which also results in energy waste as far as the energy per transmitted bit is considered. We derived the energy-optimum carrier sensing rate and the corresponding energy-optimum throughput for both a single-hop network and a multi-hop network. For single-hop networks, we observe that the energy- optimum throughput increases with the number of nodes sharing the channel. On the other hand, the energy- optimum throughput reduces with the degree of the conflict graph for multi-hop networks. For both the single-hop and multi-hop case, our results suggest that as the power required for carrier sensing increases, the energy-optimum sensing rate and throughput reduce. By proposing sev¬eral bounds, we show that the energy-optimum through¬put cannot exceed approximately half of the maximum throughput for the simulation parameters obtained from Mica2 measurements.

THANK YOU