for Journals by Title or ISSN
for Articles by Keywords
help
Followed Journals
Journal you Follow: 0
 
Sign Up to follow journals, search in your chosen journals and, optionally, receive Email Alerts when new issues of your Followed Jurnals are published.
Already have an account? Sign In to see the journals you follow.
Journal Cover   International Journal of Research in Computer and Communication Technology
  [4 followers]  Follow
    
  This is an Open Access Journal Open Access journal
   ISSN (Print) 2320-5156 - ISSN (Online) 2278-5841
   Published by Suryansh Publications Homepage  [2 journals]
  • Protected And Valuable Cutting For Packet Classification

    • Authors: suresh babu p, kumar d
      Abstract: Hardware implementations of Internet Protocol (IP) classification algorithms have been proposed by the research community over the years to realize high speed routers and Internet backbone. Abstract—Decision-tree-based packet classification algorithms such as HiCuts, HyperCuts, and EffiCuts are most popular classificasion these are  show excellent search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each input packet belongs. However, the primary challenge in implementing this high-level approach lies in the second phase, i.e. how to efficiently combine the results of the single field searches. In this paper, we propose a systolic-array-based architecture on FPGA focusing on the combining techniques in phase two. Classification techniques  approach exploits the rich logic resources on FPGA and achieves high throughput by         deeply pipelining the architecture. We show the area analysis of the design to demonstrate the efficiency in on-chip resource usage. The system will present experimentally evaluate the impact of the size of the input ruleset and number of matching rules from first phase on the performance of our design. Hence, the cutting in the proposed algorithm is deterministic rather than involving the complicated heuristics, and it is more effective inproviding improved search performance and more efficient in memory requirement.
      PubDate: 2015-04-10
      Issue No: Vol. 4 (2015)
       
  • Rattle Adversary In Ip Address Race Of Puzzler Networks

    • Authors: Saranya J, Sorna Sukanya G, Ramesh Kannan R
      Abstract: Large datasets of existent network streams procured from the mutual network are indispensable resource for the exploration group. An application encompasses network modeling and simulation, recognition of privacy assaults, and formalization of research results. Unfortunately, network flows transfer extremely delicate data, and this demoralizes the emergence of those information sets. Indeed, existing techniques for network flow sanitization are vulnerable to different kinds of assaults, and results suggested for micro data anonymity cannot be directly applied to network traces. In this paper we provide an extremely secure transfer of delicate data through network flows by obfuscating the IP address. We discover the risks presented by the incremental release of network flows, we suggest a modern defense algorithm, and we officially certify the attained confidentiality guarantees. We group hosts based on the fingerprint and obfuscated address and secure the IP address during the release of incremental network flows. We demonstrate it by sending text and image through the flows and showcase how the quality of the data sent remain unchanged and completely secured. An ample speculative assessment of the algorithm for incremental obfuscation, performed with billions of existent Internet flows, reveals that our obfuscation technique conserves the utility of flows for network traffic analysis.
      PubDate: 2015-04-03
      Issue No: Vol. 4 (2015)
       
  • Multiple Private Keys with NTRU Cryptosystem

    • Authors: Dr. Rakesh Nayak, Ashok Kumar Nanda, Prof. (Dr.) Lalit Kumar Awasthi
      Abstract: Each organization needs to protect their useful information from unauthorized users in wireless environment. Every person needs to access confidential information in less time. That means the encryption and decryption times will be as possible as minimum with providing at maximum security. It is a challenging task to meet both fastest encryption/decryption times. In Public cryptosystem, both Public and Private keys are essential to perform encryption/decryption. In this paper, we proposed a novel algorithm to generate single Public Key associated with many different multiple Private Keys by using original NTRU algorithm. Recipients can decrypt message using their own authenticated multiple Private Keys. The main advantage of our novel algorithm is to save more encryption time and computational power. Therefore, the proposed algorithm is efficient and economical in terms of computational time.
      PubDate: 2015-04-03
      Issue No: Vol. 4 (2015)
       
  • Business Analytics Focusing on Embeddable Reporting

    • Authors: Rahul Neelakantam Katkury, Razia Sulthana
      Abstract: The Business analytics is needed in Organizations where collection of data is  increasingly large these data source need to be interpreted in  an easy way to be able to make profitable decision in the limited time available with the organization due to the  rapid increase in the data it gets  complex to keep   track of the data and get a  viable result. Thus a data analyst is involved due to the increasingly large amount of the data growing  exponentially .The objective of this paper is to focus not just on the analytical operations performed on the data sources but also  to report  them through  various data  visualization and   representation of this raw data sources in  charts  and various  other easily human understandable format.
      PubDate: 2015-04-03
      Issue No: Vol. 4 (2015)
       
  • Secret Sharing of Convergent Keys to Third Party Concept of Dekey

    • Authors: vaishali ravindran, D.S.ArulMozhi Arasi, Saranya M
      Abstract: Data de-duplication is a method for eliminating redundant data copies and has been widely used in cloud storage provider to reduce the storage space and bandwidth. The arising challenge is to perform secure de-duplication in cloud storage provider. The convergent encryption has been extensively adopted for secure de-duplication, but a critical issue is that managing a huge number of convergent keys. This paper makes the attempt to formally address the problem of achieving a reliable and efficient key management in secure de-duplication of data. We first introduce a normal approach in which each user holds a master key independently for encrypting the convergent keys and outsourcing them to the cloud provider. However, such a baseline key management scheme generates an enormous number of  master keys with the increasing number of users in the cloud and requires users to dedicatedly protect the keys . To this end, we propose Dekey, a new technique in which users do not need to manage any keys on their own but instead distribute the keys to multiple servers. Analysis of security demonstrates that Dekey is secured in terms of the definitions specified in the proposed security model. As a proof of ownership concept, we implement Dekey using the Ramp secret sharing scheme and demonstrate that Dekey incurs limited overhead in realistic environments.
      PubDate: 2015-04-03
      Issue No: Vol. 4 (2015)
       
  • Hadoop MapReduce Job Scheduler Implementation and Analysis in
           Heterogeneous Environment

    • Authors: Swathi Prabhu, Anisha P Rodrigues
      Abstract: Hadoop MapReduce is one of the popular framework for BigData analytics. MapReduce cluster is shared among multiple users with heterogeneous workloads. When jobs are concurrently submitted to the cluster, resources are shared among them so system performance might be degrades. The issue here is that schedule the tasks and provide the fairness of resources to all jobs. Hadoop supports different schedulers than the default FIFO scheduler We started experiment on Hadoop FIFO, Fair and Capacity scheduler with heterogeneous workloads. Our aim is to compare the different job scheduler with heterogeneous workload and it is important to understand the task scheduler parameter, based on that we considered few parameter for the performance analysis.
      PubDate: 2015-04-03
      Issue No: Vol. 4 (2015)
       
  • Detecting Misbehaving Node In Ad-Hoc Network By Audit Mechanism

    • Authors: Sushma K D, Rukmani R, Sandhiya Sri A, Aravindhan B
      Abstract: The purpose of this project is to detect misbehaving nodes and isolate them in order to make successful message forwarding in ad-hoc networks. In this project we are trying to find the node which does not forward the packets. A new system is being developed which helps us to identify and remove the node from any path that might be used in the future. The AMD systems uses three main important modules which helps in the process of the finding the mis-behaving node. The modules are Reputation module, Route Discovery module and Audit module. Compared to the existing system, the proposed system allows us to achieve per-packet behavior using AMD without increasing the energy, overhearing techniques. Moreover AMD can detect selective dropping attacks even if end-to-end traffic is encrypted. It can be applied to multi-channel networks consisting nodes with directional antennas.  The existing system fail to detect the nodes which drops the packet during the message forwarding process. The proposed system detects the nodes which drops the packets and it also detects an alternate path for the packet to reach the destination from the source without any hindrance and with low energy expenditure, low cost.
      PubDate: 2015-04-03
      Issue No: Vol. 4 (2015)
       
  • Implementation of Wireless Sensor Hub to Support Protocols
           Interoperability

    • Authors: Hitixa Rajeshkumar Patel
      Abstract: This Paper presents a wireless sensor hub which supports protocols interoperability such as MiWi and WiFi protocol. The wireless sensor network/hub (WSN) is a combination of sensing, computation, and communication in to a single tiny device. The coordinator usually undertake the task to collect sensor data information, process the information and also as the interface of the network with the user. The data is gathered on gateway/PC-Beagle board and it is send to the web server. Data communication is done on PIC and Linux platform using MiWi and WiFi protocols.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Intensification Of Dark Mode Images Using FFT And Bilog Transformation

    • Authors: Dhruthi Yeleshetty, Shilpa A, Sherine Mary R
      Abstract: With the advancement of technologies, the images are created with more and more enhancement. Our project is based on creating a generalized equalization model for image enhancement and further improving the same using Fast Fourier Transform and Bilog Transformation. Here, we analyse the relationship between image histogram and contrast enhancement and white balancing. In the proposed system, we enhance not only images, but also videos both live and recorded. The original image is stored in RAW format which is too big for normal displays. Hence we make use of tone mapping techniques such as Gamma Correction. White Balancing and Contrast Enhancement are two categories of tone mapping. We make use of histogram analysis which is the combination of both the categories of tone mapping in this process. In order to enhance the generalized equalization model, FFT filter is used to find the intensity, i.e., whether the image has low resolution or high resolution. Then, in order to naturalize the image we use Bilog transformation. Using Bilog transformation, we map the illumination to make a balance between the details and naturalness. Then we use NTSC colour space evaluation in order to get the complete enhanced image.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Design Of Ternary Logic Gates Using CNTFET

    • Authors: Aashish Keshavajibhai Ughareja, Jimmy Nilkumar Sutaria
      Abstract: This paper presents a novel design of ternary logic gates like STI,PTI,NTI,NAND and NOR using carbon nanotube field effect transistors. Ternary logic is a promising alternative to the conventional binary logic design technique, since it is possible to accomplish simplicity and energy efficiency in modern digital design due to the reduced circuit overhead such as interconnects and chip area. In this paper novel design of basic logic gates for ternary logic based on CNTFET, is proposed.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Perceiving TheMalevolent Sachet Fatalities

    • Authors: Puvvula Krishna Kanth, Jhansi Rani S
      Abstract: The open nature of the wireless medium leaves it vulnerable to intentional interferenceattacks, typically referred to as jamming. This intentional interference with wirelesstransmissions can be used as a launchpad for mounting Denial-of-Service attacks on wirelessnetworks. Typically, jamming has been addressed under an external threat model. However,adversaries with internal knowledge of protocol specifications and network secrets can launchlow-effort jamming attacks that are difficult to detect and counter. In this work, we address theproblem of selective jamming attacks in wireless networks.By source annulment Such unwanted information leakage often results in privacy breaches of the people in environment.Moreover, the wireless communication employed by sensor networks facilitates eavesdropping and packet injection by an adversary.The combination of these factors demands security for sensor networks at design time to ensure operation safety, secrecy of sensitive data, and privacy for people in sensor environments.Providing security in sensor networks is even more difficult than MANETs due to the resource limitations of sensor nodes.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Performance Etiquette Of Client And Server

    • Authors: Siddu Revanth, Jhansi Rani S
      Abstract: The habitual communication of  delay-tolerant-network (DTN) model is having partial  infrastructural model for prevailing mobile patrons  for instance  Bluetooth  and Wi-Fi Direct. Mobile ad hoc network is aanthology  of mobile nodes communicating through wireless channels lacking of  any existing network infrastructure or centralized authority.Some of the most challenging issues in this scenario misbehaviours and burglar detection.Behavioral characterization of malware is an effective alternative to pattern matching in detecting malicious, especially when dealing with many networks or obfuscated malware. In this paper we propose trustable naive Bayesian (TNB)model. It is profitably function for wired networks but not applied for adhoc networks.In this paper we address major problem of manetsmallious nodes are produce fake estimations. We identify two exclusive challenges on manets these are phony estimation of trustable node and un estimated of  spam node detection.     Furthermore, we dogmatic filtering,and adaptive routing communication in manets.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Design of Parallel Advanced Encryption Standard(AES) Algorithm

    • Authors: Rutarth Rajeshbhai Patel, Sahdev Dharamshibhai Kanjariya, Jay Bharatbhai Dabhi
      Abstract: The Advanced Encryption Standard (AES) is today’s key data encryption standard for protecting data, but the implementation of high-speed AES encryption engine needs a large number of hardware resources. In this paper, design a low-cost and parallel AES crypto core using Rijndeal Algorithm for secure communication. AES is a symmetric-key algorithm which process data in block of 128 bits using key expansion module which uses key scheduling. Here we proposed a new parallel AES core engine and designed and implemented a fast data encryption and decryption. Experimental results prove that this implementation of AES encryption algorithm provides ultimate secrecy of the encryption key, much faster speed compared to software implementation and higher throughput.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Design Of Ring Topology Using Set Of Node

    • Authors: Riddhi Panot, Jimmy Sutaria, Kapil Parmar
      Abstract: This is a simple and scalable novel network-on-chip (NoC) based on the ring concept. The reported prototype design is generic with respect to the number of nodes and data channels. Topology efficiently exploits the available packaging technology to meet the requirements at a minimum cost. Ring Topology is best for low power consumption, small chip area, and low implementation complexity, in addition to guaranteeing a certain performance level. Central Arbiter is used with its different algorithm like Fixed Priority, Round Robin algorithm to communicate with nodes. This is mainly used when more than one node is communicated with the same node.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Semi-Autonomous Mobile Hexapod Unmanned Ground Robot With Camera based
           

    • Authors: Divya G, Rishikesh S, Manimaran N, Mohammed Sarbudeen H
      Abstract: Conventionally reconnaissance vehicles used in military application have a wheel based design. Such wheel based robots have a major disadvantage of being unadaptive to rough terrain. These robots do not have the capacity to seamlessly navigate through uneven terrain with potholes that can trap the wheels. Naturally certain insects have octopod shaped exoskeleton. When a similar design approach is incorporated in to rohots instead of wheels, the problem of traversing rough terrain is solved. A hexapod design i.e six legged robot can use a wide range of motions to navigate out of any obstacle in the terrain. With such an adaptive motion, this type of robot can be remotely controlled to make it a semi-autonomous robot for Military Reconnaissance And Ethological Research.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Implementation of Symmetric Stream Cipher for Text Encryption Using Key
           Sequence of Cyclic Elliptical Curve Points Based on PRNG

    • Authors: Karthik G, Rakesh B N, Ganesh Aithal
      Abstract: Abstract: In this paper, cyclic elliptic curves of the form y2 = x3 + ax + b mod p € E(Fp) with order N is considered in the design of a symmetric key text Encryption Scheme with Key Sequence derived from random sequence of cyclic elliptic Curve points. P with co-ordinates (xP ; yP ) which satisfy the elliptic curve equation is called a point on elliptic curve. Random sequence {ki} of integers is generated using Linear Feedback Shift Register (LFSR) and cubic equation. Every element in key– sequence and character is mapped to {kip} and {AiP}which is a point on cyclic elliptic Curve with co-ordinates say (xi; yi).These sequence find application in Stream cipher system. The encryption procedure and results of this algorithm has been discussed in this paper.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Design and Functional Verification of four way set associative cache
           controller

    • Authors: Pooja Shaileshbhai Bavishi
      Abstract: This project describes the design of a Cache Controller that will handle 32Kbyte 4 ways with 8word block size cache. A cache controller is a device that used to sequence the read and write of the cache storage array. Most of modern microprocessor is designed with multiple core architecture that will lead to massive traffic of cache data transfer. By taking the advantage of using temporal locality and spatial locality to the cache, the problem can be solved. With this solution, a controller capable to handle huge amount of way and block size need to be designed. This design will be implemented using Questasim software. It was developed base on Verilog coding. Using the same software, a test bench was constructed to test the functionality of the controller.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • Strategy And Guidelines For Sheltering Database To Database Communication
           Through Database Links

    • Authors: Rajesh M, Sumit Saseendran
      Abstract: The majority of organizations today prefer Oracle database systems to maintain their operational and transactional data. Multiple databases will be used for different fields of operation in an organization. There arise many scenarios where one database will need to access the data stored in another database. Database to database communication is enabled in Oracle database with the help of database links. Among the numerous database products, Oracle database is regarded as a highly secure database. But still it has a few security issues in certain areas, including database links. This presented paper makes an attempt to highlight these security weaknesses and compose plans and guidelines to handle the database link in various situations.
      PubDate: 2015-03-31
      Issue No: Vol. 4 (2015)
       
  • A Mixture Cloud Approach For Safe Official Deduplications

    • Authors: G Vinod Kumar, S Babu
      Abstract: Cloud computing technology is widely used so that the data can be outsourced on cloud can accessed easily. Different members can share that data through different virtual machines but present on single physical machine. But the thing is user don’t have physical control over the outsourced data. The need is to share data securely among users. The cloud service provider and users authentication is necessary to make sure no loss or leak of users data. Privacy preserving in cloud is important make sure the users identity is not revealed to everyone. On cloud anyone can share data as much they want to i.e. only selected content can be shared. Cryptography helps the data owner to share the data to in safe way. So user encrypts data and uploads on server. Different encryption and decryption keys are generated for different data. The encryption and decryptioorised n keys may be different for different set of data. Only those set of decryption keys are shared that the selected data can be decrypted. Here a public-key cryptosystems which generate a ciphertext which is of constant size. So that to transfer the decryption rules for number of ciphertext. The difference is one can collect a set of secret keys and make them as small size as a single key with holding the same ability of all the keys that are formed in a group. This compact aggregate key can be efficiently sent to others or to be stored in a smart card with little secure storage. Keywords: Cloud storage, Attribute base encryption, Identity base encryption,Cloud storage, data sharing, keyaggregate encryption .
      PubDate: 2015-03-30
      Issue No: Vol. 4 (2015)
       
  • Exemplary Instinctive Repression Of Worms

    • Authors: Manuri Parthasarathi, Jhansi Rani S
      Abstract: Key applications is the routing protocol that directs the packet in the network routing packets fully connected to wireless networks has been studied to a great extent but the assumption on full connectivity is generally not valid in a real system. A class of attacks such as Network Partitioning Node Isolation attack spreads over the network are malicious pose majority threats which compromise the computer network evolve during their propagation and challenge to detect against the routing discovery. The proposed NP Hard is routing protocol blocks the abnormal activities in wireless networks when routes the packet from source to destination, the cryptography protects the message in the packet but not provides the security to the system. Comparative results on wireless network NP hard problem demonstrate the our approach interprets the system outperforms by providing the highest detection accuracy from intrusion and low false alarm rate for normal in wireless networks.
      PubDate: 2015-03-30
      Issue No: Vol. 4 (2015)
       
  • Vigorous Data Provision And Organization By Using Gossip Protocol

    • Authors: Chinigi Praveena, S Babu
      Abstract: Cloud computing is focused on virtual mechanism   data storage and sharing on  web services. The  cloud environment consists of several elements such as clients and distributions. It includes fault tolerance, high availability, scalability, flexibility, reduced overhead for users, reduced cost of ownership, on demand services etc. Resource management poses particular challenges in large-scale systems, such as server clusters that simultaneously process requests from a large number of clients. We mainly focus on the dynamic resource management in large scale cloud environment. clouds dynamically scales and adapts both number of physical machines and allocation to the load changes. We first present a protocol that maximizes the cloud utility under CPU and memory constraints and also minimizes the cost for adapting an allocation. Then, we extend that protocol to have a management control parameter, which can be done with the help of profiling technique. we extend that protocol to provide an efficient heuristic solution for the complete problem, which includes minimizing the cost for adapting an allocation. The protocol continuously executes on dynamic, local input and does not require global synchronization, as other proposed gossip protocols do.
      PubDate: 2015-03-30
      Issue No: Vol. 4 (2015)
       
  • Sprinkling Data Prevents From Intruders

    • Authors: D.V.S Sujitha, S Babu
      Abstract: The habitual communication of delay-tolerant-network (DTN) model is having partial infrastructural model for prevailing mobile patronsfor instance Bluetooth and Wi-Fi Direct. Mobile ad hoc network is an anthology of mobile nodes communicating through wireless channels lacking of any existing network infrastructure or centralized authority.Some of the most challenging issues in this scenario misbehaviours and burglar detection. Behavioral characterization of malware is an effective alternative to pattern matching in detecting malicious, especially when dealing with many networks or obfuscated malware. In this paper we propose trustable naive Bayesian (TNB)model. It is profitably function for wired networks but not applied for ad-hoc networks. In this paper we address major problem of Manetsmalicious nodes are produce fake estimations. We identify two exclusive challenges on Manets these are phony estimation of trustable node and un-estimated of spam node detection. Furthermore, we dogmatic filtering, and adaptive routing communication in Manets.
      PubDate: 2015-03-30
      Issue No: Vol. 4 (2015)
       
  • Perception Based On Its Incline And Pier Using Centroid Delineation Pitch
           Of Leaf

    • Authors: Sandeep Thangirala, Jhansi Rani S
      Abstract: With the aim of elaborating a mobile application, accessible to anyone and with educational purposes, wepresent a method for tree species identification that relies on dedicated algorithms and explicit botanyinspireddescriptors. Focusing on the analysis of leaves, we developed a working process to help recognizespecies, starting from a picture of a leaf in a complex natural background. A two-step active contoursegmentation algorithm based on a polygonal leaf model processes the image to retrieve the contour ofthe leaf. This paper suggests normalization of the tip and base of leaf asboth of them incline to one direction which is able toinfluencedata extraction process. The extraction method we used isCentroid Contour Gradient (CCG) which calculates the gradientbetween pairs of boundary points corresponding to interval angle.CCG had butperformed its competitor which is CentroidContours Distance (CCD), as it successfully captures thecurvature of the tip and base of leaf. The accuracy in classifyingthe tip of leaf using CCG is 99.47%, but CCD is only 80.30%.For accuracy of leaf base classification, CCG (98%) alsooutperforms CCD (88%). The average accuracy for recognizingthe 5 classes of plant is 96.6% for CCG and 74.4% for CCD. Inthis research, we utilized the Feed-forward Back-propagation asour classifier.Features we use afterwards are high-level geometrical descriptors that make a semantic interpretationpossible, and prove to achieve better performance than more generic and statistical shapedescriptors alone. We present the results, both in terms of segmentation and classification, consideringa database of 50 European broad-leaved tree species, and an implementation of the system is availablein the iPhone application Folia
      PubDate: 2015-03-27
      Issue No: Vol. 4 (2015)
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015