1. A Review of Cooperative Cache Management Techniques in MANETs

Prashant Kumar Naveen Chauhan

prashantkumar32@gmail.com naveen@nitham.ac.in

Department of Computer Science and Engineering

National Institute of Technology , Hamirpur (H.P.) INDIA

Abstract

Caching of frequently accessed data in ad hoc networks is a potential technique that can improve the data access, performance and availability. A cooperative cache-based data access framework lets mobile node cache the data or the path to the data to reduce query delays and improve data accessibility. Due to mobility and resource constraints of ad hoc networks, cooperative caching techniques designed for wired network may not be applicable to ad hoc networks. The objective of cooperative caching is to improve data availability and access efficiency by collaborating local resources of mobile devices. This paper reviews the various cooperative cache management techniques in the mobile ad-hoc networks.

Keywords: Mobile adhoc networks, cooperative caching, cache resolution.

 

 

Download PDF

 

 

2. A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks

*Vivek Sharma, *Sujit Jhare, **Divakar Singh

* School of Computer Science, BUIT, Bhopal

**HOD, School of Computer Science, BUIT, Bhopal

*vivek.rgtu@gmail.com, *sujit.jhare@gmail.com, **divakar_singh@rediffmail.com

Abstract

Wireless ad-hoc networks have gained a lot of importance in wireless communications. Wireless communication is established by nodes acting as routers and transferring packets from one to another in ad-hoc networks. Routing in these networks is highly complex due to moving nodes and hence many protocols have been developed. Mobile ad hoc networks are networks without fixed infrastructure. The mobile nodes perform both as a host and a router forwarding packets to other nodes. Due to the special nature of ad hoc networks, there are special demands for ad hoc routing protocols. Performance is also an interesting issue for different protocols. This paper describes some special characteristics of ad hoc on-demand routing protocols like DSR, AODV, DYMO, LAR and TORA, with their performance measurements and study of working of these protocols.

Keywords: Ad Hoc Networks, routing protocol, DYMO, DSR, AODV, TORA, LAR.

 

 

Download PDF

 

 

 

3. A survey on wireless communications-beyond 3G

Amit Tiwari, Preeti Diwan

Assistant Systems Engineer, TCS Mumbai

Lecturer, Department of Comp. Sc. & Engg, OIST, Bhopal

amittiwari15@gmail.com, diwantina@gmail.com

Abstract

Wireless access standards, like most other technological standards, generally evolve during their service life to offer enhanced performance and capabilities. The general impression behind diverse technology “generations” is that every new generation offers noteworthy “revolutions” in routine and capabilities compared to its predecessor. This often means that a new “overlay” network, likely in a new frequency band, is requisite for each technology generation. Mobile operators need to recognize their spanking role as internet service providers (ISPs). No longer do they just provide cellular voice services; now they also provide high-speed Internet Protocol-based (IP) data services. So as to offer a wider array of services and content to their data subscribers, mobile operators are opening up their formerly closed networks to numerous other mobile operators, data networks and the public Internet.

Keywords: internet, broadband wireless, 3G, 4G

 

 

Download PDF

 

 

 

4. Performance and Analysis of CSMA, MACA & ALOHA to Support Quality of Services (QoS) under varying conditions of no. of nodes in Ad Hoc Wireless Networks

Neeraj Agrawal Prof. Sanjeev sharma

School of Information Technology, School of Information Technology,

Rajiv Gandhi Proudyogiki Vishwavidyalaya, Rajiv Gandhi Proudyogiki Vishwavidyalaya,

Bhopal (M.P.), India Bhopal (M.P.), India

neeraj.mtechit@gmail.com sanjeev@rgtu.net

Abstract

Ad hoc wireless network (AWN) is a collection of mobile hosts forming a temporary network on the fly, without using any fixed infrastructure. QoS (Quality of Service) is the idea that transmission rates, error rates, and other characteristics can be measured, improved, and to some extent guaranteed in advance in ad hoc network however in particular concern for the continuous transmission of high bandwidth video and multimedia information this kind of content dependably transmitting is difficult in public networks using ordinary "best effort” protocols. Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. Carrier Sense Multiple Access (CSMA) refers to a family of protocols used by stations contending for access to a shared medium like an Ethernet cable or a radio channel. ALOHA protocols are often used in satellite communications systems and cellular radio systems and are a precursor to the popular Ethernet protocol. MACA (Multiple Accesses with Collision Avoidance) Protocol is a Contention based Sender initiated Protocol which uses Three way handshaking means that RTS— CTS—Data packet exchange. It used in network congestion avoidance to help in determining the correct sending rate by binary exponential back off (BEB) Algorithm in which if any packet transmitted by a node is lost, the node uses the binary exponential back-off (BEB) algorithm to back off a random interval of time before retrying which is also inadequate trustworthy because of data sending acknowledgement is not  received. A comparative study was done on QualNet 4.0 Version simulator over CSMA, MACA & ALOHA. AODV routing protocol was used to evaluate the CSMA, MACA and ALOHA performance. Results show that the ALOHA simulation performs well as compared to MACA in sense of Throughput, Total Packet Received, Average Jitter and Drop Packet Ratio under varying conditions of no. of nodes.

Keywords: AWNs, QoS, MAC, MACA, CSMA, ALOHA, AODV, Throughput, Total Packet Received, Average Jitter and Drop Packet Ratio.

 

Download PDF

 

 

 

5. A New Clustering Protocol Based on Energy Band for Wireless Sensor Networks

Prabhat Kumar, M. P. Singh

Department of Information Technology, National Institute of Technology Patna , India

Department of Computer Science and Engineering, National Institute of Technology Patna , India

prabhat8@gmail.com, writetomps@gmail.com

Abstract

Clustering techniques help to prolong the life of wireless sensor network, especially in hostile environment where battery replacement of individual sensor nodes is not possible after their deployment in the given target area. Clustering techniques also provide good load balancing, and in-network data aggregation. This paper introduces and analyzes a new clustering protocol in the wireless sensor networks based on energy band. The entire target area is divided into energy band which enables a node to estimate the energy with which it can transmit to the head node and head node to another head node towards a base station resulting in a prolonged life for the wireless sensor networks.

 

Download PDF

 

 

 

6. Comparative study of Routing Protocols for Mobile Ad-Hoc Networks

Preetam Suman, Dhananjay Bisen, Poonam Tomar Vikas Sejwar Rajesh Shukla

SOIT, RGPV SOIT, RGPV MITS, SOIT, RGPV CIST, RGPV,

Bhopal , India Bhopal , India Ujjain , India Bhopal , India Bhopal , India

preetam.suman@gmail.com bisen.it2007@gmail.com poonam.bhumi@gmail.com vikas@gmail.com rkumar_dmh@rediffmail.com

Abstract

A mobile ad-hoc network (MANET) is a collection of nodes, which are able to connect on a wireless medium forming an arbitrary and dynamic network. Implicit in this definition of a network is the fact that links, due to node mobility and other factors, may appear and disappear at any time. This in a MANET implies that the topology may be dynamic - and that routing of traffic through a multi-hop path is necessary if all nodes are to be able to communicate. In this paper, a detailed simulation based performance study and analysis is performed on the Ad-hoc routing protocols like Ad-hoc On- Demand Distance Vector (AODV), Optimized Link State Routing (OLSR), Fisheye State Routing Protocol (FSR) over such kind of networks. The performance differentials are investigated using varying Pause Time and number of nodes. Based on the simulation results, how the performance of each protocol can be improved is also recommended. Simulations of protocols to analyze their performance in different conditions were performed in QualNet 4.0 simulator.

 

 

Download PDF

 

 

 

 

 

 

7. Defense Mechanisms against Hello Flood Attack in Wireless Sensor Network

Siddhartha Choubey1, Abha Choubey2 , M.Abhilash3, Kamal K Mehta4

1 Reader, CSE Dept, SSCET, Bhilai

2 Sr. Lecturer, CSE Dept, SSCET, Bhilai

3ISTE member , CSE, SSCET, Bhilai

4 Asstt.Professor,CSE , SSCET , Bhilai

siddhartha00@rediffmail.com , niceabha1@rediffmail.com , abhilash576@gmail.com , kkmehta28@yahoo.com ,

 

Abstract

In a 1large-scale sensor network individual sensors are subject to security compromise. Where the nature of communication is broadcast and, hence, an attacker can overhear messages posted by any sensor node; security is an important issue here. In this paper we consider Wireless Sensor Network (WSN) security and focus our attention to tolerate damage caused by an adversary who has compromised deployed sensor node to modify, block, or inject packets. We adopt a probabilistic secret sharing protocol using the concept of cryptography where secrets shared between two sensor nodes are not exposed to any other nodes. Adapting to WSN characteristics, we incorporate these secrets with bidirectional verification and multipath routing to multiple base stations to defend against HELLO flood attacks. We then analytically show that our defense mechanisms against HELLO flood attack can tolerate damage caused by an intruder.

Keywords: wireless sensor networks, cryptography, hello flood attack.

 

 

Download PDF

 

 

 

 

8. Effect of Pause Time on DSR, AODV and DYMO Routing Protocols in MANET

Dhananjay Bisen, Preetam Suman, Prof. Sanjeev Sharma Rajesh Shukla

SOIT, RGPV University , SOIT, RGPV University , HOD, SOIT, RGPV University , Vice Principal CIST, RGPV,

Bhopal , India Bhopal , India Bhopal , India Bhopal , India

bisen.it2007@gmail.com, preetam.suman@gmail.com sanjeev@rgtu.net rkumar_dmh@rediffmail.com

Abstract

A Mobile ad hoc network is a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. The mobile nodes perform both as a host and a router forwarding packets to other nodes. Routing in these networks is highly complex. Due to moving nodes, many protocols have been developed. Performance of each protocol is depending on their working in different conditions. This paper describes some special characteristics of ad hoc routing protocols DSR, AODV and DYMO. It also presents their performance and comparative study. Evaluation based on comparative study of above protocols was done with some realistic parameters like Total Packet Received, Packet Drop Ratio, Throughput, Average Jitter and End to End Delay with variations in Pause Time of network. Simulations of protocols to analyze their performance in different conditions were performed in QualNet 4.0 simulator.

Keywords: Ad Hoc Networks, routing protocol, DYMO, DSR, AODV.

 

Download PDF

 

 

 

9. An Efficient Location Aided Routing Protocol in Mobile Ad-Hoc Network

Hardeep Singh and P.K.Singh

ABV-IIITM, Gwalior , INDIA

hardeepsinghcs@gmail.com, pksingh@iiitm.ac.in

Abstract

In the last few years, Mobile Ad-hoc Networks (MANET) have gained increasing attention from both the researchers and the actual users. As MANET nodes are generally battery-powered devices, the challenging task is how to reduce the energy consumption of nodes and hence conserve energy of the whole system, which extend the lifetime of the network to a reasonable time. One way to achieve this goal is efficient routing protocol algorithm in MANET. Therefore we have taken location in account during route discovery and route maintenance. But in location-aided routing (LAR) of MANET, due to nodes mobility inaccuracy of location information may result in constant flooding, which will reduce the network performance. We propose a modified-LAR algorithm to improve the efficiency of LAR. Modification is based on the idea of enlarging the request zone, in case of failure of the route discovery phase, instead of going to flooding. This concept is based on memory hierarchy of computer. This result in a significant reduction in the number of routing messages compares to flooding in case of failure. Index term: MANET, routing, LAR, request zone, expected zone.

 

Download PDF

 

 

10. Interoperability issues for E-Governance Framework

Shailesh kumar Shrivastava, Amar Nath Pandey, Prabhat Kumar

Scientist 'E' National Informatics Centre, Bihar, Govt. of India

Lecturer, Nalanda Open University, Patna ,

Assistant Professor, Information Technology Deptt, National Institute of Technology, Patna ,

shailesh_patna@yahoo.com,amarnathpanday@gmail.com prabhat8@gmail.com

Abstract

Interoperability has been identified as a major issue to be addressed by all e-government agencies. In the first stage of this awareness, interoperability deals with applications and semantics concepts, which will enable the seamless information flow between organizations? However, it will not be enough for enabling the sort of interoperability required for a true seamless service delivery to citizens and business, which is the vision of the e-government strategies. A second stage in interoperability shows up which deals with the building of an enterprise architecture. The paper highlights the critical role of interoperability and investigates the way it can be incorporated into e-government domain in order to provide efficient and effective e-services. It also describes issues-steps associated to interoperability, depicts the arisen technical dimensions, proposes solutions when possible, and discusses its effectiveness.

Key words:  ICTs; e-government; Frameworks; interoperability; XML; web services; SOA; government organizations.

 

Download PDF

 

 

11. Intrusion Detection Using Network Mapping Tool

Ms. Priya P. Ravale Ms.Shrutali V. Narkar

Lecturer Lecturer, I.T.Dept I.T Dept, W.I.T.Solapur. Solapur University W.I.T.Solapur Solapur University

priyaravale@rediffmail.com shrutalivinay@hotmail.com

Abstract

This paper introduces a prototype network mapping tool that can be used along with intrusion detection systems to provide, in real-time, a comprehensive picture of network topology. This software tool can generate descriptions for both physical and logical connectivity of network components. It also provides positive identification of the operating systems running on the networked machines, as well as state and configuration information about the hosts and their connectivity. We present the network mapping technique which is suitable for mapping a large network & also for hacking. This scheme allows system administrators to scan large networks to see which hosts are up and what services are running. Network mapping usually outputs a list of interesting ports with each ports number and protocol.

 

Download PDF

 

 

 

12. Probabilistic Approach for Selecting Stable Path in Mobile Ad Hoc Network

Sudeshna Gorai, Titasi Ghatak, Avijit Bhowmick, Bappaditya Das

Dept. of CSE, Dr.B.C.Roy Engineering College , Durgapur , India

Dept. of CSE, Dr.B.C.Roy Engineering College , Durgapur , India

Dept. of IT, Dr.B.C.Roy Engineering College , Durgapur , India

Dept. of CSE, Dr.B.C.Roy Engineering College , Durgapur , India

sudeshnadgp@gmail.com, titasi.ghatak@gmail.com, er.avijit.bhowmick@gmail.com, dr.bappaditya.das@gmail.com

Abstract:

A mobile ad hoc network (MANET) is a self configuring network consisting of collection of mobile nodes that are connected with wireless links. The shortest path between a source node and the destination node does not always guarantee a stable path because, the topology of a MANET changes dynamically and frequently due to random motion of nodes results link failures. In this paper, we propose a probabilistic approach for selecting stable path for MANET by which instead of choosing the shortest path, we are searching for a stable route based on route expiration time, hop count, residual battery energy along with average interface traffic load. This helps not only to extend the network’s lifetime but also helps to achieve load balance.

Key Words—Link failure, MANET, Mobility of nodes, Stable path.

 

Download PDF

 

 

 

 

13. An Efficient and Secured Data gathering using Data Aggregation Technique

in Wireless Sensor Network

Siddhartha Choubey1, Abha Choubey2 , Anil Magendra3,  Ashay Rajimwale4

1 Reader, CSE Dept, SSCET, Bhilai

2 Sr. Lecturer, CSE Dept, SSCET, Bhilai

3ISTE member , CSE, SSCET, Bhilai

4ISTE member,CSE , SSCET , Bhilai

siddhartha00@rediffmail.com , niceabha1@rediffmail.com , anil.magene@gmail.com , ashay.rajimwale@gmail.com,

Abstract

 In wireless sensor network (WSN) security issue, Data confidentiality, integrity, and elimination of data redundancy becomes vital, when the sensor network is deployed in a hostile environment. In this hostile environment there is requirement of efficient and secured data gathering of sensed data and forward that data to the required users. In this paper our main focus is to achieve data confidentiality and integrity and to eliminate data redundancy using Data Aggregation technique .We adopt a Data Aggregation technology where an Aggregator nodes can compute the sum, average, minimum or maximum of the data from its children sensors, and send the aggregation results to a higherlevel aggregator .In this way this method gives larger latency to the transmission of network’s data and ultimately affect the accuracy of network ‘s efficiency and thus prolong the lifetime of network. This paper presents a Data Aggregation technology configuring the aggregator node’s timeout by timing control scheme which is to achieve a good trade-off between energy efficiency and Data accuracy.

Key Words: Aggregator nodes, Data confidentiality and integrity, Data Redundancy.

 

 

Download PDF

 

 

 

 

14. QoS Provisioning issues in Wireless Multimedia Sensor Networks

Monika Jena Julie D. Abraham

Amity School of Computer Sciences Amity School of Computer Sciences

Noida, U.P. Noida, U.P.

E-mail: jena_monika@yahoo.com E-mail: julie_dilip@hotmail.com

Abstract

 Increasing demand of imaging and video sensors in many applications of wireless sensor networks has led to the evolution of Wireless Multimedia Sensor Networks (WMSN). WMSN are wireless sensor networks that are able to retrieve multimedia content from the environment. WMSN applications require effective communication of event features in the form of multimedia such as audio, image, and video. The challenges faced in WMSN are same as Wireless Sensor Networks (WSN) but some additional challenges such as reliability, QoS, and high bandwidth demands, must be addressed as well. The main focus of research so far is on minimizing the energy consumption in WSNs, mechanisms to efficiently deliver application-level QoS, and to map these requirements to network-layer metrics such as latency and jitter, have not been primary concerns of research on sensor networks. Therefore, for fulfilling real- time requirements for multimedia

delivery of data, new protocols need to be developed which not only ensure bounded response time but also strive to minimize energy consumption in data processing and communication. The QoS requirements in WMSN are quite different from traditional networks. In this paper we will discuss various QoS issues in network layer in WMSN and explain the reasons for the failure of traditional QoS models in WMSN. We review the work being carried out in provisioning QoS in WMSN followed by some open research issues.

Keywords: Energy-Efficiency, Network Layer, QoS, Routing, Wireless Sensor Multimedia Networks,

 

 

Download PDF

 

 

 

15. Network Simulator-3: A Review

Ashish Mohta, Sonali I. Ajankar, M. M. Chandane

Department of Computer Technology Veermata Jijabai Technological Institute, Mumbai , India

urashu06@gmail.com, s.ajankar9@gmail.com, mmchandane@vjti.org.in

Abstract

Due to growth of computer networks and complex scenarios the role of Network simulators in research field cannot be ignored. Simulators are useful tools when one wants to consider time and resources, implementation of new security solutions, performance estimation etc. it provides a virtual environment for an assortment of desirable features such as modeling a network based on a specific criteria and analyzing its performance under different scenarios. The newly proposed network simulator NS-3 supports coupling, interoperability, good memory management, debugging of split language objects, coding in C++ and object oriented concepts, as well as supports models supported by NS-2 and most suitable for wireless networks. The primary purpose of this paper is to compare and review this new simulator, as well as find its advantages in the field of research and how it is different from others. We also discuss the current demand of industry as well proposed a framework for a simulator which most research people want.

Keywords: Network Simulator, Tool Command Language, Network Animator

 

Download PDF

 

 

 

 

16. Unicast and Multicast Routing Protocols for Manets: A Comparative Survey

Kamal Kant Lalit K. Awasthi

Kamalkant25@gmail.com lalit@nitham.ac.in

Department of Computer Science and Engineering

National Institute of Technology Hamirpur, Hamirpur (H.P.) INDIA

Abstract

A Mobile Ad-hoc Network (MANET) is a selfconfiguring network composed of mobile nodes without any fixed infrastructure. In a MANETs, there are no difference between a host node and a router so that all nodes can be source as well as forwarders of traffic. Moreover, all MANET components can be mobile. They provide robust communication in a variety of hostile environment, such as communication for the military or in disaster recovery situation when all infrastructures are down. A very important and necessary issue for mobile ad hoc networks is to finding the root between source and destination that is a major technical challenge due to the dynamic topology of the network. Routing protocols for MANETs could be differ depending on the application and network architecture. The efficiency of the wireless link can be increase by Multicasting through sending single copy of messages to all group members. Multicast transmission is a more effective mechanism when compared to unicasting in supporting group communication applications and hence is an important aspect of future network development. There are various routing protocols that have been proposed for MANETs, it is quiet difficult to cover all of the protocol in this survey. In this survey paper, we present typical routing protocols based on unicast or multicast routing schema selected from the class of similar approaches that can reflect the stateof- the-art of research work on mobile ad hoc network routing. Another criteria for classifying the routing protocols for Mobile Ad-hoc Networks, i.e. proactive, reactive and hybrid approaches have been later used in every of the unicast routing protocol and multicast routing protocol classification and a Characteristic difference’s for typical representatives of routing protocols designed for mobile ad hoc networks.

Keywords: MANET, Multicast Routing Protocol, Unicast Routing Protocol, Multicast Routing Protocol, MZR, MPR.

 

Download PDF

 

 

 

 

17. Comparative Performance of Hierarchical Fault Tolerance Protocol for Mobile Agent Systems

Heman Pathak Nipur, Kumkum Garg

Dept. of Computer Science, Gurukul Kangri Vishwavidyalaya, Haridwar , India

Dept. of Electronics & Comp. Eng. IIT, Roorkee , India

hemanp@rediffmail.com, nipursingh@hotmail.com, kgargfec@iitr.ernet.in

Abstract

A Mobile Agent (MA) is autonomous and identifiable software process that travel through a network of heterogeneous machine and act autonomously on behalf of user. Improving the survivability of MA in presence of various faults is the major issue concerns with implementation of MA. This paper presents a brief introduction of Hierarchical Fault Tolerance Protocol (HFTP) for Mobile Agents, which can tolerate host failure, system failure as well as link failure by grouping the hosts within a network and rear guard based migration of MA in the global network. A CPN model of HFTP has been used to generate simulation results for different scenarios by using various monitoring and data collection tools provided by CPN. The parameter used for analysis is trip time (time required by MA to complete its itinerary) and network overhead (number of packets transfer required over network). In order to check the efficiency of HFTP, we have modeled two other protocols Progressives Fault Tolerance Mechanism (PFTM) based of rear guards and Server Group based Agent Recovery Protocol (SG-ARP) with which our model is inspired. Performances of HFTP, PFTM and SG-ARP are compared on the basis of data obtained from simulations for different fault cases. The results of the simulation have been presented and analyzed.

Keywords-Mobile Agents, Fault Tolerance, Colored PetriNet

 

Download PDF

 

 

 

 

18. Development of Quantum Cryptographic Techniques for Enhancing Security

Swapnil Jain, Jayant Shukla

Sistech., Bhopal C.I.S.T., Bhopal

swapniljain76@gmail.com, jayant_s1981@yahoo.co.in

Abstract

Quantum cryptography, or quantum key distribution (QKD), uses quantum mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages. The genius of quantum  ryptography is that it solves the problem of key distribution. A user can suggest a key by sending a series of photons with random polarizations. This sequence can then be used to generate a sequence of numbers. Quantum key distribution has matured to the level of a technical demonstration project, and commercial turnkey systems are coming to market. However, there is still a relatively limited basis of experience with quantum cryptographic key exchange in a realistic modern network environment, and the commercial viability of quantum communication will depend upon its demonstrated performance in such environments. This paper presents the basic design considerations underlying quantum cryptographic techniques.

 

Download PDF

 

 

 

 

19. Simulation Analysis of STAR, DSR and ZRP in Presence of Misbehaving

Nodes in MANET

Amrit Suman, Ashok Kumar Nagar Sweta Jain Praneet Saurav

CS Department SOIT, RGPV University SOIT, RGPV University CS Department,

TIT, Bhopal , India Bhopal , India Bhopal , India TIT, Bhopal , India

amrit.it@gmail.com aknagoriya@gmail.com sweta.jain.sj@gmail.com praneetsaurav@gmail.com

Abstract

Wireless mobile ad-hoc networks are those networks which has no physical links between the nodes. Due to the mobility of nodes, interference, multi-path propagation and path loss there is no fixed topology in this network. Hence some routing protocol is needed to function properly for these networks. Many Routing protocols have been proposed and developed for accomplishing this task. The intent of this paper is to study three ad-hoc routing protocols ZRP, DSR and STAR in the presence of some misbehaving nodes and analyze them. This paper concentrates evaluating the performance of routing protocols when some nodes behave as malicious ones. The performance analysis for above protocol is based on variation in speed of nodes in a network with 50 nodes. All simulation is carried out with QualNet 4.5 network simulator.

Keywords: Ad Hoc Networks, routing protocol, ZRP, DSR, STAR

 

Download PDF

 

 

20. VLSI Architecture and FPGA Implementation of ICE Encryption Algorithm

Mrs.Laxmi Tiwari, Mrs.Babita Verma, Mr.Saurabh Singh

Lecturer IT/ CSE, BIT, Durg India

laxmi.nanhoriya@gmail.com babitaself@rediffmail.com saurabh_singh1983@rediffmail.com

Abstract

In modern security, the need for safe cryptographic algorithms that are hardware implemental is great. Hardware architecture is proposed in this paper, for the implementation of the ICE encryption algorithm. Since this cipher is optimized for use on software, a hardware implementation of that algorithm that achieves good performance results has much interest. The proposed implementation can be used for both encryption and decryption process. It is a folded architecture using feedback logic, designed for small chip covered area and high speed performance. The proposed architecture was implemented by using an FPGA device. The achieved throughput is equal to 116 Mbit/sec, using a system clock with frequency up to 29.1 MHz.

 

 

Download PDF

 

 

 

 

21. A Distributed Algorithm for Deadlock Detection and Resolution

Bharat Singh, Akash Bansal, Anshu Garg, Krista Chaaudhary

[1] Deptt. Of Computer science and Engg.,SEC, Sikar, Rajasthan

[2,3,4] Deptt. Of Computer science and Engg. MIET, Meerut , India

bharat.mtech@gmail.com, akash_bansal2005@rediffmail.com, anshu.garg13@gmail.com, krista2330@gmail.com

 

Abstract-This paper presents two distributed algorithms for detecting and resolving deadlocks. By insuring that only one of the deadlock processes will detect it, the problem of resolving the deadlock is simplified. That process could simply abort itself. In one version of the algorithm, an arbitrary process detects deadlock; and in a second version, the process with the lowest priority detects deadlock.

Keywords- Low-Priority Transactions, Dead Lock, System Resources.

 

 

Download PDF

 

 

 

22. A Performance Comparison for Adaptive-based Distributed Call Flow for Multi-hop MANET

Bharat Singh, Mr. Akash Bansal, Ms. Anshu Garg, Neel Mani Das

Deptt. Of Computer science and Engg. SEC, Sikar, Rajasthan

Deptt. Of Computer science and Engg. MIET, Meerut, India

Deptt. Of Computer science and Engg. MIET, Meerut , India

Deptt. of Computer Science & Engg. Jamia Hamdard, New Delhi , India

bharat.mtech@gmail.com, akash_bansal2005@rediffmail.com, anshu.garg13@gmail.com, neelmanidas@gmail.com

Abstract

MANET (Mobile Ad hoc networks) or simply Ad-hoc Networks have been proposed for a variety of applications where support for real time, multimedia services may be necessary. This requires that the network is able to offer service differentiation and quality of service (QoS) appropriate for the latency and jitter bounds needed to meet the real time constraint. This paper describes a design for realistic QoS support using a system approach that involves coordinated changes at the MAC and IP layers. At the MAC layer, we propose a priority-based scheduling mechanism to provide service differentiation based on current channel status. We develop a priority-based delay model for the adaptive back off scheme. The delay model allows each node to make local admission decisions. At the IP layer, the network resource availability distribution and flow admission in multihop ad hoc networks is achieved through a proposed call admission protocol, so that each node has the correct view of the shared channel usage, and the correct flow admission decision is made based on the estimated flow quality (accumulated delay of the path). Analytical and simulation results show that our approach can provide bounded latency and low jitter for realtime traffic, such as VoIP. The results also demonstrate that the aggregated network throughput is significantly improved given the quality requirements.

Keywords- Distribution call, Mobile ad-hoc network, MAC & IP Layer, QoS.

 

Download PDF

 

 

 

 

 

23. Attacks and their Counter Measures in Wireless Mesh Networks

Anil Kumar Gankotiya1, Sahil Seth2, Gurdit Singh3

Department of Computer Science, PEC University of Technology , Chandigarh , India

1anilgankotiya@ieee.org, 2sahilseth@ieee.org, 3gurditsingh@ieee.org

Abstract

Wireless mesh networks (WMNs) have emerged as a key technology for next-generation wireless networking. Because of their advantages over other wireless networks, WMNs are undergoing rapid progress and inspiring numerous applications. However, many technical issues still exist in this field. In order to provide a better understanding of the research challenges of WMNs, this article presents a detailed investigation of current state-of-the security issues in WMNs. Open research issues in protocol layer is also discussed, with an objective to spark new research interests in this field.

Keywords: Medium Access Control, Routing, Wireless Mesh Networks, WMN Security

 

 

Download PDF

 

 

 

 

24. Variable Key: A new investigation in cryptography and results there-off

P. Chakrabarti 1, LMISTE C.T.Bhunia 2, B. Bhuyan3

1Bengal Institute of Technology and Management, Santiniketan , West Bengal , Pin-731236, India

2 Bengal Institute of Technology and Management, Santiniketan and ICTP, 34014 Trieste , Italy

3North Eastern Hill University , Shillong , Assam , India

Main/Corresponding author email_id : prasun9999@rediffmail.com

Abstract

This paper deals with the Automatic Variable Key(AVK) that has been studied elsewhere as time variant key for information security. AVK has a very effective approach for achieving highest level of security as per Shannon . We make a study on the essence of automatic variability of key in maintaining perfect secrecy cryptosystem. It is shown that Automatic Variable Key (AVK) is necessary for security enhancement in DES, Trapdoor Knapsack Problem, Vernum Theory, ECB mode of DES.

 

Download PDF

 

 

 

 

25. Side Channel Attack Using Power Analysis

K. RAHIMUNNISA Assistant. Professor, Karunya University , Coimbatore . Email: krahimunnisa@gmail.com

KAVYA T.S Research Scholar, Karunya University , Coimbatore . Email: kavyats86@gmail.com

ANOOP SURAJ A Research Scholar, Karunya University , Coimbatore . Email: anoopsuraj@ieee.org

 

Abstract

The ingenuity of the software involved in the theoretical basis of cryptographic algorithms is indeed phenomenally strong. But they can be broken only through the weakness of their implementations. This weakness of the theoretical base is manipulated to explore into the various dimensions and possibilities of Side Channel Attack (SCA). This in fact forms the core of the methodology employed in the study of SCA as described in this paper. This paper explores into the possibilities and uses of various Side Channel Attacks meticulously. SCA exploits the unintended information leakage from the implementation to extract the secret key. The information elicited via side channel attack may include power consumed by the system, timing parameters, electromagnetic information etc. The specific aim of this paper is directed towards eliciting side channel information through power analysis attack. The process also invariably makes use of a powerful Boolean technique, which utilizes the Boolean form of extracted variables. This Boolean reasoning technique will try for all possible combinations and find out a true assignment, if there exist any. This system can be extended to attack cryptographic software implementations. SCA substantially reduces the complexity of performing cryptanalysis and defines it in a new light.

Keywords: Cryptanalysis, Side Channel Attack, Power Analysis Attacks.

 

Download PDF

 

 

 

 

26. Cross Layer Design for Routing In Multi-Hop Wireless Networks

Mr. S. R. Lahane Prof. G.R. Bamnote

M.E. (CSE) - Appearing Asst. Professor in Comp. Engg. Dept.

PRMIT & R, Badnera, Amaravati. PRMIT & R, Badnera, Amaravati.

shivaji_lahane@rediffmail.com grbamnote@rediffmail.com

Abstract:

Multi-hop wireless networks are facing some research issues regarding routing protocols. Multi-hop decentralized architecture, media access delay, lower link life and bandwidth estimation are the key challenges which need to be address. The selection of optimal path with available bandwidth for routing cannot be achieved with the traditional approaches. Cross layer design is the only solution to cope with these kinds of challenges in multi-hop wireless networks. In this system, we will discuss the importance of cross layer routing protocols for multi-hop wireless networks by critical comparison.

Keywords: Multi-hop, Cross-layer design, Available bandwidth.

 

Download PDF

 

 

 

27. Minimization of Hand-off Failure Probability and False Hand-off Initiation in Low Latency Next Generation Wireless Networks

Koushik Kumar Nundy, Himanish Mukherjee, Debabrata Sarddar, Mrinal Kanti Naskar, Utpal Biswas

B.Tech student, Department of ECE NIT Durgapur West Bengal, India

Ph.D. student, Department of CSE Jadavpur University West Bengal, India

Professor, Department of ETCE Jadavpur University West Bengal , India

Senior Lecturer, Department of CSE University of Kalyani Kalyani , India

kknundy@gmail.com,himanish@sify.com, dsarddar@rediffmail.com, mrinalnaskar@yahoo.co.in, utpal01in@yahoo.com

Abstract

This paper presents a method of reducing handoff delay and minimising handoff failure probability using available technology, without compromising bandwidth efficiency considerably, by altering and streamlining the functionality and task division of the contemporary handoff technique. This would result in fewer call failures and in congestion-free networks.

Keywords- NGWS, 4G Networks, handoff, intra-system

 

Download PDF

 

 

 

 

28. Hybrid Authentication Protocol to Address the Issue of Authentication

Julie Dilip Abraham, Monika Jena

Amity School of Computer Sciences, Sec-44 Noida UP INDIA

julie_dilip@hotmail.com, jena_monika@yahoo.com

Abstract

From National security and counterterrorism to online retailing and telemedicine, secure communications is now a defining theme of the networking industry. Rapid advances in computing power are leaving traditional approaches to data encryption more and more susceptible to attack. This paper explains the basic principles of quantum cryptography and how these principles apply to quantum key distribution. The major drawbacks of Classical or Traditional Cryptography are discussed followed by full justification as to why it becomes imperative to adopt Quantum Cryptography for communication in the future. Quantum Key Distribution(QKD) has no counter-measure for man-in-the-middle attack i.e. eavesdroppers masquerading as legitimate communicators. This paper specifically deals with different strategies for Authentication in a Quantum Key Distribution System. The different strategies are broadly classified into systems using public-key authentication techniques and systems using pre-established symmetric keys. Finally, an analysis of a Hybrid Authentication Protocol that combines a QKD protocol with Symmetric Cryptography involving one or more trusted servers.

Keywords: Intrusion detection, Key-validity check, authentication, Quantum Cryptography, Secret-key Cryptography, symmetric-key authentication.

 

 

Download PDF

 

 

 

29. Wireless ECG Monitoring System

Ms. Kanwade A. B. Prof. Dr. Patil S. P. Prof. Dr. Bormane D.S.

Lecturer, E&TC Dept Principal, E&TC Dept Principal, E&TC Dept RSCOE , Pune ANDCOE, Ashta RSCOE, Pune

Archana_kanwade@yahoo.com

Abstract

 Second greatest killer in the world is the heart disease. Improvements in diagnosis and treatment tools are welcome by the medical community; one of the most useful diagnostic tools for heart patients is the electrocardiogram, which operates by measuring the tiny electrical signals emitted by the heart through chest electrodes. The goal of this project is to develop a device classified as a “ Wireless ECG Monitor” which outperforms currently available devices, It is intended that this very product will go through medical approval and will in a year or two be found saving peoples lives. This device is designed to record single channel of full-spectrum ECG. It stores this enormous amount of information in the memory for further correspondence. Wireless technique is used to remove burden of holter monitor. It can monitor ECG of a patient, who is far apart. The device will analyze ECG for real time and will display Heart Rate, amplitude, and intervals of some critical components.

Keywords: ECG, Wireless.

 

Download PDF

 

 

 

 

30. Impacts of Distributed Generation in Restructured Power System: A Review

Anuprita Sandeep Mishra, Ganga Agnihotri, N.P.Patidar, Madhu Agrawal

Abstract

This is the review work to unite the conclusions resulting from previous work in finding the impacts of DG in Restructured Power System with different aspects. Firstly authors endow with different definitions of DG furnished by institutional authorities or industrial organizations. Then stepped separately into overview and impact of DG on transmission pricing, system reliability and interconnected system. At last under the heading of sizing and siting of DG authors reviewed adequacy assessment of placement of DG, network investment deferral on DG, impact of distributed generation on distribution contingency. And finally conclusion of this review is given.

Keywords: Transmission pricing, System reliability, Interconnected System, Sizing and Siting.

 

 

Download PDF

 

 

 

 

31. An Efficient K-Means Cluster Based Image Retrieval Algorithm using Learning: An Innovative Approach from Relevance Feedback

*Jayant Mishra, **Prof. Nishchol Mishra, *** Prof. Sanjeev Sharma

*rgtu.jayant@gmail.com, **nishchol@rgtu.net, ***sanjeev@rgtu.net

School of Information Technology, RGPV, Bhopal- India

Abstract

Content-based image retrieval (CBIR) systems are capable to use query for visually related images by identifying similarity between a query image and those in the image database. The CBIR systems can be classified broadly into two classes as Low level feature based system and High level Semantic feature based system. Image contents are plays significant role for image retrieval. The most common contents are color, texture and shape. An efficient image retrieval system must be based on well-organized image feature extraction. K-means clustering is used to group similar and dissimilar objects in an image database into k disjoint clusters whereas neural network is used as a retrieval engine to measure the overall similarity between the query and the images. Relevance feedback is a query modification technique in the field of content-based image retrieval to improve the retrieval performance.

Keywords: Content-based image retrieval, Feature Extraction, Relevance Feedback, k-means.

 

 

Download PDF

 

 

 

32. Content-Based Image Retrieval -A New Emerging Trend For Image Description

Manish Pundlik, Kavita choudhary

Reader ,School of Computers & Electronics, IPS Academy, Indore ,School of Computers & Electronics, IPS Academy, Indore

Abstract

The difficulties faced by text - based retrieval became mo re and more severe. The efficient management of the rapidly expanding visual in format ion became an urgent problem. This need formed the driving force behind the emergence of content -based image retrieval techniques. Many different app roaches for content-based image retrieval have been proposed in the literature. Successful approaches consider not only simple features like color, but also take the structural relationship between objects into ac count. The retrieval process in order to generate perceptually and semantically more meaningful retrieval results. We present a new app roach that significantly automates the examination process by relying on image analysis techniques. The general approach is to use previously identified content (e .g. contraband images) and to perform feature extraction, which captures mathematically the essential properties of the images. Based on this analysis, we build a feature set database that allows us to automatically scan a target machine for images that are similar to the ones in the database.

 

Download PDF