| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 101 === With the rapid advancement of wireless communication technology, mobile peer-to-peer network (MP2P) has become a major issue of network platform for mobile computing, which contains various applications such as data dissemination, data access object, etc. Thus, it is worth investigating how to send out the data efficiently through MP2P network.
In previous studies, they usually assumed that the human behavior patterns are random and unpredictable. However, unlike those works, recent studies have found that the human behavior implies sort of regularity and repetitive pattern. There exist certain characteristics of moving pattern for each person, as well as the specific probability of nodes’ encounters. We want to utilize those regularities and characteristics to help to disseminate data within MP2P networks.
In this thesis, we study the problem that how to disseminate the specific number of valid event tickets to users, who are interest in such event, before deadline in MP2P network environments. Without the traditional “Publish and Subscribe” mechanism, nodes moves within network with their patters and exchange information with people they encountered. Nodes will reveal their demand interests, and the ticket will based on those interests be spread and carried. In this study, the number of ticket has specified upper bound and delivery deadline. When nodes encountered, we use “public space” and “personal space” to gather information according to their moving pattern. By this information, we could calculate node’s direct and indirect disseminate ability, and allocate remaining tickets. Final, we will show our method can elevate delivery ratio of tickets in our experiment results.
|
|---|
