{"title":"Localized edge detection in sensor fields","authors":"Krishna Chintalapudi, R. Govindan","doi":"10.1109/SNPA.2003.1203357","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203357","url":null,"abstract":"A wireless sensor network that studies relatively widespread phenomena (such as a contaminant flow or a seismic disturbance) may be called upon to provide a description of the boundary of the phenomenon (either a contour or some bounding box). In such cases, it may be necessary for each node to locally determine whether it lies at (or near) the edge of the phenomenon. In this paper, we show that such localized edge detection techniques are non-trivial to design in an arbitrarily deployed sensor network. We define the notion of an edge and develop performance metrics for evaluating localized edge detection algorithms. We propose three different approaches for localized edge detection and present one example scheme for each. In all our approaches, each sensor gathers information from its local neighborhood and determines whether or not it is an edge sensor. We evaluate the performance! of each of the example schemes and compare them with respect to the developed metrics.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal energy-balanced algorithm for selection in a single hop sensor network","authors":"M. Singh, V. Prasanna","doi":"10.1109/SNPA.2003.1203352","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203352","url":null,"abstract":"Sensor networks are being used to implement a large set of applications that require distributed, collaborative computations. Selection is an important kernel in several sensor applications, particularly those involving speech and image data processing. In this paper we present an energy and time optimal algorithm for the selection problem in a single hop wireless network. The algorithm also has the property that it is energy-balanced. This implies that all sensors dissipate asymptotically equal amount of energy. Uniform energy dissipation is desirable as it enables the network to remain fully functional for the maximum time. We demonstrate that in a single hop, single channel network of n randomly distributed sensors, selection can be performed in O(n) time and O(n) energy, with no sensor being awake for more than O(1) time steps. We extend our results for a p-channel network, where p/spl les/n/sup 1-/spl epsi// and 0</spl epsi//spl les/1. We show that selection can be performed in time O(n/p) and energy O(n) with no sensor being awake for more than O(1) time steps.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127325973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure routing in wireless sensor networks: attacks and countermeasures","authors":"Chris Karlof, D. Wagner","doi":"10.1109/SNPA.2003.1203362","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203362","url":null,"abstract":"We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115336936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"RMST: reliable data transport in sensor networks","authors":"Fred Stann, J. Heidemann","doi":"10.1109/SNPA.2003.1203361","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203361","url":null,"abstract":"Reliable data transport in wireless sensor networks is a multifaceted problem influenced by the physical, MAC, network, and transport layers. Because sensor networks are subject to strict resource constraints and are deployed by single organizations, they encourage revisiting traditional layering and are less bound by standardized placement of services such as reliability. This paper presents analysis and experiments resulting in specific recommendations for implementing reliable data transport in sensor nets. To explore reliability at the transport layer, we present RMST (Reliable Multi-Segment Transport), a new transport layer for Directed Diffusion. RMST provides guaranteed delivery and fragmentation/reassembly for applications that require them. RMST is a selective NACK-based protocol that can be configured for in-network caching and repair.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115388911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Data MULEs: modeling a three-tier architecture for sparse sensor networks","authors":"R. Shah, S. Roy, S. Jain, Waylon Brunette","doi":"10.1109/SNPA.2003.1203354","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203354","url":null,"abstract":"This paper presents and analyzes an architecture to collect sensor data in sparse sensor networks. Our approach exploits the presence of mobile entities (called MULEs) present in the environment. MULEs pick up data from the sensors when in close range, buffer it, and drop off the data to wired access points. This can lead to substantial power savings at the sensors as they only have to transmit over a short range. This paper focuses on a simple analytical model for understanding performance as system parameters are scaled. Our model assumes two-dimensional random walk for mobility and incorporates key system variables such as number of MULEs, sensors and access points. The performance metrics observed are the data success rate (the fraction of generated data that reaches the access points) and the required buffer capacities on the sensors and the MULEs. The modeling along with simulation results can be used for further analysis and provide certain guidelines for deployment of such systems.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130896780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Target localization based on energy considerations in distributed sensor networks","authors":"Yi Zou, K. Chakrabarty","doi":"10.1109/SNPA.2003.1203356","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203356","url":null,"abstract":"Wireless distributed sensor networks (DSNs) are important for a number of strategic applications such as coordinated target detection, surveillance, and localization. Energy is a critical resource in wireless sensor networks and system lifetime needs to be prolonged through the use of energy-conscious sensing strategies during system operation. We propose an energy-aware target detection and localization strategy for cluster-based wireless sensor networks. The proposed method is based on an a posteriori algorithm with a two-step communication protocol between the cluster head and the sensors within the cluster. Based on a limited amount of data received from the sensor nodes, the cluster head executes a localization procedure to determine the subset of sensors that must be queried for detailed target information. This approach reduces both energy consumption and communication bandwidth requirements, and prolongs the lifetime of the wireless sensor network. Simulation results show that a large amount of energy is saved during target localization using this strategy.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114829672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Aggregation in sensor networks: an energy-accuracy trade-off","authors":"A. Boulis, S. Ganeriwal, M. Srivastava","doi":"10.1109/SNPA.2003.1203363","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203363","url":null,"abstract":"Wireless ad hoc sensor networks (WASNs) are in need of the study of useful applications that will help the researchers view them as distributed physically coupled systems, a collective that estimates the physical environment, and not just energy-limited ad hoc networks. We develop this perspective using a large and interesting class of WASN applications called aggregation applications. In particular, we consider the challenging periodic aggregation problem where the WASN provides the user with periodic estimates of the environment, as opposed to simpler and previously studied snapshot aggregation problems. In periodic aggregation our approach allows the spatial-temporal correlation among values sensed at the various nodes to be exploited towards energy-efficient estimation of the aggregated value of interest. Our approach also creates a system level energy vs. accuracy knob whereby the more the estimation error that the user can tolerate, the less is the energy consumed. We present a distributed estimation algorithm that can be applied to explore the energy-accuracy subspace for a sub-class of periodic aggregation problems, and present extensive simulation results that validate our approach. The resulting algorithm, apart from being more flexible in the energy-accuracy subspace and more robust, can also bring considerable energy savings for a typical accuracy requirement (five-fold decrease in energy consumption for 5% estimation error) compared to repeated snapshot aggregations.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128827593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}