Cognitive network is now regarded as a promising approach to solve the spectrum underutilization problem. To protect the primary user, interference temperature has been promoted as a threshold under which the secondary user must control its transmitting power. As the traditional contention graph based model can't actually depict this interference character, we proposed a geometric SINR model which can jointly solve the interference temperature requirement and optimal spectrum assignment problem. Differing from other research works, this paper considers both primary and secondary users' SINR requirement. As finding the optimal results of power control and spectrum allocation is proved to be NP complete, we proposed a novel heuristic power and spectrum allocation algorithm (HPSA) to solve this problem efficiently. Based on the HPSA algorithm's result, an intensive iterative power and spectrum allocation (IPSA) algorithm is designed to find a more excellent result. By detailed simulation, the results demonstrated that this algorithm can quickly be converged within 10 iterations. IPSA also has the average performance improvement about 60% comparing to the maximum coloring scheme.
{"title":"A SINR Guaranteed Power and Spectrum Allocation Algorithm for Cognitive Networks","authors":"Hu Gang, Liu Lixia, Xu Ming","doi":"10.1109/MUSIC.2012.37","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.37","url":null,"abstract":"Cognitive network is now regarded as a promising approach to solve the spectrum underutilization problem. To protect the primary user, interference temperature has been promoted as a threshold under which the secondary user must control its transmitting power. As the traditional contention graph based model can't actually depict this interference character, we proposed a geometric SINR model which can jointly solve the interference temperature requirement and optimal spectrum assignment problem. Differing from other research works, this paper considers both primary and secondary users' SINR requirement. As finding the optimal results of power control and spectrum allocation is proved to be NP complete, we proposed a novel heuristic power and spectrum allocation algorithm (HPSA) to solve this problem efficiently. Based on the HPSA algorithm's result, an intensive iterative power and spectrum allocation (IPSA) algorithm is designed to find a more excellent result. By detailed simulation, the results demonstrated that this algorithm can quickly be converged within 10 iterations. IPSA also has the average performance improvement about 60% comparing to the maximum coloring scheme.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131153933","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}
Group key management (GKM) refers to the actions taken to update and distribute the group key upon members joining and leaving a multicast/broadcast group. The GKM scheme defined in the IEEE 802.11 WLAN standards is not efficient because the re-keying latency grows linearly with the number of clients connected to an access point. In this paper, we apply the logical key hierarchy (LKH) and one-way function tree (OFT) algorithms to GKM in WLANs to improve its performance. Our numerical analyses show that the LKH and OFT algorithms reduce the re-keying latency of GKM in WLANs to logarithmic time.
{"title":"Efficient Group Key Management in Wireless LANs","authors":"Celia Li, U. T. Nguyen","doi":"10.1109/MUSIC.2012.25","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.25","url":null,"abstract":"Group key management (GKM) refers to the actions taken to update and distribute the group key upon members joining and leaving a multicast/broadcast group. The GKM scheme defined in the IEEE 802.11 WLAN standards is not efficient because the re-keying latency grows linearly with the number of clients connected to an access point. In this paper, we apply the logical key hierarchy (LKH) and one-way function tree (OFT) algorithms to GKM in WLANs to improve its performance. Our numerical analyses show that the LKH and OFT algorithms reduce the re-keying latency of GKM in WLANs to logarithmic time.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923325","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}
Secure multicast is one of the most important security services in wireless sensor networks since it enables the base station to multicast messages to sensor nodes in a secure manner. Multicast potentially optimises bandwidth consumption and node resources when several users simultaneously participate in a communication session. In this paper, we propose a secure data multicast scheme for wireless sensor networks which composes group key management and data security. The proposed scheme is light weight and works for both small and large sized sensor networks.
{"title":"A Secure Multicast Scheme for Wireless Sensor Networks","authors":"Qian Yu, C. Zhang","doi":"10.1109/MUSIC.2012.35","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.35","url":null,"abstract":"Secure multicast is one of the most important security services in wireless sensor networks since it enables the base station to multicast messages to sensor nodes in a secure manner. Multicast potentially optimises bandwidth consumption and node resources when several users simultaneously participate in a communication session. In this paper, we propose a secure data multicast scheme for wireless sensor networks which composes group key management and data security. The proposed scheme is light weight and works for both small and large sized sensor networks.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123439534","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}
Traditional E-Commerce applications have evolved in the last years due to the growth of the mobile environment, creating a new research area known as U-Commerce. The application of these techniques in the banking environment has been a direct outcome in order to enhance the services offered to end users. In this paper, we present a context-aware mobile recommender system based on real banking data provided by a well known Spanish bank. The data were composed by customer profiles, credit card transactions and information about places where bank clients have previously spent their money. The system model and its architecture are described taking into account social, mobility and ubiquitous requisites to generate personalized recommendations. The mobile prototype deployed in the bank was evaluated in a survey among 100 users with good results regarding trust, usefulness and effectiveness.
{"title":"An Empirical Case of a Context-Aware Mobile Recommender System in a Banking Environment","authors":"Daniel Gallego, G. Huecas","doi":"10.1109/MUSIC.2012.11","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.11","url":null,"abstract":"Traditional E-Commerce applications have evolved in the last years due to the growth of the mobile environment, creating a new research area known as U-Commerce. The application of these techniques in the banking environment has been a direct outcome in order to enhance the services offered to end users. In this paper, we present a context-aware mobile recommender system based on real banking data provided by a well known Spanish bank. The data were composed by customer profiles, credit card transactions and information about places where bank clients have previously spent their money. The system model and its architecture are described taking into account social, mobility and ubiquitous requisites to generate personalized recommendations. The mobile prototype deployed in the bank was evaluated in a survey among 100 users with good results regarding trust, usefulness and effectiveness.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115313712","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
扫码关注我们
求助内容：
应助结果提醒方式：