The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2013 vol.62)
pp: 798-812
Yuan-Po Cheng , Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Chia-Yi Wu , Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Yao-Jen Tang , Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Ming-Jer Tsai , Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
ABSTRACT
We address the problem of information brokerage, where information consumers search for the data acquired by information producers. To the best of our knowledge, there exists no retrieval-guaranteed location-aware information brokerage scheme with a bounded data retrieval path length and bounded replication and retrieval message overhead costs available for use in 3D wireless ad hoc networks to date. In this paper, we propose a novel location-aware information brokerage scheme, termed LAIB, where the network area is divided into cube grids, and data are replicated and retrieved in the hashed geographic location in each grid designated by the producer and the consumer, respectively. In LAIB, a polylogarithmic number of grids are designated by the producer and by the consumer, and at least one grid, whose distance from the grid of the consumer is smaller than the distance from the grid of the consumer to the grid of the producer, is designated by both the producer and the consumer. Simulations show that, as the network area is divided into a moderate number of grids, LAIB has good performance in term of retrieval latency stretch while ensuring moderate replication memory, replication message, and retrieval message overhead costs.
INDEX TERMS
ad hoc networks, retrieval message overhead cost, retrieval-guaranteed location-aware information brokerage scheme, 3D wireless ad hoc network, bounded data retrieval path length, bounded replication, Three dimensional displays, Mobile ad hoc networks, Vegetation, Peer to peer computing, Distance measurement, Binary trees, Routing protocols, double-ruling technique, Wireless ad hoc network, information brokerage, routing algorithm
CITATION
Yuan-Po Cheng, Chia-Yi Wu, Yao-Jen Tang, Ming-Jer Tsai, "Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks", IEEE Transactions on Computers, vol.62, no. 4, pp. 798-812, April 2013, doi:10.1109/TC.2012.16
REFERENCES
[1] S. Subramanian, S. Shakkottai, and P. Gupta, "Optimal Geographic Routing for Wireless Networks with Near-Arbitrary Holes and Traffic," Proc. IEEE INFOCOM, 2008.
[2] M.-J. Tsai, H.-Y. Yang, B.-H. Liu, and W.-Q. Huang, "Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocols in Wireless Sensor Networks," IEEE/ACM Trans. Networking, vol. 17, no. 4, pp. 1228-1241, Aug. 2009.
[3] M. Naghshvar and T. Javidi, "Opportunistic Routing with Congestion Diversity in Wireless Multi-Hop Networks," Proc. IEEE INFOCOM, 2010.
[4] W. Zeng, R. Sarkar, F. Luo, X. Gu, and J. Gao, "Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space," Proc. IEEE INFOCOM, 2010.
[5] C.-H. Lin, S.-A. Yuan, S.-W. Chiu, and M.-J. Tsai, "Progressface: An Algorithm to Improve Routing Efficiency of GPSR-Like Routing Protocols in Wireless Ad Hoc Networks," IEEE Trans. Computers, vol. 59, no. 6, pp. 822-834, June 2010.
[6] X. Xiang, X. Wang, and Y. Yang, "Stateless Multicasting in Mobile Ad Hoc Networks," IEEE Trans. Computers, vol. 59, no. 8, pp. 1076-1090, Aug. 2010.
[7] H. Frey and I. Stojmenovic, "On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks," IEEE Trans. Computers, vol. 59, no. 9, pp. 1224-1239, Sept. 2010.
[8] J. Li, J. Jannotti, D.S.J.D. Couto, D.R. Karger, and R. Morris, "A Scalable Location Service for Geographic Ad Hoc Routing," Proc. ACM MobiCom, 2000.
[9] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "GHT: A Geographic Hash Table for Data-Centric Storage," Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), 2002.
[10] I. Aydin and C.-C. Shen, "Facilitating Match-Making Service in Ad Hoc and Sensor Networks Using Pseudo Quorum," Proc. 11th Int'l Conf. Computer Comm. and Networks (ICCCN), 2002.
[11] H. Luo, F. Ye, J. Cheng, S. Lu, and L. Zhang, "A Two-Tier Data Dissemination Model for Large-Scale Wireless Sensor Networks," Proc. MobiCom '02, 2002.
[12] R. Zhang, H. Zhao, and M.A. Labrador, "A Grid-Based Sink Location Service for Large-Scale Wireless Sensor Networks," Proc. Int'l Conf. Wireless Comm. and Mobile Computing (IWCMC '06), 2006.
[13] R. Sarkar, X. Zhu, and J. Gao, "Double Rulings for Information Brokerage in Sensor Networks," IEEE/ACM Trans. Networking, vol. 17, no. 6, pp. 1902-1915, Dec. 2009.
[14] I. Stojmenovic, D. Liu, and X. Jia, "A Scalable Quorum-Based Location Service in Ad Hoc and Sensor Networks," Int'l J. Comm. Networks and Distributed Systems, vol. 1, pp. 71-94, 2008.
[15] X. Li, N. Santoro, and I. Stojmenovic, "Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks," IEEE Trans. Computers, vol. 58, no. 9, pp. 1275-1288, Sept. 2009.
[16] S. Ishihara and T. Suda, "Replica Arrangement Scheme for Location Dependent Information on Sensor Networks with Unpredictable Query Frequency," Proc. IEEE Int'l Conf. Comm. (ICC '09), 2009.
[17] V. Ravelomanana, "Extremal Properties of Three-Dimensional Sensor Networks with Applications," IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 246-257, July-Aug. 2004.
[18] W. Cheng, A.Y. Teymorian, L. Ma, X. Cheng, X. Lu, and Z. Lu, "Underwater Localization in Sparse 3d Acoustic Sensor Networks," Proc. IEEE INFOCOM, 2009.
[19] H. Ma, X. Zhang, and A. Ming, "A Coverage-Enhancing Method for 3D Directional Sensor Networks," Proc. IEEE INFOCOM, 2009.
[20] H. Ammari and S. Das, "A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks," IEEE Trans. Computers, vol. 59, no. 2, pp. 243-257, Feb. 2010.
[21] C. Zhang, X. Bai, J. Teng, D. Xuan, and W. Jia, "Constructing Low-Connectivity and Full-Coverage Three Dimensional Sensor Networks," IEEE J. Selected Areas in Comm., vol. 28, no. 7, pp. 984-993, Sept. 2010.
[22] A. Abdallah, T. Fevens, and J. Opatrny, "Power-Aware 3d Position-Based Routing Algorithms for Ad Hoc Networks," Proc. IEEE Int'l Conf. Comm. (ICC '07), 2007.
[23] R. Flury and R. Wattenhofer, "Randomized 3D Geographic Routing," Proc. IEEE INFOCOM, 2008.
[24] W.-J. Liu and K.-T. Feng, "Three-Dimensional Greedy Anti-Void Routing for Wireless Sensor Networks," IEEE Trans. Wireless Comm., vol. 8, no. 12, pp. 5796-5800, Dec. 2009.
[25] C. Liu and J. Wu, "Efficient Geometric Routing in Three Dimensional Ad Hoc Networks," Proc. IEEE INFOCOM, 2009.
[26] C. Liu and J. Wu, "Virtual-Force-Based Geometric Routing Protocol in MANETs," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 4, pp. 433-445, Apr. 2009.
[27] B. Karp and H.T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM MobiCom, 2000.
[28] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks," Wireless Networks, vol. 7, pp. 609-616, 2001.
[29] H.P. Manning, Geometry of Four Dimensions. The Macmillan Company, 1914.
[30] E.W. Weisstein, "Great Sphere," MathWorld-A Wolfram Web Resource, http://mathworld.wolfram.comGreatSphere.html , 2011.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool