當取得資訊者(Consumer)對某些散布資訊者(Producer)的資料產生興趣時，我們在三維無線隨意網路下提供了一個資訊取得的服務。近年來，無線隨意網路在三維環境下的應用越來越多，而沒有提供座標資訊的網路，我們需要花費更多額外的訊息傳送才能取得整個網路的拓墣，所以這篇論文是在有座標的三維隨意網路下提供資訊取得的服務(LAIB)。就我們所知，目前在三維隨意網路下，沒有任何一個可靠的資訊取得服務存在。在這篇論文中，我們首先提出了建造散布－取得樹的方法，接下來，我們介紹LAIB如何在散布－取得樹上去散布資訊和取得資訊。我們也分析了LAIB在連續的環境下，可以保證取得資訊以及他具有方格距離敏感度(Grid-Distance Sensitive)的特性。方格距離敏感度的指標是取得資訊的路徑長度和取得資訊者與散布資訊者之間的距離有一定的比例存在。除此之外，我們也做了將網路切割成不同的大小的方格，LAIB在散布資訊所花費的儲存成本、散布資訊的訊息花費成本、取得資訊的訊息花費成本、以及資訊取得的延遲比例的實驗。

[1] A. Abdallah, T. Fevens, and J. Opatrny, “Power-aware 3d position-based routing algorithms for ad hoc networks,” in IEEE International Communications Conference (ICC), 2007.
[2] R. Flury and R. Wattenhofer, “Randomized 3d geographic routing,” in IEEE International Conference on Computer Communications (INFOCOM), 2008.
[3] C. Liu and J. Wu, “Efficient geometric routing in three dimensional ad hoc networks,”in IEEE International Conference on Computer Communications (INFOCOM), 2009.
[4] M. J. Tsai and F. R. Wang and H. Y. Yang and Y. P. Cheng, “VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks,” in IEEE International Conference on Computer Communications (INFOCOM), 2009.
[5] C. H. Lin, J. J. Kuo, and M. J. Tsai, “Reliable GPS-Free Double-Ruling-Based Information Brokerage in Wireless Sensor Networks,” in IEEE International Conference on Computer Communications (INFOCOM), 2010.
[6] S. Funke and L. J. Guibas and A. Nguyen and Y. Wang,“Distance-sensitive routing and information brokerage in sensor networks,”in IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS),2006.
[7] Q. Fang and J. Gao and L. J. Guibas,“Landmark-based information storage and retrieval in sensor networks,”in IEEE International Conference on Computer Communications (INFOCOM),2006.
[8] X. Li and N. Santoro and I. Stojmenovic,“Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks,”in IEEE Transactions on Computers,2009.
[9] S. Funke and I. Rauf,“Ad-Hoc, Mobile, and Wireless Networks,”in Ad-Hoc, Mobile, and Wireless Networks,2007.
[10] F. Roy and M. Noam,“3DLS: density-driven data location service for mobile adhoc networks,”in ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC),2009.
[11] I. Aydin and Chien-Chung Shen,“Facilitating Match-Making Service in Ad hoc and Sensor Networks Using Pseudo Quorum,”in IEEE International Conference on Computer Communications and Networks (ICCCN),2002.
[12] S. Ivan and L. Dandan and J. Xiaohua,“International Journal of Communication Networks and Distributed Systems,”in International Journal of Communication Networks and Distributed Systems,2008.
[13] J. Li and J. Jannotti and D. S. J. D. Couto and D. R. Karger and R. Morris,“A Scalable Location Service for Geographic Ad Hoc Routing,”in ACM International Conference on Mobile Computing and Networking (MOBICOM),2000.
[14] H. Luo and F. Ye and J. Cheng and S. Lu and L. Zhang,“TTDD: A Two-tier Data Dissemination Model for Large-scale Wireless Sensor Networks,”in ACM International Conference on Mobile Computing and Networking (MOBICOM),2003.
[15] R. Zhang and H. Zhao and M. A. Labrador,“A grid-based sink location service for large-scale wireless sensor networks,”in ACM International Conference On Communications And Mobile Computing (IWCMC),2006.
[16] R. Sarkar and X. Zhu and J. Gao,“Double Rulings for Information Brokerage in Sensor Networks,”in ACM International Conference on Mobile Computing and Networking (MOBICOM),2006.
[17] S. Ratnasamy and B. Karp and L. Yin and F. Yu and D. Estrin and R. Govindan and S. Shenker,“GHT: A Geographic Hash Table for Data-Centric Storage,”in ACM International Workshop on Wireless Sensor Networks and Applications
(WSNA),2002.
[18] S. Ishihara and T. Suda,“Replica Arrangement Scheme for Location Dependent Information on Sensor Networks with Unpredictable Query Frequency,”in IEEE International Communications Conference (ICC),2009.
[19] F. Papadopoulos and D. Krioukov and M. Boguna and A. Vahdat,“Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces,”in IEEE International Conference on Computer Communications (IN-
FOCOM),2010.
[20] U. Lee and P. Wang and Y. Noh and L. F. M. Vieira and M. Gerla and J. H. Cui,“Pressure Routing for Underwater Sensor Networks,”in IEEE International Conference on Computer Communications (INFOCOM),2010.
[21] W. Zeng and R. Sarkar and F. Luo and X. Gu and J. Gao,“Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space,”in IEEE International Conference on Computer Communications (IN-
FOCOM),2010.
[22] W. Galuba and P. Papadimitratos and M. Poturalski and K. Aberer and Z. Despotovic and W. Kellerer,“Castor: Scalable Secure Routing for Ad Hoc Networks,”in IEEE International Conference on Computer Communications (IN-
FOCOM),2010.
[23] R. M. Mendez and J.J. G. L. Aceves,“Robust and Scalable Integrated Routing in MANETs Using Context-Aware Ordered Meshes,”in IEEE International Conference on Computer Communications (INFOCOM),2010.
[24] M. Naghshvar and T. Javidi,“Opportunistic Routing with Congestion Diversity in Wireless Multi-hop Networks,”in IEEE International Conference on Computer Communications (INFOCOM),2010.