簡易檢索 / 詳目顯示

研究生: 湯曜任
Tang, Yao-Jen
論文名稱: 行動隨意網路之無定位資訊經紀系統和高效節能位置輔助繞徑研究
Double-Ruling-Based GPS-Free Information Brokerage and Energy-Efficient Geographic Routing in Mobile Ad Hoc Networks
指導教授: 蔡明哲
Tsai, Ming-Jer
口試委員: 許健平
Sheu, Jang-Ping
高榮駿
Kao, Jung-Chun
徐正炘
Hsu, Cheng-Hsin
趙禧綠
Chao, Hsi-Lu
林靖茹
Lin, Ching-Ju
學位類別: 博士
Doctor
系所名稱:
論文出版年: 2017
畢業學年度: 105
語文別: 英文
論文頁數: 75
中文關鍵詞: 經紀資訊系統位置輔助繞徑行動隨意網路
外文關鍵詞: information brokerage system, geographic routing, mobile ad hoc networks
相關次數: 點閱:4下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在行動隨意網路中,資訊經紀系統和位置輔助繞徑是兩個重要的應用。在這篇論文中,我們探討無定位輔助系統輔助的資訊經紀系統以及使用定位輔助系統的繞徑方法中的一些問題。在論文的第一部分中,我們研究無定位之資訊經紀系統問題。資訊經紀系統是一種資料散佈和取得的方式。在過去,許多資料散佈和取得的方式透過交互尺技術達到低資料取得延遲。但是在行動隨意網路中,這些方式都需要全球定位系統。為了在行動隨意網路中使用交互尺技術,我們提出了一個不需要預備知識且基於交互尺技術的無定位資訊經紀系統。實驗顯示我們的方法在資料取得率和資料取得延遲能有很好的效能。此外,在節點均勻且密集分佈的網路中,我們也分析了我們取得資訊的方法有一個最大的傳輸次數。在論文的第二部分中,我們研究位置輔助繞徑的問題。在位置輔助繞徑中,兩個鄰近的節點需要定期的交換彼此的位置資訊。然而在行動隨意網路中,可能會因為過期的位置資訊而丟失傳輸的封包,進而需要耗費更多的能量來重新傳送封包。在行動隨意網路中,我們透過考慮過期的鄰居資訊,提出了兩個可以讓位置輔助繞徑有效節能的方法。第一個方法考慮了前進距離和能量消耗間的取捨。第二個方法只著重在密集的網路中能使用最低的能量消耗。實驗顯示位置輔助繞徑使用了我們的方法後,可以明顯地降低能量的消耗並且保留很高的封包傳輸率。


    The information brokerage and the geographic routing are two important applications in mobile ad hoc networks (MANETs). In this thesis, we investigate some problems of the information brokerage without the assistance of Global Positioning System (GPS) and the routing with the assistance of GPS separately.
    In the first part of this thesis, we study the GPS-free information brokerage problem. In the past, many information brokerage schemes achieve low data retrieval latency using the double-ruling technique. However, these schemes require static nodes or GPS support. To apply the double-ruling technique without the assistance of GPS in MANATs, we propose a zero-knowledge double-ruling-based GPS-free information brokerage scheme (MobiMark). Simulations show that MobiMark achieves good performance in terms of data retrieval rate and data retrieval latency. In the second part of this thesis, we study the geographic routing problem. To employ the geographic routing, two neighboring nodes need to exchange the location information with each other periodically. In MANETs, however, a packet transmitted between two neighboring nodes may be lost due to the out-of-date location information, resulting in demanding extra energy to retransmit the packet. By considering the out-of-date neighboring location information, we propose two methods capable of augmenting geographic routing protocols to reduce energy consumption in MANETs. Simulations show that geographic routing protocols augmented with our methods can significantly reduce the energy consumption while preserving the high packet delivery rate.

    List of Figures . . . v 1 Introduction . . . 1 2 Double-Ruling-Based GPS-Free Information Brokerage Scheme in Mobile Ad Hoc Networks . . . 5 2.1 Background and Motivation . . . 5 2.2 The Network Model and Problem . . . 10 2.3 The Basic Ideas . . . 11 2.3.1 Identification of Brokers . . . 11 2.3.2 Establishment of Brokers . . . 13 2.4 MobiMark System Architecture . . . 15 2.4.1 Preliminaries and Overview . . . 15 2.4.2 Election of Polar Landmark Brokers . . . 17 2.4.3 Election of Ordinary Landmark Brokers . . . 19 2.4.4 Establishment of Landmark Regions and Preservation of Data Integrity . . . 20 2.5 MobiMark . . . 20 2.5.1 Submission of Consumers' Interests . . . 22 2.5.2 Distribution of Producers' Data . . . 22 2.5.3 Delivery of Matched Data . . . 23 2.5.4 Handoff of Consumers' Interests . . . 24 2.6 Analysis . . . 24 2.7 Performance Evaluation . . . 31 2.7.1 Empirical Results of MobiMark Architecture . . . 34 2.7.2 Empirical Results of MobiMark, SAW, DRIP, and LDDD . . . 37 2.7.3 Empirical Results of MobiMark, SAW, DRIP, and LDDD under Other Network/Mobility Models . . . 45 2.8 Related Works . . . 47 3 Energy Consumption Reduction Methods of Geographic Routing with Out-of-Date Location Information in Mobile Ad Hoc Networks . . . 48 3.1 Background and Motivation . . . 48 3.2 Network and Mobility Models . . . 50 3.2.1 Network Model . . . 50 3.2.2 Mobility Models . . . 50 3.3 Energy Consumption Reduction Methods . . . 51 3.3.1 Preliminaries . . . 51 3.3.2 Out-of-Date Location Information . . . 52 3.3.3 Maximum Progress Distance Per Energy Method . . . 53 3.3.4 Minimum Energy Consumption Method . . . 54 3.4 Evaluation of fM, fA, and m* . . . 56 3.4.1 Random Walk Mobility Model . . . 57 3.4.2 Real-Trace-Based Mobility Model . . . 57 3.5 Performance Evaluation . . . 58 3.6 Related Works . . . 62 4 Conclusion and Future Work . . . 63

    [1] I. Chlamtac, M. Conti, and J. J.-N. Liu, "Mobile ad hoc networking: Imperatives and challenges," Ad Hoc Networks, vol. 1, no. 1, pp. 13–64, 2003.
    [2] H. R. Maamar, R. W. Pazzi, A. Boukerche, and E. Petriu, "A supplying partner strategy for mobile networks-based 3d streaming - proof of concept," in Proc. IEEE IPDPSW, 2010.
    [3] G. Pei, M. Gerla, and X. Hong, "LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility," in ACM MOBIHOC, 2000.
    [4] S. Yang, C. K. Yeo, and B.-S. Lee, "Toward reliable data delivery for highly dynamic mobile ad hoc networks," IEEE Transactions on Mobile Computing, vol. 11, pp. 111–124, 2012.
    [5] D. Tschopp, S. Diggavi, M. Grossglauser, and J. Widmer, "Robust geo-routing on embeddings of dynamic wireless networks," in IEEE INFOCOM, 2007.
    [6] X. Chen, H. M. Jones, and D. Jayalath, "Channel-aware routing in manets with route handoff," IEEE Transactions on Mobile Computing, vol. 10, pp. 108–121, 2011.
    [7] K. E. Defrawy and G. Tsudik, "Alarm: Anonymous location-aided routing in suspicious manets," IEEE Transactions on Mobile Computing, vol. 10, pp. 1345–1358, 2011.
    [8] J.-H. Choi, K.-S. Shim, S. Lee, and K.-L. Wu, "Handling selfishness in replica allocation over a mobile ad hoc network," IEEE Transactions on Mobile Computing, vol. 11, pp. 278–291, 2012.
    [9] D. Torrieri, S. Talarico, and M. C. Valenti, "Performance comparisons of geographic routing protocols in mobile ad hoc networks," IEEE Transactions on Communications, vol. 63, no. 11, pp. 4276–4286, 2015.
    [10] C. Perkins, E. Belding-Royer, and S. Das, "Ad hoc on-demand distance vector (AODV) routing," RFC Editor, RFC 3561, 2003. [Online]. Available: http://www.rfc-editor.org/rfc/rfc3561.txt
    [11] R. Sarkar, X. Zhu, and J. Gao, "Double rulings for information brokerage in sensor networks," IEEE/ACM Transactions on Networking, vol. 17, pp. 1902–1915, 2009.
    [12] I. Aydin and C.-C. Shen, "Facilitating match-making service in ad hoc and sensor networks using pseudo quorum," in IEEE ICCCN, 2002.
    [13] X. Li, N. Santoro, and I. Stojmenovic, "Localized distance-sensitive service discovery in wireless sensor and actor networks," IEEE Transactions on Computers, vol. 58, pp. 1275–1288, 2009.
    [14] J. Gao, L. Guibas, and J. Hershberger, "Sparse data aggregation in sensor networks," in ACM IPSN, 2007.
    [15] K. Wu, J. Xiao, Y. Yi, M. Gao, and L. M. Ni, "FILA: Fine-grained indoor localization," in IEEE INFOCOM, 2012.
    [16] D. Last, "Gnss: The present imperfect," Inside GNSS Magazine, vol. 5, pp. 60–64, 2010.
    [17] N. Bulusu, J. Heidemann, and D. Estrin, "GPS-less low cost outdoor localization for very small devices," IEEE Personal Communications, vol. 7, pp. 28–34, 2000.
    [18] J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in ACM MOBICOM, 2000.
    [19] F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, "A two-tier data dissemination model for large-scale wireless sensor networks," in ACM MOBICOM, 2002.
    [20] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "GHT: A geographic hash table for data-centric storage," in ACM WSNA, 2002.
    [21] C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in ACM MobiCom, 2000.
    [22] A. Carzaniga, M. J. Rutherford, and A. L. Wolf, "A routing scheme for contentbased networking," in IEEE INFOCOM, 2004.
    [23] W. W. Terpstra, J. Kangasharju, C. Leng, and A. P. Buchmann, "BubbleStorm: Resilient, probabilistic, and exhaustive peer-to-peer search," in ACM SIGCOMM, 2007.
    [24] Q. Fang, J. Gao, and L. J. Guibas, "Landmark-based information storage and retrieval in sensor networks," in IEEE INFOCOM, 2006.
    [25] S. Funke and I. Rauf, "Information brokerage via location-free double rulings," in ADHOC-NOW, 2007.
    [26] C.-H. Lin, J.-J. Kuo, and M.-J. Tsai, "Reliable GPS-free double-ruling-based information brokerage in wireless sensor networks," in IEEE INFOCOM, 2010.
    [27] X. Hong, M. Gerla, G. Pei, and C.-C. Chiang, "A group mobility model for ad hoc wireless networks," in ACM MSWiM, 1999.
    [28] T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for ad hoc network research," Wireless Communications and Mobile Computing, vol. 10, pp. 483–502, 2002.
    [29] G. Cugola and J. E. M. de Cote, "On introducing location awareness in publishsubscribe middleware," in IEEE ICDCSW, 2005.
    [30] X. Chen, Y. Chen, and F. Rao, "An efficient spatial publish/subscribe system for intelligent location-based services," in ACM DEBS, 2003.
    [31] D. Niculescu, "Positioning in ad hoc sensor networks," IEEE Network, vol. 18, pp. 24–29, 2004.
    [32] N. Patwari, J. N. Ash, S. Kyperountas, A. O. H. III, R. L. Moses, and N. S. Correal, "Locating the nodes: Cooperative localization in wireless sensor networks," IEEE Signal Processing Magazine, vol. 22, pp. 54–69, 2005.
    [33] I. Sharp, K. Yu, and T. Sathyan, "Positional accuracy measurement and error modeling for mobile tracking," IEEE Transactions on Mobile Computing, vol. 11, pp. 1021–1032, 2012.
    [34] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "MaxProp: Routing for vehicle-based disruption-tolerant networks," in IEEE INFOCOM, 2006.
    [35] Z. Li, H. Shen, H. Wang, G. Liu, and J. Li, "SocialTube: P2P-assisted video sharing in online social networks," in IEEE INFOCOM, 2012.
    [36] M. Xiao, J. Wu, and L. Huang, "Home-based zero-knowledge multi-copy routing in mobile social networks," IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 5, pp. 1238–1250, 2015.
    [37] Y. Huang and H. Garcia-Molina, "Publish/Subscribe in a mobile environment," Wireless Networks, vol. 10, pp. 643–652, 2004.
    [38] P. Costa and G. P. Picco, "Semi-probabilistic content-based publish-subscribe," in IEEE ICDCS, 2005.
    [39] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and Wait: An efficient routing scheme for intermittently connected mobile networks," in ACM WDTN, 2005.
    [40] Q. Yuan and J.Wu, "DRIP: A dynamic Voronoi regions-based publish/subscribe protocol in mobile networks," in IEEE INFOCOM, 2008.
    [41] R. Friedman and A. K. Shulman, "A density-driven publish subscribe service for mobile ad-hoc networks," Ad Hoc Networks, vol. 11, pp. 522–540, 2013.
    [42] P. Leach, M. Mealling, and R. Salz, "A universally unique IDentifier (UUID) URN namespace," RFC 4211, July 2005.
    [43] V. Ramasubramanian, R. Chandra, and D. Mosse, "Providing a bidirectional abstraction for unidirectional ad hoc networks," in IEEE INFOCOM, 2002.
    [44] F. A. Tobagi and L. Kleinrock, "Packet switching in radio channels: Part ii- the hidden terminal problem in carrier sense multiple-access and the busy-tone solution," IEEE Transactions on Communications, vol. 23, pp. 1417–1433, 1975.
    [45] P. Nain, D. Towsley, B. Liu, and Z. Liu, "Properties of random direction models," in IEEE INFOCOM, 2005.
    [46] S. K. S. Gupta and P. K. Srimani, "Adaptive core selection and migration method for multicast routing in mobile ad hoc networks," IEEE Trans. Parallel Distrib. Syst., vol. 14, pp. 27–38, 2003.
    [47] B. Liang and Z. J. Haas, "Predictive distance-based mobility management for multidimensional pcs networks," IEEE/ACM Transactions on Networking, vol. 11, pp. 718–732, 2003.
    [48] J. Ghosh, S. J. Philip, and C. Qiao, "Sociological orbit aware location approximation and routing (solar) in MANET," Ad Hoc Networks, vol. 5, pp. 189–209, 2007.
    [49] B.-H. Liu, M.-L. Chen, and M.-J. Tsai, "Message-efficient location prediction for mobile objects in wireless sensor networks using a maximum likelihood technique," IEEE Transactions on Computers, vol. 60, pp. 865–878, 2011.
    [50] D. Ciullo, V. Martina, M. Garetto, and E. Leonardi, "Impact of correlated mobility on delay-throughput performance in mobile ad hoc networks," IEEE Transactions on Networking, vol. 19, pp. 1745–1758, 2011.
    [51] R. J. La and E. Seo, "Network connectivity with a family of group mobility models," IEEE Transactions on Mobile Computing, vol. 11, pp. 504–517, 2012.
    [52] J.-L. Huang, M.-S. Chen, and W.-C. Peng, "Exploring group mobility for replica data allocation in a mobile environment," in ACM CIKM, 2003.
    [53] J.-L. Huang and M.-S. Chen, "On the effect of group mobility to data replication in ad hoc networks," IEEE Transactions on Mobile Computing, vol. 5, pp. 492–506, 2006.
    [54] M. Fanelli, L. Foschini, A. Corradi, and A. Boukerche, "Self-adaptive context data distribution with quality guarantees in mobile P2P networks," IEEE Journal on Selected Areas in Communications, vol. 31, pp. 115–131, 2013.
    [55] D. J. Goodman, J. Borr`as, N. B. Mandayam, and R. D. Yates, "INFOSTATIONS: a new system model for data and messaging services," in IEEE VTC, 1997.
    [56] T. Small and Z. J. Haas, "The shared wireless infostation model - a new ad hoc networking paradigm (or where there is a whale, there is a way)," in ACM MobiHoc, 2003.
    [57] R. C. Shah, S. Roy, S. Jain, W. Brunette, and G. Borriello, "Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks," Ad Hoc Networks, vol. 1, pp. 215–233, 2003.
    [58] A. Balasubramanian, B. N. Levine, and A. Venkataramani, "DTN routing as a resource allocation problem," in ACM SIGCOMM, 2007.
    [59] X. Tie, A. Venkataramani, and A. Balasubramanian, "R3: Robust replication routing in wireless networks with diverse connectivity characteristics," in ACM SIGCOMM, 2011.
    [60] P. Hui, J. Crowcroft, and E. Yoneki, "BUBBLE Rap: Social-based forwarding in delay-tolerant networks," in ACM MobiHoc, 2008.
    [61] P. Costa, C. Mascolo, M. Musolesi, and G. P. Picco, "Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks," IEEE Journal on Selected Areas in Communications, vol. 26, pp. 748–760, 2008.
    [62] M. Grossglauser and D. N. C. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Transactions on Networking, vol. 10, pp. 477–486, 2002.
    [63] G. G. Finn, "Routing and addressing problems in large metropolitan-scale internetworks," Information Sciences Institute, Tech. Rep., 1987.
    [64] E. Kranakis, H. Singh, and J. Urrutia, "Compass routing on geometric networks," in Proc. CCCG, 1999, pp. 51–54.
    [65] B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM MobiCom, 2000.
    [66] S. Lee, B. Bhattacharjee, and S. Banerjee, "Efficient geographic routing in multihop wireless networks," in Proc. ACM Mobihoc, 2005.
    [67] S. Yang, C. K. Yeo, and B.-S. Lee, "Toward reliable data delivery for highly dynamic mobile ad hoc networks," IEEE Transactions on Mobile Computing, vol. 11, no. 1, pp. 111–124, 2012.
    [68] A. Mostefaoui, M. Melkemi, and A. Boukerche, "Localized routing approach to bypass holes in wireless sensor networks," IEEE Transactions on Computers, vol. 63, no. 12, pp. 3053–3065, 2014.
    [69] M. Kim, D. Kotz, and S. Kim, "Extracting a mobility model from real user traces," in Proc. IEEE INFOCOM, 2006.
    [70] D. Kotz, T. Henderson, I. Abyzov, and J. Yeo, "CRAWDAD dataset dartmouth/campus (v. 2009-09-09)," Downloaded from http://crawdad.org/dartmouth/campus/20090909/movement.
    [71] J. Zhu and X.Wang, "Model and protocol for energy-efficient routing over mobile ad hoc networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1546–1557, 2011.
    [72] R. Zhang, N. Timmons, and J. Morrison, "Utility energy-based opportunistic routing for lifetime enhancement in wireless sensor networks," in Proc. IEEE ICC, 2015.
    [73] M. T. Nuruzzaman and H.-W. Ferng, "A low energy consumption routing protocol for mobile sensor networks with a path-constrained mobile sink," in Proc. IEEE ICC, 2016.
    [74] Q. Chen, S. S. Kanhere, and M. Hassan, "Adaptive position update for geographic routing in mobile ad hoc networks," IEEE Transactions on Mobile Computing, vol. 12, no. 3, pp. 489–501, 2013.
    [75] M. Heissenbuttel, T. Braun, M. Walchli, and T. Bernoulli, "Evaluating the limitations of and alternatives in beaconing," Ad Hoc Networks, vol. 5, no. 5, pp. 558–578, 2007.
    [76] S. Kwon and N. B. Shroff, "Geographic routing in the presence of location errors," Computer Networks, vol. 50, no. 15, pp. 2902–2917, 2006.
    [77] D. Son, A. Helmy, and B. Krishnamachari, "The effect of mobility-induced location errors on geographic routing in mobile ad hoc and sensor networks: Analysis and improvement using mobility prediction," IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 233–245, 2004.
    [78] A. Nadembega, A. Hafid, and T. Taleb, "A destination and mobility path prediction scheme for mobile networks," IEEE Transactions on Vehicular Technology, vol. 64, no. 6, pp. 2577–2590, 2015.
    [79] M. Heissenbuttel, T. Braun, T. Bernoulli, and M. Walchli, "BLR: Beacon-less routing algorithm for mobile ad hoc networks," Computer Communications, vol. 27, no. 11, pp. 1076–1086, 2004.
    [80] J. A. Sanchez, R. Marin-Perez, and P. M. Ruiz, "BOSS: Beacon-less on demand strategy for geographic routing in wireless sensor networks," in Proc. IEEE MASS, 2007.
    [81] J. A. Sanchez, P. M. Ruiz, and R. Marin-Perez, "Beacon-less geographic routing made practical: Challenges, design guidelines, and protocols," IEEE Communications Magazine, vol. 47, no. 8, pp. 85–91, 2009.

    QR CODE