| 1 |
Front Matter |
|
|
Abstract
|
| 2 |
Improved Ant Colony Optimization Technique for Mobile Adhoc Networks |
Mano Yadav,K. V. Arya,Vinay Rishiwal |
|
Abstract
Efficient routing is a crucial issue in Mobile Adhoc Networks. This paper proposes an improved algorithm for routing in mobile adhoc networks based on the Ant Colony Optimization (ACO) technique. The proposed improved ACO (I-ACO) performs routing by making use of transition probability among nodes along with available pheromone update information in ACO principle. This approach reduces the cost of ant agents. I-ACO has two phases . route discovery and route maintenance and also utilizes the concept of backtracking when the packets reaches destination node..Simulation results show that I-ACO achieves better packet delivery ratio and reduces the average end-to-end-delay as compare to its counterpart AODV. This scheme can be incorporated in any version of the on demand routing protocol. In this paper it has been implanted in the basic AODV protocol.
|
| 3 |
A Performance Comparison Study of Two Position-Based Routing Protocols and Their Improved Versions f |
Natarajan Meghanathan |
|
Abstract
The high-level contribution of this paper is a detailed simulation based analysis of the performance of two well-known position-based routing protocols - Greedy Perimeter Stateless Routing (GPSR) and the Geographical Routing Protocol based on Prediction (GRPP) and their improved versions to handle perimeter forwarding. The two strategies adopted to improve the performance of position-based routing protocols and better handle perimeter forwarding are: Destination-node Location Prediction (DNP) and Advanced Greedy Forwarding (AGF) approaches. We use a scalable location service scheme, referred as Hierarchical Location Service (HLS) to periodically disseminate the location information of the nodes in the network. The simulations were conducted in ns-2 under different conditions of network density, node mobility and offered traffic load. Performance results indicate that with a slightly larger location service overhead, the improved versions of GPSR and GRPP based on DNP and AGF yield a relatively lower hop count, end-to-end delay per data packet and a larger packet delivery ratio.
|
| 4 |
Privacy Preserving Naïve Bayes Classification Using Trusted Third Party Computation over Distributed |
Keshavamurthy B.N.,Durga Toshniwal |
|
Abstract
Privacy-preservation in distributed progressive databases is an active area of research in recent years. In a typical scenario, multiple parties may wish to collaborate to extract interesting global information such as class labels without revealing their respective data to each other. This may be particularly useful in applications such as customer retention, medical research etc. In the proposed work, we aim to develop a global classification model based on the Naïve Bayes classification scheme. The Naïve Bayes classification has been used because of its simplicity, high efficiency. For privacy-preservation of the data, the concept of trusted third party with two offsets has been used. The data is first anonymized at local party end and then the aggregation and global classification is done at the trusted third party. The proposed algorithms address various types of fragmentation schemes such as horizontal, vertical and arbitrary distribution required format. The car-evaluation dataset is used to test the effectiveness of proposed algorithms.
|
| 5 |
Cluster Based Mobility Considered Routing Protocol for Mobile Ad Hoc Network |
Soumyabrata Saha,Rituparna Chaki |
|
Abstract
Mobile ad hoc networks consist of wireless hosts that communicate with each other without the support of fixed infrastructure. In case of large network, a flat structure may not be the most efficient organization for routing. For this purpose many clustering schemes have been proposed that organize the MANET into a hierarchy, with a view to improve the efficiency of routing. In this paper, we have presented a brief review of the state of the art scenario of routing topologies for mobile ad hoc networks and try to present a scheme that leads to cluster formation which efficiently uses the resources of the MANET. The proposed Cluster Based Mobility Considered Routing Protocol obtains efficient communications among MANET and achieves scalability in large networks by using the clustering technique. The new algorithm takes into consideration the mobility factor during routing and as well as computational overhead is also diminished.
|
| 6 |
Speech Transaction for Blinds Using Speech-Text-Speech Conversions |
Johnny Kanisha,G. Balakrishanan |
|
Abstract
Effective human computer interaction requires speech recognition and voice response.In this paper we present a concatenative Speech-Text-Speech(STS) system and discuss the issues relevant to the development of perfect human-computer interaction.The new STS system allows the visually impaired people to interact with the computer by giving and getting voice commands.Audio samples are collected from the individuals and then transcribed to text.A text file is used ,where the meanings for the transcribed texts are stored.In the synthesis phase,the sentences taken from the text file are converted to speech using unit selection synthesis.The proposed method leads to a perfect human-computer interaction
|
| 7 |
Floating-Point Adder in Techology Driven High-Level Synthesis |
M. Joseph,Narasimha B. Bhat,K. Chandra Sekaran |
|
Abstract
Implementation of floating-point algorithms in fixed-point processor asks for customization into fixed-point for that processor. Technology driven High-Level Synthesis is a customized High-Level Synthesis approach for a particular fixed-point processor. It makes the present High-Level Synthesis knowledgeable of the target Field Programmable Gate Array. All the functions of High-Level Synthesis become aware of target technology since parsing here. It makes right inference of hardware by attaching target technology specific attributes to the parse tree in it, which guides to generate optimized hardware. This paper, integrating both, presents an approach to synthesize the floating-point algorithms in this customized tool. It performs the conversion of floating-point model into corresponding fixed-point model and synthesizes it for implementing onto an Field Programmable Gate Array. This compiler driven approach generates optimal output in terms of silicon usage and power consumption.
|
| 8 |
Differential Artificial Bee Colony for Dynamic Environment |
Syed Raziuddin,Syed Abdul Sattar,Rajya Lakshmi,Moin Parvez |
|
Abstract
This paper introduces a novel variant of artificial bee colony algorithm for complex multimodal and dynamic optimization problem. The Differential Artificial Bee Colony (DABC) is proposed to enhance the bees update strategy for improving the quality of solutions. The DABC is also integrated with external archive to preserve the good solutions produced through the generations and contributing to the better search strategy. Comprehensive analysis of proposed algorithm is carried out on standard benchmark problems with higher dimensions (10, 30 and 50) and on dynamic optimization problems. The algorithmic suitability, robustness and convergence rate are investigated. Results show that the performance of the proposed algorithm is better and competitive to those of the other population based stochastic algorithms.
|
| 9 |
FAM2BP: Transformation Framework of UML Behavioral Elements into BPMN Design Element |
Jayeeta Chanda,Ananya Kanjilal,Sabnam Sengupta,Swapan Bhattacharya |
|
Abstract
Business processes are an integral part of service-oriented architecture. A typical business process spans multiple Use Cases. Use case diagram along with activity diagrams represents the behavior of a design in the analysis phase for an object-oriented system. In this paper, we propose a relational model, "Formalized Analysis Model to Business Process (FAM2BP)" for transformation of Formalized Analysis Model (FAM) of object-oriented systems into BPMN process for SOA application. FAM consists of a set of grammar based formalized Use case and Activity diagram elements of UML. FAM2BP propose some rules that will help the designer to generate business processes for SOA application directly from object oriented analysis models. This model would help in evolution of software design and development paradigms from Object Oriented to Service Oriented systems.
|
| 10 |
A Cross-Layer Framework for Adaptive Video Streaming over IEEE 802.11 Wireless Networks |
Santhosha Rao,M. Vijaykumar,Kumara Shama |
|
Abstract
Development in video compression techniques and wireless techniques has resulted in considerable amount of video streaming applications in the wireless networks. However, the time varying transmission characteristic of the wireless channels leads to poor performance of multimedia traffic over wireless networks. This results in longer packet delay, jitter and lower throughput that deteriorate the video quality considerably at the receiving end, thus diminishing the user experience. In this work, we propose cross-layer framework which optimizes the transcoding rate at the application layer depending upon the channel condition estimated using parameters associated with the data-link layer. Further, we evaluate the proposed frame work using NS-2 simulator with EvalVid framework. We use three different motion video sequences to evaluate the proposed frame work. Our simulation result shows that the proposed cross-layer frame work improves the video quality in all the three cases at the receiving end.
|
| 11 |
FIFO Optimization for Energy-Performance Trade-off in Mesh-of-Tree Based Network-on-Chip |
Santanu Kundu,T. V. Ramaswamy,Santanu Chattopadhyay |
|
Abstract
This paper presents an exhaustive study about the impact of FIFO optimization on performance and energy consumption in a Mesh-of-Tree (MoT) based Network-on-Chip (NoC) architecture. A generic NoC router has FIFO at each input and output channel. The paper shows that FIFO is the most energy hungry component in a NoC router. On the design trade-off front, we establish that elimination of FIFO from the output channel reduces energy consumption significantly at the cost of marginal performance degradation.
|
| 12 |
Outliers Detection as Network Intrusion Detection System Using Multi Layered Framework |
Nagaraju Devarakonda,Srinivasulu Pamidi,V. Valli Kumari,A. Govardhan |
|
Abstract
Outlier detection is a popular technique that can be utilized for finding Intruders. Security is becoming a critical part of organizational information systems. ..... is an important detection system that is used as a counter measure to preserve data integrity and system availability from attacks [2]. However, current researches find that it is extremely difficult to find out outliers directly from high dimensional datasets. In our work we used entropy method for reducing high dimensionality to lower dimensionality, where the processing time can be saved without compromising the efficiency. Here we proposed a framework for finding outliers from high dimensional dataset and also presented the results. We implemented our proposed method on standard dataset kddcup’99 and the results shown with the high accuracy.
|
| 13 |
A New Routing Protocol for Mobile Ad Hoc Networks |
S. Rajeswari,Y. Venkataramani |
|
Abstract
Mobile Adhoc Networks (MANETs) is a wireless infrastructure-less network, where nodes are free to move independently in any direction. The nodes have limited battery power; hence we require energy efficient routing protocols to optimize network performance. This paper aims to develop a new routing algorithm based on the energy status of the node. In this paper, it has been proposed a new Protocol for Mobile Adhoc Networks which is expected to achieve energy efficiency and reliability. The gossiping probability of a node is determined by the throughput. Differently from other proposals no external location service support, e.g., via GPS, is not required. Rather, the throughput is estimated from the “inside” of the network using feedback factor through the node propagation to the destination and the value of gossiping probability is adaptively adjusted. This results in less energy consumption and more reliability in the network.
|
| 14 |
Remote-Memory Based Network Swap for Performance Improvement |
Nirbhay Chandorkar,Rajesh Kalmady,Phool Chand,Anup K. Bhattacharjee,B. S. Jagadeesh |
|
Abstract
On High Performance Computing Clusters we run scientific application programs which are highly memory intensive. Such applications require large amount of primary memory, the execution of which causes swapping on to the secondary memory of the cluster nodes. As the swapped blocks reside on the secondary memory (disk), any access to these affects the throughput of the applications significantly. In this paper we discuss the design and development of a fast and efficient swap device. This device is a network based, pseudo block device, developed to improve the performance of memory intensive work loads by dynamically unifying free physical memory of various nodes of a cluster over the network. We also discuss the performance observed over different network interconnects.
|
| 15 |
Collaborative Alert in a Reputation System to Alleviate Colluding Packet Droppers in Mobile Ad Hoc N |
K. Gopalakrishnan,V. Rhymend Uthariaraj |
|
Abstract
The nature of the ad hoc network seems to have a promising future in real world and vast researches are going on to make the network more secure in an open wireless environment. The misbehaving nodes in ad hoc network results in degradation of overall network throughput and creates difficulty in finding route between nodes. Thus the collaborative nature of ad hoc network seems to be endangered due to the presence of misbehaving nodes and even get worse when the misbehaving node colludes to misbehave. This paper addresses a colluding packet dropping misbehavior and proposes a collaborative alert mechanism in a reputation system to alleviate it. The simulation result shows that the proposed system increases overall network throughput, reduces the malicious drop and false detection when compared to existing system and defense less scenario.
|
| 16 |
Secure Service Discovery Protocols for Ad Hoc Networks |
Haitham Elwahsh,Mohamed Hashem,Mohamed Amin |
|
Abstract
Ad-hoc networks, mobile devices communicate via wireless links without the aid of any fixed networking infrastructure. These devices must be able to discover services dynamically and share them safely, taking into account ad-hoc networks requirements such as limited processing and communication power, decentralized management, and dynamic network topology, among others. Legacy solutions fail in addressing these requirements. In this paper, we propose a service discovery protocol with security features, the Secure Pervasive Discovery Protocol. SPDP is a fully distributed protocol in which services offered by devices can be discovered by others, without a central server. It is based on an anarchy trust model, which provides location of trusted services, as well as protection of confidential information, secure communications, or access control.
|
| 17 |
Certificate Path Verification in Peer-to-Peer Public Key Infrastructures by Constructing DFS Spannin |
Balachandra,Ajay Rao,K. V. Prema |
|
Abstract
Authentication of users in an automated business transaction is commonly realized by means of a Public Key Infrastructure(PKI). A PKI is a framework on which the security services are built. Each user or end entity is given a digitally signed data structure called digital certificate. Peer-to-Peer(also called Mesh PKI) architecture is one of the most popular PKI trust models that is widely used in automated business transactions, but certificate path verification is very complex since there are multiple paths between users and the certification path is bidirectional. In this paper, we propose a novel method to convert a peer-to-peer PKI to a Depth First Search(DFS) spanning tree to simplify the certificate path verification by avoiding multiple paths between users, since the DFS spanning tree equivalent of peer-to-peer PKI contains only one path between any two Certification Authorities.
|
| 18 |
A Novel Deadlock-Free Shortest-Path Dimension Order Routing Algorithm for Mesh-of-Tree Based Network |
Kanchan Manna,Santanu Chattopadhyay,Indranil Sen Gupta |
|
Abstract
This paper presents a new dimension ordered routing algorithm for Mesh-of-Tree (MoT) based Network-on-Chip (NoC) designs. The algorithm has been theoretically proved to be deadlock, live-lock and starvation free. It also ensures shortest-path routing for the packets. The simplified algorithm, compared to the previously published works, provides same throughput and average latency measures, at a lesser hardware overhead (about 61% for routers, 46% for links, and 44% in total) due to possible reduction in the minimum flit-size. It allows us to vary router complexity more flexibly while planning the MoT based NoC for application specific System-on-Chip (SoC) synthesis.
|
| 19 |
2-D DOA Estimation of Coherent Wideband Signals Using L-Shaped Sensor Array |
P. M. Swetha,P. Palanisamy |
|
Abstract
In this paper, a two-dimensional (2-D) direction-of-arrival (DOA) angle estimation method for coherent wideband signals using L-shaped array is introduced. This method estimates the elevation and azimuth angles using ESPRIT technique.The incident wideband signals are assumed to be coherent and hence some decorrelation techniques are employed to decorrelate them. Then the cross-correlation matrix is found. The proposed method reconstructs the signal subspace using cross-correlation matrix and then ESPRIT algorithm is employed to estimate the azimuth and elevation angles. This approach enables the 2-D DOA estimation without the use of peak search and is robust to noise. Simulation results are presented to verify the effectiveness of the proposed algorithm.
|
| 20 |
An Approach towards Lightweight, Reference Based, Tree Structured Time Synchronization in WSN |
Surendra Rahamatkar,Ajay Agarwal |
|
Abstract
Time synchronization for wireless sensor networks (WSNs) has been studied in recent years as a fundamental and significant research issue. Many applications based on these WSNs assume local clocks at each sensor node that need to be synchronized to a common notion of time. Time synchronization in a WSN is critical for accurate time stamping of events and fine-tuned coordination among the sensor nodes to reduce power consumption. This paper proposes a lightweight tree structured time synchronization approach for WSNs based on reference nodes. This offers a push mechanism for (i) accurate and (ii) low overhead for global time synchronization. Analysis and comparative study of proposed approach shows that it is lightweight as the number of required broadcasting messages is constant in one broadcasting domain.
|
发表于 2025-3-21 19:48:56
