CPTR: conditional probability tree based routing in opportunistic networks

详细信息    查看全文

• 作者：Nahideh Derakhshanfard ; Masoud Sabaei ; Amir Masoud Rahmani
• 关键词：Opportunistic network ; Conditional probability tree ; Store ; carry ; forward ; Single copy
• 刊名：Wireless Networks
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：23
• 期：1
• 页码：43-50
• 全文大小：
• 刊物类别：Computer Science
• 刊物主题：Communications Engineering, Networks; Computer Communication Networks; Electrical Engineering; IT in Business;
• 出版者：Springer US
• ISSN：1572-8196
• 卷排序：23

文摘

In opportunistic networks due to the inconsistency of the nodes link, routing is carried out dynamically and we cannot use proactive routes. In these networks, nodes use opportunities gained based on store-carry-forward patterns to forward messages. Every node that receives a message when it encounters another node makes decision regarding the forwarding or not forwarding the node encountered. In some previous methods, the recognition of whether encounter with current node is considered as an appropriate opportunity or not has been carried out based on the comparison of the probability of carrier node and the node encountered. In these methods, if the message is delivered to the encountered node, a better opportunity would be lost. To fight with this challenge we have posed CPTR method by using conditional probability tree method through which in addition to the probability of the delivery of carrier and encountered nodes’ message delivery, the opportunities for after encounter will be involved in messages’ forwarding. Results of simulation showed that the proposed method can improve the ratio of delivery and delay of message delivery compared to other similar methods in networks with limited buffer.