Computer Science And Technology - Master Dissertation

Permanent URI for this collectionhttps://kr.cup.edu.in/handle/32116/80

Browse

Has files: Yes

Search Results

Now showing 1 - 10 of 17
  • Thumbnail Image
    Item
    A Novel Approach for Information Hiding in Punjabi Language
    (Central University of Punjab, 2016) Kumar, Arun; Kaur, Amandeep
    The Internet is global in scope and rapidly growing. With this growth, internet security threats are also increasing. The Internet is the global information exchange media, which is open and insecure, needs more and better security provision. In the era of computer network virtually all business, government and academic organizations interconnect their local area network with a collection of interconnected networks. Data transmission in a public communication system is not secure because of interception and improper manipulation by an opponent Therefore, the attractive solution for this problem is steganography, which is the art and science of writing concealed messages in such a way that no one, apart from the sender and intend recipient, can notice the existence of the message. Thus, confidentiality and integrity principle of security can be achieved. There have been wide ranges of algorithms introduced using a text file as cover media. This thesis explains a two layered hiding technique that provides high security than other techniques. The use of local language ensures more security to the information exchange as the awareness of the local language is limited. The proposed approach uses the local language Punjabi as cover text. In proposed approach, the cover media is pre-existing media, not system generated media. Therefore, a user will be free to use the cover media taken from any Punjabi newspaper, magazine or book and the syntax of a sentence and sequence of sentence both will be true grammatically. Even though the opponent has a very good command on the Punjabi language, they will not found any suspicious.
  • Thumbnail Image
    Item
    Devising a Feature Matching Algorithm for Pharmacophore Modelling.
    (Central University of Punjab, 2015) Mahato, Suchismita; Jain, AK
    Feature Matching is one of the central issues of model-based recognition and an important component of most object recognition systems. The feature matching technique can be applied in image alignment, 3D secure reconstruction, motion tracking, object recognition and in pharmacophore based molecular alignment. Even though numerous algorithms exist for feature recognition and search yet the efficiency of these have considerable room for improvement. This has necessitated a continuous search for better performing algorithms. The combination of geometric hashing technique and tolerance limits for a given set of known interactions can be used for the pharmacophore modelling based search. The algorithm proposed is precise as compared with the previous existing algorithms. This algorithm is better in its runtime complexity.
  • Thumbnail Image
    Item
    Performance analysis of spin protocol under different security threats in wireless sensor networks
    (Central University of Punjab, 2014) Choudhary, Rohit; Kaur, Amanpreet
    The wireless sensor network consists of homogenous sensor nodes with limited energy and computational power which are self organisable. These nodes use radio frequency channels to communicate with each other wirelessly. Besides that wireless sensor networks are resource constrained with low energy and low bandwidth along with shorter communication range. The evolution of VLSI circuit technology has also enabled the development of wireless sensor networks. The ease of deployment and low cost availability of sensor devices has attracted much advancement in wireless sensor networks. The nodes with capabilities of sensing and computing help the administrator to observe particular environment like battle field, climatic conditions and weather forecasting in remote areas etc. This dissertation research is about the study of performance challenges in wireless sensor networks using Sensor Protocol for Information via Negotiation(SPIN) protocol under various security threats and to analyse their impact on SPIN. The empirical study has been carried to validate the issues studied in literature review by simulating the scenarios. On the basis of achieved observations the inference is drawn about the better protocol in sensor network and future recommendations are made for the analysis and enhancement.
  • Thumbnail Image
    Item
    Analysis of leach protocol for lifetime optimization of wireless sensor networks
    (Central University of Punjab, 2014) Maurya, Prashant; Kaur, Amanpreet
    A Wireless Sensor Network (WSN) is an emerging field comprised of sensor nodes with limited resources like power, memory etc. It is used to monitor the remote areas where recharging or replacing the battery power of sensor nods is not possible. So, energy is a most challenging issue in case of WSN. Low-Energy Adaptive Clustering Hierarchy (LEACH) is most significant protocol which consumes less amount of energy while routing the data to the base station (BS). All descendents protocols of LEACH have been discussed in Literature review chapter. Each descendants of LEACH has its merits and demerits which needs improvement. In this research work RCH-LEACH protocol (LEACH protocol using Relay Cluster Head Node) has been proposed using a relay cluster head node (RCH node) in each cluster. RCH-LEACH protocol has been simulated on MATLAB with fixed location of base station and with fixed percentage of cluster heads in the network. Results of RCH-LEACH has been analyzed using parameters like Energy Consumption per Round, Round when First Node Dies (FND), Round when half of Nodes Die (HND), Round when Last Node Dies (LND) and throughput. Analysis of results represent that FND, HND, LND and Throughput of RCH-LEACH are higher and Energy consumption per Round is lower than that of LEACH protocol. So, it can be concluded that RCH-LEACH outperforms LEACH protocol. This RCH model used in RCH-LEACH protocol can be further extended and implemented on other descendant protocols of LEACH to improve them as a part of future work.
  • Thumbnail Image
    Item
    Security analysis of AODV, ARAN and improved mobile adhoc networks routing protocols
    (Central University of Punjab, 2014) Goel, Ruby; Meenakshi
    Wireless networks use wireless connections to provide a communication environment between the communicating devices using their radio transmission range. Wireless network doesn?t require any pre-established infrastructure. Adhoc network is an infrastructure-less network which allow nodes to communicate beyond their direct wireless transmission range by introducing cooperation in mobile nodes. Wireless communication is guided by routing protocols. Wireless routing protocols come under different categories like- On-demand, Table-driven and secure routing protocols. Wireless networks face many challenges due to limited resources, dynamic topologies and lack of physical security, due to which variety of attacks have been identified that target both the on-demand and table- driven routing protocols. By attacking the routing protocols attacker can absorb network traffic, or can inject the false traffic in the network. Due to this attacks like- Blackhole, IP-Spoofing, False message fabrication, Denial of service, etc. are possible in adhoc networks. Many secure routing protocols have been developed that can deal with these attacks. One of them is Authenticated Routing for Adhoc Network (ARAN) which introduces authentication, message integrity and non- repudiation as part of its security policy and provides security against various network attacks like- Message modification, false message fabrication and impersonation attack. But ARAN is vulnerable to Distributed Denial of Service (DDOS) attack because legitimate nodes can send large amount of unnecessary packets in the network and can create congestion and thus prevent other legitimate nodes to access the network. In this research work security aspects of ARAN have been analyzed with respect to Adhoc On-Demand Distance Vector (AODV) routing protocol under Blackhole and IP-Spoofing attack. Further a technique has been proposed for ARAN to resist DDOS attack by limiting the number of packets per unit of time each node can send in the network and this enhanced ARAN in this research work is called as improved ARAN (i-ARAN). By implementing the proposed technique i- ARAN is able to prevent DDOS attack. Various performance metrics like- Packet Delivery ratio, Average Path Length, Average end-to-end delay and Throughput; iv are calculated under Glomosim-2.03 simulator. Results show that ARAN is safe against Blackhole and IP-Spoofing attack, but AODV is highly vulnerable to both the attacks. Also results of i-ARAN under DDOS attack show that the attack can be prevented by the proposed technique as it provides constant Packet delivery ratio from all the source nodes and throughput of i-ARAN is also approximately constant. By using i-ARAN there is no congestion in the network so average end- to-end delay of i-ARAN is less than the ARAN.
  • Thumbnail Image
    Item
    Improved and rule scheme to increase lifetime of wireless sensor networks
    (Central University of Punjab, 2014) Saini, Swati; Khurana, Surinder.K
    Wireless sensor network (WSN) is a network of small light weight wireless nodes which are highly distributed and deployed in large numbers. The sensor nodes scan the environment and provide useful information to the user through sink node. One of the major issues in wireless sensor networks is developing an energy-efficient routing technique which has a significant impact on the overall lifetime of the sensor network. Our dissertation work focuses on increasing lifetime of wireless sensor networks. This is done by improving the existing Divide and Rule Scheme which is based on dividing network area into logical divisions to reduce distance for intra cluster and inter cluster communications. Improvement of Divide and Rule Scheme is done by developing a new scheme called Segregated Receive and Relay Scheme in which addition of relay nodes is done in inner and middle regions. The Proposed Scheme results in around 50% increase in lifetime of inner region nodes and leading to overall increase in lifetime of the network. Other parameters such as Delay, Throughput and Packet loss also shows better results in new Scheme.
  • Thumbnail Image
    Item
    To verify the data integrity and third party auditor at user side in cloud computing
    (Central University of Punjab, 2014) Goyal, Renuka; Sidhu, Navjoot
    Now-a-days the concept of Cloud Computing is one of the major theories in the world of IT. Its services are now being applied to several IT scenarios. Cloud Computing is the Internet based computing which provides users with a number of services. One of the services provided by the cloud computing is data storage. Users store their data in the cloud without the burden of local data storage. But as every technology has some drawbacks, cloud computing also has some drawbacks. The main drawback of cloud computing is the security issues that are associated with it. The security issue with which this dissertation is dealing is the threat to data integrity. As the user no longer has physical possession of data so the integrity of data stored on cloud server become the major concern in the cloud computing. Data stored on the cloud server may be getting corrupted and sometimes even the cloud service provider for his own benefit like for more space on data centre can discard the user data which is not used for a longer time. In order to maintain the integrity of data, the user takes the assistance of a Third Party Auditor (TPA). The Third Party Auditor checks the integrity of data on user demand and the released audit reports not only helps the user to evaluate the risk of their services but also helps the cloud service provider to improve their security mechanism. As a part of verification it is assumed that Third Party Auditor is reliable and independent which does not mean that there is no space for the Third Party Auditor to cheat. So there is need to check the integrity and Third Party Auditor at user side. This dissertation highlights the basics of cloud computing, general model and different approaches used for Third Party Auditor. The model to verify the data integrity and Third Party Auditor is implemented in this dissertation and the results found are good according to the user data.
  • Thumbnail Image
    Item
    A fault tolerable load balancing technique in cloud computing
    (Central University of Punjab, 2014) Shiny; Khurana, Surinder.K
    As the IT industry is growing day by day, the need of computing and data storage is increasing rapidly. The process of this increasing mass of data requires more computer equipment to meet the various needs of the organizations. To better capitalize their investment, the over-equipped organizations open their infrastructures to others by exploiting the Internet and other important technologies such as virtualization by creating a new computing model: the cloud computing. Cloud computing is one of the significant milestones in recent times in the history of computers. However, there are number of technical challenges that need to be tackled which include reliability, resource provisioning, fault tolerance, load balancing and efficient mechanism to increase the service level agreement (SLA) and better use of the resources. The main purpose of this dissertation report is to provide a preface of the topic and to work on the various issues involved in the field of load balancing and fault tolerance i.e. load computation and the distribution of load. Load balancing and fault tolerance in cloud computing have a great impact on the performance of the system. Good load balancing makes cloud computing more efficient by provisioning of resources to cloud users on demand basis in pay-as-you-say manner. Load balancers are used for assigning load to different virtual machines in such a way that none of the nodes gets loaded heavily or lightly. When many clients request the server simultaneously, server is overloaded which causes fault. There are many load balancing algorithms and fault tolerance techniques in order to settle down these issues, but these techniques further had some drawbacks. Das and Khilar (2013) discussed a load balancing technique for virtualization and fault tolerance in cloud computing (LBVFT) to assign the task to the virtual nodes depending upon the success rates (SR) and the previous load history. This v technique tolerates not only the faults but also reduce the chance of future faults by not assigning tasks to virtual nodes of physical servers whose success rates are very low and loads are very high. But there is still a need to provide an efficient load balancing, load migration, load calculation and fault handling technique to make the VFT model more effective.
  • Thumbnail Image
    Item
    Performance evaluation of manet routing protocols dsdv, tora enhanced tora
    (Central University of Punjab, 2014) Kaur, Amandeep; Meenakshi
    Wireless Networking has become the phrase du jour these days because of an attractive number of benefits it offers to the end users, by enabling them to access and share a wide pool of resources and information across the globe. Mobile ad hoc networks (MANETs) are a kind of infrastructure less wireless networks in which all the nodes act as peers and themselves configure the network. Mobile ad hoc networks are an open area of research because of its applicability in a number of areas like tactical networks, emergency services and education. One of the major challenges in networking is the efficient, accurate, reliable, secure and immediate delivery of data from source to destination. Therefore, the efficient routing of data across the mobile ad hoc network is a major concern of researchers all over the world. Several routing protocols have been developed to send data efficiently across mobile ad hoc networks. These protocols have been divided into three categories- Proactive, Reactive and Hybrid. The performance evaluation of these protocols has been going on since a long time. Most of the current research focuses on the pause times, simulation times and network size to measure the performance of various mobile ad hoc network routing protocols. A very few work has been done on the performance analysis of protocols by varying the underlying mobility models and traffic patterns. This dissertation work is focused on the improvement of the poor performance of TORA with the rise in number of traffic connections. This behavior has been credited to the link sensing mechanism of Internet MANET Encapsulation protocol (IMEP). IMEP is a multi-purpose network-layer protocol that supports the operation of many routing protocols including TORA. It provides mechanism for sensing the status of links in TORA. This link sensing mechanism has been investigated and proposed modification by K. H. Lim and A. Datta has been implemented to observe improvement in the overall performance of Enhanced-TORA protocol in comparison with original TORA. iv Through this research, investigations have been made into the behavior of DSDV, and TORA mobile ad hoc routing protocols by varying the underlying mobility models (Random Waypoint, Random Direction and Manhattan Grid model) and Traffic patterns (FTP, TELNET, HTTP). The metrics used to analyze the performance are Throughput, Average End to End delay, Routing overhead, Packet Delivery Ratio and Packet Loss. This research draws an analysis whether under which mobility model and traffic pattern combination these protocols give the best performance. Results show that DSDV gives best performance under Manhattan Grid Mobility model and FTP traffic pattern. Whereas, TORA and Enhanced-TORA give best performance under Random Direction Mobility model and FTP traffic. The performance of Enhanced-TORA is then compared with original TORA using 10 traffic connections under Random Direction mobility model and FTP Traffic and it was observed that Enhanced-TORA outperformed original TORA thereby eliminating the problem of performance degradation with rise in number of connections
  • Thumbnail Image
    Item
    Performance analysis of aodv for wormhole attack using different mobility models
    (Central University of Punjab, 2014) Kaur, Gurmeet; Kaur, Amanpreet
    Mobile Ad-Hoc Network (MANET) is a type of temporary wireless network, in which the nodes are mobile and have dynamic network topology. According to structural arrangement, wireless networks are classified into two main types: fixed infrastructure wireless networks and non-infrastructure wireless networks. Mobile Ad-Hoc Networks (MANETs) fall under the type of infrastructure less wireless networks. Mobile nodes can communicate to each other through wireless links in this type of an autonomous system. At any time, whenever required nodes can join or leave the network as nodes are free to move. Although various routing protocols are used in the communication process but those protocols have numerous security complexities. An intruder can perform many attacks (both active and passive attacks) through different security flaws. Wormhole attack is an active attack in the context of mobile ad-hoc networks that disrupts the normal routing functioning of any routing protocol. In this work, an attempt has been made to analyze and compare the performance of demand oriented or reactive routing protocol: Ad-hoc On Demand Distance Vector (AODV) with two approaches: AODV without wormhole attack and AODV under attack using two mobility models viz. Random Way Point Model and Reference Point Group Mobility Model. Evaluation of two examined approaches has been done in terms of performance metrics such as Average Throughput, PDR (Packet Delivery Ratio), Jitter, Average End to End Delay and Packet Drop Rate. An approach has also been used to analyze participated malicious nodes in the wormhole peer list. Along with this, the attack has been detected with the help of metrics such as Average Throughput, Average End to End Delay, Jitter and Packet Delivery Ratio.