Pub Date : 2013-06-09DOI: 10.1109/ICCW.2013.6649382
N. Zorba, E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy
Quality of Service (QoS) is a very important metric in wireless communication systems, where both Uplink (UL) and Downlink (DL) connections request strict QoS demands in terms of rate, delay, etc. for their proper operation. The development of wireless communications standards and the emergence of new interactive and conversational services with bi-directional QoS requirements changes the scheduling context from a link-level to a system level. To this end, this paper presents a joint UL-DL bandwidth allocation approach that considers outage as the main QoS parameter to be minimized. The well-known opportunistic scheduling algorithm is first modified to account for the UL-DL coupling and a mathematical expression of the outage probability is derived. Then the expression is employed in the joint UL-DL bandwidth allocation problem. The formulated problem is shown to be a convex optimization problem. Simulation results demonstrate the merits of the proposed approach compared to traditional techniques.
{"title":"A modified joint uplink-downlink opportunistic scheduling for Quality of Service guarantees","authors":"N. Zorba, E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy","doi":"10.1109/ICCW.2013.6649382","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649382","url":null,"abstract":"Quality of Service (QoS) is a very important metric in wireless communication systems, where both Uplink (UL) and Downlink (DL) connections request strict QoS demands in terms of rate, delay, etc. for their proper operation. The development of wireless communications standards and the emergence of new interactive and conversational services with bi-directional QoS requirements changes the scheduling context from a link-level to a system level. To this end, this paper presents a joint UL-DL bandwidth allocation approach that considers outage as the main QoS parameter to be minimized. The well-known opportunistic scheduling algorithm is first modified to account for the UL-DL coupling and a mathematical expression of the outage probability is derived. Then the expression is employed in the joint UL-DL bandwidth allocation problem. The formulated problem is shown to be a convex optimization problem. Simulation results demonstrate the merits of the proposed approach compared to traditional techniques.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127129085","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649360
Yizhuo Yang, Feng Li, C. Lim, A. Nirmalathas
We propose a converged fiber-wireless access network based on radio-over-fiber technologies as future mobile backhaul incorporating base station cooperation schemes (CoMP). Both analog and digitized RoF technologies are discussed as possible solutions, in terms of base station configuration, system performance and energy efficiency. The implementation approach and the capacity gain of CoMP are analyzed. To reduce the processing overhead, CoMP should only be enabled with a significant CoMP gain. Experimental demonstration of the proposed scheme is presented with more than 2-dB SNR improvement.
{"title":"Converged fiber-wireless access networks for next generation mobile backhaul enabling CoMP","authors":"Yizhuo Yang, Feng Li, C. Lim, A. Nirmalathas","doi":"10.1109/ICCW.2013.6649360","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649360","url":null,"abstract":"We propose a converged fiber-wireless access network based on radio-over-fiber technologies as future mobile backhaul incorporating base station cooperation schemes (CoMP). Both analog and digitized RoF technologies are discussed as possible solutions, in terms of base station configuration, system performance and energy efficiency. The implementation approach and the capacity gain of CoMP are analyzed. To reduce the processing overhead, CoMP should only be enabled with a significant CoMP gain. Experimental demonstration of the proposed scheme is presented with more than 2-dB SNR improvement.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121700827","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649306
B. Micallef, C. J. Debono, R. Farrugia
Bandwidth-limited channels demand the transmission of the per-pixel depth maps with the texture data to provide immersive 3D video services that allow arbitrary 3D viewpoint reconstruction. This auxiliary depth data offers geometric information, which together with the multi-view and epipolar geometries, can be exploited during 3D video coding to calculate geometric positions for the search areas of disparity estimation. These positions represent a more accurate estimate match to compensate the current macro-block from than those provided by the median adopted by the H.264/MVC standard. The result is smaller search areas that reduce the encoder's computational requirement. In this work, we exploit this fact together with the largest depth variation within the macro-block to encode, to calculate and adaptively adjust these areas along the epipolar lines. The proposed solution achieves a speedup gain of up-to 32 times over the original disparity estimation, with negligible influence on the rate-distortion performance of 3D video coding. This highly reduces the computational cost of the H.264/MVC encoder and eases its need to be implemented on highly expensive systems that are otherwise necessary to meets the stringent latency requirement of broadcast transmissions. Moreover, it provides similar coding efficiencies required for such scenarios.
{"title":"Low complexity disparity estimation for immersive 3D video transmission","authors":"B. Micallef, C. J. Debono, R. Farrugia","doi":"10.1109/ICCW.2013.6649306","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649306","url":null,"abstract":"Bandwidth-limited channels demand the transmission of the per-pixel depth maps with the texture data to provide immersive 3D video services that allow arbitrary 3D viewpoint reconstruction. This auxiliary depth data offers geometric information, which together with the multi-view and epipolar geometries, can be exploited during 3D video coding to calculate geometric positions for the search areas of disparity estimation. These positions represent a more accurate estimate match to compensate the current macro-block from than those provided by the median adopted by the H.264/MVC standard. The result is smaller search areas that reduce the encoder's computational requirement. In this work, we exploit this fact together with the largest depth variation within the macro-block to encode, to calculate and adaptively adjust these areas along the epipolar lines. The proposed solution achieves a speedup gain of up-to 32 times over the original disparity estimation, with negligible influence on the rate-distortion performance of 3D video coding. This highly reduces the computational cost of the H.264/MVC encoder and eases its need to be implemented on highly expensive systems that are otherwise necessary to meets the stringent latency requirement of broadcast transmissions. Moreover, it provides similar coding efficiencies required for such scenarios.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555838","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649365
Jilan Feng, Y. Pi, Jianyu Yang
Superpixel based SAR image classification methods can take advantage of the contextual information in SAR images effectively, leading to robust classification results. The accuracy of superpixel generation has great impact on the performance of the following classification stage. In this paper, based on the property of SAR images, an energy minimizing based superpixel generation approach is proposed for SAR images. The energy function is composed of two parts. The data term is defined according to the statistical characteristic of SAR images, and the regularization term is defined by using the ratio of mean intensity. Then the superpixel generation is performed by energy minimizing with graph cut based energy minimization method. Experimental results on both synthetic and real SAR image data verify the good performance of the proposed approach. Compared with several superpixel approaches, the proposed approach can deal with speckle noise more effectively, resulting in better applicability for SAR images.
{"title":"SAR image superpixels by minimizing a statistical model and ratio of mean intensity based energy","authors":"Jilan Feng, Y. Pi, Jianyu Yang","doi":"10.1109/ICCW.2013.6649365","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649365","url":null,"abstract":"Superpixel based SAR image classification methods can take advantage of the contextual information in SAR images effectively, leading to robust classification results. The accuracy of superpixel generation has great impact on the performance of the following classification stage. In this paper, based on the property of SAR images, an energy minimizing based superpixel generation approach is proposed for SAR images. The energy function is composed of two parts. The data term is defined according to the statistical characteristic of SAR images, and the regularization term is defined by using the ratio of mean intensity. Then the superpixel generation is performed by energy minimizing with graph cut based energy minimization method. Experimental results on both synthetic and real SAR image data verify the good performance of the proposed approach. Compared with several superpixel approaches, the proposed approach can deal with speckle noise more effectively, resulting in better applicability for SAR images.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131335109","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649408
Hongseok Kim, Hyea Youn Kim, Y. Cho, Seung-Hwan Lee
In this paper, we develop a self organizing mechanism for spectrum breathing and user association in cellular networks employing fractional frequency reuse. In doing this we specifically focus on flow-level cell load balancing under spatially inhomogeneous traffic distributions. Our work adaptively changes the spectrum bandwidth of each base station (BS) so that spectrums of the BSs breathe in and out to balance the loads of the BSs. Spectrum breathing is further combined with α-optimal user association for better load balancing. Our problem is challenging in the sense that the problem is not necessarily a convex optimization. To tackle the difficulty we decouple spectrum breathing and user association by introducing the concept of reference load, which is independent of the spectrum bandwidth. We propose an iterative algorithm that always converges to a fixed point, which is possibly an optimal solution. We verify that the proposed algorithm achieves the optimality by performing exhaustive search. Our extensive simulations demonstrate that the proposed algorithm significantly improves the system performs: decreasing the delay more than 10 times or increasing the admittable traffic load by more than 125%.
{"title":"Spectrum breathing and cell load balancing for self organizing wireless networks","authors":"Hongseok Kim, Hyea Youn Kim, Y. Cho, Seung-Hwan Lee","doi":"10.1109/ICCW.2013.6649408","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649408","url":null,"abstract":"In this paper, we develop a self organizing mechanism for spectrum breathing and user association in cellular networks employing fractional frequency reuse. In doing this we specifically focus on flow-level cell load balancing under spatially inhomogeneous traffic distributions. Our work adaptively changes the spectrum bandwidth of each base station (BS) so that spectrums of the BSs breathe in and out to balance the loads of the BSs. Spectrum breathing is further combined with α-optimal user association for better load balancing. Our problem is challenging in the sense that the problem is not necessarily a convex optimization. To tackle the difficulty we decouple spectrum breathing and user association by introducing the concept of reference load, which is independent of the spectrum bandwidth. We propose an iterative algorithm that always converges to a fixed point, which is possibly an optimal solution. We verify that the proposed algorithm achieves the optimality by performing exhaustive search. Our extensive simulations demonstrate that the proposed algorithm significantly improves the system performs: decreasing the delay more than 10 times or increasing the admittable traffic load by more than 125%.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130570008","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649302
Jaehyun Park, B. Clerckx
This paper investigates transmission strategies for joint wireless information and energy transfer in a two-user MIMO interference channel, in which each receiver either decodes the incoming information data (information decoding, ID) or harvests the RF energy (energy harvesting, EH) to operate with a potentially perpetual energy supply. In the two-user interference channel, we have four different scenarios according to the receiver mode - (ID1, ID2), (EH1, EH2), (EH1, ID2), and (ID1, EH2). For single-operation modes such as (ID1, ID2) and (EH1, EH2), the optimal transmission strategies achieving either maximum information bit rate or maximum harvested energy are derived - iterative water filling and rank-one energy beamforming. For (EH1, ID2), and (ID1, EH2), the achievable rate-energy (R-E) tradeoff region is investigated when one of the transmitters takes a rank-one energy beamforming and the other transmitter takes “water-filling-like” approach. Here, for the rank-one energy beamforming, the transmitter can take two different strategies - maximum energy beamforming (MEB) and minimum leakage beamforming (MLB). Finally, a new rank-one energy beamforming strategy - signal-to-leakage-and-energy ratio (SLER) maximization beamforming - is proposed.
{"title":"Transmission strategies for joint wireless information and energy transfer in a two-user MIMO interference channel","authors":"Jaehyun Park, B. Clerckx","doi":"10.1109/ICCW.2013.6649302","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649302","url":null,"abstract":"This paper investigates transmission strategies for joint wireless information and energy transfer in a two-user MIMO interference channel, in which each receiver either decodes the incoming information data (information decoding, ID) or harvests the RF energy (energy harvesting, EH) to operate with a potentially perpetual energy supply. In the two-user interference channel, we have four different scenarios according to the receiver mode - (ID<sub>1</sub>, ID<sub>2</sub>), (EH<sub>1</sub>, EH<sub>2</sub>), (EH<sub>1</sub>, ID<sub>2</sub>), and (ID<sub>1</sub>, EH<sub>2</sub>). For single-operation modes such as (ID<sub>1</sub>, ID<sub>2</sub>) and (EH<sub>1</sub>, EH<sub>2</sub>), the optimal transmission strategies achieving either maximum information bit rate or maximum harvested energy are derived - iterative water filling and rank-one energy beamforming. For (EH<sub>1</sub>, ID<sub>2</sub>), and (ID<sub>1</sub>, EH<sub>2</sub>), the achievable rate-energy (R-E) tradeoff region is investigated when one of the transmitters takes a rank-one energy beamforming and the other transmitter takes “water-filling-like” approach. Here, for the rank-one energy beamforming, the transmitter can take two different strategies - maximum energy beamforming (MEB) and minimum leakage beamforming (MLB). Finally, a new rank-one energy beamforming strategy - signal-to-leakage-and-energy ratio (SLER) maximization beamforming - is proposed.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147449","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649392
M. Zeng, S. Leng, Yan Zhang
In the last few decades, environmental impact of the petroleum-based transportation system, along with the lack of oil, has led to renewed interest in Electric Vehicles (EVs). The electric power grid has to supply sufficient electric power as the energy source of EV. In order to satisfy the huge demand of electric power by the continuously growing EVs, the grid should be innovated towards smart grid with scattered structure, intermittent renewable energy, efficient scheduling policies as well as the advanced Information and Communication Technologies (ICT). With the aid of the Vehicle-to-Grid (V2G) system, EVs are able to be charged or discharge according to the varying electric load and price of electricity. In this paper, we propose adaptable scheduling schemes for the electric charging/feedback of EVs in either a mobile mode or a parking mode. The charging scheduling scheme in the mobile mode focuses on minimizing the delay of charge, whereas the scheme of parking mode dedicates to minimizing the peak-to-average ratio of power grid load and the charging cost. Moreover, electricity feedback is integrated into the parking mode for the decrease of the load offered by grid. Based on the actual daily load of electric power in a city of China, simulation experiments have been conducted to validate the efficiency of the proposed schemes.
{"title":"Power charging and discharging scheduling for V2G networks in the smart grid","authors":"M. Zeng, S. Leng, Yan Zhang","doi":"10.1109/ICCW.2013.6649392","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649392","url":null,"abstract":"In the last few decades, environmental impact of the petroleum-based transportation system, along with the lack of oil, has led to renewed interest in Electric Vehicles (EVs). The electric power grid has to supply sufficient electric power as the energy source of EV. In order to satisfy the huge demand of electric power by the continuously growing EVs, the grid should be innovated towards smart grid with scattered structure, intermittent renewable energy, efficient scheduling policies as well as the advanced Information and Communication Technologies (ICT). With the aid of the Vehicle-to-Grid (V2G) system, EVs are able to be charged or discharge according to the varying electric load and price of electricity. In this paper, we propose adaptable scheduling schemes for the electric charging/feedback of EVs in either a mobile mode or a parking mode. The charging scheduling scheme in the mobile mode focuses on minimizing the delay of charge, whereas the scheme of parking mode dedicates to minimizing the peak-to-average ratio of power grid load and the charging cost. Moreover, electricity feedback is integrated into the parking mode for the decrease of the load offered by grid. Based on the actual daily load of electric power in a city of China, simulation experiments have been conducted to validate the efficiency of the proposed schemes.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130325798","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649385
F. Llario, S. Sendra, L. Parra, J. Mauri
Wolves attacks to sheep and goats are very frequent at night. It has caused great economic losses in some countries. When an animal feels the presence of people or different animals, it experiences an increase of its cardiac frequency and corporal temperature. In this paper, we present a network of wireless nodes using IEEE 802.15.4 technology, which are capable of monitoring the vital signs of the sheep and goats. This smart system allows us to detect the collective stress caused by the attack of any predator during the night. It uses a learning system which decision is taken after having received 5 messages. When the system detects these anomalies in the animal's behavior, it sends an alarm signal to alert the person in charge of the livestock facility and activates visual and acoustic alarms capable of frighten the predators and prowlers.
{"title":"Detection and protection of the attacks to the sheep and goats using an intelligent wireless sensor network","authors":"F. Llario, S. Sendra, L. Parra, J. Mauri","doi":"10.1109/ICCW.2013.6649385","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649385","url":null,"abstract":"Wolves attacks to sheep and goats are very frequent at night. It has caused great economic losses in some countries. When an animal feels the presence of people or different animals, it experiences an increase of its cardiac frequency and corporal temperature. In this paper, we present a network of wireless nodes using IEEE 802.15.4 technology, which are capable of monitoring the vital signs of the sheep and goats. This smart system allows us to detect the collective stress caused by the attack of any predator during the night. It uses a learning system which decision is taken after having received 5 messages. When the system detects these anomalies in the animal's behavior, it sends an alarm signal to alert the person in charge of the livestock facility and activates visual and acoustic alarms capable of frighten the predators and prowlers.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133947706","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649447
Francesco Carpine, Claudio Mazzariello, Carlo Sansone
IRC botnets have been rapidly growing in number, in infected network hosts, and, most of all, in size of caused damages. Hence, there is the need of a real-time detection solution, as accurate as possible; the earlier a botnet is discovered, the smaller will be its potential impact. In order to tackle these issues, our approach to IRC Botnet detection considers both the online context and the time consumption problem. In particular, we use both statistical and digrams-based features to build a two-class behavioral model. Then, we setup a fast detection engine based on an unsupervised incremental learning method. Several tests performed on real data (botnet and non-botnet IRC channels) revealed the effectiveness of the entire proposed solution.
{"title":"Online IRC botnet detection using a SOINN classifier","authors":"Francesco Carpine, Claudio Mazzariello, Carlo Sansone","doi":"10.1109/ICCW.2013.6649447","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649447","url":null,"abstract":"IRC botnets have been rapidly growing in number, in infected network hosts, and, most of all, in size of caused damages. Hence, there is the need of a real-time detection solution, as accurate as possible; the earlier a botnet is discovered, the smaller will be its potential impact. In order to tackle these issues, our approach to IRC Botnet detection considers both the online context and the time consumption problem. In particular, we use both statistical and digrams-based features to build a two-class behavioral model. Then, we setup a fast detection engine based on an unsupervised incremental learning method. Several tests performed on real data (botnet and non-botnet IRC channels) revealed the effectiveness of the entire proposed solution.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134095982","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 : 2013-06-09DOI: 10.1109/ICCW.2013.6649335
Jun-Hyuk Choi, Y. Woo, Seung-Man Chun, Jongtae Park
In order to provide the mobile multimedia service cost-effectively, the smartphone user's demand on free access to widely deployed Wireless LAN (WLAN) systems has been greatly increasing. This is because 3G or 4G mobile networks are usually expensive, and slower than WLAN. Unfortunately, although secure WLANs are installed widely, they are usually not shared. In this article, we have designed and implemented secure WLAN access sharing system using Social Network Service (SNS). A new secure WLAN access sharing model has been designed and implemented, in which the social trust strength between people is employed for secure WLAN access control.
{"title":"A secure WLAN access sharing system using SNS","authors":"Jun-Hyuk Choi, Y. Woo, Seung-Man Chun, Jongtae Park","doi":"10.1109/ICCW.2013.6649335","DOIUrl":"https://doi.org/10.1109/ICCW.2013.6649335","url":null,"abstract":"In order to provide the mobile multimedia service cost-effectively, the smartphone user's demand on free access to widely deployed Wireless LAN (WLAN) systems has been greatly increasing. This is because 3G or 4G mobile networks are usually expensive, and slower than WLAN. Unfortunately, although secure WLANs are installed widely, they are usually not shared. In this article, we have designed and implemented secure WLAN access sharing system using Social Network Service (SNS). A new secure WLAN access sharing model has been designed and implemented, in which the social trust strength between people is employed for secure WLAN access control.","PeriodicalId":252497,"journal":{"name":"2013 IEEE International Conference on Communications Workshops (ICC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134237857","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
扫码关注我们
求助内容：
应助结果提醒方式：