A content-aware multimedia accessing model in ad hoc networks

In this paper, we show that data content distribution can be employed to facilitate content-based multimedia retrieval in ad-hoc networks. It is challenging to perform content-based multimedia retrieval in ad hoc networks due to the dynamic network topology. The autonomy and heterogeneity of data sources introduce additional complexity to this task. Motivated by the data organization methodology of the summary-schemas model (SSM), we proposed a logic-based content summary framework that is able to represent semantic contents of multimedia data using concise logic terms. Furthermore, we proposed a virtual infrastructure to cluster mobile nodes based on semantic contents. The proposed framework has been simulated, and the simulation results are presented and analyzed based on various performance metrics.

[1]  Marina Thottan,et al.  A simple polynomial time framework for reduced-path decomposition in multipath routing , 2004, IEEE INFOCOM 2004.

[2]  Richard J. La,et al.  Measurement based optimal multi-path routing , 2004, IEEE INFOCOM 2004.

[3]  Jong Bae Kim,et al.  Unsupervised moving object segmentation and recognition using clustering and a neural network , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[4]  Paul A. Viola,et al.  Robust Real-Time Face Detection , 2001, International Journal of Computer Vision.

[5]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[6]  Ada Wai-Chee Fu,et al.  Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances , 2000, The VLDB Journal.

[7]  Ali R. Hurson,et al.  Automated resolution of semantic heterogeneity in multidatabases , 1994, TODS.

[8]  Paul A. Viola,et al.  Robust Real-time Object Detection , 2001 .

[9]  Martial Hebert,et al.  Combining Simple Discriminators for Object Discrimination , 2002, ECCV.

[10]  Charles E. Perkins,et al.  An implementation study of the AODV routing protocol , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[11]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[12]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[13]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[14]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[15]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[16]  Sergey Ioffe,et al.  Human tracking with mixtures of trees , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[17]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[18]  Daniel P. Huttenlocher,et al.  Efficient matching of pictorial structures , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[19]  Shih-Fu Chang,et al.  Multimedia access and retrieval: the state of the art and future directions (panel session). , 1999, ACM Multimedia.