M Tech Dissertations

Permanent URI for this collectionhttp://ir.daiict.ac.in/handle/123456789/3

Browse

Filters

2004 - 200942010 - 20111

Settings

Has files: YesSubject: search.filters.subject.Sensor networks

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    ItemOpen Access
    Secure data delivery in mobile ad hoc network using multiple paths
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Maheshwari, Mayur; Das, Manik Lal
    A mobile ad hoc network (MANET) is a self configurable, self organized, infrastructure less multi hop mobile wireless network.Characteristics of ad hoc network make security a critical issue i.e. any node can join the network without revealing its presence as well as any node can behave in either a passive way (eavesdropping the message) or in an active way (manipulating the message, signal interference or jamming the network). When a node has some confidential information needed to transmit to other node, it needs some secure data delivery protocols such that, information can reach to intended node confidentially without tempered. We have studied two secure data delivery protocols namely SPREAD and Xia et al‟s scheme. These protocols focus on how to deliver a secret message over insecure MANET using multiple paths. These protocols provide confidentiality and robustness but don‟t focus on authentication and integrity. Due to the lack of authentication, any node can impersonate the good node or the intermediate node can manipulate message and no one can detect this misbehaviour. We have proposed a scheme that aims to provide confidentiality, authentication, and robustness for a message when they are delivered across the insecure MANET. We have used the concept of SPREAD, where message transforms into multiple shares and then delivers the shares via multiple independent paths to the destination, so that if a small number of nodes that are used to relay the message shares are compromised, the whole message is not compromised. We are using basic idea of TESLA to provide authentication. Finally, when we analyzed our proposed protocol and compared it with SPREAD. Our analysis showed that the proposed scheme provides all basic security objectives as well as it protects against data tempering, impersonation, replay and known session key attacks.
  • Thumbnail Image
    ItemOpen Access
    FPGA implementation of direct sequence spread spectrum techniques
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Choudhary, Vivek Kumar; Dubey, Rahul
    This work presents the performance, noise analysis and FPGA implementation of Direct Sequence Spread Spectrum technique. Performance of signal increases as increasing parity bits in Hamming code algorithm. Increasing parity noise goes reduce therefore received signal close to its original value, but adding parity band-width requirement also increases. This work is bases on the IS-95 standard for CDMA (Code Division Multiple Access) Digital Cellular.
  • Thumbnail Image
    ItemOpen Access
    Detection of unauthorized vehicle movement across the forest boundary using wireless sensor networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2006) Rana, Deepika; Srivastava, Sanjay; Lenin, R. B.
    Wireless sensor network is a collection of small sensor nodes. These nodes consist of sensing, communication and computation capability that attracts a large number of applications. Wireless sensor networks are deployed for a particular application on hand and are therefore application-specific in nature. An effort has been made in this thesis work to understand the true potential of such networks by studying the on-going work in this field. A novel application has been identified that would benefit from the deployment of such network. Presence of unauthorized vehicle inside the forest premises can be detected and its information can be made available to the forest officials. Sensor network architecture has been designed for the application. Importance of placement of sensor nodes and scheduling the sensor nodes to achieve longer lifetime are also discussed. Simulation results show how the system behaves under various conditions.
  • Thumbnail Image
    ItemOpen Access
    Localization of target in wireless sensor networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2005) Sudhir, K. Venkata; Chakka, Vijaykumar
    Advances in hardware and wireless network technology have made it possible to build and deploy dense ad-hoc wireless sensor networks of nodes collecting and disseminating information. One problem that arises in ad-hoc wireless sensor networks is the inability of the nodes to locate themselves and the object (events) as well. With a motivation to solve this, we have proposed the following in this thesis: 1. Distributed algorithm for the location of sensors having omni directional radiation pattern using MMSE distance criteria. 2. A low computational complexity grid based technique to find sub set of sensors close to the event of occurrence from the reported set of sensors to query for further information. A MATLAB simulation is done for finding the closest sensor to the event of occurrence, without the knowledge of true positions of all the sensors in the field excluding those that act as anchors. The simulation shows a successful detection percentage of 55 with one-sensor query and 80 with two-sensor query. This detection percentage is close to the detection that is done with the knowledge of true sensor positions in the field.
  • Thumbnail Image
    ItemOpen Access
    Energy efficient secret aggregation for wireless sensor networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2004) Jadia, Pawan K.; Mathuria, Anish M.
    Sensor networks involves large amount of nodes spread over a region. Data aggre¬gation is an important technique for reducing the amount of data to be transmitted in the networks. Data confidentiality is a crucial requirement in many applications. Many existing protocol for secure aggregation do not provide confidentiality. To re¬duce the computations, it is desirable to have a protocol in which aggregation can be done without decrypting the data at intermediate nodes. This thesis proposes a protocol in which nodes can do data aggregation without learning the neighboring nodes data. The scheme is based on Processing Over Encrypted Data. Much work has been already done in various fields using this cryptographic construct but to the best of our knowledge the field of sensor networks is still untouched. Using this con¬struct in the field of sensor network will be a novel idea because it leads to energy efficient secure aggregation and can open new directions of research in the field of wireless sensor networks.