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

Rusli, Mohd Ezanee; Harris, Richard; Punchihewa, Amal

doi:10.1109/tencon.2010.5686003

Cited by 13 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm of relay-terminal selection is a typical multi-objective decision algorithm that takes into account many aspects of factors, and makes the most reasonable target terminal selection decisions [12], [13]. The prediction function (x ),a {1, 2,..., } a fm  represents relay-terminal selection cost.…”

Section: Relay-terminal Selection Based On Analytic Hierarchy Prmentioning

confidence: 99%

A Packet Forwarding Protocol in Coal Mine Opportunistic Networks

Zou¹,

Yu²,

Li³

et al. 2016

jcm

View full text Add to dashboard Cite

A packet forwarding protocol based on terminals' Markov mobility model (TMM) is proposed for coal mine poor connectivity in opportunistic networks since its complex environment. First, a Markov model is established for predicting the probability of terminals' encounter. Then the network-delay in the condition of next selected relay-terminal (NDT), the probability of terminal encounter with destination (PTD) and the terminal diffusion range (TDR) are calculated based on the model, by which the best relay-terminal can be obtained to receive data packet based on Analytic Hierarchy Process (AHP). Theoretical analysis and simulation results show that the proposed protocol has a better performance in terms of delay and overhead compared with Flooding and HMPR method, and it's more suitable for coal mine opportunistic networks.

show abstract

Section: Relay-terminal Selection Based On Analytic Hierarchy Prmentioning

confidence: 99%

A Packet Forwarding Protocol in Coal Mine Opportunistic Networks

Zou¹,

Yu²,

Li³

et al. 2016

jcm

View full text Add to dashboard Cite

show abstract

“…Sharif et al, [23] presented a new transport layer protocol that prioritizes sensed information based on its nature while simultaneously supporting the data reliability and congestion control features. Rusli et al, [24] 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 WSNs. Koulali et al, [25] propose a hybrid QoS routing protocol for wireless sensor networks based on a customized Distributed Genetic Algorithm (DGA) that accounts for delay and energy constraints.…”

Section: Related Workmentioning

confidence: 99%

Real-Time Link-Reliability Routing for QoS in Wireless Sensor Networks

T¹,

Raja²,

Venugopal³

et al. 2014

IOSRJCE

View full text Add to dashboard Cite

This paper proposes a Real-Time Link Reliability Routing protocol for wireless sensor networks (WSNs). The protocol achieves to reduce packet deadline miss ratio while considering link reliability, two-hop velocity and power efficiency and utilizes memory and computational effective methods for estimating the link metrics. Numerical results provide insights that the protocol has a lower packet deadline miss ratio and improved sensor network lifetime. The results show that the proposed protocol is a feasible solution to the QoS routing problem in wireless sensor networks that support real-time applications.

show abstract

“…Sharif et al, [4] presented a new transport layer protocol that prioritizes sensed information based on its nature while simultaneously supporting the data reliability and congestion control features. Rusli et al, [23] 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 WSNs. Koulali et al, [21] propose a hybrid QoS routing protocol for WSNs based on a customized Distributed Genetic Algorithm (DGA) that accounts for delay and energy constraints.…”

Section: Related Workmentioning

confidence: 99%

Real-Time Traffic-Differentiated QoS Routing for Wireless Sensor Networks

PrakashT¹,

Raja²,

Venugopal³

2014

IJCA

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large scale networked embedded systems. However, WSNs system designers must fulfill the Qualityof-Service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs. This paper proposes a Real-Time Traffic-Differentiated Routing protocol for Wireless Sensor Networks (WSNs). It targets WSN applications having different types of data traffic with several priorities. The protocol achieves to increase packet reception ratio and reduce end-to-end delay while considering multi-queue priority policy, two-hop neighborhood information, link reliability and power efficiency. The protocol is modular and utilizes memory and computational effective methods for estimating the link metrics. Numerical results show that the proposed protocol is a feasible solution to addresses QoS service differentiation for traffic with different priorities.

show abstract

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

Cited by 13 publications

References 19 publications

A Packet Forwarding Protocol in Coal Mine Opportunistic Networks

A Packet Forwarding Protocol in Coal Mine Opportunistic Networks

Real-Time Link-Reliability Routing for QoS in Wireless Sensor Networks

Real-Time Traffic-Differentiated QoS Routing for Wireless Sensor Networks

Contact Info

Product

Resources

About