Publish/Subscribe Mechanism Using Time-Concerned ContentCorrelation for Link Sharing

• Main Authors: Chu-Yu Wang, 王楚渝
• Other Authors: Sy-Yen Kuo
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/37889056186367173915

碩士 === 國立臺灣大學 === 電機工程學研究所 === 102 === In recent years, the development of Internet of Things grows rapidly, and we often use publish/subscribe mechanism to disseminate information in distributed system. Different nodes can exchange data when they subscribe to a same topic, and then form a topic overlay. When two nodes have many common subscribed topics, their content-correlation will increase, and different topic overlays may share links between both nodes to transmit data, which leads to decrease the amount of total links in order to make lower cost on network transmission. However, every node subscribes to a topic may be time-dependent in some scenarios, especially, has specific subscription period or schedule. When looking for neighbor nodes to build links, simply taking power-consuming into concern is no longer fit the requirement. Therefore we take time into concern to build a different network topology, and propose a new data publish/subscribe mechanism with some simulation. The result shows that it can lower the effort when the need to build new network graph due to the subscription time is expired.