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
  [2 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]
  • Improvisation of Identity, Trustworthiness and Privacy In Social Network

    • Authors: Kotturu Lokeswara Rao, Y Ramesh
      Abstract: The expanding notoriety of informal community administrations (SNS), being utilized by a great many individuals ordinary, has emerged some security and protection issues. While clients must be allowed to pick which measure of individual data they give, SNS suppliers ought to get more included to ensure that their administrations are accurately misused. This leads us to propose a more secure yet at the same time security improving answer for enlistment forms, that includes the utilization of computerized testaments —which are a solid wellspring of individual data , and data cards —which hold protection properties. Safelayer applications PKI Trust Center and Interidy Identity Provider actualize this proposition.Roused by the absence of deal with representing differential trust in Interpersonal organization based applications—Sybil Protections specifically, we build up four outlines and utilization them to record for trust in a benchmark system of Sybil resistance (Sybil Limit). We demonstrate observationally that our plans enhance the security of this guard at some sensible expense. We propose to extend these calculations to different applications, Sybil barriers and other directing and data spread applications on top of informal communities and depend on trust and social diagrams' structure in their operation. At long last, we propose to utilize interpersonal organizations for building two sorts of uses: a conveyed figuring administration (called social cloud) that does not make any immediate utilization of a worldwide property of social charts, (for example, the blending time or the development), and an unknown correspondence benefit that consolidates progress in the social chart to enhance obscurity.
      PubDate: 2015-07-02
      Issue No: Vol. 4 (2015)
       
  • Detection Of Connected But A Cut Occurred Somewhere (Ccos) In Wireless
           Sensor Networks

    • Authors: Vasantha Rao K, sahu p
      Abstract: A wireless sensor network is able to obtain detached into several connected components owing of the crash of some of its intersection, which is entitle such as “cut”. Herein, we deem the problem of detecting cuts as a result of the lasting nodes of a wireless sensor set of connections. Wireless Sensor Network (WSN) be pretended of few or huge number of sensor nodes and individual sink node. One of the decisive challenges in WSN is cut initiation as a substitute of enlarge the life sensor nodule. Feeler node is petite device conjured of 3 important units as wireless communication (transceiver) unit, sensor unit and processing unit and equipped with imperfect power supply by means of batteries. Because the node has limited energy trade in, these nodes are posing in sleep mode to preserve energy which facilitates to prolong network existence. In this paper we will converse sleep scheduling based energy conservation protocol with broadcast tree used to save succession of sensor intersection. Inside tree sink node act as root node and the nodes with higher energy perform as branch node and node through low energy works as leaf node. The leaf nodes are put to sleep and branch node vestiges conscious. The tree is renovated periodically to assess energy in all nodes. Omission easiness in network is accomplished by keep two paths as of each node to sink node. Dishonourable resting on the existing system, we can thwart the cuts in network.
      PubDate: 2015-07-02
      Issue No: Vol. 4 (2015)
       
  • Improved Routing mechanism for enhancing Mobile Adhoc Network by using
           elliptic curve algorithm

    • Authors: Mangal Meshram Ms., Sayali N. Mane, Manish Sharma
      Abstract: In mobile adhoc network routing optimization along with security is enhancing. Mobile adhoc networks have constantly changing topologies; hence several routing protocols must satisfy the challenge of link quality, delay and energy conscious routing. In this paper, delay and energy conscious routing approach is introduced based on the estimated delay and residual energy of the nodes which are closer to each other. Adaptive node stability (ANS) mechanism is mathematically modeled to make the routing strategy. The adhoc security algorithm uses the adaptive node stability to establish a link and to find the nearby efficient node for transmission of data. Elliptic curve algorithm is used to provide security in adhoc network. Simulation performance of delay, packet delivery ratio, and normalized overhead and average energy consumption is calculated with the total number of nodes used by using NS2 simulator.
      PubDate: 2015-06-30
      Issue No: Vol. 4 (2015)
       
  • Transportation XSS Model Data Escape Finding In Content Delivery Networks

    • Authors: Rajya Lakshmi, R.China Appala Naidu
      Abstract: Recently increasing use of multimedia scheme applications and services the applications is trusted video sources to dentations undesirable content-loss become critical. While preserving user security XSS model is used have different addressed this issue by proposing model is based on the observation of schema traffic in the network. These conventional systems maintain a high detection efficiently while coping with some of the traffic variation in the network their detection performance substantially degrades owing to the significant number  of data  lengths we mainly  focus on over load  content-leakage detection techniques   that is robust to the variation of the data length we determine a relation between the length of data to be compared and the similarity between the compared data we enhance the detection results of the proposed scheme even locations subjected to variation in length of data a test based  experiment  the performance  of our proposed scheme is evaluated in terms of variation of data length, delay variation and packet loss. We could user these technologies to develop different user detection applications based on event logs with long time observation then our framework could be changed to improve the model of XSS Attack detection by further analyzing inputs and outputs of a web application system and thus discover and prevent new types of web attacks.
      PubDate: 2015-06-30
      Issue No: Vol. 4 (2015)
       
  • Wireless Mesh Network Deployed in Disaster Area using Gateway Selection

    • Authors: Supriya Madanrao Nasre, P Malathi, Manish Sharma
      Abstract: As known from the history, communication services turns out to be exceedingly imperative after calamity strike. Wireless Mesh network (WMN) serves as a cost effective technology that yield backbone infrastructure to provide city-wide network access. The self-recovery characteristics of Wireless Mesh Network (WMN), makes it an appropriate solution to be deployed in disaster areas for network access. Throughput is a major factor used for assessment of the WMN. Selection of different wireless mesh routers as gateway results in distinct system performance. In this paper, we propose a gateway selection method to associate the destroyed network with an external network. The gateway selection must maximize the system throughput. The simulation is done using network simulator (NS2).
      PubDate: 2015-06-30
      Issue No: Vol. 4 (2015)
       
  • Image Watermarking And Its Techniques: A review

    • Authors: Sujata Nagpal, Shashi Bhushan, Manish mahajan
      Abstract: With the fast development in computer network and multimedia technology, the need of protecting the ownership of digital media becomes a major issue. Digital watermarking is a process of hiding imperceptible data into digital media like text, audio, video etc. The major aspects of information hiding are security, imperceptibility and robustness. To increase security, a secret key can be used to encode and decode the watermark. In this paper, we present a review on image watermarking and its techniques. There are several techniques that are based on spatial and transform domain. We also discuss various properties and applications of image watermarking. Previous work in digital watermarking is also reviewed.
      PubDate: 2015-06-30
      Issue No: Vol. 4 (2015)
       
  • Construction of Covert Channel Using Data Hiding Mechanism In Ipv4

    • Authors: Rajesh H, Anjan K
      Abstract: Covert channel is a way of abstracting the information and hiding the information, in such a way that the reader should not analyse the hidden information and transmit the data to the destination. The covert technique which is used in this paper is unique; it uses the IP fields to hide the data. The data can be malignant software or virus that can be communicated via unauthorized channel. This paper focuses on various techniques which are used to hide the information using IP field hiding as the mechanism and also on vulnerabilities of IPV4 & IPsec.
      PubDate: 2015-06-30
      Issue No: Vol. 4 (2015)
       
  • A Lightweight Routing Approach for In-Network Aggregation in Wireless
           Sensor Networks

    • Authors: Sneha Vilas Gurnale, P. Malathi, Manish Sharma
      Abstract: Wireless sensor networks (WSNs) have sensing, computation and communications capabilities. Energy conservation is a key issue in WSN. Redundant data can be aggregated at intermediate nodes which can reduce the size and number of exchanged messages. This decreases communication cost, energy consumption and increases the lifetime. For this purpose a modified novel Data Routing for In-Network Aggregation (M-DRINA) algorithm is proposed for setting up a routing tree and high aggregation rate. To find the shortest path for routing, instead of hop count, distance parameter is considered to reduce the energy consumption, delay, communication cost, and increase the lifetime.  Results indicate clearly that with the increase of number of nodes, throughput, packet delivery ratio (PDR) & lifetime increases and simultaneously delay, energy consumption, and tree cost decreases. Extensive simulations in Network-Simulator 2 show that our protocol outperforms the existing protocols in terms of various performance metrics. Thus the modified DRINA (M-DRINA) provides the best aggregation quality with respect to other algorithms.
      PubDate: 2015-06-30
      Issue No: Vol. 4 (2015)
       
  • An Approach To Control Congestion And Improve Performance Of TCP Vegas In
           Ad Hoc Network

    • Authors: Sunil Vispute Ms, Sayali N. Mane, Manish Sharma
      Abstract: Computers and the Internet play a essential role in people’s life. Internet users and network application increases day by day and hence large amount of network is important but bandwidth is limited. As network requirement is high and bandwidth is limited, network traffic has become a critical problem. This congestion problem is mainly related to delay and packet losses. TCP Vegas is a mechanism of congestion control. The wireless communication Transmission Control Protocol (TCP) plays an important role in developing communication systems. It provides better and reliable communication capabilities in almost all kinds of networking environment. Vegas is much better in performance as compare to other TCP variants like TCP reno because vegas has high packet delivery ratio and it uses full transmission bandwidth. Some parameters like throughput and transmission delay plays a vital role in vegas performance.  The purpose of this paper is to control congestion and improve performance of tcp vegas in mobile ad-hoc network (MANET).  The simulation results show that vegas has higher throughput and lower delay of whole network and control congestion.
      PubDate: 2015-06-30
      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