IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.最新文献

Mobile agent middleware for sensor networks: an application case study 传感器网络的移动代理中间件:一个应用案例研究

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440953

Chien-Liang Fok, G. Roman, Chenyang Lu

{"title":"Mobile agent middleware for sensor networks: an application case study","authors":"Chien-Liang Fok, G. Roman, Chenyang Lu","doi":"10.1109/IPSN.2005.1440953","DOIUrl":"https://doi.org/10.1109/IPSN.2005.1440953","url":null,"abstract":"Agilla is a mobile agent middleware that facilitates the rapid deployment of adaptive applications in wireless sensor networks (WSNs). Agilla allows users to create and inject special programs called mobile agents that coordinate through local tuple spaces, and migrate across the WSN performing application-specific tasks. This fluidity of code and state has the potential to transform a WSN into a shared, general-purpose computing platform capable of running several autonomous applications at a time, allowing us to harness its full potential. We have implemented and evaluated a fire tracking application to determine how well Agilla achieves its goals. Fire is modeled by agents that gradually spread throughout the network, engulfing nodes by inserting fire tuples into their local tuple spaces. Fire tracker agents are then used to form a perimeter around the fire. Using Agilla, we were able to rapidly create and deploy 47 byte fire agents, and 100 byte tracker agents on a WSN consisting of 26 MICA2 motes. Our experiments show that the tracker agents can form an 8-node perimeter around a burning node within 6.5 seconds and that it can adapt to a fire spreading at a rate of 7 seconds per hop. We also present the lessons learned about the adequacy of Agilla's primitives, and regarding the efficiency, reliability, and adaptivity of mobile agents in a WSN.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116960436","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}

引用次数: 277

Fading observation alignment via feedback 通过反馈的衰落观测对准

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440941

A. Sarwate, M. Gastpar

{"title":"Fading observation alignment via feedback","authors":"A. Sarwate, M. Gastpar","doi":"10.1109/IPSN.2005.1440941","DOIUrl":"https://doi.org/10.1109/IPSN.2005.1440941","url":null,"abstract":"In some remote sensing applications, the functional relationship between the source being observed and the sensor readings may not be known. Because of communication constraints, this uncertainty may result in poor end-to-end distortion. If the sensors have some knowledge of their joint statistics, they may be able to communicate collaboratively to combat the channel noise. A model is proposed for capturing some of the uncertainty in the observation process, called a fading observation model. An example with fading observations is analysed. For M sensors with no fading there exists a scheme for which the achievable distortion scales with M as M/sup -1/, but with fading the distortion does not scale with M. In this paper, a one-bit feedback scheme is presented that provides enough information about the joint statistics to achieve scaling rates like M/sup -1/3/. Additional feedback improves the achievable scaling rate. For comparison, a scheme based on separate source and channel coding at best gives a distortion scaling behaviour of (log M)/sup -1/. Some extensions to multiple sources and observation models with unknown delay are discussed.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125184460","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}

引用次数: 10

A scheme for robust distributed sensor fusion based on average consensus 一种基于平均一致性的鲁棒分布式传感器融合方案

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440896

Lin Xiao, Stephen P. Boyd, S. Lall

引用次数: 1415

Lazy inference on object identities in wireless sensor networks 无线传感器网络中目标身份的延迟推理

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440922

Jae-Hyuck Shin, Nelson Lee, S. Thrun, L. Guibas

{"title":"Lazy inference on object identities in wireless sensor networks","authors":"Jae-Hyuck Shin, Nelson Lee, S. Thrun, L. Guibas","doi":"10.1109/IPSN.2005.1440922","DOIUrl":"https://doi.org/10.1109/IPSN.2005.1440922","url":null,"abstract":"Maintaining the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic combinatorial difficulty of the data association problem, suggests probabilistic formulations over the set of possible identities. While an explicit representation of a distribution over all associations may require exponential storage and computation, in practice the information provided by this distribution is accessed only in certain stylized ways, as when asking for the identity of a given track, or the track with a given identity. Exploiting this observation, we proposed a practical solution to this problem based on maintaining marginal probabilities and demonstrated its effectiveness in the context of tracking within a wireless sensor network. That method, unfortunately, requires extensive communication in the network whenever new identity observations are made, in order for normalization operations to keep the marginals consistent. In this paper, we have proposed a very different solution based on accumulated log-likelihoods that can postpone all normalization computations until actual identity queries are made. In this manner the continuous communication and computational expense of repeated normalizations is avoided and that effort is expended only when actual queries are made of the network. We compare the two methods in terms of their computational complexities, inference accuracies, and distributed implementations. Simulation and experimental results from a RFID system are also presented.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130554697","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}

引用次数: 26

Multiple simultaneous acoustic source localization in urban terrain 城市地形多声源同步定位

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440982

Á. Lédeczi, P. Völgyesi, M. Maróti, G. Simon, Gyorgy Balogh, András Nádas, B. Kusy, Sebestyen Dóra

引用次数: 58

The particle computer system 粒子计算机系统

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.5555/1147685.1147761

C. Decker, A. Krohn, M. Beigl, T. Zimmer

{"title":"The particle computer system","authors":"C. Decker, A. Krohn, M. Beigl, T. Zimmer","doi":"10.5555/1147685.1147761","DOIUrl":"https://doi.org/10.5555/1147685.1147761","url":null,"abstract":"This paper presents a sensor-based, networked embedded system, referred to as the particle computer system. It is comprised of tiny wireless sensor nodes, capable of communication with each other, as well as connectivity with backend, PC-based systems, thereby facilitating software development and data analysis in an integrated systems package. The core design principles of the sensor nodes enable operation in very mobile settings and truly ad-hoc, peer-to-peer interoperation without the intervention of a master or explicit middleware layer. The two main system properties highlighted in this paper are: 1) information distribution to all components within the system and 2) the usage of a common communication language in all system components. This language has been proprietarily developed for the particle system and is known as ConCom. As a result of these system properties, we have found the particle system to be very extensible and applicable in many everyday scenarios. The paper presents insights to the implementation of the particle computer system, including software development and data analysis capabilities, and the overall system integration.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877841","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}

引用次数: 76

Building up to macroprogramming: an intermediate language for sensor networks 构建宏编程:用于传感器网络的中间语言

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440891

Ryan Newton, Arvind, M. Welsh

引用次数: 82

Design considerations for solar energy harvesting wireless embedded systems 太阳能收集无线嵌入式系统的设计注意事项

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440973

V. Raghunathan, A. Kansal, Jason Hsu, J. Friedman, M. Srivastava

{"title":"Design considerations for solar energy harvesting wireless embedded systems","authors":"V. Raghunathan, A. Kansal, Jason Hsu, J. Friedman, M. Srivastava","doi":"10.1109/IPSN.2005.1440973","DOIUrl":"https://doi.org/10.1109/IPSN.2005.1440973","url":null,"abstract":"Sustainable operation of battery powered wireless embedded systems (such as sensor nodes) is a key challenge, and considerable research effort has been devoted to energy optimization of such systems. Environmental energy harvesting, in particular solar based, has emerged as a viable technique to supplement battery supplies. However, designing an efficient solar harvesting system to realize the potential benefits of energy harvesting requires an in-depth understanding of several factors. For example, solar energy supply is highly time varying and may not always be sufficient to power the embedded system. Harvesting components, such as solar panels, and energy storage elements, such as batteries or ultracapacitors, have different voltage-current characteristics, which must be matched to each other as well as the energy requirements of the system to maximize harvesting efficiency. Further, battery non-idealities, such as self-discharge and round trip efficiency, directly affect energy usage and storage decisions. The ability of the system to modulate its power consumption by selectively deactivating its sub-components also impacts the overall power management architecture. This paper describes key issues and tradeoffs which arise in the design of solar energy harvesting, wireless embedded systems and presents the design, implementation, and performance evaluation of Heliomote, our prototype that addresses several of these issues. Experimental results demonstrate that Heliomote, which behaves as a plug-in to the Berkeley/Crossbow motes and autonomously manages energy harvesting and storage, enables near-perpetual, harvesting aware operation of the sensor node.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129524164","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}

引用次数: 1109

Robust statistical methods for securing wireless localization in sensor networks 传感器网络无线定位的鲁棒统计方法

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440903

Zang Li, W. Trappe, Yanyong Zhang, B. Nath

{"title":"Robust statistical methods for securing wireless localization in sensor networks","authors":"Zang Li, W. Trappe, Yanyong Zhang, B. Nath","doi":"10.1109/IPSN.2005.1440903","DOIUrl":"https://doi.org/10.1109/IPSN.2005.1440903","url":null,"abstract":"Many sensor applications are being developed that require the location of wireless devices, and localization schemes have been developed to meet this need. However, as location-based services become more prevalent, the localization infrastructure will become the target of malicious attacks. These attacks will not be conventional security threats, but rather threats that adversely affect the ability of localization schemes to provide trustworthy location information. This paper identifies a list of attacks that are unique to localization algorithms. Since these attacks are diverse in nature, and there may be many unforeseen attacks that can bypass traditional security countermeasures, it is desirable to alter the underlying localization algorithms to be robust to intentionally corrupted measurements. In this paper, we develop robust statistical methods to make localization attack-tolerant. We examine two broad classes of localization: triangulation and RF-based fingerprinting methods. For triangulation-based localization, we propose an adaptive least squares and least median squares position estimator that has the computational advantages of least squares in the absence of attacks and is capable of switching to a robust mode when being attacked. We introduce robustness to fingerprinting localization through the use of a median-based distance metric. Finally, we evaluate our robust localization schemes under different threat conditions.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126444389","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}

引用次数: 515

Efficient routing with small buffers in dense networks 在密集网络中使用小缓冲区的高效路由

IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. Pub Date : 2005-04-24 DOI: 10.1109/IPSN.2005.1440936

G. Barrenetxea, B. Beferull-Lozano, M. Vetterli

{"title":"Efficient routing with small buffers in dense networks","authors":"G. Barrenetxea, B. Beferull-Lozano, M. Vetterli","doi":"10.1109/IPSN.2005.1440936","DOIUrl":"https://doi.org/10.1109/IPSN.2005.1440936","url":null,"abstract":"The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson's theorem that give more insight into the effect of routing algorithms on the queue size distributions. Using the proposed approximation models, we analyze and design routing algorithms that minimize overflow losses in grid networks with finite buffers and different communication patterns, namely uniform communication and data gathering. We show that the buffer size required to achieve the maximum possible rate decreases as the network size increases. Motivated by the insight gained in grid networks, we apply the same principles to the design of routing algorithms for random networks with finite buffers that minimize overflow losses. We show that this requires adequately combining shortest path tree routing and traveling salesman routing. Our results show that such specially designed routing algorithms increase the transmitted rate for a given loss probability up to almost three times, on average, with respect to the usual shortest path tree routing.","PeriodicalId":174256,"journal":{"name":"IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131607351","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}

引用次数: 12