JCT - Volume 3 Issue 11 (November 2014)

 


Sr/No/ Title Pdf
1 Detection and Trace back by Using New Information Metrics of Low-Rate DDoS Attacks
Bhupendra Puri Goswami, Prof. Somesh Dewangan, Shrikant Nirmalkar

Abstract—A low rate distributed denial of service (DDoS) attack has importance of hiding its traffic because it is very much like normal traffic. It has the capacity to avoid the current anomalybased detection schemes. An information metric can analysis the differences of network traffic with various probability distributions. In this paper, we propose using two new information metrics such as the generalized entropy metric and the information distance metric to detect slow-rate DDoS attacks by calculation the difference between legal traffic and attack traffic. The proposed generalized entropy metric can detect attacks several hops earlier (three hops earlier while the order α=10 ) than the traditional Shannon metric. The proposed information distance metric outperforms (six hops earlier while the order α=10) the popular Kullback–Leibler divergence approach as it can clearly enlarge the adjudication distance and then obtain the optimal detection sensitivity. The experimental results show that the proposed information metrics can successfully detect low-rate DDoS attacks and clearly reduce the false positive rate. Furthermore, the proposed IP traceback algorithm can find all attacks as well as attackers from their own local area networks (LANs) and discard attack traffic.

Download
2 Variable Edge Detection based on Improved Canny Filter
Shashi Mishra, Prof. Bharti Chourasia

Abstract— Edge detection is main significant part of any image. By accurate edges we are able to predict the property of any image. For the detection of the object, it is important to find exact boundary of the image. So it’s very important to have a well knowledge of edge detection. For this purpose different edge detection methods are available but canny edge detection is more appropriate than others. In canny edge detection, different kind of operator and filter are used. This operator improves the detection level of edge. OTSU thresholding is used for the automatic dual level of threshold. This makes canny edge detection method more usable from astronomy to photography, medicine to war. In this paper we are using canny edge detection for finding the edges, and thresholding is based on OTSU multi-level.

Download
3 Proposed Secured Framework for Mobile Cloud Computing
Mohammad Arif Ansari, Er. Archana Singh

Abstract—Mobile Cloud computing has invoked a new wave of evolution in the field of the mobile world. Although several research works has been done in the field of mobile technology, but cloud computing for mobile world is vastly unexplored. In this dissertation, we introduce the concept of Mobile Cloud Computing (MCC), and its security for data storage into the cloud from mobile device. Recently the market of mobile has been evolving rapidly and as such cloud computing is also growing its pace in mobile technology. That is why mobile cloud computing is a new and fast growing issue today. Cloud computing is the computing that provides virtualized IT resources as a service by using the Internet technology. Cloud computing, functions as such that a user impart IT resources (i.e. software, storage, server, network) as needed, uses them, get a support of real-time scalability according to service load, and pays as he goes. Especially the cloud computing environment distributes IT resources and allocates according to user’s request. The security issues in Mobile Cloud Computing can be classified as follows: mobile threats and cloud threats. The main purpose of these threat is that, the person (hacker or thieves) steals personal data (e.g. passwords, contact database, credit card numbers, calendar, location) or to impose on mobile device resources. To overcome these problems we will be proposing a framework for data security into cloud from mobile device. This framework consists of multilevel data security and thus it not only secures but it also works on data saving part and it has security on data retrieving from cloud also this is done in our dissertation by using multilevel of key security for data storage.

Download
4 Performance Comparison of Routing Protocol in MANET Based on Different Mobility Models
Sachin Kumar, Ankit Jha

Abstract— Wireless Mesh Networks (WMNs) have gained a lot of attention recently. Features such as self- configuration, self healing and the low cost of equipment and deployment make WMN technology a promising platform for a wide range of applications. They offer the flexibility of wireless access, combined with a high coverage area; they also offer communication between heterogeneous domains. Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. WMN is a special kind of ad hoc networks and like any other ad hoc network one of the issues in WMNs is resource management which includes routing. For routing there are certain routing protocols that may give better performance when checked with certain parameters. These parameters include packet delivery ratio, delay, throughput, routing overhead and normalized routing load. This paper specifically aims to study the performance of routing protocols in a wireless mesh network, where static mesh routers and mobile clients collaborate to implement networks functionality such as routing and packet forwarding in different mobility scenarios. Based on extensive simulations, I present a comparative analysis covering performance metrics such as latency, throughput and routing overhead etc. This work allows us to arrive at an algorithm suitable for mesh networks to be implemented with and provides the basis to prove the applicability of these networks.

Download
5 An Enhanced Adaptive Acknowledgement Method to Provide Security in MANETs
U. Alekhya, K. Venkata Rao

Abstract—In Wireless Sensor Networks there was a new facility like mobility and scalability through which a lot of demand for wireless sensor networks compared with wired networks .With this great features a lot of users have been migrating to wireless sensor networks from wired network .As this is increasing its popularity in spreading almost all around the world, on the other side there was many intruders who try to attack the data transmission during WSN communication. MANET is considered to be one of the best media among all WSN.On the contrary to traditional network architecture, MANET does not require a fixed network infrastructure; every single node works as both a transmitter and a receiver. Nodes communicate directly with each other when they are both within the same communication range. Otherwise, they rely on their neighbors to relay messages. The self-configuring ability of nodes in MANET made it popular among critical mission applications like military use or emergency recovery. As the MANETS have open network facility there was a lot of hackers who try to attack the data during transmission. Till now there was no proper device or mechanism to identify the suspicious objects or intruders in wireless sensor networks .So in this paper we have implemented a new system for identifying the Hackers or intruders known as Intrusion Detection System (IDS where this new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs. Compared to old approaches, EAACK demonstrates higher – behavior-detection rates in certain circumstances while does not greatly affect the network performances.

Download
6 An Attribute-Based Encryption Method for Storing and Sharing Personal Health Records In Cloud Computing
M.V. Sri Subha, K. Venkata Rao

Abstract—Cloud Computing is one of the most fascinating domain in real time environment for storing their private data in a remote cloud server. By using this cloud service a lot of users try to store their valuable private data on an individual remote location. Many schools, offices, hospitals, large scale enterprise organizations try to store their valuable office data in the remote cloud servers which is provided by cloud team. In this paper presents a novel protocol for storing and sharing PHR records Personal health record (PHR) is an emerging patient-centric model of health information exchange, which is often outsourced to be stored at a third party, such as cloud providers. However, there have been wide privacy concerns as personal health information could be exposed to those third party servers and to unauthorized parties. To achieve fine-grained and scalable data access control for PHRs, we leverage attribute based encryption (ABE) techniques to encrypt each patient’s PHR file. Different from previous works in secure data outsourcing, we focus on the multiple data owner scenario, and divide the users in the PHR system into multiple security domains that greatly reduces the key management complexity for owners and users. A high degree of patient privacy is guaranteed simultaneously by exploiting multiauthority ABE. Our scheme also enables dynamic modification of access policies or file attributes, supports efficient on-demand user/attribute revocation and break-glass access under emergency scenarios. Extensive analytical and experimental results are presented which show the security, scalability and efficiency of our proposed scheme.

Download
7 An Efficient Secure Image Encryption Algorithm Using DNA Subsequence Operations
Naveen Kumar Kavartapu, Dharmaiah Devarapalli

Abstract—This paper proposes a new Image Encryption using DNA Subsequence that uses the idea of chaotic systems to produce two Chaotic Maps, One is Logistic Map and the other is 2D logistic map, that produces secret key, which is used for encryption process. The input is an 8-bit grey image that is divided into Bit-planes using the pixel values. In this paper, we do not use biological operation to implement image encryption, but adopt the rule of DNA subsequence operation such as truncation operation, deletion operation, transformation operation and so forth, then combine DNA subsequence operation with chaos system to scramble the location and the value of pixel point from the image. A DNA subsequence operations, Complement Operations are Performed on the generated Sequence. Recombining the bit planes again we get the Encrypted image. The reverse of Encryption follows Decryption Process. By conducting several experiments on various inputs data we finally conclude that this DNA Subsequence operation is efficient in encrypting image securely.

Download
8 A Novel Mechanism for Reducing Content Provision Cost in Distributed Social Wireless Networks by Using Co-Operative Caching
Santi.Gottumukkala, CH.Sunil

Abstract—Social Wireless Networks (SWNTs) are the devices that are mainly formed by integrated group of several mobile devices, such as data enabled phones, E-Book, Card Readers and a lot more, sharing all the common interests in the form of electronic content, and physically gathering all together in public places. By using this novel method of object caching in SWNTs are shown to be able to reduce the content provisioning cost. In this paper, we mainly designed and analyzed a new caching technique with cooperative mode practically deals with network, service, and pricing models which are then used for creating two object caching strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands. By using this new co-operative caching mechanism the user can be able to get the services more beneficiaries for downloading EBooks or Electronic contents without affording more amount during lost stages. Finally at the end of our research, we construct theoretical and practical simulation models for analyzing the proposed caching strategies in the presence of selfish users along with several end consumers that deviate from network-wide cost-optimal policies.

Download
9 A New Method of Detecting and Preventing Coding Rate dynamically for Controlling Packets in Delay Tolerant Networks
V.Naidu, B.Shalini

Abstract—The main characteristic of Delay Tolerant Network is by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. In p articular, routing schemes that leverage relay s’ memory and mobility are a customary solution in order to improve message delivery delay. When large files need to be transferred from source to destination, not all packets may be available at the source prior to the first transmission. In particular, we determine the conditions for optimality in terms of probability of successful delivery and mean delay and we devise optimal policies, so-called piecewisethreshold policies. We account for linear blockcodes and rate less random linear coding to efficiently generate redundancy, as well as for an energy constraint in the optimization. We numerically assess the higher efficiency of piecewise-threshold policies compared with other policies by developing heuristic optimization of the thresholds for all flavors of coding considered. As an enhancement we have also shown the data transfer in a simulation manner which clearly tells that there was no packet loss during the transmission of packets from source to destination in DTN Networks.

Download