Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.最新文献

筛选
英文 中文
Energy efficiency based packet size optimization in wireless sensor networks 基于能量效率的无线传感器网络数据包大小优化
Y. Sankarasubramaniam, I. Akyildiz, S. McLaughlin
{"title":"Energy efficiency based packet size optimization in wireless sensor networks","authors":"Y. Sankarasubramaniam, I. Akyildiz, S. McLaughlin","doi":"10.1109/SNPA.2003.1203351","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203351","url":null,"abstract":"This paper addresses the question of optimal packet size for data communication in energy constrained wireless sensor networks. Unlike previous work on packet length optimization in other wired and wireless networks, energy efficiency is chosen as the optimization metric. The use of fixed size packets is proposed in light of the limited resources and management costs in sensor networks. The optimal fixed packet size is then determined for a set of radio and channel parameters by maximizing the energy efficiency metric. Further, the effect of error control on packet size optimization and energy efficiency is examined. While retransmission schemes are found to be energy inefficient, it is shown that forward error correction can improve the energy efficiency eventhough it introduces additional parity bits and encoding/decoding energy consumptions. In this regard, binary BCH codes are found to be 15% more energy efficient than the best performing convolutional codes, which have thus far been considered for error control in sensor networks.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126858747","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}
引用次数: 505
Computing aggregates for monitoring wireless sensor networks 用于监测无线传感器网络的计算聚合
Yonggang Jerry Zhao, R. Govindan, D. Estrin
{"title":"Computing aggregates for monitoring wireless sensor networks","authors":"Yonggang Jerry Zhao, R. Govindan, D. Estrin","doi":"10.1109/SNPA.2003.1203364","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203364","url":null,"abstract":"Wireless sensor networks involve very large numbers of small, low-power, wireless devices. Given their unattended nature, and their potential applications in harsh environments, we need a monitoring infrastructure that indicates system failures and resource depletion. We describe an architecture for sensor network monitoring, then focus on one aspect of this architecture: continuously computing aggregates (sum, average, count) of network properties (loss rates, energy-levels etc., packet counts). Our contributions are two-fold. First, we propose a novel tree construction algorithm that enables energy-efficient computation of some classes of aggregates. Second, we show through actual implementation and experiments that wireless communication artifacts in even relatively benign environments can significantly impact the computation of these aggregate properties. In some cases, without careful attention to detail, the relative error in the computed aggregates can be as much as 50%. However, by carefully discarding links with heavy packet loss and asymmetry, we can improve accuracy by an order of magnitude.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"92 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":"121049115","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}
引用次数: 377
Localized positioning in ad hoc networks 自组织网络中的局部定位
D. Niculescu, B. R. Badrinath
{"title":"Localized positioning in ad hoc networks","authors":"D. Niculescu, B. R. Badrinath","doi":"10.1109/SNPA.2003.1203355","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203355","url":null,"abstract":"Position centric approaches, such as Cartesian routing, geographic routing, and the recently proposed trajectory based forwarding (TBF), address scalability issues in large ad hoc networks by using Euclidean space as a complementary name space. These approaches require. that nodes know their position in a common coordinate system. While a GPS receiver in each node would be ideal, in many cases an approximation algorithm is necessary for networks with only a few GPS enabled nodes. These algorithms however require collaboration of large portions of the network, thus imposing an overhead for nodes which do not need positioning, or are mobile. We propose Local Positioning System (LPS), a method that makes use of local node capabilities-angle of arrival, range estimations, compasses and accelerometers, in order to internally position only the groups of nodes involved in particular conversations. Localized positioning enables position centric uses, like discovery, flooding and routing in networks where global positioning is not available.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"1 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":"116280255","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}
引用次数: 151
Data funneling: routing with aggregation and compression for wireless sensor networks 数据漏斗:无线传感器网络的聚合和压缩路由
D. Petrovi, Rahul C. Shah, K. Ramchandran, Jan M. Rabaey
{"title":"Data funneling: routing with aggregation and compression for wireless sensor networks","authors":"D. Petrovi, Rahul C. Shah, K. Ramchandran, Jan M. Rabaey","doi":"10.1109/SNPA.2003.1203366","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203366","url":null,"abstract":"This paper considers the problem of minimizing the amount of communication needed to send readings from a set of sensors to a single destination in energy constrained wireless networks. Substantial gains can be obtained using packet aggregation techniques while routing. The proposed routing algorithm, called Data Funneling, allows the network to considerably reduce the amount of energy spent on communication setup and control, an important concern in low data-rate communication. This is achieved by sending only one data stream from a group of sensors to the destination instead of having an individual data stream from each sensor to the destination. Doing so also reduces the probability of packet collisions in the wireless medium because the same amount of information can be transmitted by having fewer nodes send longer packets. Additional gains can be realized by efficient compression of data. This is achieved by losslessly compressing the data by encoding information in the ordering of the sensors' packets. This \"coding by ordering\" scheme compresses data by suppressing certain readings and encoding their values in the ordering of the remaining packets. Using these techniques together can more than halve the energy spent in communication.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"15 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":"121311769","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}
引用次数: 283
DIFS: a distributed index for features in sensor networks DIFS:传感器网络特征的分布式索引
Ben Greenstein, S. Ratnasamy, S. Shenker, Ramesh Govindan, Deborah Estrin
{"title":"DIFS: a distributed index for features in sensor networks","authors":"Ben Greenstein, S. Ratnasamy, S. Shenker, Ramesh Govindan, Deborah Estrin","doi":"10.1109/SNPA.2003.1203367","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203367","url":null,"abstract":"Sensor networks pose new challenges in the collection and distribution of data. Much attention has been focused on standing queries that use in-network aggregation of time series data to return data statistics in a communication-efficient manner. In this work, rather than consider searches over time series data, we consider searches over semantically rich high-level events, and present the design, analysis, and numerical simulations of a spatially distributed index that provides for efficient index construction and range searches. The scheme provides load balanced communication over index nodes by using the governing property that the wider the spatial extent known to an index node, the more constrained is the value range covered by that node.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"189 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":"116334810","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}
引用次数: 265
A protocol for tracking mobile targets using sensor networks 一种使用传感器网络跟踪移动目标的协议
H. Yang, Biplab Sikdar
{"title":"A protocol for tracking mobile targets using sensor networks","authors":"H. Yang, Biplab Sikdar","doi":"10.1109/SNPA.2003.1203358","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203358","url":null,"abstract":"With recent advances in device fabrication technology, economical deployment of large scale sensor networks, capable of pervasive monitoring and control of physical systems have become possible. Scalability, low overhead anti distributed functionality are some of the key requirements for any protocol designed for such large scale sensor networks. In this paper, we present a protocol, Distributed Predictive Tracking, for one of the most likely applications for sensor networks: tracking moving targets. The protocol uses a clustering based approach for scalability and a prediction based tracking mechanism to provide a distributed and energy efficient solution. The protocol is robust against node or prediction failures which may result in temporary loss of the target and recovers from such scenarios quickly and with very little additional energy use. Using simulations we show that the proposed architecture is able to accurately track targets with random movement patterns with accuracy over a wide range of target speeds.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"81 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":"116762346","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}
引用次数: 379
The ACQUIRE mechanism for efficient querying in sensor networks 传感器网络中高效查询的ACQUIRE机制
Narayanan Sadagopan, B. Krishnamachari, A. Helmy
{"title":"The ACQUIRE mechanism for efficient querying in sensor networks","authors":"Narayanan Sadagopan, B. Krishnamachari, A. Helmy","doi":"10.1109/SNPA.2003.1203365","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203365","url":null,"abstract":"We propose a novel and efficient mechanism for obtaining information in sensor networks which we refer to as ACQUIRE. In ACQUIRE an active query is forwarded through the network, and intermediate nodes use cached local information (within a look-ahead of d hops) in order to partially resolve the query. When the query is fully resolved, a completed response is sent directly back to the querying node. We take a mathematical modelling approach in this paper to calculate the energy costs associated with ACQUIRE. The models permit us to characterize analytically the impact of critical parameters, and compare the performance of ACQUIRE with respect to alternatives such as flooding-based querying (FBQ) and expanding ring search (ERS). We show that with optimal parameter settings, depending on the update frequency, ACQUIRE obtains order of magnitude reduction over FBQ and potentially over 60% reduction over ERS in consumed energy.","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":"129640679","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}
引用次数: 326
Providing application QoS through intelligent sensor management 通过智能传感器管理提供应用服务质量
M. Perillo, W. Heinzelman
{"title":"Providing application QoS through intelligent sensor management","authors":"M. Perillo, W. Heinzelman","doi":"10.1109/SNPA.2003.1203360","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203360","url":null,"abstract":"Wireless sensor networks are uniquely characterized by tight energy and bandwidth constraints. These networks should be designed to provide enough data to their application so that a reliable description of the environment can be derived, while operating as energy-efficiently as possible and at the same time meeting bandwidth constraints. These goals are typically contradicting and must be balanced at the point where the application is best satisfied. In this paper, we address the problem of maximizing lifetime for a wireless sensor network while meeting a minimum level of reliability. This maximization is achieved by jointly scheduling active sensor sets and finding paths for data routing. Simulation results show that network lifetime can be significantly increased through such methods.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"5 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":"120971204","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}
引用次数: 69
Multi-resolution state retrieval in sensor networks 传感器网络中的多分辨率状态检索
Budhaditya Deb, S. Bhatnagar, B. Nath
{"title":"Multi-resolution state retrieval in sensor networks","authors":"Budhaditya Deb, S. Bhatnagar, B. Nath","doi":"10.1109/SNPA.2003.1203353","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203353","url":null,"abstract":"Large-scale dense sensor networks require mechanisms to extract topology information that can be used for various aspects of sensor network management. It is critical for any topology discovery algorithm in dense networks not only to adhere to the resource constraints of bandwidth and energy but also to provide several views of the network. Due to factors of density, redundancy and failures it may not be possible or practical to get a complete view of the topology. We describe a distributed parameterized algorithm for Sensor Topology Retrieval at Multiple Resolutions (STREAM), which makes a tradeoff between topology details and resources expended. The algorithm retrieves network state at multiple resolutions at a proportionate communication cost. We also define various classes of topology queries and show how the parameters in the algorithm can be used to support queries specific to sensor networks. We show that topology determined at different resolutions is sufficient for approximating different network properties. We also show that STREAM can be used for general-purpose multi-resolution information retrieval in sensor networks.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"47 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":"126836682","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}
引用次数: 66
Reliable upgrade of group communication software in sensor networks 传感器网络中群通信软件的可靠升级
P. V. Krishnan, L. Sha, K. Mechitov
{"title":"Reliable upgrade of group communication software in sensor networks","authors":"P. V. Krishnan, L. Sha, K. Mechitov","doi":"10.1109/SNPA.2003.1203359","DOIUrl":"https://doi.org/10.1109/SNPA.2003.1203359","url":null,"abstract":"Communication is critical between nodes in wireless sensor networks. Upgrades to their communication software need to be done reliably because residual software errors in the new module can cause complete system failure. We present a software architecture, called cSimplex, which can reliably upgrade multicast-based group communication software in sensor networks. Errors in the new module are detected using statistical checks and a stability definition that we propose. Error recovery is done by switching to a well-tested, reliable safety module without any interruption in the functioning of the system. cSimplex has been implemented and demonstrated in a network of acoustic sensors with mobile robots functioning as base stations. Experimental results show that faults in the upgraded software can be detected with an accuracy of 99.71% on average. The architecture, which can be easily extended to other reliable upgrade problems, will facilitate a paradigm shift in system evolution from static design and extensive testing to reliable upgrades of critical communication components in networked systems, thus also enabling substantial savings in testing time and resources.","PeriodicalId":329641,"journal":{"name":"Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.","volume":"23 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":"133624475","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信