M Tech Dissertations
Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3
Browse
17 results
Search Results
Item Open Access Application of network coding in wireless sensor and relay based ad hoc networks(Dhirubhai Ambani Institute of Information and Communication Technology, 2015) Singh, Dushyant; Pillutla, Laxminarayana S.Network Coding (NC) is a new area which brings radical change in the way we treat information flow in networks. NC considered being a layer 3 operation has been shown to improve the throughput of wired networks especially for broadcast and multicast traffic. Linear network coding (LNC) in which packets are combined using simple linear operations over finite fields can indeed achieve the multicast capacity. Random LNC (RLNC) is attractively used for distributed scenario where the codes are generated by various nodes in random fashion. The data dissemination latency scales as O(N2) (N is the number of nodes) in naive broadcast scenario. However with RLNC the data dissemination latency scales between O(N) and O(N2) depending on the network connectivity. NC is at the heart of two problems that we have considered in this thesis. Firstly we consider collaborative distributed indoor target tracking using wireless sensor networks (WSNs) where we show how RLNC can be used for effective information dissemination and analyzed its impact on tracking performance for the case of indoor target tracking. Our simulation results demonstrate that for a target root mean square (RMS) value of tracking error the RLNC scheme would require less number of time slots in comparison with the two competing schemes. Secondly we consider the performance of NC in relay assisted contention based ad hoc networks considered like the IEEE 802.11 compliant ones. We specifically show as how MAC layer NC can be used at both relay, source & destination nodes to improve throughput in contention based wireless networks. Our simulation results demonstrate an increment in system throughput by 15-20% for the case with NC.Item Open Access Generalized data extraction protocol for habitat monitoring applications in WSNs(Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Hemnani, Deepak Manohar; Srivastava, SanjayHabitat monitoring applications use WSNs to gather data about environment and migration patterns of animals. This data is used by biologists to analyze the life and behavior of animals in different environments. The application involves designing of WSN nodes to tag the animals and running protocols to gather and exchange information to be collected at the base station. Given the limited resources i.e. energy and memory, there is a need for an energy efficient and memory efficient data extraction protocol. We take in to consideration previous work done in Zebra net and wild CENSE to formulate a generalized protocol which could be implemented as is. The protocol parameters are defined as symbols which are based on application parameters. My work involves identifying the gaps in the previous work done for habitat monitoring. Filling the gaps and coming up with a generalized protocol and finally providing formulation for the protocol in terms of application parameters.Item Open 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 LalA 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.Item Open Access Effect of location inaccuracy on deterministic coverage and connectivity protocol in wireless sensor network(Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Jain, Poonam; Srivastava, SanjaySensor networks have a wide range of potential, practical and useful applications. Energy saving is one critical issue for sensor networks since most sensors are equipped with non rechargeable batteries that have limited lifetime. Many of the current literature of Energy efficient scheduling protocols assumed that sensing range of a sensor node is always uniform in all directions (unitdisc model). Unfortunately, this is not appropriate for the realistic sensing model, as the sensing capabilities of networked sensors are affected by environmental factors. The other issue is that most of the protocol used the location information of sensors for accurate data analysis. GPS technology and localization algorithms provide location information. But these technologies do not give accurate information, there is some uncertainty or error is exist in location information. Most of the protocols are location depended and will not work efficiently when inaccurate information is given. The main goal of this work is to analyze the performance of deterministic energy efficient scheduling protocol with location inaccuracy.Item Open Access Robust surface coverage using deterministic grid based deployment in wireless sensor networks(Dhirubhai Ambani Institute of Information and Communication Technology, 2010) Kulkarni, Rucha; Srivastava, SanjayThe rapid progress in the field of wireless communication ans MEMS technology has made wireless sensor networks (WSN) possible. These networks may have low cost sensors deployed which are capable of sensing any activity in the vicinity, storing the information etcetera to carry out a certain task. An important problem receiving increasing consideration is the sensor coverage problem, that is, how well the sensors observe the physical space? Coverage can be considered as a measure of quality of service (QoS) of a sensor network [17]. Using equilateral triangle grid based deployment of the sensors, it is necessary to place the sensor nodes such that they are not too close so that the overlapping of the covered area is minimum. But, at the same time, not too far away that it leads to some uncovered areas known as the coverage holes. Thus, the sensing capabilities of the sensor nodes must be fully utilized in order to maximize coverage of the FoI. To find the coverage of the given uneven surface, the concepts in computational geometry, especially the Voronoi diagrams have been extensively used. When the sensor nodes are deployed using an aircraft, the accuracy of the sensor deployment is affected due to various factors like terrain properties, timing errors in deployment mechanism and more. Hence, it is necessary to take into consideration these placement errors while calculating the coverage of the surface. Existing work on the coverage of the given surface provides mathematical formulation for 2-D surfaces [5]. But, in real world applications, the surfaces are not 2-D in nature. But have many perturbations. This work intends towards deriving mathematical formulas based on Voronoi Diagram concept for such perturbed surfaces which calculates the value, the sensing radius should be set to, so that the entire region is covered. It also derives formulas when horizontal and vertical errors are introduced individually and when introduced together. This work also proposes an algorithm for calculating the coverage of the region under consideration when random errors are introduced in the deployment of the sensor nodes. It also provides information about total area covered for different values of the sensing radius of the sensor nodes. This information is required by different applications having different coverage needs.Item Open Access Game theory based strategies for cooperation in ad hoc wireless networks(Dhirubhai Ambani Institute of Information and Communication Technology, 2010) Rajput, Nitin Singh; Srivastava, Sanjay; Divakaran, SrikrishnanIn self-organized ad-hoc wireless networks, nodes belong to different authorities, pursue different goals, have constrains like energy; therefore, cooperation among them cannot be taken for granted. Non cooperation of nodes causes increase in probability of packet drop and increase in probability of route or network failure, which leads to poor network performance. On other hand if nodes always cooperate, network does not last for a long as nodes are energy constrained. Several schemes are proposed in literature based on incentive and reputation mechanism. All of them outperforms in their own set of assumptions and have certain issues.Researchers started looking at game theory as a probable solution and proposed some schemes, but yet to come up with better solutions. We focus on optimization of service received by a node from network and delivered to network considering energy as constraint. We first derive the probability by which a node accept the relay request of other nodes based on energy constraint. Then apply game theory based schemes Generous Tit For Tat (GTFT), Neighboring GTFT (N-GTFT) and contrite Tit For Tat (C-TFT) for acceptance of relay requests; well known in economics, behavioral science and biology for cooperation. We find that all above mention scheme converges towards parato optimal values of service received and deliver to network in presence and absentia of noise in network. We find that when network has pair wise mixed strategies (any two from GTFT, N-GTFT and C-TFT) then also convergences remain same as it is for single strategy. But when there are 50% non cooperative nodes (Always Drops strategy), C-TFT is the dominating strategy. Also C-TFT copes up with 10% or more noise in the network as other strategy fail to do so, however they cope well with lesser amount of noise. At the end CTFT evolve as the dominating strategy when all strategies including Always Drops simulated under evolutionary method of comparison in noisy and noise free network. C-TFT out performs because it switches to mutual Tit For Tat after cooperating against fixed unilateral non cooperation from other nodes and also cope up with own unintentional defection caused by noise.
Item Open Access Lifetime analysis of wireless sensor nodes using queuing models(Dhirubhai Ambani Institute of Information and Communication Technology, 2010) Anand, Guneshwar; Srivastava, SanjayProlonging the lifetime of wireless sensor networks (WSN) is one of the key issues for wireless sensor network applications. For increasing the lifetime of network, each node should conserve its energy. Sensor nodes consume different power in different operating modes. It also consumes significant amount of power while switching from one mode to another mode. So it is important that how frequently a node is changing its mode. To address this question we have used queuing theory based control policy, which finds the optimal parameter for switching between modes. We have analysed two different control policies namely, N-policy and T-policy and their effect on the lifetime of a sensor node. In N-policy, a sensor node switches its mode only when total number of packets are N. We find an optimal value of N that minimizes the energy consumption per unit time. Similarly, in T-policy whenever system becomes empty it goes on vaccation for a fixed duration T. It changes its mode only again after T unit of time and stays in the same mode as long as there is a packet. In this case also we find the optimal value of T that minimizes the energy consumption per unit time. But this improvement in lifetime comes at the cost of longer delay and larger waiting time. We have given the expression for the latency delay. Depending on the application requirement one can tune the parameters to get the best result between the energy saving and latency delay.Item Open Access Wireless sensor network based automatic meter reading: WSNAMR(Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Sutariya, Mahesh R.; Ranjan, PrabhatAutomatic Meter Reading is technology evolved from 1995[3] or before, for remote collection of utilities measurement data which involve Electricity, Gas and Water etc. In this process of evolution every time new idea was methodology being used for implementation. In this thesis same task of meter reading will be performed wirelessly by using zigbee standard developed for the low power wireless sensor network. Concentration is on electrical energy. Goal of this work is to have a Remote collection of measured energy value as well as to have an on/off control of this energy supply which will indirectly enable wireless monitoring of energy consumption, prepaid billing etc through web based interface provided. So work will involve development of hardware and firmware and web based software to achieve this functionality. Once energy consumption data is available to us, it can be used for purpose of dynamic tariff management, dynamic load management, power quality monitoring, peak power consumption etc.Item Open Access Energy efficient data gathering protocol for wireless sensor network(Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Rao, Parth A.; Srivastava, SanjayWireless Sensor Network is made up of hundreds and thousands of miniature electronic devices called node, which have sensors built on them. Functionality of a sensor is entirely application dependent. They can perform a large number of functions from measuring the forces of nature like temperature, humidity, geophysical activity, sound vibrations to motion detection and military surveillance. Apart from sensing or measuring, the nodes are responsible for efficiently collecting the sensed data by performing appropriate activities on the collected data and there by weeding out redundant data so as to reduce transmission overload on nodes. Thus the nodes are responsible for gathering data and routing the data to the base station. Data Gathering can be performed in number of ways after nodes are deployed in the sensing field depending on their application. The manner in which nodes are deployed in the sensing field also affects the lifetime of the sensor network. It is not always possible that all nodes after deployment in the sensing field are able to communicate with the base station. Moreover efficient utilization of the energy is a must for sensor nodes, because these sensors are battery powered devices, and after they are deployed in the sensing field it is not feasible to change the battery of the nodes. So energy preservation of nodes in sensor network is a crucial requirement to be taken care of. The other prime matter worth considering is that during the whole life time of the sensor network care should be taken that load distribution on all the nodes in the sensing field is equal. All nodes should either die randomly at random location in the sensing field at random time intervals, or all nodes should start dying at more or less the same time. We have proposed an energy efficient protocol for data gathering in wireless sensor networks, which through hierarchical cluster formation reduce the number of high energy transmissions per round of data gathering and takes care of the load balancing issue by randomized rotation of the cluster heads. Routing of data is done in multi-hop fashion to ensure that the most remotely located node is also able to communicate with the base station through the best available intermediary nodes.Item Open Access FPGA implementation of direct sequence spread spectrum techniques(Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Choudhary, Vivek Kumar; Dubey, RahulThis 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.