Multi-hop scheduling and local data link aggregation dependant Qos in modeling and simulation of power-aware wireless sensor networks

Vasanth Iyer, S. S. Iyengar, Rama Murthy, Bertrand Hochet, Vir Phoha, M. B. Srinivas

Research output: Chapter in Book/Entry/PoemConference contribution

5 Scopus citations

Abstract

In this study of wireless sensor networks (WSN) protocols, the application Qos, system, and protocol performance metrics are measured for a large scalable wireless deployment using a typical wireless radio and an energy model. As there are many different types of WSN algorithms, we have categorized it into pro-active, re-active, and query driven information processing. A typical Qos is based on the useful lifetime of sensor nodes, after which reliability of the sensor data cannot be guaranteed and typically, a threshold such as a percentage of the sensor drains out of energy or a minimum through-put of real-time data from the sensor network is expected, which is used to compare the Qos of the routing algorithm. The results from lifetime based Qos, measured in simulation seconds, for the implemented protocols show that with varying sampled data sources for a BE Qos multi-hop deployment and varying percentage of cluster heads in a time synchronized deployment, the lifetime is based on network size and protocol invariant. However, low sensing ranges result in dense networks, and therefore, it becomes necessary to achieve an efficient medium-access protocol subjected to power constraints. Scalability of sensor network applications are based on energy energy-harvesting techniques in which the various layers of the network interoperate and extend the system network lifetime, the battery residual power per node, and the application reliability in terms of cross-layer energy savings. In this study, we have extended the lifetime metrics from a constant metrics into a break down of how much percentage of time is spent for Tx, Rx, and Idle tasks, respectively. This helps one to highlight the cross-layer energy dissipation per node and how the performance of an algorithm differs in terms of duty-cycling.

Original languageEnglish (US)
Title of host publicationProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
PublisherAssociation for Computing Machinery (ACM)
Pages844-848
Number of pages5
ISBN (Print)9781605585697
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 - Leipzig, Germany
Duration: Jun 21 2009Jun 24 2009

Publication series

NameProceedings of the 2009 ACM International Wireless Communications and Mobile Computing, Connecting the World Wirelessly, IWCMC 2009

Other

Other2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
Country/TerritoryGermany
CityLeipzig
Period6/21/096/24/09

Keywords

  • Algorithm complexity
  • Distributed algorithms
  • MAC layer duty-cycling
  • Power aware routing
  • Qos for link quality
  • Renewable energy resources
  • Wireless sensor network

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Fingerprint

Dive into the research topics of 'Multi-hop scheduling and local data link aggregation dependant Qos in modeling and simulation of power-aware wireless sensor networks'. Together they form a unique fingerprint.

Cite this