Pub Date : 2011-07-18DOI: 10.5220/0003453100350040
J. A. Gay-Fernández, I. Cuiñas
A complete analysis for the deployment of a wireless sensor network in a vineyard is presented in this paper. First, due to the lack of propagation models for peer to peer networks in plantations, propagation experiments have been carried out to determine the propagation equations. This model was then used for planning and deploying an actual wireless sensor network. Afterwards, some sensor data are presented and finally, some general conclusions are extracted from the experiments and presented in the paper.
{"title":"Deployment of a wireless sensor network in a vineyard","authors":"J. A. Gay-Fernández, I. Cuiñas","doi":"10.5220/0003453100350040","DOIUrl":"https://doi.org/10.5220/0003453100350040","url":null,"abstract":"A complete analysis for the deployment of a wireless sensor network in a vineyard is presented in this paper. First, due to the lack of propagation models for peer to peer networks in plantations, propagation experiments have been carried out to determine the propagation equations. This model was then used for planning and deploying an actual wireless sensor network. Afterwards, some sensor data are presented and finally, some general conclusions are extracted from the experiments and presented in the paper.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123317989","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}
Pub Date : 2011-07-18DOI: 10.5220/0003611001150118
A. Chohra, F. Giandomenico, S. Porcarelli, A. Bondavalli
To enhance wireless and mobile system dependability, audit operations are necessary, to periodically check the database consistency and recover in case of data corruption. Consequently, how to tune the database audit parameters and which operation order and frequency to apply becomes important aspects, to optimize performance and satisfy a certain degree of Quality of Service, over system life-cycle. The aim of this work is then to suggest an intelligent maintenance system based on reinforcement Q-Learning approach, built of a given audit operation set and an audit manager, in order to maximize the performance (performability and unreliability). For this purpose, a methodology, based on deterministic and stochastic Petri nets, to model and analyze the dependability attributes of different scheduled audit strategies is first developed. Afterwards, an intelligent (reinforcement Q-Learning) software agent approach is developed for planning and learning to derive optimal maintenance policies adaptively dealing with the highly dynamic evolution of the environmental conditions. This intelligent approach, is then implemented with feedforward artificial neural networks under the supervised gradient back-propagation learning to guarantee the success even with large state spaces, exploits intelligent behaviors traits (learning, adaptation, generalization, and robustness) to derive optimal actions in different system states in order to achieve an intelligent maintenance system.
{"title":"An intelligent maintenance based on machine learning approach for wireless and mobile systems","authors":"A. Chohra, F. Giandomenico, S. Porcarelli, A. Bondavalli","doi":"10.5220/0003611001150118","DOIUrl":"https://doi.org/10.5220/0003611001150118","url":null,"abstract":"To enhance wireless and mobile system dependability, audit operations are necessary, to periodically check the database consistency and recover in case of data corruption. Consequently, how to tune the database audit parameters and which operation order and frequency to apply becomes important aspects, to optimize performance and satisfy a certain degree of Quality of Service, over system life-cycle. The aim of this work is then to suggest an intelligent maintenance system based on reinforcement Q-Learning approach, built of a given audit operation set and an audit manager, in order to maximize the performance (performability and unreliability). For this purpose, a methodology, based on deterministic and stochastic Petri nets, to model and analyze the dependability attributes of different scheduled audit strategies is first developed. Afterwards, an intelligent (reinforcement Q-Learning) software agent approach is developed for planning and learning to derive optimal maintenance policies adaptively dealing with the highly dynamic evolution of the environmental conditions. This intelligent approach, is then implemented with feedforward artificial neural networks under the supervised gradient back-propagation learning to guarantee the success even with large state spaces, exploits intelligent behaviors traits (learning, adaptation, generalization, and robustness) to derive optimal actions in different system states in order to achieve an intelligent maintenance system.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116399532","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}
Pub Date : 2011-07-18DOI: 10.5220/0003525000530058
Björn Stelte
Wireless Sensor Networks are vulnerable to many different kind of attacks. Especially insider attacks known as Byzantine attacks are very harmful and is not easy to defend a wireless sensor network against such attacks. The problem is that insider attacks are much easier to perform in sensor networks than in classical computer networks. The presented concept of a cluster-based sensor network is based on cluster heads equipped with data diodes and can be used to prevent Byzantine attacks. To reduce the impact of cluster head tampering a security mechanism based on the Byzantine Generals's Problem will be introduced. Finally, details concerning our implementation of cluster nodes on low-power FPGA are given.
{"title":"Protection against Byzantine attacks on Wireless Sensor Networks","authors":"Björn Stelte","doi":"10.5220/0003525000530058","DOIUrl":"https://doi.org/10.5220/0003525000530058","url":null,"abstract":"Wireless Sensor Networks are vulnerable to many different kind of attacks. Especially insider attacks known as Byzantine attacks are very harmful and is not easy to defend a wireless sensor network against such attacks. The problem is that insider attacks are much easier to perform in sensor networks than in classical computer networks. The presented concept of a cluster-based sensor network is based on cluster heads equipped with data diodes and can be used to prevent Byzantine attacks. To reduce the impact of cluster head tampering a security mechanism based on the Byzantine Generals's Problem will be introduced. Finally, details concerning our implementation of cluster nodes on low-power FPGA are given.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131567987","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}
Pub Date : 2011-07-18DOI: 10.5220/0003484400650068
Youn-Sik Hong, Hwa-Seok Lim, Cheol-Ho Lee
Node failure in a connected dominating set (CDS) is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. For a typical localized algorithm to construct CDS, it has the time complexity ofO(Δ3), where Δ is the maximum degree of an input graph. In this paper we inspect the problem of load balancing in a dominating-set based routing. The motivation of load balancing is to prolong the network lifetime, while minimize the partitions of the network due to node failure, where they cause interruptions in communication among nodes. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. The number of nodes which should be awaken during partial reconstruction is less than 2(Δ−1)×ρ, where ρ is the number of nodes from CDS and the number of neighbour of the faulty node.
{"title":"A load-balanced topology maintenance with partial reconstruction of connected dominating sets","authors":"Youn-Sik Hong, Hwa-Seok Lim, Cheol-Ho Lee","doi":"10.5220/0003484400650068","DOIUrl":"https://doi.org/10.5220/0003484400650068","url":null,"abstract":"Node failure in a connected dominating set (CDS) is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. For a typical localized algorithm to construct CDS, it has the time complexity ofO(Δ3), where Δ is the maximum degree of an input graph. In this paper we inspect the problem of load balancing in a dominating-set based routing. The motivation of load balancing is to prolong the network lifetime, while minimize the partitions of the network due to node failure, where they cause interruptions in communication among nodes. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. The number of nodes which should be awaken during partial reconstruction is less than 2(Δ−1)×ρ, where ρ is the number of nodes from CDS and the number of neighbour of the faulty node.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131908066","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}
Pub Date : 2011-07-18DOI: 10.5220/0003606901230127
Jian-Zhu Lu, Hong-Qing Ren, Jipeng Zhou
In 2008, Tang and Wu designed a one-time alias mechanism for protecting the mobile privacy of a user. Recently, Youn and Lim proposed an improved delegation-based authentication protocol to provide private roaming service. In this article, we show that a link between requests may disclose information about the mobile privacy of a sender, and that the aliases of a user fail to achieve the unlinkability in Tan-Wu's scheme. We remedy this situation by suggesting an enhanced protocol that utilizes a pseudorandom function. Compared to Youn-Lim's protocol, our design is more efficient than theirs.
{"title":"Efficient delegation-based authentication protocol with strong mobile privacy","authors":"Jian-Zhu Lu, Hong-Qing Ren, Jipeng Zhou","doi":"10.5220/0003606901230127","DOIUrl":"https://doi.org/10.5220/0003606901230127","url":null,"abstract":"In 2008, Tang and Wu designed a one-time alias mechanism for protecting the mobile privacy of a user. Recently, Youn and Lim proposed an improved delegation-based authentication protocol to provide private roaming service. In this article, we show that a link between requests may disclose information about the mobile privacy of a sender, and that the aliases of a user fail to achieve the unlinkability in Tan-Wu's scheme. We remedy this situation by suggesting an enhanced protocol that utilizes a pseudorandom function. Compared to Youn-Lim's protocol, our design is more efficient than theirs.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131063496","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}
Pub Date : 2011-07-18DOI: 10.5220/0003614101090112
N. I. Miridakis, D. Vergados
In this paper, we propose a new reception scheme for MIMO-OFDM systems, which can switch between two different equalization methodologies, accordingly, on a subcarrier basis. In fact, the proposed receiver is based on the ordered successive interference cancellation (SIC) technique and uses jointly zero forcing SIC (ZF-SIC) and minimum mean squared error SIC (MMSE-SIC) according to a defined threshold value. The modulation scheme considered in this study is QPSK. Our main objective, here, is the provision of the computational complexity efficiency. Hence, a complexity analysis is provided and upper and lower complexity bounds for the proposed scheme are also derived.
{"title":"Complexity analysis of a hybrid threshold-based ZF-MMSE equalizer for sic-based MIMO-OFDM receivers","authors":"N. I. Miridakis, D. Vergados","doi":"10.5220/0003614101090112","DOIUrl":"https://doi.org/10.5220/0003614101090112","url":null,"abstract":"In this paper, we propose a new reception scheme for MIMO-OFDM systems, which can switch between two different equalization methodologies, accordingly, on a subcarrier basis. In fact, the proposed receiver is based on the ordered successive interference cancellation (SIC) technique and uses jointly zero forcing SIC (ZF-SIC) and minimum mean squared error SIC (MMSE-SIC) according to a defined threshold value. The modulation scheme considered in this study is QPSK. Our main objective, here, is the provision of the computational complexity efficiency. Hence, a complexity analysis is provided and upper and lower complexity bounds for the proposed scheme are also derived.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123161613","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}
Pub Date : 2011-07-18DOI: 10.5220/0003406900210026
Ran Zhao, K. Selvarajah, N. Speirs
The main objective of the PECES project is the development of system software to enable the communication among heterogeneous devices across multiple smart spaces, breaking the traditional barrier of “smart islands” where only the services offered in a nearby spatial area can be used easily. PECES development tools help the application developer to build and test the PECES middleware based applications. This paper presents a set of tools, namely Peces Project, Peces Device Definition, Peces Ontology Instantiation, Peces Service Definition and Peces Role Specification Definition which enable application developers to build the PECES middleware based application using the novel concepts such as role assignment context ontologies and heterogeneous communication technologies. Furthermore, this paper proposes new tools which enable to model and simulate the smart space applications.
{"title":"Development tools for pervasive computing in embedded systems (PECES) middleware","authors":"Ran Zhao, K. Selvarajah, N. Speirs","doi":"10.5220/0003406900210026","DOIUrl":"https://doi.org/10.5220/0003406900210026","url":null,"abstract":"The main objective of the PECES project is the development of system software to enable the communication among heterogeneous devices across multiple smart spaces, breaking the traditional barrier of “smart islands” where only the services offered in a nearby spatial area can be used easily. PECES development tools help the application developer to build and test the PECES middleware based applications. This paper presents a set of tools, namely Peces Project, Peces Device Definition, Peces Ontology Instantiation, Peces Service Definition and Peces Role Specification Definition which enable application developers to build the PECES middleware based application using the novel concepts such as role assignment context ontologies and heterogeneous communication technologies. Furthermore, this paper proposes new tools which enable to model and simulate the smart space applications.","PeriodicalId":292305,"journal":{"name":"Proceedings of the International Conference on Wireless Information Networks and Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132575678","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：