By Topic

Markov Chain-based analytical model of Opportunistic Routing protocol for wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rusli, M.E. ; Sch. of Eng. & Adv. Technol., Massey Univ., Palmerston North, New Zealand ; Harris, R. ; Punchihewa, A.

In a resource constrained wireless sensor network (WSN), communication tasks can be expensive in terms of power consumption. Thus, when good communication is required, a mechanism that can maximize the chances of a successful transmission of information via wireless network is very desirable. The Opportunistic Routing (OR) protocol has been proposed as an alternative and efficient method for exploiting the spatial and temporal characteristics of a wireless network. In this paper, we propose an analytical framework model based on Markov Chain of OR and M/D/l/K queue to measure its performance in term of end-to-end delay and reliability in wireless sensor network. The performance predicted by the proposed framework is validated through simulation and is in very good agreement. We also discuss the enhancement strategy on OR to achieve better QoS guarantee in term of delay constraint.

Published in:

TENCON 2010 - 2010 IEEE Region 10 Conference

Date of Conference:

21-24 Nov. 2010