Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
18 results
Search Results
Item Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks(2006) Srinath, T.V.; Katti, A.K.; S, V.S.In this paper, We mathematically model the In-Range localization scheme in the presence of a Mobile Beacon. In the In-Range localization scheme, a sensor with unknown location is localized to a disc centered at the position of the beacon, if the sensor under consideration can successfully decode a transmission from the beacon. In our approach a Mobile Beacon guided by a mobility model is used to generate the virtual beacons, there by eliminating the need to deploy static beacons that are required in the classical In-Range localization scheme. For analysis, we consider a Mobile Beacon guided by the Random Way Point (RWP) mobility model with In-Range localization scheme. The main contribution of this paper consists of mathematical models for the In-Range localization parameters in the presence of a Mobile Beacon guided by the RWP mobility model. Copyright 2006 ACM.Item Localization in resource constrained sensor networks using a mobile beacon with in-ranging(IEEE Computer Society, 2006) Srinath, T.V.In this paper1, We provide a mechanism for the problem of localization in resource constrained sensor networks by extending the principles of In-Range technique using a mobile beacon. The main advantage of this mechanism is that, it inherits all the advantages of In-Range technique, eliminates the need to deploy beacons in the sensor network and satisfy the requirements of localization algorithms for sensor networks. Location awareness of sensor nodes plays a critical role in most of the sensor network applications. Our mechanism assumes only a basic communication capability of sensor nodes and does not require any additional infrastructure. We employ a single mobile beacon equipped with a GPS receiver for localization. Each broadcast position of the mobile beacon acts as a stationary beacon at that point (known as a virtual beacon) thereby eliminating the need to deploy GPS equipped beacons in the sensor network. The motion of the mobile beacon localizes some of the sensor nodes, which in turn aid in localization of their neighbors using the iterative In-Range technique. Simulation results are presented to evaluate the performance of the proposed mechanism. An Implementation on sensor network of MICA2 motes is used to evaluate the functionality of the proposed algorithm. © 2006 IEEE.Item Energy efficient load sharing mechanism for multipath routing protocol in wireless sensor networks(2011) Prasanna, K.; Hegde, S.; Shiva, M.G.Many existing energy efficient routing protocols in wireless sensor networks attempt to reduce the energy usage in data routing from source to sink node. Energy efficient routing in wireless sensor network is a paramount requirement to prolong the lifetime of the network. To increase the network lifetime, effective distribution of the traffic from the source node is very much necessary. We would like to propose a novel energy efficient load sharing mechanism in multipath routing for wireless sensor networks. The load sharing mechanism improves the wireless sensor network effectively. © Springer-Verlag 2011.Item Reliability analysis of route redundancy model for energy efficient node disjoint multipath routing in wireless sensor networks(Elsevier Ltd, 2012) Shiva Murthy, G.; D'Souza, R.J.; Varaprasad, G.The objective of every sensor node in a sensor network is to send the sensed data in the phenomena to the sink node. Many routing protocols select an optimal path to increase the network lifetime in sensor networks. The consumption by the nodes along this optimal path is high, thereby causing their early death. In the multipath routing, path reliability is high, because of the availability of alternate paths to the optimal paths. This work proposes a theoretical frame work to study the reliability analysis of route redundancy model for node disjoint multipath networks in wireless sensor networks. The reliability of route redundancy in single path and multiple paths with varied number of nodes and its probability values are discussed. © 2012 Published by Elsevier Ltd.Item Life time enhancement of wireless Sensor Network using fuzzy c-means clustering algorithm(Institute of Electrical and Electronics Engineers Inc., 2014) Kumar, P.; Chaturvedi, A.The major issues in wireless Sensor Networks (WSNs) are efficient uses of limited resources and appropriate routing of network paths under severely constrained energy scenarios. To overcome these issues; k-means and fuzzy c-means algorithms are investigated to form clusters and for subsequent selection of cluster heads. For all these clusters; selection of cluster head is done based on member sensor nodes residual energy status (RES) and estimation of Euclidean distances. Depending upon the Euclidean distance measure between the sink node and center of gravity of clusters; these clusters are classified into five types. Further, RES estimations are presented for cluster heads as well simple sensor network nodes. © 2014 IEEE.Item SGR: Secure geographical routing in Wireless Sensor Networks(Institute of Electrical and Electronics Engineers Inc., 2015) Lata, B.T.; Tejaswi, V.; Shaila, K.; Raghavendra, M.; Venugopal, K.R.; Iyengar, S.S.; Patnaik, L.M.Geographical Routing Technique is a new trend in Wireless Sensor Networks in which the sensor nodes are enabled using Global Positioning Systems(GPS). This helps to easily detect the position of their neighboring nodes. The power consumption is more in the existing routing algorithms, since the nodes build the routing tables and the neighboring node IDs are determined by searching the routing table. In this paper, we have proposed Secure Geographical Routing (SGR) algorithm in which the data traffic and energy consumption is minimized using single copy data transfer. In SGR, initially one copy is transmitted to the next node using greedy approach and another copy is preserved in the sending station. If acknowledgment is not received even after timeout then the second copy is transmitted. This dynamic single copy scheme reduces the data traffic in Wireless Sensor Networks. Security algorithms are incorporated in every sensor node to prevent any malicious node attack that disturb the normal functioning of the network. Simulation result shows that the performance of the proposed algorithm is better in terms of packet delivery probability and energy consumption in comparison with existing algorithms. © 2014 IEEE.Item Data trustworthiness in wireless sensor networks(Institute of Electrical and Electronics Engineers Inc., 2016) Karthik, N.; Ananthanarayana, V.S.Wireless Sensor Networks (WSN) comprises of tiny wireless sensor nodes installed in the terrain for continuous observation of physical or environmental conditions. Finding data trustworthiness is a prime pre-processing action in WSN because of harsh environment producing faulty data and insecure data transfer over WSN. The trustworthy of the data generated from sensor nodes play an important role to make critical decision. In this work, we propose a Data Trust Management Scheme (DTMS) to address the issue by assigning the trust score to data items. The proposed DTMS detects the data fault with the help of temporal and spatial correlations. The provenance data is used to evaluate the trust score of data item by similarity of value and provenance. The data trust score is utilized for making decision. Implementation of the proposed DTMS is done by simulations. Results show that the proposed DTMS detects untrustworthy data and score the data items which are useful for taking critical decisions. © 2016 IEEE.Item Performance measures of fuzzy C-means algorithm in wireless sensor networks(Inderscience Publishers, 2017) Kumar, P.; Chaturvedi, A.The major issues that govern performance of wireless sensor networks (WSNs) are efficient uses of limited resources and appropriate routing decisions of network paths under the severely constrained energy scenario. In this work, to address these issues uses of k-means and fuzzy C-means algorithms are investigated for clusters formation and subsequent selection of cluster heads (CHs). For all these newly formed clusters; selection of cluster head is done based on member sensor nodes residual energy status (RES) followed by estimation of Euclidean distances. Depending upon the Euclidean distance measures between the sink node and the estimated energy-centroid (EC) of clusters these clusters are classified into five types. The RES estimation is exercised for all the CHs and sensor nodes (SNs) of the network. Outcomes of simulation results indicate superior performance of fuzzy-c means algorithm compared to k-means algorithm. Further, a case study is presented, wherein the sink is allowed to have some movements in the service area. Here, different quadrant of service area exhibits different pattern of query spatial distribution. The optimal location of sink is sought to support energy efficient operational aspects of the WSNs. © © 2017 Inderscience Enterprises Ltd.Item Optimal placement of sensor nodes for water quality measurement(IEEE Computer Society, 2017) Arun, D.; Pais, A.R.One among seven in this world dont have the luxory to have safe drinking water. As water is an essential component, ensuring the safety is very important. Providing a feasible method which is reliable and easy to deploy will help in understanding the quality of water which is used. Using wireless sensor nodes for detecting the water quality is a good option for this problem as sensor nodes are considered cheap, robust and easy to deploy. This paper designs an efficient algorithms for the placement of wireless sensor nodes which will do the purpose of water quality monitoring. National Institute of Technology, Surathkal campus has been taken as the case study for analysis. © 2015 IEEEItem Sensor data modeling for data trustworthiness(Institute of Electrical and Electronics Engineers Inc., 2017) Karthik, N.; Vs, A.Wireless sensor networks (WSNs) are installed in the terrain for observing the physical and environmental parameters. The nodes in the network are resource constrained in nature and faces several challenges for producing the data from the unfriendly environment. Large amount of data is generated from WSN and suffers from data fault, inaccuracy and inconsistency. To increase the reliability of application, several data trust management schemes are introduced to ensure the trustworthiness of data in decision making process. Apart from these schemes, in the absence of ground truth, sensor data models are used to find the trustiness of the sensor data. The data generated from the simulation of data model is used as a metric to evaluate the degree of trustiness of sensor data. The existing sensor data models suffer from high energy consumption for data trustiness detection and it becomes inaccurate when the data fault rate is high. In this paper, we are proposing an energy efficient sensor data model for evaluating the sensor data trustworthiness and reconstruct the sensor data in case of any data loss and data fault. The proposed data model is hybrid in nature and it works at low level sensor nodes and also at sink node. Results show that the proposed data model is able to detect the untrustworthy data and gives remedy to untrustworthy and missing data with the help of data reconstruction in an energy efficient way and it is able to identify the events in reliable fashion. © 2017 IEEE.