2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)最新文献_第7页

Query aggregation for providing efficient data services in sensor networks 查询聚合为传感器网络提供高效的数据服务

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392067

Wei Yu, Thang Nam Le, D. Xuan, Wei Zhao

{"title":"Query aggregation for providing efficient data services in sensor networks","authors":"Wei Yu, Thang Nam Le, D. Xuan, Wei Zhao","doi":"10.1109/MAHSS.2004.1392067","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392067","url":null,"abstract":"Providing efficient data services is one of the fundamental requirements for wireless sensor networks. The data service paradigm requires that the application submit its requests as queries and the sensor network transmits the requested data to the application. While most existing work in this area focuses on data aggregation, not much attention has been paid to query aggregation. For many applications, especially ones with high query rates, query aggregation is very important. We study a query aggregation-based approach for providing efficient data services. In particular: (1) we propose a multi-layered overlay-based framework consisting of a query manager and access points (nodes), where the former provides the query aggregation plan and the latter executes the plan; (2) we design an effective query aggregation algorithm to reduce the number of duplicate/overlapping queries and save overall energy consumption in the sensor network Our performance evaluations show that by applying our query aggregation algorithm, the overall energy consumption can be significantly reduced and the sensor network lifetime can be prolonged correspondingly.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125575714","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}

引用次数: 36

RACE: time series compression with rate adaptivity and error bound for sensor networks RACE:具有速率自适应和误差界的传感器网络时间序列压缩

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392089

Huamin Chen, J. Li, P. Mohapatra

{"title":"RACE: time series compression with rate adaptivity and error bound for sensor networks","authors":"Huamin Chen, J. Li, P. Mohapatra","doi":"10.1109/MAHSS.2004.1392089","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392089","url":null,"abstract":"Sensor networks usually have limited energy and transmission capacity. It is beneficial to reduce the data volume for dissemination in a sensor network that monitors continuous physical processes in order to reduce energy consumption. Data compression schemes in use should be able to adapt to limited bandwidth while preserving high data quality. We propose a wavelet-based, error aware compression algorithm that is targeted to achieving these goals. It is called RACE (rate adaptive compression with error bound). It can adjust its maximum normalized error to current network capacity. Additionally, errors due to multiple passes of compression during multi-hop relaying are additive and thus can be estimated easily upon data reconstruction. Moreover, during data dissemination, error ranges can be narrowed through an opportunistic patching process when excess bit rate is available. Consequently, the performance is less subject to the volatility of physical processes. The algorithm has been evaluated in various aspects and demonstrated to be effective in rate adaptivity, error range narrowing, and preservation of statistical interpretation.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121373428","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}

引用次数: 46

Trade-off between coverage and data reporting latency for energy-conserving data gathering in wireless sensor networks 无线传感器网络中节能数据采集覆盖与数据报告延迟的权衡

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392191

Wook Choi, Sajal K. Das

{"title":"Trade-off between coverage and data reporting latency for energy-conserving data gathering in wireless sensor networks","authors":"Wook Choi, Sajal K. Das","doi":"10.1109/MAHSS.2004.1392191","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392191","url":null,"abstract":"We propose a novel energy-conserving data gathering strategy for wireless sensor networks. The proposed strategy is based on a trade-off between coverage and data reporting latency with an ultimate goal of maximizing the network's lifetime. The basic idea is to select in each round only a minimum of k sensors as data reporters which are sufficient for a desired sensing coverage given by the users or applications. Such a selection of the minimum data reporters also reduces the amount of traffic flow to the data gathering point in each round, and thus avoids network congestion as well as channel interference/contention. The proposed strategy includes three schemes for the minimum k-sensor selection. Using these schemes, we evaluate such fundamental issues as event detection integrity and data reporting latency, which can be critical in deploying the proposed data gathering strategy. Simulation results demonstrate that the average data reporting latency is hardly affected and the real-time event detection ratio is greater than 80% when the desired sensing coverage is at least 80%. It is also shown that the sensors can conserve a significant amount of energy with a small trade-off, and that the higher the network density, the higher is the energy conservation rate without any additional computation cost.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129187916","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}

引用次数: 27

Efficient and practical query scoping in sensor networks 传感器网络中高效实用的查询范围

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392209

H. Dubois-Ferrière, D. Estrin, T. Stathopoulos

引用次数: 70

A mix route algorithm for mix-net in wireless mobile ad hoc networks 无线移动自组网中混合网的混合路由算法

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392180

Shu Jiang, N. Vaidya

引用次数: 21

Utility-based routing in wireless ad hoc networks 无线自组织网络中基于实用程序的路由

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392217

Chi Zhou, D. Qian, H. Lee

{"title":"Utility-based routing in wireless ad hoc networks","authors":"Chi Zhou, D. Qian, H. Lee","doi":"10.1109/MAHSS.2004.1392217","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392217","url":null,"abstract":"This work presents a novel utility-based routing (UBR) algorithm for wireless ad hoc networks. In multi-hop ad hoc networks, each node may be responsible for forwarding data packets for others. Thus, some nodes may consume more energy than others, and consequently die earlier This leads to unbalanced usage of the power among the nodes, network partition, and the decrease in network lifetime. The UBR algorithm we develop takes into account not only the status of each intermediate node but also the characteristic of applications. Specifically, each application is assumed to be associated with a utility function, which maps to the quality of service (QoS). Each intermediate node sets a price to signal its willingness to participate, and then the cost for involving this intermediate node is calculated as price times the transmit power. Instead of choosing the shortest routing path, the destination node picks up the routing path that gives the maximum surplus defined as utility minus cost. Our performance study based on the PARSEC simulator shows that the proposed utility based algorithm improves the energy balance when compared with the original DSR.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132701407","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}

引用次数: 8

Proxy-based sensor deployment for mobile sensor networks 移动传感器网络中基于代理的传感器部署

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392190

Guiling Wang, G. Cao, T. L. Porta

{"title":"Proxy-based sensor deployment for mobile sensor networks","authors":"Guiling Wang, G. Cao, T. L. Porta","doi":"10.1109/MAHSS.2004.1392190","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392190","url":null,"abstract":"To provide satisfactory coverage is very important in many sensor network applications such as military surveillance. In order to obtain the required coverage in harsh environments, mobile sensors are helpful since they can move to cover the area not reachable by static sensors. Previous work on mobile sensor deployment is based on a round by round process, where sensors move iteratively until the maximum coverage is reached. Although these solutions can deploy mobile sensors in a distributed way, the mobile sensors may move in a zig-zag way and waste a lot of energy compared to moving directly to the final location. To address this problem, we propose a proxy-based sensor deployment protocol. Instead of moving iteratively, sensors calculate their target locations based on a distributed iterative algorithm, move logically, and exchange new logical locations with their new logical neighbors. Actual movement only occurs when sensors determine their final locations. Simulation results show that the proposed protocol can significantly reduce the energy consumption compared to previous work, while maintaining similar coverage.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116145174","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}

引用次数: 130

Sensor localization with Ring Overlapping based on Comparison of Received Signal Strength Indicator 基于接收信号强度指标比较的环形重叠传感器定位

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392193

Chong Liu, Kui Wu, T. He

引用次数: 233

Scribble: an efficient reliable manycast protocol for ad-hoc networks Scribble:一个高效可靠的多播协议，用于自组织网络

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392208

E. Vollset, P. Ezhilchelvan

{"title":"Scribble: an efficient reliable manycast protocol for ad-hoc networks","authors":"E. Vollset, P. Ezhilchelvan","doi":"10.1109/MAHSS.2004.1392208","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392208","url":null,"abstract":"The problem of efficient message delivery to multiple nodes has been widely studied for ad-hoc networks, be it sensor or mobile ad-hoc networks (MANETs). We are concerned with deterministic delivery guarantees, i.e. the delivery ratio for any given message is guaranteed not to fall below a threshold specified for that message. This threshold can be considered to take the special case value of 100% when message delivery is guaranteed to all nodes. Guaranteeing delivery to all in a group, however desirable, often involves making a simplifying assumption that no destination node leaves the group nor crashes during an execution of the protocol. However, the nodes that make up an ad-hoc network are prone to failures and are likely to leave the group, something which undermines the validity of the assumption. We outline a protocol, called Scribble, which permits the minimum threshold to be less than 100%, thus allowing a few nodes to depart or crash during the execution. More precisely, it provides what we call k-deterministic delivery guarantees, where delivery is guaranteed to at least k destination nodes. The value of k is chosen by the application is required to be a realistic value. Such a service is called manycast.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123632018","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

Improving interactive video in ad-hoc networks using path diversity 利用路径分集改进ad-hoc网络中的交互式视频

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI: 10.1109/MAHSS.2004.1392176

A. A. E. Al, T. Saadawi, Myung J. Lee

引用次数: 9