iosr-JCE   Volume-9 ~ Issue-1

Abstract:Intermittently connected network often referred to as Delay/Disruption Tolerant Network which is an infrastructure less network suffers from intermittent connection i.e. a connected path from the source to the destination may be absent or a given destination may not be reachable at the moment a message is sent. As a result traditional routing protocols for Ad hoc networks cannot serve the purpose of this type of intermittently connected network. PROPHET routing protocol works on the principle of history of encounters and transitivity. It is called Probabilistic routing prot ocol since it uses a parameter 'Delivery of Predictability'. In this paper the architecture of delay tolerant network is being discussed and PROPHET protocol is implemented.
Keywords: Delay tolerant network, PROPHET routing protocol, Delivery predictability, Epidemic routing protocol

[1] Kevin Fall, ""A delay-tolerant network architecture for challenged internets". Proceedings of ACM SIGCOMM. USA: ACM Press, 2003.
[2] V. Cerf, et al. , Network ""Delay-Tolerant Networking Architecture",April 2007.
[3] Jahnabi Borah," Application of Computational Intelligence Paradigm in the Probabilistic Routing for intermittently connected network," IOSR Journal of Computer Engineering (IOSRJCEVolume 8, Issue 2, PP 32-36, Nov-Dec. 2012.
[4] Lindgren, et al.,""Probabilistic Routing Protocol for Intermittently Connected Networks‟‟,. Internet Research Task Force (IRTF), August 2012.
[5] A. Lindgren, A. Doria, and O. Scheln, "Probabilistic Routing in Intermittently Connected Networks", in Proc. Workshop on Service
Assurance with Partial and Intermittent Resources, August 2004.
[6] Jingfeng Xue, Jiansheng Li, Yuanda Cao, Ji Fang, ""Advanced PROPHET Routing in Delay Tolerant Network" ,International Conference on Communication Software and Networks 2009.
[8] A. Vahdat and B. Becker, "Epidemic Routing for Partially-Connecte Ad- hoc Networks," Technical Report CS-2000-06, Duke
University,July 2000.
[9] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: Efficient routing in intermittently connected mobile networks," in Proceedings of ACMSIGCOMM workshop on Delay Tolerant Networking (WDTN), 2005.

Abstract: A Wireless Sensor Network can break into a number of disconnected paths due to failure of some of the nodes known as cut vertices. In this paper, we propose an efficient algorithm to detect vertices. The neighbor node gets failure intimation from the cut vertex so that the information can be passed to source and destination so that the source can initiate data transmission through alternate path before the cut vertices get breakdown completely. In this way, data loss can be minimized and the cut can be detected truly. The algorithm is distributed and asynchronous so that every node needs to communicate with only those nodes that are within their communication range. The most important advantage is that this method can be used to reduce the time delay needed in detecting cut.
Keywords: alternate path, cut vertex, disconnected paths, intimation and detection, wireless network

[1] Shuguang Xiong and Jianzhong Li, " An Efficient Algorithm for Cut Vertex Detection in Wireless Sensor Networks ", in 2010
International Conference on Distributed Computing Systems,pp368-377.
[2] Prabir Barooah, Harshavardha Chenji, Radu Stolera, and Taman Kalmar-Nagy, "Cut Detection in Wireless Sensor Networks", IEEE
Transaction on parallel and distributed system.
[3] X.Liu, L.Xiao, A.Kreling and Y.Liu, "Optimizing Overlay Topology by Reducing Cut Vertices", in ACM Workshop on Network and Operating System support for Digital Audio and Video (NOSSDAV), 2006.
[4] G.Dini, M.Pelagatti, and I.M.Savino, "An algorithm for reconnecting wireless sensor network partitions", in European Conference
on Wireless Sensor Networks, 2008, pp.253-257.
[5] B. Milic and M. Malek, "Adaptation of the Breadth First Search Algorithm for Cut-edge detection in Wireless Multihop Networks", in ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM),
[6] T.H.Cormen, C.E. Leiserson, R.LRivest and C.Stein, "Introduction to Algorithms (Second Edition)", The MIT Press, 2002.

Abstract:Top-K dominating query is a preference based query which determines the dominating itemset from the data stream. This query combines the notion of ranking function with the concept of dominance. Datastream mining has more constraints and requirements. It determines valuable information from a great deal of primitive data. This is adequate for static datasets, where updates are rare. As many modern applications adopt dynamic datasets, they need continuous query processing algorithms to revive the query result. The Sliding Window defines the set of active points which are the most recently arrived points. The existing work combines the ADVANCED ALGORITHM, the APPROXIMATE HOEFFDING BOUND ALGORITHM and the APPROXIMATE MINIMUM SCORE ALGORITHM. This combination guarantees accuracy, provides faster processing and best performance. The enhancement work proposes the TOP-K SCRUTINIZING ALGORITHM for finding dominant itemset from datastream by partitioning the Sliding Window into buckets of equal size. This is an Event processing algorithm which includes event scheduling and rescheduling towards avoiding the examination of points for inclusion in the Top-K. Experimental results using real datasets and synthetic datasets show that the proposed method reduces CPU time and memory overhead. Also, it is quite efficient and achieves high accuracy.
Keywords: Data-stream, Itemset, Event Processing Algorithms, Sliding Window, Top-K Dominating Queries.

[1] M. Kontaki, A. N. Papadopoulos and Y. Manolopoulos, Continuous Top-K Dominating Queries, Proc. IEEE Transactions on
Knowledge & Data Engineering, Vol. 24, 2012, 840-853.
[2] Di Yang, Avani Shastri, Elke A. Rundensteiner and Mathew O. Ward, An Optimal Strategy for Monitoring Top-k Queries in
Streaming Windows, Proc. Int'l Conf. Extending Database Technology: Advances in Database Technology, 2011.
[3] Kuen-Fang Jea and Chao-Wei Li, A Sliding-Window Based Adaptive Approximating Method to Discover Recent Frequent Itemsets
from Data Streams, Proc. IMECS, 2010.
[4] A. Vlachou, C. Doulkeridis, Y. Kotidis and K. Nørvag, Reverse Top-k Queries, Proc. IEEE Int'l Conf. Data Engg., 2010.
[5] X. Lian and L. Chen, Top-k Dominating Queries in Uncertain Databases, Proc. 12th Int'l Conf. Extending Database Technology:
Advances in Database Technology, 2009.
[6] M. L. Yiu and N. Mamoulis, Multidimensional Top-k Dominating Queries, Proc. Int'l Conf. Very Large Data Bases, 2009, 1-23.
[7] M. Kontaki, A. N. Papadopoulos, and Y. Manolopoulos, Continuous Top-k Dominating Queries in Subspaces, Proc. Panhellenic
Conf. Informatics, 2008.
[8] M. L. Yiu and N. Mamoulis, Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data, Proc. Int'l Conf. Very
Large Data Bases, 2007, 483-494.
[9] K. Mouratidis, S. Bakiras, and D. Papadias, Continuous Monitoring of Top-k Queries over Sliding Windows, Proc. ACM SIGMOD
Int'l Conf. Management of Data, 2006, 635-646.