Lightweight opportunistic routing forwarding strategy based on Markov chain
A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequ...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2017-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017105/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539537966202880 |
|---|---|
| author | Feng LI Ya-li SI Zhen CHEN Li-min SHEN |
| author_facet | Feng LI Ya-li SI Zhen CHEN Li-min SHEN |
| author_sort | Feng LI |
| collection | DOAJ |
| description | A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio. |
| format | Article |
| id | doaj-art-cfd90d5c306a4098836295b0f0a2bd76 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2017-05-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-cfd90d5c306a4098836295b0f0a2bd762025-01-14T07:12:24ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2017-05-013810812059710304Lightweight opportunistic routing forwarding strategy based on Markov chainFeng LIYa-li SIZhen CHENLi-min SHENA lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017105/opportunistic networkMarkov chainactivity degreeaverage encounter intervalmessage copy |
| spellingShingle | Feng LI Ya-li SI Zhen CHEN Li-min SHEN Lightweight opportunistic routing forwarding strategy based on Markov chain Tongxin xuebao opportunistic network Markov chain activity degree average encounter interval message copy |
| title | Lightweight opportunistic routing forwarding strategy based on Markov chain |
| title_full | Lightweight opportunistic routing forwarding strategy based on Markov chain |
| title_fullStr | Lightweight opportunistic routing forwarding strategy based on Markov chain |
| title_full_unstemmed | Lightweight opportunistic routing forwarding strategy based on Markov chain |
| title_short | Lightweight opportunistic routing forwarding strategy based on Markov chain |
| title_sort | lightweight opportunistic routing forwarding strategy based on markov chain |
| topic | opportunistic network Markov chain activity degree average encounter interval message copy |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017105/ |
| work_keys_str_mv | AT fengli lightweightopportunisticroutingforwardingstrategybasedonmarkovchain AT yalisi lightweightopportunisticroutingforwardingstrategybasedonmarkovchain AT zhenchen lightweightopportunisticroutingforwardingstrategybasedonmarkovchain AT liminshen lightweightopportunisticroutingforwardingstrategybasedonmarkovchain |