A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Mohanapriya, S.
- Queue Batch Multicast Group Key Agreement Protocol with Communication Security
Authors
1 Department of MCA in K.S.R.College of Engineering, Tiruchengode, IN
2 Department of Computer Science in Periyar University, Salem, IN
Source
Wireless Communication, Vol 3, No 1 (2011), Pagination: 45-50Abstract
With the emergence of many group-oriented distributed applications such as tele / video-conferencing and multiplayer games, there is a need for providing group-oriented communication privacy and data integrity. For this members of the group can establish a common secret key for encrypting group communication data. Traditional secure group communication problems differ from the distributed group key agreement on the characteristics such as distributed, collaborative and dynamic nature. Instead of performing individual rekeying operations, an interval-based approach of rekeying is adopted i.e., Rebuild algorithm, Batch algorithm and the Queue-batch algorithm. The interval-based approach provides rekeying efficiency for dynamic peer groups while preserving both distributed and contributory properties.
The work presented in this paper, concentrated on authenticated group key agreement protocol incorporated into the interval-based algorithms and evaluate the performance to prove its security properties. The Secure Communication Library implemented realizes the interval-based algorithms with a programming interface for the development of secure group-based applications. Performance of these three interval-based algorithms under different settings, such as different join and leave probabilities, is analyzed. The simulation conducted on NS-2 show that the interval-based algorithms significantly outperform the individual rekeying approach. The Queue-batch algorithm performs the best among the three interval-based algorithms. The Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment.
Keywords
Diffie–Hellman protocol,NS-2.
- Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks
Authors
1 Department of Computer Applications (MCA), RVS College of Arts & Science (Autonomous), Sulur, Coimbatore, IN
Source
Programmable Device Circuits and Systems, Vol 5, No 12 (2013), Pagination: 466-478Abstract
Wireless Sensor Networks (WSNs) are increasingly used in data-intensive applications such as micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit all the data generated within an application’s lifetime to the base station despite the fact that sensor nodes have limited power supplies. We propose using low-cost disposable mobile relays to reduce the energy consumption of data-intensive WSNs. Our approach differs from previous work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless transmissions into a holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an optimal routing tree assuming no nodes can move. The second algorithm improves the topology of the routing tree by greedily adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for each node given the constraint that the routing tree topology does not change. We present efficient distributed implementations for each algorithm that require only limited localized synchronization. Because we do not necessarily compute an optimal topology, our final routing tree is not necessarily optimal. However, our simulation results show that our algorithms significantly outperform the best existing solutions.
Keywords
Wireless Sensor Networks, Energy Optimization, Mobile Nodes, Wireless Routing.- A Study on Enhanced Path Sequence Algorithm Using Web Directories
Authors
1 Department of BCA, PSGR Krishnammal College for Women, Coimbatore, Tamilnadu, IN
Source
Fuzzy Systems, Vol 9, No 1 (2017), Pagination: 6-8Abstract
A web directory is not a search engine and does not display lists of web pages based on keywords; instead, it lists web sites by category and subcategory. The categorization is usually based on the whole web site rather than one page or a set of keywords, and sites are often limited to inclusion in only a few categories. Web directories often allow site owners to submit their site for inclusion, and have editors review submissions for fitness.
In dissimilarity to most of the work on Web usage mining, the usage data that are analyzed here communicate to user navigation throughout the Web, to a certain extent than a particular Web site exhibit as a result a high amount of thematic diversity. Due to proxy servers and cached versions of the pages used by the client using ‘Back’, the sessions identified have many missed pages. Enhanced Path Sequence Algorithm proposed there are chances of missing pages after constructing transactions due to proxy servers and caching problems.
Three approaches used for this 1. Time Window: A time window transaction is framed from triplets of ip address, user identification, and time length of each webpage up to a limit called time window. 2. Reference Length approach: This approach is based on the assumption that the amount of time a user spends on a page correlates to whether the page is an auxiliary page or content page for that user. 3. Maximal Forward Reference: A transaction is considered as the set of pages from the visited page until there is a backward reference.
Forward reference pages are considered as content pages and the path is taken as index pages. The primary usage to store sessions and pointers to secondary table which is having complete path navigation.