近年來無線網路技術與應用發展迅速，行動同儕網路系統(Mobile Peer-to-Peer Network or MP2P)因此成為研究的重要一環。其中包含著許多應用，例如資料傳遞、訊息暫存等。然而，如何在MP2P環境中將資料傳遞出去便是資料傳播議題裡值得探討的。
以往人的行為模式大多是假設隨機不可預測的；雖然人類的行為活動是不可預測的，但卻隱含著週期移動的特性，而且節點相遇也有著某種特定的機率。而在近幾年的研究發現－人類行為網路(human network)確實存在著某些特定的規律性，不像過去的假設是隨機且毫無關連性。因此，在行動同儕網路環境下要做資料散播的工作時，若能將此資訊考量進去的話，相信對於資料散播會有很大的幫助。
在本篇論文中，我們將針對同儕網路中，有時效性的票券議題進行探討，而票券的屬性和以往探討的不太相同，這邊票券數量限制在特定的上限值，票券發出不能超過此上限。而我們的目標就是如何優化票券散播的能力，讓票券盡可能滿足需求的節點，且不超過上限的門檻。我們將環境中分為私領域空間及公領域空間分別探討，利用節點相遇時交換的資訊，透過類似發佈(publish)及訂閱(subscribe)的動作，衡量節點間票券散播能力以及考量日後遇到節點的間接能力，對剩餘的票券進行票券的分配，完成最後票券散播的動作。而實驗驗證我們的機制能大幅的提升票券的散播效率。

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.

[1] A. Datta, S. Quarteroni, and K. Aberer, “Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks,” in Proc. International Conference on Semantics of a Networked World, Paris, France, 2004, pp. 126-143.
[2] I. Gupta, A. M. Kermarrec, and A. J. Ganesh, “Efficient Epidemic-style Protocols for Reliable and Scalable Multicast,” in Proc. 21st IEEE Symposium on Reliable Distributed Systems, 2002, pp.180-189.
[3] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” in Proceedings of the 2004 Conference on Applications, Technologies, Architecture, and Protocols for Computer Communications (SIGCOMM), Portland, Oregon, USA, 2004, pp. 145-158.
[4] C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” in Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99. Second IEEE Workshop on, 1999, pp. 90-100
[5] Y. Huang and G. M. Hector, “Publish/Subscribe in a Mobile Environment,” Wireless Networks, vol. 10, no. 6, pp. 643-652, 2004.
[6] Y. Zhao and J. Wu, “Socially-Aware Publish/Subscribe System for Human Networks,” in Proc. 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, 2010, pp. 1-6.
[7] F. Nazir, H. Prendinger, and A. Seneviratne, “Participatory Mobile Social Network Simulation Environment,” in Proc. 2010 IEEE International Conference on Communications (ICC), Cape Town, South Africa, 2010, pp. 1-6.
[8] W. J. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy, “Modeling Time-variant User Mobility in Wireless Mobile Networks,” in Proc. 26th IEEE International Conference on Computer Communications (INFOCOM 2007), Anchorage, Alaska, USA, 2007, pp. 758-766.
[9] F. Ekman, A. Keranen, J. Karov, and J. Ott, “Working Day Movement Model,” in Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models, Hong Kong, China, 2008, pp. 33-40.
[10] F. Nazir, J. Ma, and A. Seneviratne, “Time Critical Content Delivery using Predictable Patterns in Mobile Social Networks,” in Proc. 2009 International Conference on Computational Science and Engineering (CSE’09), Vancouver, Canada, 2009, pp. 1066-1073.
[11] V. McKinney, K. Yoon, and F. M. Zahedi, “The Measurement of Web-Customer Satisfaction: An Expectation and Disconfirmation Approach,” Information Systems Research, Sep 2002, Volume: 13 Issue: 3 pp.296-315.
[12] G. Gregg Dawn and Walczak Steven, “Dressing Your Online Auction Business for Success: An Experiment Comparing Two eBay Businesses,” MIS Quarterly, (32: 3), 2008, pp.653-670.
[13] A. Persaud, and I. Azhar, “Innovative mobile marketing via smartphones: Are consumers ready,” Marketing Intelligence & Planning, Vol. 30 Iss: 4, 2012, pp.418 – 443.
[14] S. P. Mahambre, and U. Bellur, “Decentralized Adaptive Routing for Reliability in Event Broker Networks,” in Procrrdings of 15th IEEE International Conference on Parallel and Distributed Systems (ICPADS), Shenzhen, 2009, pp. 18-25.
[15] I. Burcea, H. I. Jacobsen, E. D. Lara, V. Muthusamy, and M. Petrovic, “Disconnected Operation in Publish/Subscribe Middleware,” in Proceedings of IEEE International Conference on Mobile Data Management (MDM 2004), Berkeley, California, USA, 2004, pp. 39-50.
[16] L. Fiege, F. C. Gartner, O. Kasten, and A. Zeidler, “Supporting Mobility in Content-Based Publish/Subscribe Middleware,” in Proc. ACM/IFIP/USENIX 2003 International Conference on Middleware, Rio de Janeiro, Brazil, 2003, pp. 103-122.
[17] I. Podnar and I. Lovrek, “Supporting Mobility with Persistent Notifications in Publish/Subscribe Systems,” in Proceedings of the 3rd Int. Workshop on Distributed Event-Based Systems (DEBS), Nashville, TN, USA, 2004, pp. 80-85.
[18] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, Philadelphia, Pennsylvania, USA, 2005, pp. 252-259.
[19] A. Balasubramanian, B. N. Levine, and A. Venkataramani, “Replication Routing in DTNs: A Resource Allocation Approach,” IEEE/ACM Transactions on Networking, vol. 18, no. 2, pp. 596-609, 2010.
[20] O. Wolfson, B. Xu, and R. M. Tanner, “Mobile Peer-to-Peer Data Dissemination with Resource Constraints,” in Proceedings of the 8th International Conference on Mobile Data Management (MDM 2007), Mannheim, Germany, 2007, pp. 16-23.
[21] S. Milgram, “The Small-World Problem,” Psychology Today, vol. 1, no. 1, pp. 61-67, 1967.
[22] E. M. Daly and M. Haahr, “Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs,” IEEE Transactions on Mobile Computing, vol. 8, no. 5, pp. 606-621, 2009.
[23] M. Musolesi and C. Mascolo, “A community based mobility model for ad hoc network research,” in Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality, Florence, Italy, 2006, pp. 31-38.
[24] W. Gao, and G. Cao, “On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks,” in Proceedings of 18th IEEE International Conference on Network Protocols (ICNP), Kyoto, Japan, 2010, pp. 193-202.
[25] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in delay tolerant networks: a social network perspective,” in Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, New Orleans, LA, USA, 2009, pp. 299-308.
[26] Y. Zhao and J. Wu, “Socially-Aware Publish/Subscribe System for Human Networks,” in Proc. 2010 IEEE Wireless Communication and Networking Conference (WCNC), Sydney, Australia, 2010, pp. 1-6.
[27] M. Musolesi and C. Mascolo, “Designing mobility models based on social network theory,” ACM SIGMOBILE Mobile Computing and Communication Review, vol. 11, no. 3, pp. 59-70, 2007.
[28] H. Ling-ya, “A Study of Ticket Dissemination in Mobile Peer to Peer Networks,” National Taiwan University of Science and Technology Repository, 2012.