2017 International Conference on Computer, Information and Telecommunication Systems (CITS)最新文献

筛选
英文 中文
WBAN on hardware: Implementation and optimization based on IEEE 802.15.6 硬件上的WBAN:基于IEEE 802.15.6的实现与优化
Xiaonan Su, Changle Li, Yueyang Song, Xiaoming Yuan
{"title":"WBAN on hardware: Implementation and optimization based on IEEE 802.15.6","authors":"Xiaonan Su, Changle Li, Yueyang Song, Xiaoming Yuan","doi":"10.1109/CITS.2017.8035311","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035311","url":null,"abstract":"Various current trends such as ever growing population have effectively promoted the growth of Wireless Body Area Network (WBAN). Most of the existing works in WBAN focus on theoretical performance enhancement, whereas works in implementation which is of significance in validation and further research are pretty rare. Therefore, a reliable and efficient system designed both in hardware and software based on the IEEE 802.15.6, named WBAN prototype system, is proposed and implemented in this paper. We constructed the prototype system from modules to system architecture, and conducted a set of experiments to verify the prototype system as well as optimize parameters in IEEE 802.15.6. The prototype system is ascertained to meet basic requirements in terms of quality of service indexes by extensive experiments, among which we further explored packet error rate and frame error rate that can be a reference for future WBAN studies.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114264300","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}
引用次数: 4
Genetic algorithm and probability based routing protocol for Opportunistic Networks 基于遗传算法和概率的机会网络路由协议
D. Sharma, S. K. Dhurandher, M. Obaidat, Aman Bansal, Apoorv Gupta
{"title":"Genetic algorithm and probability based routing protocol for Opportunistic Networks","authors":"D. Sharma, S. K. Dhurandher, M. Obaidat, Aman Bansal, Apoorv Gupta","doi":"10.1109/CITS.2017.8035288","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035288","url":null,"abstract":"The random nature of network topology is a major challenge while developing new routing protocol for Opportunistic Networks (OppNets). Additionally, other factors like intermittent connections, limited bandwidth etc. further restrict the performance of existing routing protocols. In this paper, an advanced context aware routing protocol called GAP is proposed. The proposed protocol efficiently combines the benefits of Genetic Algorithm and Probabilistic Routing to route the message from the source to destination. The protocol uses the Genetic algorithm to predict the path a message would take if it is transferred to the neighbouring node. A Fitness function is defined to evaluate the efficiency of this predicted path. The message is transferred to the neighbouring node only if the fitness value of the predicted path is greater than a threshold value, which is calculated by implementing the concepts of probabilistic routing. Simulation results show that the GAP routing protocol outperforms Prophet, Spray and Wait and GAER protocol in terms of message delivery ratio, overhead ratio and average latency.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"32 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132502236","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}
引用次数: 6
Hierarchical fairness based re-provisioning in post-disaster telecom networks 基于分层公平的灾后电信网络重新配置
Ning-Hai Bao, Ya-Kun Wu, Guo-Qing Su, Yuan Yuan, D. Luo
{"title":"Hierarchical fairness based re-provisioning in post-disaster telecom networks","authors":"Ning-Hai Bao, Ya-Kun Wu, Guo-Qing Su, Yuan Yuan, D. Luo","doi":"10.1109/CITS.2017.8035298","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035298","url":null,"abstract":"Wavelength-division-multiplexing (WDM) optical networks as the most promising telecom backbone are facing critical threaten from large-scale disasters, such as earthquake, tsunami, hurricane, and human attack. Disasters may cause severe damage to network components (links/nodes) and drastic traffic fluctuations in post-disaster phases, leading to resource crunch. In this paper, we study optimal traffic re-provisioning under resource crunch and propose a hierarchical fairness based re-provisioning (HFR) scheme to maintain service connectivity and balance traffic flow in post-disaster optical networks. By exploiting a multistage re-provisioning process and a cyclic re-provisioning process, HFR can effectively maintain service connectivity and achieve a hierarchical fairness on traffic distribution. Numerical results show that, the proposed HFR, compared with some counterparts, can obtain satisfactory performance in terms of connection loss ratio, traffic loss ratio, and fairness of traffic distribution.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125223239","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}
引用次数: 3
Trust-enhanced matrix factorization using PageRank for recommender system 基于PageRank的基于信任增强的矩阵分解推荐系统
Jiawei Lu, Yu Guo, Zhenqiang Mi, Yang Yang
{"title":"Trust-enhanced matrix factorization using PageRank for recommender system","authors":"Jiawei Lu, Yu Guo, Zhenqiang Mi, Yang Yang","doi":"10.1109/CITS.2017.8035314","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035314","url":null,"abstract":"As the most widely used recommendation algorithm, collaborative filtering (CF) has been studied for many years due to its simplicity and effectiveness. The two main categories of CF have their own shortcomings. Memory-based CF can't generate accurate results when faced with data sparsity; and model-based CF always loses the information between users or items. To alleviate this problem, we propose an algorithm that integrate user trust into the traditional matrix factorization (MF). Trust network is introduced to utilize all the trusted users to help make prediction. Experiments are performed on Epinions dataset and FilmTrust dataset to compare proposed approach with traditional ones. The reported results indicate that the idea of employing user trust into MF is valid and can improve the recommendation quality.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134487471","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}
引用次数: 6
Efficient scheduling for multicasting hard deadline constrained prioritized data via two interfaces 通过两个接口有效调度多播硬截止日期约束的优先级数据
Guojie Hu, Kui Xu, Youyun Xu
{"title":"Efficient scheduling for multicasting hard deadline constrained prioritized data via two interfaces","authors":"Guojie Hu, Kui Xu, Youyun Xu","doi":"10.1109/CITS.2017.8035331","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035331","url":null,"abstract":"This paper considers the transmission scene of multicasting hard deadline constrained prioritized (HDCP) packets via cellular links and D2D links. That is to say, each device with two wireless interfaces could receive HDCP packets from the base station (BS) and transmit or receive HDCP packets from other devices concurrently. In this transmission scene, we study the problem of maximizing the network throughput and minimizing the mean delivery delay per packet. Then we propose a greedy scheduling (GS_Cellular&D2D) algorithm, which jointly selects the transmit device and schedules the coded packet transmitted from the BS and selected device at each time slot in order to maximize one time step future-reward. As contrast, we also analyze another two algorithms: ARQ_Cellular&D2D and RNC_Cellular&D2D. Simulation results show the excellent performance of GS_Cellular&D2D.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115535679","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
Performance evaluation of reliable communications for wireless in-body sensor networks 无线体内传感器网络可靠通信性能评估
Liting Zhang, M. Leeson, Yangzhe Liao, M. Higgins
{"title":"Performance evaluation of reliable communications for wireless in-body sensor networks","authors":"Liting Zhang, M. Leeson, Yangzhe Liao, M. Higgins","doi":"10.1109/CITS.2017.8035315","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035315","url":null,"abstract":"Wireless in-body sensor networks are attracting increasing attention for numerous healthcare applications and medical services. Implant devices are widely employed to measure physiological signals inside the human body in a simple, long lifetime and continuous approach. However, due to the strict technical requirements of implant devices, there exist numerous key research challenges in this area. Considering realistic transmission power requirements based on the IEEE 802.15.6 standard safety regulations, the channel characteristics of implant to deep implant and implant to body surface communication scenarios are investigated. Furthermore, multiple vital quality of service (QoS) factors of implant communication channels are studied regarding channel capacity, bit error rate (BER), link quality and data rate. The system performance evaluation indicates that the data transmission rate can be optimized up to 10 Mbps. Furthermore, the transmission distance supported by in-body to on-body communication path is 2 meters, at 1 µW while the in-body to deep tissue region communication channel achieves less than 1 meter. The results proposed in this paper give an outlook of the intra-body networking system performance and can be applied to in-body communication system implementation research.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"23 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132388780","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
Detecting the Internet Water Army via comprehensive behavioral features using large-scale E-commerce reviews 利用大规模电子商务评论,通过综合行为特征来检测互联网水军
B. Guo, Hao Wang, Zhaojun Yu, Yu Sun
{"title":"Detecting the Internet Water Army via comprehensive behavioral features using large-scale E-commerce reviews","authors":"B. Guo, Hao Wang, Zhaojun Yu, Yu Sun","doi":"10.1109/CITS.2017.8035320","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035320","url":null,"abstract":"Online reviews play a crucial role in helping consumers to make purchase decisions. However, a severe problem Internet Water Army (a large amount of paid posters who write inauthentic reviews) emerge in many E-commerce websites recently which dramatically undermines the value of user reviews. Although the word Internet Water Army originated from China, some other countries also suffered from this problem. Many organized underground paid poster groups found it extremely profitable to mislead the consumers by writing fake reviews. It had become more and more challenging to accurately detect the water army who could alter their writing style. In this paper, we design a comprehensive set of features to compare paid posters against normal users on different dimensions. Then we build an ensemble detection model of seven different algorithms. Our model has reached 0.726 in AUC measure and 0.683 in F1 measure on JD dataset, 0.926 in AUC measure and 0.871 in F1 measure on Amazon dataset, which outperforms previous studies. Our work provides some practical solutions and guidance to this severe problem for the whole E-commerce industry.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125439","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
Translating OpenACC program for HAS environment 为HAS环境翻译OpenACC程序
Han-Ping Lo, J. Shann
{"title":"Translating OpenACC program for HAS environment","authors":"Han-Ping Lo, J. Shann","doi":"10.1109/CITS.2017.8035283","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035283","url":null,"abstract":"Heterogeneous System Architecture (HSA) is a newly arising heterogeneous multiprocessor platform which may improve the heavy data transmission between CPU and GPU in traditional heterogeneous multiprocessor platforms through shared virtual memory. However, as other heterogeneous multiprocessor platforms, it is complex and error-prone to write HSA programs. Therefore, we design and implement a translation framework based on LLVM for automatically translating OpenACC programs, directive-based parallel programming programs, into HSA programs. The main components of the framework include an extension version of Clang, a PLIR-annotation parser, and an HAS host/kernel IR generator. The experiment result shows that the translated HSA programs generated by our OpenACC compiler achieve 7.78× speedups in average with respect to the corresponding sequential programs. Moreover, compared with the OpenMP compiler proposed by HSA foundation, our OpenACC compiler achieves 2.91× speedups in average.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131789346","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
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学术文献互助群
群 号:481959085
Book学术官方微信