{"title":"Copyright page","authors":"","doi":"10.23919/acc.2004.1383913","DOIUrl":"https://doi.org/10.23919/acc.2004.1383913","url":null,"abstract":"ing is permitted with credit to the source. Libraries are permitted to photocopy beyond the limit of U.S. copyright law for private use of patrons those articles in this volume that carry a code at the bottom of the first page, provided the per-copy fee indicated in the code is paid through","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124149740","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":"Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization","authors":"Stefan Unterschütz, V. Turau","doi":"10.1109/DCOSS.2011.5982201","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982201","url":null,"abstract":"Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly due to the resource-restricted nature of wireless devices, such as sensor nodes, and the error-prone character of the communication medium. This work introduces and evaluates a new local, probabilistic self-stabilizing algorithm providing fault-tolerance and scalability for networks of high density.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238710","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":"Work in progress: Energy saving through cooperation in wireless personal networks","authors":"Alberto Nascimento, Jonathan Rodriguez","doi":"10.1109/DCOSS.2011.5982196","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982196","url":null,"abstract":"Recent years have witnessed an explosive growth of wireless technologies and applications. Without disruptive new approaches for energy saving, 4G mobile users will relentlessly be searching for power outlets rather than network access, and become once again bound to a single location. In this paper, we explore the cooperation among nodes in a cluster for the main goal of saving the battery power of mobile terminals. This paper studies the possibility of decreasing energy consumption through relaying data from all nodes in a cluster through the cluster head. A game theoretic framework is considered based on the classical duopoly model of Cournot. This is a trading model in which the relay behaves as the seller and the sources as buyers. Whenever the relay delineates a possibility for revenue, a portion of its resource space is reserved for cooperation for some price, which takes into consideration the degradation in terms of quality of service and the energy consumed from its own battery in forwarding packets on behalf of sources nodes in the cluster. Results demonstrate the gains in energy saving.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116613905","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}
Konstantin Avrachenkov, Mahmoud El Chamie, G. Neglia
{"title":"A local average consensus algorithm for wireless sensor networks","authors":"Konstantin Avrachenkov, Mahmoud El Chamie, G. Neglia","doi":"10.1109/DCOSS.2011.5982199","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982199","url":null,"abstract":"In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In this case each sensor maintains a local estimate of the global average, and keeps improving it by performing a weighted sum of the estimates of all its neighbors. The number of iterations needed to reach an accurate estimate depends on the weights used at each sensor. Speeding up the convergence rate is important also to reduce the number of messages exchanged among neighbors and then the energetic cost of these algorithms. While it is possible in principle to calculate the optimal weights, the known algorithm requires a single sensor to discover the topology of the whole network and perform the calculations. This may be unfeasible for large and dynamic sensor networks, because of sensor computational constraints and of the communication overhead due to the need to acquire the new topology after each change. In this paper we propose a new average consensus algorithm, where each sensor selects its own weights on the basis of some local information about its neighborhood. Our algorithm is tailored for networks having cluster structure, like it is common for wireless sensor networks. In realistic sensor network topologies, the algorithm shows faster convergence than other existing consensus protocols.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128639155","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":"Invited talk: Models and methods for maintaining connectivity in sensor networks","authors":"S. Nikoletseas","doi":"10.1109/DCOSS.2011.5982214","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982214","url":null,"abstract":"In this talk we first present models for deployment and interactions of wireless sensor nodes and explore their properties (such as connectivity and wireless access). Then we focus on two methods for maintaining network connectivity. The first one uses energy balance (i.e., guaranteeing the same per node energy dissipation in the network towards avoiding its early disconnection due to energy depletion of bottleneck regions). The second method suggests an incremental deployment of (potentially heterogeneous) sensor nodes. Both methods incur significant gains and satisfactory trade-offs to several performance metrics.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850104","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":"STARS: Static relays for multi-robot real-time search and monitoring","authors":"Yuanteng Pei, M. Mutka","doi":"10.1109/DCOSS.2011.5982137","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982137","url":null,"abstract":"We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a near-optimal heuristic to PC2TSP to generate tours by clustering points, generating optimal single-traveler tours, and tour pruning and balance. Second, we show an application of PC2TSP and how our solution to PC2TSP can be applied to the application. By modeling in part by PC2TSP, we solve the problem of minimum time two-robot real-time search with relay deployment. We call the solution STAtic Relay aided Search (STARS), which identifies visiting positions by set cover and Steiner connected dominating set; assigns the precedence constraint by breadth-first search; and finally generates tours by PC2TSP. STARS substantially reduces cost compared to a homogeneous mobile robot system and enables constant monitoring of suspicious areas. STARS and our solution to PC2TSP are extensible to deal with more than two travelers. Extensive simulations with both narrow and wide regions show that our solution to PC2TSP achieves near-optimal performance with less than 2% average difference from optimal.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128049054","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}
Wolf-Bastian Pöttner, L. Wolf, J. Cecílio, P. Furtado, Ricardo M. Silva, J. Silva, Amâncio Santos, P. Gil, A. Cardoso, Z. Zinonos, Ó. JoseManueldo, B. McCarthy, James Brown, U. Roedig, Tony O'Donovan, C. Sreenan, Zhitao He, T. Voigt, Anja Jugel
{"title":"WSN evaluation in industrial environments first results and lessons learned","authors":"Wolf-Bastian Pöttner, L. Wolf, J. Cecílio, P. Furtado, Ricardo M. Silva, J. Silva, Amâncio Santos, P. Gil, A. Cardoso, Z. Zinonos, Ó. JoseManueldo, B. McCarthy, James Brown, U. Roedig, Tony O'Donovan, C. Sreenan, Zhitao He, T. Voigt, Anja Jugel","doi":"10.1109/DCOSS.2011.5982178","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982178","url":null,"abstract":"The GINSENG project develops performance-controlled wireless sensor networks that can be used for time-critical applications in hostile environments such as industrial plant automation and control. GINSENG aims at integrating wireless sensor networks with existing enterprise resource management solutions using a middleware. A cornerstone is the evaluation in a challenging industrial environment — an oil refinery in Portugal. In this paper we first present our testbed. Then we introduce our solution to access, debug and flash the sensor nodes remotely from an operations room in the plant or from any location with internet access. We further present our experimental methodology and show some exemplary results from the refinery testbed.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134450585","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":"On experimentally evaluating the impact of security on IEEE 802.15.4 networks","authors":"Roberta Daidone, G. Dini, Marco Tiloca","doi":"10.1109/DCOSS.2011.5982223","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982223","url":null,"abstract":"IEEE 802.15.4 addresses low-rate wireless personal area networks, enables low power devices, and includes a number of security provisions and options (the security sublayer). Security competes with performance for the scarce resources of low power, low cost sensor devices. So, a proper design of efficient and secure applications requires to know the impact that IEEE 802.15.4 security services have on the protocol performance. In this paper we present the preliminary results of a research activity aimed at quantitatively evaluating such impact from different standpoints including memory consumption, network performance, and energy consumption. The evaluation exploits a free implementation of the IEEE 802.15.4 security sublayer.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133794862","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":"Configuration and data processing over a heterogeneous wireless sensor networks","authors":"J. Cecílio, P. Furtado","doi":"10.1109/DCOSS.2011.5982221","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982221","url":null,"abstract":"Whereas software adaptation has been identified as an effective approach for addressing context-aware applications, the existing work on WSNs fails to support context-awareness and mostly focuses on developing techniques to reprogram the whole sensor node rather than reconfiguring a particular portion of the sensor application software. Therefore, enabling adaptively in the higher layers of the network architecture such as the middleware and application layers, beside the consideration in the lower layers, becomes of high importance. In this paper we propose an approach to hide heterogeneity and offer a single common configuration and processing component for all nodes of that heterogeneous system. This advances the current state-of-the-art, by providing a lego-like model whereby a single simple but powerful component is deployed in any node regardless of its underlying differences and the system is able to remotely configure and process data in any node in a most flexible way, since every node has the same uniform API, processing and access functionalities.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125727142","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}
Marco Zúñiga, Izabela Irzynska, Jan-Hinrich Hauer, T. Voigt, C. Boano, K. Römer
{"title":"Link quality ranking: Getting the best out of unreliable links","authors":"Marco Zúñiga, Izabela Irzynska, Jan-Hinrich Hauer, T. Voigt, C. Boano, K. Römer","doi":"10.1109/DCOSS.2011.5982169","DOIUrl":"https://doi.org/10.1109/DCOSS.2011.5982169","url":null,"abstract":"Link quality estimation has been an active area of research within the wireless sensor network community. It is now well known that the estimation of reliable links requires few sample packets — less than 10, while the estimation of unreliable links require many more — above 50. In scenarios where unreliable links are ubiquitous, and a rapid transfer of data is needed, traditional estimation techniques are not a viable option. In such scenarios, it is instead sufficient to identify the best link available at any given time. Within this context, we propose Link Quality Ranking (LQR), a mechanism that identifies the best link available when only unreliable links are present. Our testbed results indicate that with one sample packet, the delivery rate of LQR — with respect to the best link available — is above 93%. With 10 sample packets, the performance is above 96%.","PeriodicalId":412748,"journal":{"name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132049762","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}