iosr-JCE   Volume-6 ~ Issue-4

Abstract:In this paper we introduce the notion of fuzzy bitopological ideals .The concept of fuzzy pairwise local function is also introduced here by utilizing the q-neighborhood structure for a fuzzy topological space .These concepts are discussed fuzzy bitopologies and several relations between different fuzzy bitopological ideals .
Keywords: Fuzzy bitopological space; fuzzy ideals; fuzzy pairwise local function

[1] M. K. Chakraborty and T.M.G. Ahasanullah, Fuzzy topology on fuzzy sets and tolerance topology, Fuzzy Sets and Systems 45
(1992) 103-108.
[2] C. L. Chang, Fuzzy Topological Spaces, J. Math. Anal. Appl. 24 (1968) 128 - 189.
[3] Pu Pao - Ming and Liu Ying, Fuzzy Topology.1. Neighbourhood structure of a fuzzy point and moore smith convergence, J.
Math. Anal. Appl. 76 (1980) 571 - 599.
[4] A. A. Nouh, On separation axioms in fuzzy bitopological spaces, Fuzzy Sets and Systems, 80(1996)225-236.
[5] Debasis Sarkar, Fuzzy ideal theory, Fuzzy local function and generated fuzzy topology, Fuzzy Sets and Systems 87 (1997) 117
- 123.
[6] L . A. Zadeh, Fuzzy Sets Inform. and Control 8 (1965) 338 - 353.

Abstract:A spanning tree of à connected graph is à sub graph, with least number of edges that still spans. The problem of finding degree constraint spanning tree is known to be NP-hard. In this paper we discuss an Ant-Based algorithm for finding minimum degree spanning trees and give improvement of the algorithm. We also show comparisons among the three algorithms and find the best improved Ant-Based algorithm. Extensive experimental results show that our improved algorithm performs very well against other algorithms on a set of 50 problem instances.
Keywords - Ant algorithm, Graph algorithms, Heuristic methods, minimum degree spanning tree,

[1]. Dorigo, M., V. Maniezzo, and A. Colorni, "Ant System: Optimization by a Colony of Cooperating Agents," IEEE Trans. on
Systems, Man, and Cybernetics - Part B, 26(1), Feb. 1996, pp. 29–41.
[2]. Volgenant, A., "A Lagrangean Approach to the Degree-Constrained Minimum Spanning Tree Problem," European Journal of
Operational Research, 39, 1989, pp. 325–331.
[3]. Eila Safari and Azizallah Rahmati, "Using Learning Automata to Solving Degree-constrained Minimum Spanning Tree Problem",
Australian Journal of Basic and Applied Sciences, 5(6): 337-341, 2011, ISSN 1991-8178
[4]. Minh N. Doan," An Effective Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem", 1-4244-1340-
0/07$25.00_c 2007 IEEE
[5]. YOON-TECK BAU, CHIN-KUAN HO AND HONG-TAT EWE, "Ant Colony Optimization Approaches to the Degreeconstrained
Minimum Spanning Tree Problem", JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 1081-1094
(2008)
[6]. Thang N. Bui and Catherine M. Zrncic, "An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree",
GECCO'06, July 8–12, 2006, Seattle, Washington, USA.
[7]. Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, and Kunal Talwar, "A Push-Relabel Algorithm for Approximating Degree
Bounded MSTs"
[8]. Savelsbergh, M. and T. Volgenant, "Edge Exchanges in the Degree-Constrained Minimum Spanning Tree Problem," Computers
and Operations Research, 12(4), 1985, pp. 341–348.
[9]. Marck De Berg, Marc Van Kreveld and Mark Overmars, "Computational Geometry Algorithms and Applications".
[10]. Marco Dorigo, Mauro Birattari, and Thomas Stutzle, "Ant Colony Optimization-Artificial Ants as a Computational Intelligence
Technique".

Abstract:All researches shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. And all these studies have been done up to some level only.So for that purpose now iam using an protocol technique called Dynamic Source routing (DSR). And previous studies have been done mainly by using an AODV routing technique and these are all at high level and leaving many design and implementation issues unanswered. In this paper, I am mainly presenting my design and implementation of cooperative cache in wireless P2P networks, and propose solutions to find the best place to cache the data. For that one I propose an novel asymmetric cooperative cache approach by using an Dynamic Source Routing Protocol. By using these technique I can say that packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. The data has been accessed easily by the user. And also by using an data pipelines we can reduce the end-toend delays between the server and client. My results show that the Dynamic Source Routing out performs the AODV in wireless P2P networks.
Keywords:wireless networks, caching, protocols, DSR.

[1]. R. Agu¨ ero and J.P. Campo, "Adding Multiple Interface Support in NS-2," Jan. 2007.
[2]. G. Cao, L. Yin, and C. Das, "Cooperative Cache-Based Data Access in Ad Hoc Networks," Computer, vol. 37, no. 2, pp. 32-39,
Feb. 2004.
[3]. W. Lau, M. Kumar, and S. Venkatesh, "A Cooperative Cache Architecture in Supporting Caching Multimedia Objects in
MANETs," Proc. Fifth Int'l Workshop Wireless Mobile Multimedia, 2002.
[4]. B. Barr, J. Bicket, D. Dantas, B. Du, T. Kim, B. Zhou, and E. Sirer, "On the Need for System-Level Suppport for Ad Hoc and
Sensor Networks," ACM Operating System Rev., vol. 36, no. 2, pp. 1-5, Apr. 2002.
[5]. E. Royer and C. Perkins, "An Implemenatation Study of the
[6]. AODV Routing Protocol," Proc. IEEE Wireless Comm. and
[7]. Networking Conf., 2000.
[8]. J. Bicket, D. Aguayo, S. Biswas, and R. Morris, "Architecture and Evaluation of an Unplanned 802.11b Mesh Network," Proc.
ACM MobiCom, 2005.
[9]. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web Caching and Zipf-like Distributions: Evidence and Implications,"
Proc. IEEE INFOCOM, 1999.
[10]. M. Cieslak, D. Foster, G. Tiwana, and R. Wilson, "Web Cache Coordination Protocol v2.0," IETF Internet Draft, 2000.