Web Service Composition Framework using Petrinet and Web Service Data Cache in MANET
Keywords:
Data Cache, Web Service, Distributed Spanning Tree, Ant Colony Optimization, MANET, OMNeTAbstract
A Mobile Ad Hoc Network (MANET) is characterized by multi-hop wireless links and frequent node mobility. Every neighboring node in the MANET is likely to have similar task and interests, several nodes might need to access the similar web service at different times. So, by caching the repeatedly accessed web service data within MANET, it is possible to reduce the cost of accessing the same service details from the UDDI and also from the external providers. Composition of web services leads to a better alternative as, at times a candidate web service may not completely serve the need of the customer. An effective Data Cache Mechanism (DCM) has been proposed in [6] using the Distributed Spanning Tree (DST) as a communication structure in Mobile network to improve scalability and lessen network overload. As an enhancement, Ant Colony Optimization (ACO) technique has been applied on DST to cope with the fragile nature of the MANET and to improve the network fault tolerance [1]. In these perspectives, an efficient Web Service Cache Mechanism (WSCM) can be modeled to improve the performance of the web service operations in MANET. In this paper, a fine grained theoretical model has been formulated to assess the various performance factors such as Cooperative Cache and Mobility Handoff. In addition to these, the performance improvement of WSCM using DST and ACO optimized DST techniques in MANET has been proved experimentally using Precision and Data Reliability of the system using appropriate simulation.References
R. Baskaran, P. Victer Paul and P. Dhavachelvan (2012), Ant Colony Optimization for Data Cache Technique in MANET, Int. Conf. on Advances in Computing (ICADC 2012), Advances in Intelligent and Soft Computing series, India, Springer, 873-878.
Hassan Artail and Khaleel Mershad (2009); MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks , IEEE Transactions on Mobile Computing, 8(10): 1412 - 142.
MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks, IEEE Transactions on Mobile Computing, 8(10): 1412 - 142. http://dx.doi.org/10.1109/TMC.2009.56
Lan Wang and Stephan Olariu (2005); Cluster Maintenance in Mobile Ad-hoc Networks, Springer Science + Business Media, 8: 111-118.
P. Krishna, M. Chatterjee, N. Vaidya and D. Pradhan(1997); A cluster-based approach for routing in ad-hoc networks, ACM SIGCOMM Computer Communication, 27(2): 49-64.
P. Victer Paul, N. Saravanan, S.K.V. Jayakumar, P. Dhavachelvan, R. Baskaran (2008); QoS Enhancements for Global Replication Management in Peer to Peer networks, Future Generation Computer Systems, Elsevier, 28(3):573-582.
P. Victer Paul, D. Rajaguru, N. Saravanan, R. Baskaran and P. Dhavachelvan (2013); Efficient service cache management in mobile P2P networks, Future Generation Computer Systems, Elsevier, 29(6): 1505-1521.
Sylvain Dahan (2005); Distributed Spanning Tree Algorithms for Large Scale Traversals, 11th International Conference on Parallel and Distributed Systems (ICPADS'05), DOI: 10.1109/ICPADS.2005.131 , 1: 453-459. http://dx.doi.org/10.1109/ICPADS.2005.131
P. Victer Paul, T. Vengattaraman, P. Dhavachelvan (2010); Improving efficiency of Peer Network Applications by formulating Distributed Spanning Tree, Third International Conference on Emerging Trends in Engineering & Technology (ICETET-2010), IEEE, India, 813-818.
R. Baskaran, P. Victer Paul and P. Dhavachelvan (2012); Algorithm and Direction for Analysis of Global Replica Management in P2P Network, IEEE International Conference on Recent Trends in Information Technology (ICRTIT), May 2012, Chennai, 211 - 216.
Sylvain Dahan, Jean-Marc Nicod and Laurent Philippe (2005); The Distributed Spanning Tree: A Scalable Interconnection Topology for Efficient and Equitable Traversal, International Symposium on Cluster Computing and the Grid, 2005 IEEE.
The Distributed Spanning Tree: A Scalable Interconnection Topology for Efficient and Equitable Traversal, International Symposium on Cluster Computing and the Grid, 2005 IEEE.
Sylvain Dahan (2005); Distributed Spanning Tree Algorithms for Large Scale Traversals, 11th International Conference on Parallel and Distributed Systems (ICPADS'05), DOI: 10.1109/CCGRID.2005.1558561, 1: 243-250. http://dx.doi.org/10.1109/CCGRID.2005.1558561
R. Friedman (2002); Caching Web Services in Mobile Ad-Hoc Networks: Opportunities and Challenges, Proc. Second ACM Intl Workshop Principles of Mobile Computing, 90-96. http://dx.doi.org/10.1145/584490.584508
J. Zhao, P. Zhang, G. Cao, and C. Das (2010); Cooperative caching in wireless p2p networks: Design, implementation, and evaluation, Parallel and Distributed Systems, IEEE Transactions on, 21(2):229-241.
S. Lim, W. Lee, G. Cao, and C. Das (2006); A Novel Caching Scheme for Internet Based Mobile Ad Hoc Networks Performance, Ad Hoc Networks, 4(2):225-239.
A Novel Caching Scheme for Internet Based Mobile Ad Hoc Networks Performance, Ad Hoc Networks, 4(2):225-239. http://dx.doi.org/10.1016/j.adhoc.2004.04.013
N. Chand, R. C. Joshi, and M. Misra (2006); Efficient cooperative caching in ad hoc networks. COMSWARE, DOI:10.1109/COMSWA.2006.1665190, 1-8. http://dx.doi.org/10.1109/COMSWA.2006.1665190
Fan Ye, Qing Li, and EnHong Chen, Adaptive caching with heterogeneous devices in mobile peer to peer network, ACM Symposium on Applied Computing (SAC '08). ACM, New York, USA, 1897-1901.
Guohong Cao, Liangzhong Yin, Chita R. Das (2004);
Cooperative Cache- Based Data Access in Ad Hoc Networks, Pennsylvania State University, IEEE Computer Society, February 2004, 32-39.
Hassan Artail and Khaleel Mershad (2009); MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks, IEEE Transactions on Mobile Computing, 8(10): 1412 - 142.
MDPF: Minimum Distance Packet Forwarding for search applications in mobile ad hoc networks, IEEE Transactions on Mobile Computing, 8(10): 1412 - 142. http://dx.doi.org/10.1109/TMC.2009.56
Dorigo, M., Maniezzo, V., Colorni A. (1991); The ant system: An autocatalytic optimizing Process. Tech.Rep. 91-016 Revised, Politecnico di Milano, Italy.
A. Colorni, M. Dorigo, V. Maniezzo (1991); Distributed optimization by ant colonies, Proc. of ECAL91 European Conference on Artificial Life, Elsevier Publishing, Amsterdam, The Netherlands, 134-142.
P. Victer Paul, T. Vengattaraman, P. Dhavachelvan and R. Baskaran (2010); Improved Data Cache Scheme using Distributed Spanning Tree in Mobile Adhoc Network, The International Journal of Computer Science and Communication (IJCSC), 1(2): 329-332.
Published
Issue
Section
License
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.
