2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)最新文献

筛选
英文 中文
Experimental emergency communication systems using USRP and GNU radio platform 采用USRP和GNU无线电平台的实验应急通信系统
Shin-Ming Cheng, W. Huang, R. Cheng, Chai-Hien Gan
{"title":"Experimental emergency communication systems using USRP and GNU radio platform","authors":"Shin-Ming Cheng, W. Huang, R. Cheng, Chai-Hien Gan","doi":"10.4108/EAI.19-8-2015.2260927","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260927","url":null,"abstract":"One lesson learned from recent large-scale disasters is that the destroyed communication infrastructure severely burdens the relief operation and the recovery mission. How to establish a temporary emergency communication system (ECS) providing reliable communication channels upon deployment becomes a must. An Universal Software Radio Peripheral platform with GNU Radio is employed for experimential purpose with basic voice communications and short message services. With the aid of pre-installed APP in victims' smartphone, valuable information about the victim, such as the identity, location, or physical condition, can be automatically delivered to the developed BS, which significantly facilitates the rescue work. Furthermore, BS acting as a relay could provide direct voice connectivity between victims and relief workers, thereby avoiding considerable fatalities.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115710050","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}
引用次数: 5
Tiered licensed-assisted access with paid prioritization: A game theoretic approach for unlicensed LTE 具有付费优先级的分层许可辅助访问:非许可LTE的博弈论方法
Ting-Hsuan Wu, Mei-Ju Shih, Hung-Yu Wei
{"title":"Tiered licensed-assisted access with paid prioritization: A game theoretic approach for unlicensed LTE","authors":"Ting-Hsuan Wu, Mei-Ju Shih, Hung-Yu Wei","doi":"10.4108/EAI.19-8-2015.2260882","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260882","url":null,"abstract":"The network congestion is caused by the rapidly growing data traffic and the limited wireless radio resources. In addition to the licensed spectrum, the access to unlicensed spectrum (e.g., LAA) brings hope for the service provider (SP) to mitigate the deficiency of radio resources. The premium peering deal with the content providers (CPs) can be an approach to efficiently allocate the scarce radio resources to the CPs with higher traffic load and QoS requirement. This work contributes to a content premium pricing framework for one SP and several CPs, where the SP possesses both LTE and LAA. Through the four-stage Stackelberg game, job market signaling game and second price auction, we derive the optimal bandwidth demand of each CP, the optimal amounts of licensed bandwidth and unlicensed bandwidth required by the SP, the premium access fee and basic access fee. Analysis shows that the CPs and the SP all benefit from the premium access deal. Furthermore, there is a tradeoff between improvement and variability of the SP's profit when introducing LAA.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124564730","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}
引用次数: 2
The fast collection of radio fingerprint for WiFi-based indoor positioning system 基于wifi的室内定位系统无线指纹的快速采集
Hung-Huan Liu, Chung-Wei Liao, Wei-Hsiang Lo
{"title":"The fast collection of radio fingerprint for WiFi-based indoor positioning system","authors":"Hung-Huan Liu, Chung-Wei Liao, Wei-Hsiang Lo","doi":"10.4108/EAI.19-8-2015.2261020","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2261020","url":null,"abstract":"Mobile communications and Internet have become one of the most important services nowadays. Most mobile devices, such as cell phone, PDA, and laptop computer, equipped with the WiFi, GPS, and Bluetooth as their standard, build-in equipment, and people have got used to use mobile services in their daily life. One interesting service is Wifi-based indoor positioning system (IPS) that attracts many researchers devote their effort to it. Many researches in IPS determine the user location by the method of scene analysis. This method needs to collect the RSSI of APs from the interested place beforehand to build the building's WiFi radio fingerprint database and this task is time-consuming. Meanwhile, it also needs to resample very often in order to keep the accuracy of the positioning result. In this paper, we design and test a fast setup algorithm for collecting those sampling information. The Android smartphone and its build-in motion sensors were used to help collecting the AP's RSSI. We use the motion sensor to detect the pace while walking and collect the AP's RSSI in every step. The method gets through the sampling work in a walking duration which is much shorter than traditional method. This paper also compares the fast setup method with the traditional method from the positioning accuracy point of view. Experiments show that there is no significant difference on positioning accuracy between them.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117151184","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}
引用次数: 9
Streaming data transmission by using spatially coupled LDPC codes 利用空间耦合LDPC码进行流数据传输
Sijie Wang, Zhongwei Si, Xuehong Lin
{"title":"Streaming data transmission by using spatially coupled LDPC codes","authors":"Sijie Wang, Zhongwei Si, Xuehong Lin","doi":"10.4108/EAI.19-8-2015.2260883","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260883","url":null,"abstract":"With the tremendous development of mobile Internet and big data, much attention has been attracted on streaming data transmission. In this paper, we propose a quasi real-time transmission scheme using spatially coupled LDPC codes for forward error correction. Recursive encoder and sliding-window decoder with low-latency and low-complexity are employed for data transmission. When any error is reported, additional information is requested and retransmitted. Capacity-approaching performance can be achieved by constructing proper ensembles according to channel conditions. Theoretical thresholds and simulation results are provided, which illustrate the good performance.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116848983","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}
引用次数: 1
Maximizing the information diffusion opportunity in the cyber-physical network 最大化信息在信息物理网络中的传播机会
Hongliang Lu, Xuan Dong, Wenxiang Li, Shaohe Lv, Xiaodong Wang, Wei Chen
{"title":"Maximizing the information diffusion opportunity in the cyber-physical network","authors":"Hongliang Lu, Xuan Dong, Wenxiang Li, Shaohe Lv, Xiaodong Wang, Wei Chen","doi":"10.4108/EAI.19-8-2015.2260912","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260912","url":null,"abstract":"Our daily life is changing by the smart objects, such as smart watches, smart phones etc. They make the cyber world and the physical world integrated by their abundant abilities of sensing, communication and computation etc. Focusing on a wide range of the integrated network, a statistical based strategy was introduced to get a special kind of link between objects, the statistical probability communication link. To get a maximized information spread probability for grouped people, this paper introduced a distributed, yet efficient algorithm naming DMPID algorithm, for finding a sub-network to spread people oriented inforamtion. The DMPID algorithm take the size of the selection and the information spread probability into account, and made a balance between the two parameters. Extended simulation showed that the DMPID algorithm performs well in different distributed networks.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128832915","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}
引用次数: 0
Scheduling both GBR and non-GBR uplink bearers based on moving average of data rate 基于数据速率的移动平均调度GBR和非GBR上行承载
Fang-Chang Kuo, Kuo-Chang Ting, Chih-Cheng Tseng, Hwang-Cheng Wang, Ming-Wei Chen
{"title":"Scheduling both GBR and non-GBR uplink bearers based on moving average of data rate","authors":"Fang-Chang Kuo, Kuo-Chang Ting, Chih-Cheng Tseng, Hwang-Cheng Wang, Ming-Wei Chen","doi":"10.4108/EAI.19-8-2015.2260881","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260881","url":null,"abstract":"Many resource allocation schemes have been proposed based on different criteria such as system throughput, fairness, transmission power, user priority and others. According to the 3GPP specifications, however, as long as a GBR (guaranteed bit rate) bearer is admitted, eNB has to allocate resource blocks (RBs) for this bearer to ensure its transmission right. At the same time, eNB also must distribute the remaining RBs to non-GBR bearers so as to achieve high radio resource utilization. However, 3GPP has not specified how to measure GBR. In this paper, we use exponentially weighted moving average (EWMA) to define the measurement of data rate and show that it is beneficial to the scheduling on both UE and eNB sides. We also present a scheduling scheme, AAG-2, which aims at ensuring QoS for all in-progress GBR sessions, while at the same time efficiently allocating RBs to non-GBR sessions.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"C-29 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120998072","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}
引用次数: 1
Providing adaptive quality of security in quantum networks 在量子网络中提供自适应的安全质量
Bao-kang Zhao, Ziling Wei, Bo Liu, Jinshu Su, I. You
{"title":"Providing adaptive quality of security in quantum networks","authors":"Bao-kang Zhao, Ziling Wei, Bo Liu, Jinshu Su, I. You","doi":"10.4108/EAI.19-8-2015.2260982","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260982","url":null,"abstract":"Recently, several Quantum Key Distribution (QKD) networks, such as Tokyo QKD, SECOQC, have been built to evaluate the quantum based OTP(One Time Pad) secure communication. As an ideal unconditional secure technique, OTP requires the key rate the same as the information rate. However, comparing with high speed information traffic (Gbps), the key generation rate of QKD is very poor(Kbps). Therefore, in practical QKD networks, it is difficult to support numerous applications and multiple users simultaneously. To address this issue, we argue that it is more practical to provide quality of security instead of OTP in quantum networks. We further propose ASM, an Adaptive Security Selection Mechanism for quantum networks based on the Analytic Hierarchy Process (AHP). In ASM, services can select an appropriate encryption algorithm that satisfies the proper security level and performance metrics under the limit of the key generation rate. We also implement ASM under our RT-QKD platform, and evaluate its performance. Experimental results demonstrate that ASM can select the optimal algorithm to meet the requirement of security and performance under an acceptable cost.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127629763","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}
引用次数: 0
A dynamic self-adaptive resource-load evaluation method in cloud computing 云计算中动态自适应资源负荷评估方法
Liyun Zuo, Lei Shu, Shoubin Dong, Zhangbing Zhou, Lei Wang
{"title":"A dynamic self-adaptive resource-load evaluation method in cloud computing","authors":"Liyun Zuo, Lei Shu, Shoubin Dong, Zhangbing Zhou, Lei Wang","doi":"10.4108/EAI.19-8-2015.2260146","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260146","url":null,"abstract":"Cloud resource and its load have dynamic characteristics. To address this challenge, a dynamic self-adaptive evaluation method (termed SDWM) is proposed in this paper. SDWM uses some dynamic evaluation indicators to evaluate resource state more accurately. And it divides the resource load into three states - Overload, Normal and Idle by the self-adaptive threshold. Then it migrates overload resources to balance load, and releases idle resources whose idle times exceed a threshold to save energy, which can effectively improve system utilization. Experimental results demonstrate SDWM has better adaptability than other similar methods when resources dynamically join or exit. This shows the positive effect of the dynamic self-adaptive threshold.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131460677","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}
引用次数: 0
Cognitive vertical handover in heterogeneous networks 异构网络中的认知垂直切换
Yu-Jui Liu, Shin-Ming Cheng, Po-Yao (Bernie) Huang
{"title":"Cognitive vertical handover in heterogeneous networks","authors":"Yu-Jui Liu, Shin-Ming Cheng, Po-Yao (Bernie) Huang","doi":"10.4108/EAI.19-8-2015.2260928","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260928","url":null,"abstract":"One of the major design issues in heterogeneous wireless networks is the support of seamless vertical handover for mobile users. The cognitive capability for mobile terminal enables the functionalities of system parameter estimation and learning. By utilizing these parameters, cognitive users make a handover decision to select an appropriate point of attachment (PoA) among multiple primary radio access technologies/networks without explicit negotiation with surrounding PoAs, and thus handover latency and signaling overhead are minimized. A novel cognitive vertical handover process is proposed including system capacity estimation mechanisms and vertical handover decision process. The vertical handover decision problem is formulated as a Markov decision process and its performance is better than other distributed schemes which do not consider the network side's information from the numerical results.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127060083","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}
引用次数: 1
PFCS: Pre-buffering-aware flow control scheme for LTE-advanced relay networks PFCS: LTE-advanced中继网络的预缓冲感知流量控制方案
Ping-Chen Lin, R. Cheng, Xian Wang, Putu Ayu Rhamani Suryadhi
{"title":"PFCS: Pre-buffering-aware flow control scheme for LTE-advanced relay networks","authors":"Ping-Chen Lin, R. Cheng, Xian Wang, Putu Ayu Rhamani Suryadhi","doi":"10.4108/EAI.19-8-2015.2260852","DOIUrl":"https://doi.org/10.4108/EAI.19-8-2015.2260852","url":null,"abstract":"Relay technology is one of the techniques proposed to enhance the capacity of Long Term Evolution-Advanced (LTE-A) networks. In an LTE-A relay network, each serving relay node has to store packets for its mobile users and forward the remaining packets to another node during handover. However, increasing the number of forwarded packets will result in the degradation of the users throughput. Flow control and pre-buffering schemes are the two main schemes proposed to reduce the number of forwarded packets in LTE-A relay networks. Existing studies assumes the two schemes are independently operated. However, ignoring the effect of buffer overflow at the pre-buffering queue in a flow control scheme may result in ineffective operation. This paper presents a pre-buffering-aware flow control scheme (PFCS) for an LTE-A relay network that jointly considers the effects of both flow control and pre-buffering schemes. The proposed PFCS can significantly improve user's throughput by preventing both buffer overflow and buffer underflow of the local queue at the serving relay node and minimizing the number of forwarded packets. Simulation results show that the PFCS can provide a better throughput than the traditional flow control schemes because the effect of the pre-buffering scheme can minimize the number of forwarded packets.","PeriodicalId":152628,"journal":{"name":"2015 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QSHINE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129182895","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信