Skip Navigation

IEICE Transactions on Communications 2008 E91-B(4):1153-1157; doi:10.1093/ietcom/e91-b.4.1153
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by SUNG, S.
Right arrow Articles by KIM, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Fundamental Theories for Communications

Energy Consumption Analysis of the S-MAC Protocol with Contending Nodes under Unsaturated Conditions

Seokjin SUNG1, Seok WOO1 and Kiseon KIM1

1 The authors are with the Department of Information and Communications, Gwangju Institute of Science and Technology (GIST), Korea. E-mail: ssj75{at}gist.ac.kr


  Abstract

We analyze the energy consumption of the sensor-medium access control (S-MAC) protocol, where contending nodes exist. Because all nodes running the S-MAC within a virtual cluster always behave with a fixed frame length, the behavior should be analyzed based on its frame. Hence, reflecting the frame architecture, we first present an analytic model for the S-MAC behavior with a discrete-time Markov chain, and then we analyze energy consumption under unsaturated conditions.

Key Words: S-MAC protocol, frame occurrence probability

Manuscript received November 1, 2007. Manuscript revised December 21, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.