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

筛选
英文 中文
A retail application based on indoor location with grid estimations 基于网格估计的室内定位零售应用
D. Cai
{"title":"A retail application based on indoor location with grid estimations","authors":"D. Cai","doi":"10.1109/CITS.2014.6878970","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878970","url":null,"abstract":"Indoor positioning systems have many technological varieties and application scenarios. Through development of a LBS service for targeted retail scenario we have adopted Wi-Fi signal strength fingerprinting considering cost, resolution and scaling-up factors. To tackle the accuracy problem of returned location coordinates and make the LBS service more impactful, we have looked into past studies of probabilistic smoothing techniques such as Bayesian modeling, clustering and regression neural network. The robustness of these techniques was found sensitive to signal attenuation due to the complexity of indoor setup and dynamics of on-site crowds. We have therefore come out with a grid estimation method for the collected coordinates on top of Bayesian smoothing, which was proved to be simple but effective for the proposed retail scenario.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115686926","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
A novel approach for throughput analysis of multi-hop multi-rate WLANs 一种新的多跳多速率无线局域网吞吐量分析方法
B. Alkandari, K. Pahlavan
{"title":"A novel approach for throughput analysis of multi-hop multi-rate WLANs","authors":"B. Alkandari, K. Pahlavan","doi":"10.1109/CITS.2014.6878958","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878958","url":null,"abstract":"Nowadays the deployment of the Wireless Local Area Network (WLAN) is under the limelight of the academic community. In a multi-rate data WLAN, the data rate is a function of the distance from the access point (AP). To extend the coverage of the AP to cover a target terminal outside the AP coverage area, relay nodes are deployed between the AP and the target terminal. Therefore, for a given relationship between the throughput and the distance, and a given distance between the access point and the target receiver, there is a minimum number of nodes that provides the maximum throughput to the target receiver. It is always desirable to optimize the deployment from various aspects. These aspects are application-dependent and they range from energy conservation in sensor networks to throughput and coverage maximization in data networks. This paper presents a novel approach to determine the optimal bounds for the Medium Access Control (MAC) throughput at the target receiver in a multi-hop multi-rate wireless data network. We use the principles of linear programming and a model for the physical layer (PHY) throughput-distance relationship to determine the optimal performance bounds for the MAC throughput of a target terminal as a function of distance from the AP and the number of hops. Additionally, we determine the physical locations for the relays to reach the optimal MAC throughput for a target terminal located at a specific distance from the AP.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125806767","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
Robot and human teacher 机器人和人类老师
Noraidah Blar, S. Idris, F. A. Jafar, Mahasan Mat Ali
{"title":"Robot and human teacher","authors":"Noraidah Blar, S. Idris, F. A. Jafar, Mahasan Mat Ali","doi":"10.1109/CITS.2014.6878953","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878953","url":null,"abstract":"In this day and age, robot teacher application in education system has been spread throughout the world. The usage of robot teacher is believed to improve the teaching lesson that delivered by human teacher. For human teacher, there are methods that can be used to measure the teaching effectiveness. What about the effectiveness of teaching by robot teacher? Therefore, a method that suitable to measure the effectiveness of teaching by robot teacher is discussed in this research. The method that will be used to measure the effectiveness is by giving quiz and questionnaire to selected students. A quiz is constructed according to elements that required in measuring the effectiveness for teaching that is observation and understanding. To measure the interaction between students to robot teacher and human teacher, a questionnaire is constructed and given to the students after a lesson is delivered by both teachers. The robot teacher was programmed to deliver teaching. The quiz and questionnaire was constructed and ready to hand out to audience. The important aspects in measuring effectiveness of teaching students by using robot teacher are observation, understanding, and interaction.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129341401","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
A handover prediction mechanism based on LTE-A UE history information 基于LTE-A用户历史信息的切换预测机制
Ying-Hong Wang, Jui-Lin Chang, Guo-Rui Huang
{"title":"A handover prediction mechanism based on LTE-A UE history information","authors":"Ying-Hong Wang, Jui-Lin Chang, Guo-Rui Huang","doi":"10.1109/NBiS.2015.29","DOIUrl":"https://doi.org/10.1109/NBiS.2015.29","url":null,"abstract":"In response to the rapidly developing of wireless communication technology, the deployed of eNB is denser and more complex. The research of how to handover accurately and fast in LTE-A are discussed much in recent years .In 3GPP Release 8, the UE History Information recorded by eNB was first proposed, it's proposed to provide eNB to judge the target eNB when handover. The history information includes the Cell ID and Time UE stayed in cell. We proposed an advance UE history information, reducing the handover failure rate and ping-pong handover rate by using the history information like Region-Domain, Time-Domain and Time To Trigger.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116382643","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}
引用次数: 26
A novel vertical handoff decision making algorithm across Heterogeneous Wireless Networks 一种跨异构无线网络的垂直切换决策算法
N. Omheni, F. Zarai, M. Obaidat, K. Hsiao
{"title":"A novel vertical handoff decision making algorithm across Heterogeneous Wireless Networks","authors":"N. Omheni, F. Zarai, M. Obaidat, K. Hsiao","doi":"10.1109/CITS.2014.6878967","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878967","url":null,"abstract":"Heterogeneous Wireless Networks communication is a combination of various heterogeneous networks. With their complementary characteristics, incorporation of these technologies in the same network in order to provide a full coverage to mobile users causes several challenges such as handover decision making and mobility management. A good handoff decision should avoid unnecessary handovers, which increase the computational network load. In this paper, we present a novel approach for Handover decision making in the context of heterogeneous wireless network. The aim of the proposed scheme is the selection of the most suitable radio access network for each application. Simulation results show that the proposed approach can guarantee QoS requirements and reduce the blocking probability of new and handoff calls.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130220331","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}
引用次数: 19
Discriminative leaf based Hough Forest for vehicle detection 基于区分叶的霍夫森林车辆检测
Xue Fan, Teng Yu, Jingchun Piao, Hyunchu Shin
{"title":"Discriminative leaf based Hough Forest for vehicle detection","authors":"Xue Fan, Teng Yu, Jingchun Piao, Hyunchu Shin","doi":"10.1109/CITS.2014.6878960","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878960","url":null,"abstract":"This paper introduces a discriminative framework for the task of vehicle detection based on Hough Forest. The leaf nodes in Hough Forest framework are not discriminative enough, which means that they do not have the ability to classify whether the test patches ended up in each leaf are positive or negative. Hough votes are assigned to all test patches by Hough forest, including negative test patches, which will introduce a large number of noise votes, even lead to false alarms. Furthermore, most of test patches are negative (background), and negative patches do not contribute informative Hough votes. Aggregating voting information from all patches extracted at each pixel location is really time-consuming. Thus we have developed a framework to classify whether the test patches are positive or not, and only positive test patches (object patches) participate in Hough voting, which will not only reduce noise votes but also increase detection efficiency. We demonstrate that discriminative leaf node framework improves the results of Hough Forest framework and achieves desirable performance on UIUC car datasets.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129935780","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
Secure multi-key file-sharing for cloud storage with erasure coding 安全的多密钥文件共享云存储与擦除编码
Chun-Hsin Wu, Pai-Hsing Wang
{"title":"Secure multi-key file-sharing for cloud storage with erasure coding","authors":"Chun-Hsin Wu, Pai-Hsing Wang","doi":"10.1109/CITS.2014.6878968","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878968","url":null,"abstract":"Cloud storage provides users with immediate access to a broad range of files from anywhere in the world. When users store files in the cloud, however, there are critical concerns with data leakage and integrity issues. In this paper, we propose a new approach that integrates erasure coding with data encryption and data splitting to secure file-sharing for cloud storage. The basic idea of the proposed approach is that a file is not completely stored in the cloud, and only authorized devices or clients have their own unique key, which is derived from erasure coding, to fulfill the file exactly. By investigating three typical erasure codes, we analyze the efficiency and trade-offs of different file splitting strategies. The results show that it is promising to share files securely for cloud storage with erasure coding.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122777686","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
High accuracy and low storage hybrid IP traceback 高精度和低存储混合IP追溯
Ming-Hour Yang, Ming-Chien Yang, Jia-Ning Luo, W. Hsu
{"title":"High accuracy and low storage hybrid IP traceback","authors":"Ming-Hour Yang, Ming-Chien Yang, Jia-Ning Luo, W. Hsu","doi":"10.1109/CITS.2014.6878977","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878977","url":null,"abstract":"Since adversaries may spoof their source IPs in their attacks, traceback schemes have been proposed to identify the attack source. Among these methods, Hybrid IP traceback schemes fuse packet marking and packet logging, using only one packet for traceback and reducing the storage requirements during packet logging. However, if a hybrid traceback scheme logs a packet's digests on a router, the router's storage requirements will increase with the packet numbers. Its storage requirements cannot be bounded. Thus, we propose a 16-bit single packet hybrid IP traceback scheme. In our logging, the storage requirements can be bounded by the number of routes. And our marking can guarantee that fragmented packets can be re-assembled at the destination. Thus, compared with existing hybrid traceback schemes, our proposed scheme has higher accuracy in source tracking and has lower storage requirements for the routers.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127355825","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
Power and Delay-aware Multi-Path Routing Protocol for Ad Hoc Networks Ad Hoc网络的功率和延迟感知多路径路由协议
Salwa Othmen, A. Belghith, F. Zarai, M. Obaidat, L. Kamoun
{"title":"Power and Delay-aware Multi-Path Routing Protocol for Ad Hoc Networks","authors":"Salwa Othmen, A. Belghith, F. Zarai, M. Obaidat, L. Kamoun","doi":"10.1109/CITS.2014.6878956","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878956","url":null,"abstract":"Mobile Ad Hoc Networks (MANETs) also called mesh networks, consist of a large number of mobile nodes that communicate with each other in the absence of any fixed infrastructure or centralized administration. The principle characteristics of MANET are the dynamic topology and the limited battery power of mobile nodes. The discharge of the battery causes many problems such as the loss of the packets and the re-initialization of route discovery which leads to lot of bandwidth consumption, increase in the delay and decrease in the throughput. In this paper, we propose a new power and delay aware routing protocol for wireless Ad Hoc networks. The goal of our proposed routing protocol is not only to find more stable paths from a source to a destination node in terms of remaining life time of battery, but also to find multi-paths that satisfy Quality of Service (QoS) requirements, given in terms of delay and bandwidth. To evaluate our proposed routing protocol (PDMRP), an extensive simulation study is performed using the NS-2 simulator. We show through simulation that our proposed routing protocol called Power and Delay aware Multi-path Routing Protocol (PDMRP) outperforms the Stable Path Routing Protocol based on Power Awareness (SPR) and the Modified Adhoc On-Demand Distance Vector (MAODV) routing protocols in terms of throughput, end-to-end delay, and loss rate. We modify the AODV protocol in NS-2 simulator so that it supports the energy module. We add the energy class to the relay and destination nodes. Therefore, the life time of each node in this protocol decreases when it sends or receives a packet. This modification is made on the AODV protocol to become similar to the two other routing protocols (The three protocols support the energy module).","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131604913","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}
引用次数: 21
Minimum latency data collection in interference-aware Wireless Sensor Networks 干扰感知无线传感器网络中最小延迟数据采集
Min Kyung An, Hyuk Cho
{"title":"Minimum latency data collection in interference-aware Wireless Sensor Networks","authors":"Min Kyung An, Hyuk Cho","doi":"10.1109/CITS.2014.6878957","DOIUrl":"https://doi.org/10.1109/CITS.2014.6878957","url":null,"abstract":"In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency a schedule, that is, to compute a schedule with the minimum number of timeslots, such that all data from all nodes can be collected to a sink node without any collision or interference. We introduce an approximation algorithm with O(1)-approximation ratio that works in both the interference models by yielding a schedule whose latency is bounded by O(n), where n is the number of nodes in the network.","PeriodicalId":205407,"journal":{"name":"2014 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121655957","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
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学术官方微信
小红书