Over the recent years, one of the most important problems in wireless sensor networks (WSNs) is to develope an energy-efficient and reliable routing protocol and provide network robustness. To achieve these objectives, we propose a new architecture for data dissemination called Two Tier Cluster Based Routing Protocol (TTCRP) for reliable data delivery in WSNs. TTCRP uses resource rich cluster heads with dual channels to form the clusters for efficient data delivery. While it provides power control algorithm to connect the isolated low power sensor nodes with minimum required power that achieves the network robustness. Simulation results reveal that TTCRP is efficient and provides reliability in both uniform as well as non-uniform sensor nodes deployment.
{"title":"Two-Tier Cluster Based Routing Protocol for Wireless Sensor Networks","authors":"Asif U. Khattak, G. Shah, M. Ahsan","doi":"10.1109/EUC.2010.68","DOIUrl":"https://doi.org/10.1109/EUC.2010.68","url":null,"abstract":"Over the recent years, one of the most important problems in wireless sensor networks (WSNs) is to develope an energy-efficient and reliable routing protocol and provide network robustness. To achieve these objectives, we propose a new architecture for data dissemination called Two Tier Cluster Based Routing Protocol (TTCRP) for reliable data delivery in WSNs. TTCRP uses resource rich cluster heads with dual channels to form the clusters for efficient data delivery. While it provides power control algorithm to connect the isolated low power sensor nodes with minimum required power that achieves the network robustness. Simulation results reveal that TTCRP is efficient and provides reliability in both uniform as well as non-uniform sensor nodes deployment.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127687469","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}
Certificateless cryptography eliminates the key escrow problem in identity-based cryptography. Hierarchical cryptography exploits a practical security model to mirror the organizational hierarchy in the real world. In this paper, to incorporate the advantages of both types of cryptosystems, we instantiate hierarchical certificate less cryptography by formalizing the notion of hierarchical certificate less signatures. Furthermore, we propose an HCLS scheme which, under the hardness of the computational Diffie-Hellman (CDH) problem, is proven to be existentially unforgeable against adaptive chosen-message attacks in the random oracle model. As to efficiency, our scheme has constant complexity, regardless of the depth of the hierarchy. Hence, the proposal is secure and scalable for practical applications.
{"title":"Hierarchical Certificateless Signatures","authors":"Lei Zhang, Qianhong Wu, J. Domingo-Ferrer, Bo Qin","doi":"10.1109/EUC.2010.92","DOIUrl":"https://doi.org/10.1109/EUC.2010.92","url":null,"abstract":"Certificateless cryptography eliminates the key escrow problem in identity-based cryptography. Hierarchical cryptography exploits a practical security model to mirror the organizational hierarchy in the real world. In this paper, to incorporate the advantages of both types of cryptosystems, we instantiate hierarchical certificate less cryptography by formalizing the notion of hierarchical certificate less signatures. Furthermore, we propose an HCLS scheme which, under the hardness of the computational Diffie-Hellman (CDH) problem, is proven to be existentially unforgeable against adaptive chosen-message attacks in the random oracle model. As to efficiency, our scheme has constant complexity, regardless of the depth of the hierarchy. Hence, the proposal is secure and scalable for practical applications.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126958833","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}
The currently proposed anonymous routing mechanisms for Mobile Ad hoc Networks enable network entities to anonymously and securely communicate with each other. However, protocols that provide a high level of anonymity generally have poor scalability due to delays and overhead introduced by cryptographic operations, while other approaches sacrifice anonymity to achieve better performance. In this paper, we propose a novel anonymous routing protocol that provides improved anonymity and security while achieving similar or better performance, as compared to existing proposals. Our proposal achieves anonymity using a novel efficient solution for invisible implicit addressing based on keyed hash chain and security via a novel application of one-to-many Diffie-Hellman mechanism, used to exchange keys for symmetric encryption. The final contribution includes a mechanism to facilitate selection of a trusted route by verifying connections between intermediate nodes. We demonstrate the benefits of our proposal in comparison with previous approaches using analysis and simulation.
{"title":"TARo: Trusted Anonymous Routing for MANETs","authors":"Jiefeng Chen, R. Boreli, V. Sivaraman","doi":"10.1109/EUC.2010.119","DOIUrl":"https://doi.org/10.1109/EUC.2010.119","url":null,"abstract":"The currently proposed anonymous routing mechanisms for Mobile Ad hoc Networks enable network entities to anonymously and securely communicate with each other. However, protocols that provide a high level of anonymity generally have poor scalability due to delays and overhead introduced by cryptographic operations, while other approaches sacrifice anonymity to achieve better performance. In this paper, we propose a novel anonymous routing protocol that provides improved anonymity and security while achieving similar or better performance, as compared to existing proposals. Our proposal achieves anonymity using a novel efficient solution for invisible implicit addressing based on keyed hash chain and security via a novel application of one-to-many Diffie-Hellman mechanism, used to exchange keys for symmetric encryption. The final contribution includes a mechanism to facilitate selection of a trusted route by verifying connections between intermediate nodes. We demonstrate the benefits of our proposal in comparison with previous approaches using analysis and simulation.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"440 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115270116","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}
To handle the triple hidden terminal problems, this paper proposes OCO, an asynchronous multi-channel MAC protocol with opportunistic cooperation for wireless sensor networks. By adopting opportunistic cooperation, OCO effectively alleviates, if not eliminates, the triple hidden terminal problems. More importantly, OCO is fully distributed with no requirements of time synchronization or multi-radio scheme, so it is easy to be implemented on the real sensor nodes. Via the theoretical analysis, the opportunistic probability that a node cooperates with its neighbor is obtained. To validate the effectiveness of opportunistic cooperation, extensive simulations and real test bed experiments were con-ducted. The simulation and experimental results show that when the number of channels is large or the network loads are heavy, OCO improves energy efficiency and throughput significantly compared with other works in the literature.
{"title":"OCO: A Multi-channel MAC Protocol with Opportunistic Cooperation for Wireless Sensor Networks","authors":"Jinbao Li, Desheng Zhang, Longjiang Guo","doi":"10.1109/EUC.2010.45","DOIUrl":"https://doi.org/10.1109/EUC.2010.45","url":null,"abstract":"To handle the triple hidden terminal problems, this paper proposes OCO, an asynchronous multi-channel MAC protocol with opportunistic cooperation for wireless sensor networks. By adopting opportunistic cooperation, OCO effectively alleviates, if not eliminates, the triple hidden terminal problems. More importantly, OCO is fully distributed with no requirements of time synchronization or multi-radio scheme, so it is easy to be implemented on the real sensor nodes. Via the theoretical analysis, the opportunistic probability that a node cooperates with its neighbor is obtained. To validate the effectiveness of opportunistic cooperation, extensive simulations and real test bed experiments were con-ducted. The simulation and experimental results show that when the number of channels is large or the network loads are heavy, OCO improves energy efficiency and throughput significantly compared with other works in the literature.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124688639","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}
Dongxi Liu, Jack Lee, Julian Jang, S. Nepal, J. Zic
We propose and implement a cloud architecture of virtual TPMs. In this architecture, TPM instances can be obtained from the TPM cloud on demand. Hence, the TPM functionality is available for applications that do not have TPM chips in their local platforms. Moreover, users can access their keys and data in the same TPM instance even if they move to other platforms. The TPM functionality in cloud is easy to access for applications developed in different languages since cloud computing delivers services in standard protocols. The functionality of the TPM cloud is demonstrated by using it to implement the Needham-Schroeder public-key protocol for web authentication.
{"title":"A Cloud Architecture of Virtual Trusted Platform Modules","authors":"Dongxi Liu, Jack Lee, Julian Jang, S. Nepal, J. Zic","doi":"10.1109/EUC.2010.125","DOIUrl":"https://doi.org/10.1109/EUC.2010.125","url":null,"abstract":"We propose and implement a cloud architecture of virtual TPMs. In this architecture, TPM instances can be obtained from the TPM cloud on demand. Hence, the TPM functionality is available for applications that do not have TPM chips in their local platforms. Moreover, users can access their keys and data in the same TPM instance even if they move to other platforms. The TPM functionality in cloud is easy to access for applications developed in different languages since cloud computing delivers services in standard protocols. The functionality of the TPM cloud is demonstrated by using it to implement the Needham-Schroeder public-key protocol for web authentication.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124941248","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}
Reciprocity-based cooperation on packet forwarding in mobile ad hoc networks means that before passing on a packet to the next hop intermediate nodes verify whether the sender of the packet is trustworthy (i.e., cooperative in the past) or not. One of the key questions is what data should be used to evaluate the trustworthiness. This paper demonstrates that if cooperation is based on indirect reciprocity and a classic watchdog-based mechanism for data collection is used, discarding packets can be seen as an act of altruistic punishment. An intermediate node that decides to discard packets from a selfish sender pays the cost (expressed in decrease of trustworthiness among other nodes). However, if the cost of punishing free-riders is too high then nobody has the incentive to be the punisher. This paper demonstrates that the cost is significant and reduces an overall performance of the network. Using computational experiments it is shown that a simple modification of the classic watchdog-based trust data collection mechanism can result in minimisation of the cost and improvement of the throughput of the network.
{"title":"The Cost of Altruistic Punishment in Indirect Reciprocity-based Cooperation in Mobile Ad Hoc Networks","authors":"M. Seredynski, P. Bouvry","doi":"10.1109/EUC.2010.118","DOIUrl":"https://doi.org/10.1109/EUC.2010.118","url":null,"abstract":"Reciprocity-based cooperation on packet forwarding in mobile ad hoc networks means that before passing on a packet to the next hop intermediate nodes verify whether the sender of the packet is trustworthy (i.e., cooperative in the past) or not. One of the key questions is what data should be used to evaluate the trustworthiness. This paper demonstrates that if cooperation is based on indirect reciprocity and a classic watchdog-based mechanism for data collection is used, discarding packets can be seen as an act of altruistic punishment. An intermediate node that decides to discard packets from a selfish sender pays the cost (expressed in decrease of trustworthiness among other nodes). However, if the cost of punishing free-riders is too high then nobody has the incentive to be the punisher. This paper demonstrates that the cost is significant and reduces an overall performance of the network. Using computational experiments it is shown that a simple modification of the classic watchdog-based trust data collection mechanism can result in minimisation of the cost and improvement of the throughput of the network.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130774013","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}
Energy efficiency should be considered as a key design objective in wireless sensor networks (WSNs), since a sensor node can only be equipped with a limited energy supply. Clustering is one of the well-known design methods for managing the energy consumption in WSNs. Rotating role of cluster heads (CH) among nodes in these networks is an important issue in some of clustering methods. Directly collecting information about the energy level of nodes in each round increases the cost of CH role rotation, in the field of centralized hierarchical methods. In this paper, we proposed a centralized clustering algorithm that utilize hidden Markov model (HMM) optimized by particle swarm optimization (PSO) to predict the energy level of the network. In the next step, the appropriate CHs are selected by PSO algorithm. Our proposed method reduces the cost of clustering and in the mean time increases clustering performance. Evaluation results demonstrate by comparison with famous clustering algorithms, our scheme is energy efficient and increase network life time.
{"title":"An Efficient Clustering Algorithm Using Evolutionary HMM in Wireless Sensor Networks","authors":"Rouhollah Goudarzi, Behrouz Jedari, M. Sabaei","doi":"10.1109/EUC.2010.67","DOIUrl":"https://doi.org/10.1109/EUC.2010.67","url":null,"abstract":"Energy efficiency should be considered as a key design objective in wireless sensor networks (WSNs), since a sensor node can only be equipped with a limited energy supply. Clustering is one of the well-known design methods for managing the energy consumption in WSNs. Rotating role of cluster heads (CH) among nodes in these networks is an important issue in some of clustering methods. Directly collecting information about the energy level of nodes in each round increases the cost of CH role rotation, in the field of centralized hierarchical methods. In this paper, we proposed a centralized clustering algorithm that utilize hidden Markov model (HMM) optimized by particle swarm optimization (PSO) to predict the energy level of the network. In the next step, the appropriate CHs are selected by PSO algorithm. Our proposed method reduces the cost of clustering and in the mean time increases clustering performance. Evaluation results demonstrate by comparison with famous clustering algorithms, our scheme is energy efficient and increase network life time.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121726322","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}
With the advancement of mobile devices' capabilities, it is possible to implement knowledge-based systems on the mobile devices. This development introduces a challenge of transferring knowledge between mobile devices and knowledge-based systems on the server side. This paper presents a novel representation, Entity Notation, to tackle this challenge. It can represent ontology knowledge in a straightforward fashion and allows incremental transfer of ontology. This unique feature makes Entity Notation an ideal solution for transferring knowledge in highly dynamic ubiquitous environments. Moreover, Entity Notation has a short format suitable for communication when resources are constrained. We address the design issues of the representation, demonstrate its usability by a small ontology, and evaluate it based on a set of ubiquitous ontologies.
{"title":"Transferring Ontologies between Mobile Devices and Knowledge-Based Systems","authors":"Xiang Su, J. Riekki","doi":"10.1109/EUC.2010.28","DOIUrl":"https://doi.org/10.1109/EUC.2010.28","url":null,"abstract":"With the advancement of mobile devices' capabilities, it is possible to implement knowledge-based systems on the mobile devices. This development introduces a challenge of transferring knowledge between mobile devices and knowledge-based systems on the server side. This paper presents a novel representation, Entity Notation, to tackle this challenge. It can represent ontology knowledge in a straightforward fashion and allows incremental transfer of ontology. This unique feature makes Entity Notation an ideal solution for transferring knowledge in highly dynamic ubiquitous environments. Moreover, Entity Notation has a short format suitable for communication when resources are constrained. We address the design issues of the representation, demonstrate its usability by a small ontology, and evaluate it based on a set of ubiquitous ontologies.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115470876","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}
In underwater sensor networks, localization is one of the most important issues because sensor nodes are considerably difficult to be deployed at determined locations. Since range-based schemes require additional device and precise time synchronization for measuring distances in underwater environments, range-free schemes are promising in the view point of energy consumption and implementation. Coarseness of range-free schemes in the localization accuracy can be compensated utilizing a mobile beacon. In this paper, we propose a new range-free localization scheme with a mobile beacon which estimates two candidates for the location of a sensor node utilizing geometry and then determines the final location out of the two candidates. During simulations, the proposed scheme was indeed shown to provide higher localization accuracy with respect to irregularities in acoustic range.
{"title":"Localization with a Mobile Beacon in Underwater Sensor Networks","authors":"Sangho Lee, Kiseon Kim","doi":"10.1109/EUC.2010.52","DOIUrl":"https://doi.org/10.1109/EUC.2010.52","url":null,"abstract":"In underwater sensor networks, localization is one of the most important issues because sensor nodes are considerably difficult to be deployed at determined locations. Since range-based schemes require additional device and precise time synchronization for measuring distances in underwater environments, range-free schemes are promising in the view point of energy consumption and implementation. Coarseness of range-free schemes in the localization accuracy can be compensated utilizing a mobile beacon. In this paper, we propose a new range-free localization scheme with a mobile beacon which estimates two candidates for the location of a sensor node utilizing geometry and then determines the final location out of the two candidates. During simulations, the proposed scheme was indeed shown to provide higher localization accuracy with respect to irregularities in acoustic range.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114179533","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}
Many existing Wireless Sensor Network (WSN) synchronisation protocols have demonstrated microsecond-level accuracy is achievable. Furthermore, sub-microsecond-level accuracy has recently been reported, although rather sophisticated, relatively bulky and custom-designed hardware were needed. This paper addresses a fundamental problem in WSN synchronisation: is there a more elegant way to achieve precise synchronisation in WSN? What are the obstacles to pushing the limit in WSN synchronisation? This paper identified the drawbacks caused by the assumptions made in existing WSN synchronisation protocols, and presented and discussed a range of novel solutions to improve the accuracy, reliability and scalability of WSN synchronisation through fusing various types of information and a sensible selection of hardware.
{"title":"Towards Precise Synchronisation in Wireless Sensor Networks","authors":"L. Cheng, S. Hailes, Alan M. Wilson","doi":"10.1109/EUC.2010.38","DOIUrl":"https://doi.org/10.1109/EUC.2010.38","url":null,"abstract":"Many existing Wireless Sensor Network (WSN) synchronisation protocols have demonstrated microsecond-level accuracy is achievable. Furthermore, sub-microsecond-level accuracy has recently been reported, although rather sophisticated, relatively bulky and custom-designed hardware were needed. This paper addresses a fundamental problem in WSN synchronisation: is there a more elegant way to achieve precise synchronisation in WSN? What are the obstacles to pushing the limit in WSN synchronisation? This paper identified the drawbacks caused by the assumptions made in existing WSN synchronisation protocols, and presented and discussed a range of novel solutions to improve the accuracy, reliability and scalability of WSN synchronisation through fusing various types of information and a sensible selection of hardware.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127638157","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
扫码关注我们
求助内容：
应助结果提醒方式：