Abstract

The increasing consumer demand for access to communication services, everywhere and anytime, accelerates technical development to the incorporation of different wireless access technologies. Wireless technologies with the standards of anywhere and anytime present the users of being all the time attached to the network. A multiplicity of present and future network applications require low latency communication. The extremely active environment of infrastructure-less ad-hoc networks poses new problems during service discovery. It is apparent that in present and upcoming environments, dynamic content information from network side entities is tremendously required for the vertical handoff decision procedures. In order to provide absolute connectivity between the new wireless access technologies, the existing context-aware information server store, manage and deliver real-time dynamic information retrieved from both the network and the terminal side entities. It is still necessary to improve the bandwidth and minimize the error rate. To overcome the issues, the study presents Content Aware Service Discovery (CASD) which drops less important message fragments whenever the wireless network is congested with nodes and improves the end-to-end data delivery among information flows. This study presents the integration of prioritize message fragment dropping during bottlenecks and targets end-to-end data delivery integrity between users with improved bandwidth rate. The CASD framework provides clear analysis on the experimental factors such as improved bandwidth rate, increasing the end-to-end data delivery ratio and average utilization while providing services in wireless network when compared to the state-of-the-art.

Keywords:

Content aware service discovery, context aware information server, data delivery scheme, wireless technologies,

References

1. Abrantes, F., J. Taveira-Arau and M. Ricardo, 2011. Explicit congestion control algorithms for time varying capacity media. IEEE T. Mobile Comput., 10(1): 81-93.
   CrossRef    
2. Chiti, F., R. Fantacci, F. Archetti, E. Messina and D. Toscani, 2009. An integrated communications framework for context aware continuous monitoring with body sensor networks. IEEE J. Sel. Area. Comm., 27(4): 379-386.
   CrossRef    
3. Choi, J.H., K.S. Shim, S.K. Lee and K.L. Wu, 2012. Handling selfishness in replica allocation over a mobile ad hoc network. IEEE T. Mobile Comput., 11(2): 278-291.
   CrossRef    
4. Dini, G. and A.L. Duca, 2012. Towards a reputation-based routing protocol to contrast blackholes in a delay tolerant network. Ad Hoc Netw., 10(7): 1167-1178.
   CrossRef    
5. Fenza, G., D. Furno and V. Loia, 2012. Hybrid approach for context-aware service discovery in healthcare domain. J. Comput. Syst. Sci., 78(4): 1232-1247.
   CrossRef    
6. Hou, R., K.S. Lui, F. Baker and J. Li, 2012. Hop-by-hop routing in wireless mesh networks with bandwidth guarantees. IEEE T. Mobile Comput., 11(2): 264-277.
   CrossRef    
7. Incel, O.D., A. Ghosh, B. Krishnamachari and K. Chintalapudi, 2012. Fast data collection in tree-based wireless sensor networks. IEEE T. Mobile Comput., 11(1): 86-99.
   CrossRef    
8. Jeong, J., S. Guo, Y. Gu and T. He, 2012. Trajectory-based statistical forwarding for multihop infrastructure-to-vehicle data delivery. IEEE T. Mobile Comput., 11(10): 1523-1537.
   CrossRef    
9. Kang, S., J. Lee, H. Jang, Y. Lee, S. Park and J. Song, 2010. Scalable and energy-efficient context monitoring framework for mobile personal sensor networks. IEEE T. Mobile Comput., 9(5): 686-702.
   CrossRef    
10. Li, J., S.M. Shatz and A.D. Kshemkalyani, 2011. Mobile sampling of sensor field data using controlled broadcast. IEEE T. Mobile Comput., 10(6): 881-896.
    CrossRef    
11. Liu, C. and G. Cao, 2011. Spatial-temporal coverage optimization in wireless sensor networks. IEEE T. Mobile Comput., 10(5): 465-478.
    CrossRef    
12. Márquez-Barja, J., C.T. Calafate, J.C. Cano and P. Manzoni, 2011. An overview of vertical handover techniques: Algorithms, protocols and tools. Comput. Commun., 34(8): 985-997.
    CrossRef    
13. Neves, P., J. Soares, S. Sargento, H. Pires and F. Fontes, 2011. Context-aware media independent information server for optimized seamless handover procedures. Comput. Netw., 55(7): 1498-1519.
    CrossRef    
14. Rahman, M.A., A. El-Saddik and W. Gueaieb, 2011. Augmenting context awareness by combining body sensor networks and social networks. IEEE T. Instrum. Meas., 60(2): 345-353.
    CrossRef    
15. Sanchez-Pi, N., J. Carbo and J.M. Molina, 2012. A knowledge-based system approach for a context-aware system. Knowl-Based Syst., 27: 1-17.
    CrossRef    
16. Villas, L.A., A. Boukerche, H.S. Ramos, H.A.B.F. de Oliveira, R.B. de Araujo and A.A.F. Loureiro, 2013. DRINA: A lightweight and reliable routing approach for in-network aggregation in wireless sensor networks. IEEE T Comput., 62(4): 676-689.
    CrossRef    
17. Wilson, J. and N. Patwari, 2011. See-through walls: Motion tracking using variance-based radio tomography networks. IEEE T. Mobile Comput., 10(5): 612-621.
    CrossRef    
18. Yan, X., Y.A. Sekercioglu and S. Narayanan, 2010. A survey of vertical handover decision algorithms in Fourth Generation heterogeneous wireless networks. Comput. Netw., 54(11): 1848-1863.
    CrossRef    
19. Yang, S., C.K. Yeo and B.S. Lee, 2012. Toward reliable data delivery for highly dynamic mobile ad hoc networks. IEEE T. Mobile Comput., 11(1): 111-124.
    CrossRef    
20. Yu, P., X. Maa, J. Caob and J. Lua, 2013. Application mobility in pervasive computing: A survey. Pervasive Mob. Comput., 9(1): 2-17.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.