{"title":"An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip","authors":"Jindun Dai, Xin Jiang, Takahiro Watanabe","doi":"10.1109/CITS.2017.8035332","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035332","url":null,"abstract":"This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133425914","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}
Jun Wang, Zhe Chen, Yang Xu, Zhenyi Song, Riqing Chen
{"title":"Spectrum sensing with random arrivals of primary users by using multiple antennas","authors":"Jun Wang, Zhe Chen, Yang Xu, Zhenyi Song, Riqing Chen","doi":"10.1109/CITS.2017.8035277","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035277","url":null,"abstract":"Spectrum sensing is the fundamental technology of Cognitive Radio (CR). This paper proposes a novel multiple-antenna based spectrum sensing method with random arrivals of primary users (PUs). The method first constructs a local test statistic for each antenna based on the assumption that the PU is randomly arriving, and then calculates the estimated optimum coefficient for every local test statistic and finally gets the total test statistic by linearly combing the local test statistics and the estimated optimum coefficients. Given false alarm probability, the proposed method calculates the corresponding threshold according to Neyman-Pearson (N-P) criteria and makes the final decision by comparing the total test statistic with the threshold. Simulation results prove the validity and the superiority of the proposed method when the PU is arriving randomly. Simulation results show that the proposed method is superior to the conventional energy detection method with random arrivals of PUs, about 1 dB advantage in performance.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116173701","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}
C. Kuo, Shyi-Chyi Cheng, C. Lin, K. Hsiao, Shang-Hung Lee
{"title":"Texture-based treatment prediction by automatic liver tumor segmentation on computed tomography","authors":"C. Kuo, Shyi-Chyi Cheng, C. Lin, K. Hsiao, Shang-Hung Lee","doi":"10.1109/CITS.2017.8035318","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035318","url":null,"abstract":"This study presents a novel approach to extracting discriminative texture features of a liver tumor in computed tomography (CT) scans, which are used to combine with medical records for survival prediction. The liver region is first located using an image segmentation method. A pre-learned tumor classifier follows to segment the tumors in the liver region. Next, two sets of feature points are detected: (1) feature points in the liver region; (2) randomly sampling several points in the tumor region. Using each feature point as the center of a region of interest (ROI), this study computes Gray-level Co-occurrence Matrix (GLCM) which is further used to derive the texture features of the ROI. Multiple ROIs and thus multiple texture feature vectors are derived in an input CT image. These textures are collected and clustered into four clusters, where each of them is represented by a representative texture feature vector. To further enhance the discriminative powder of the texture features, for each CT image, we select two representative texture feature vectors which are from the two clusters with the highest probability belonging to the tumor region and the liver region, respectively. The resulting tumor (liver) texture feature vector is then labeled as a positive (negative) example in order to train a tumor Support Vector Machine (SVM) classifier. In the diagnosis stage, the tumor SVM classifies an input texture feature vector and the classification result locates the liver tumors in a CT image. Given CT images of 72 patients, to associate the detected tumor texture feature vectors with the medical records, a treatment prediction dataset is constructed for mining the survival prediction model using logistic regression. In the testing stage, to input a tumor texture feature vector and the possible treatments to the survival prediction model, the system computes the survival probabilities and generates a treatment prediction report, which suggests the most suitable treatment for the patient. Experimental results show that the proposed method gives good performance in terms of the accuracy of survival prediction.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130431183","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}
{"title":"A network traffic shunt system in SDN network","authors":"Chia-Wei Tseng, Yu-Kai Huang, Yao-Tsung Yang, Chien-Chang Liu, Deng-Yang Huang, Li-Der Chou","doi":"10.1109/CITS.2017.8035281","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035281","url":null,"abstract":"With the popularity of smart devices in a variety of actions to drive more usage of wireless broadband networks. OTT refers to delivery of video, audio and other media over the Internet. The video-related applications and services are major challenges that impact the network performance in the future. It is important to achieve network and service traffic offloading to overcome high-speed, real-time, a large number of the transmission behavior in the upcoming 5G. In addition, with the increased demand on higher quality video and the Internet of Things (IoT) traffic. How to achieve traffic shunting and offloading through software defined networking (SDN) and network function virtualization (NFV) technologies to reduce traffic volume and backbone network traffic load and enhancing the user's quality of experience (QoE) is the major challenge for Internet service providers. This paper addressed a traffic shunt system to isolate the large bandwidth services or specific traffic types requirements such as video streaming, which have large amount of data or same destinations through SDN/OpenFlow technology, and allocates virtual network slicing flexibly and dynamically, so as to increase the bandwidth utilization.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"211 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133388158","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}
Liang Zhang, Yuanqiu Luo, N. Ansari, Bo Gao, Xiang Liu, F. Effenberger
{"title":"Channel bonding for Next Generation Passive Optical Network Stage 2 (NG-PON2)","authors":"Liang Zhang, Yuanqiu Luo, N. Ansari, Bo Gao, Xiang Liu, F. Effenberger","doi":"10.1109/CITS.2017.8035304","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035304","url":null,"abstract":"Channel bonding is a key endeavor in the ITU Telecommunication Standardization Sector (ITU-T) to increase the peak rate of the Next Generation Passive Optical Network Stage 2 (NG-PON2) system. It manages several parallel wavelength channels in NG-PON2 as a single link. In this paper, we investigate the NG-PON2 layering structure and propose the sublayer changes to support channel bonding. The problem is formulated as an integer non-linear programming (INLP) problem, and is analyzed by using the water filling scheme. Two interleaving heuristic algorithms are proposed to solve this problem. Evaluation results show that full wavelength channel delivery algorithm provides the lowest jitter, and restricted wavelength channel delivery algorithm with a threshold 3 provides the lowest end-to-end delay by reducing envelope headers.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116642410","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}
Hui Wang, Xiangxu Xie, Yongfa Ling, Chunhua Gao, Yumei Tan
{"title":"A method of low-rank decomposition with feature point detection for moving target tracking","authors":"Hui Wang, Xiangxu Xie, Yongfa Ling, Chunhua Gao, Yumei Tan","doi":"10.1109/CITS.2017.8035287","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035287","url":null,"abstract":"In respect of the problems of complex changing of targets and background in moving target tracking, we utilize feature point detection method under low-rank sparse decomposition to track the moving target. First, for video sequence image, we adopt RPCA (Robust Principal Component Analysis) algorithm to conduct low-rank sparse decomposition, thereby extracting the foreground of the target; then SURF operator is used on each frame of image in the foreground sequence to conduct feature point detection, which just operates on the foreground of the image, thereby reducing the disturbance of complex background for target tracking and meanwhile reducing the amount of calculation in feature point detection. Through experiment on scale change, non-rigid motion, partial occlusion, and low-resolution thermal imaging video sequence as well as comparison with such moving target tracking methods as MIL, L1APG and DFT, the validity of the method adopted in this article in tracking moving target is verified.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"636 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123281500","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}
M. Gor, J. Vora, S. Tanwar, Sudhanshu Tyagi, Neeraj Kumar, M. Obaidat, B. Sadoun
{"title":"GATA: GPS-Arduino based Tracking and Alarm system for protection of wildlife animals","authors":"M. Gor, J. Vora, S. Tanwar, Sudhanshu Tyagi, Neeraj Kumar, M. Obaidat, B. Sadoun","doi":"10.1109/CITS.2017.8035325","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035325","url":null,"abstract":"In the present arena, wildlife and forest departments are facing the problem of movement of animals from forest area to residential area. The number of trees has reduced drastically from the forest that creates an unhealthy environment for animals to survive in the forest. This paper proposes a system we call GATA for tracking and alarming for the protection of Wildlife Animals. GATA combined Wireless Sensor Network (WSN) [1] and Global Positioning System (GPS) technologies to solve the above mentioned problem. Wild animals straying out of wildlife sanctuaries and natural parks have been tracked by auto generative location tracking and movement patterns. Automatic location and movement tracking has been implemented using GPS with the accelerometer and the WiFi shield. In the event of straying of a wild animal out of the predefined zone of sanctuary or natural reserve, an alert is sounded on a fixed base station (BS). As a prototype, we have tested this hardware on the cows, which shows that the proposed approach is very efficient in terms of flexibility and cost. This may be acting as a deterrent to various anti social activities poaching, train delays, railway accidents and danger to man due to the straying out of the animals off their habitation zone.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127310777","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}
{"title":"A chaotic convolutional encryption scheme based on multiple chaos mapping","authors":"Xiaozhong Zhang, Y. Wang, Yong-mei Wang","doi":"10.1109/CITS.2017.8035290","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035290","url":null,"abstract":"In this paper, we propose a chaotic convolutional encryption scheme based on multiple chaos mapping. The scheme employs the characteristics of pseudo randomness and sensitivity to initial conditions of chaos mapping. It generates time-varying state transition matrix through modulo-two adder between multiple chaos sequences and input data as well as the state values of status registers in convolutional encoder. The scheme can encrypt the data sequences while providing the channel coding features. It's shown by simulation results and analysis that the scheme can not only effectively encrypt the information and enhance the randomness of output signals, but also reach similar performance to traditional convolutional code.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122985","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}
{"title":"Clustering energy-efficient transmission protocol for Wireless Sensor Networks based on ant colony path optimization","authors":"Huahongzi Chen, Ze Lv, Ruichun Tang, Ye Tao","doi":"10.1109/CITS.2017.8035280","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035280","url":null,"abstract":"Consider the problem of energy loss caused by inefficient use of energy in Wireless Sensor Networks (WSN). A clustering energy-efficient transmission protocol for wireless sensor networks based on ant colony path optimization (CEETP-ACPO) is proposed. Firstly, use the distributed cluster computing energy-efficient routing scheme (DCCERS) to select cluster heads according to the center of gravity and the energy of nodes in the reachable range of nodes, then sensor nodes are clustered. Secondly, by using the improved ant colony path optimization algorithm, the optimal path is selected by the next-hop range of nodes controlled by the ring-angle search model and the transition probability calculated by the path pheromone, distance and current energy of the node. Simulation results show the effectiveness of the proposed protocol.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"34 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120967800","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}
S. Tanwar, P. Patel, Keyur Patel, Sudhanshu Tyagi, Neeraj Kumar, M. Obaidat
{"title":"An advanced Internet of Thing based Security Alert System for Smart Home","authors":"S. Tanwar, P. Patel, Keyur Patel, Sudhanshu Tyagi, Neeraj Kumar, M. Obaidat","doi":"10.1109/CITS.2017.8035326","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035326","url":null,"abstract":"Before inception of Internet of Things (IoT), personal computers and laptop were used to handle daily tasks of individuals like mail surfing, access to bank portal, observing current temperature, among others. Nowadays, IoT-enabled smart devices like smart mobile phones, PDAs, and tablets are being used by them for such tasks due to rapid growth in IoT. Smart homes have been widely accepted by individuals and organizations world wide due to their many advantages. Home security systems can be defined as monitoring of complete home/some portion of home from a remotely located or centralized location. It allows the user to watch all activities inside the home from a remote location that ultimately gives satisfaction to the owner of the home. Many home security systems exist, but they have some challenging issues like: delay, non-web enabled and difficult to handle during transfer of alerts to user in situation where any unusual event occurred inside the home. If any unusual event encountered inside the home, where security systems deployed, then system must be capable enough to send alert to the user without any delay by phone, text, or email. Cameras and other latest network technologies have enabled us to remotely monitor the home more effectively and efficiently from our smart phone. Hence, considering the above mentioned facts, in this paper, we have proposed an advanced Internet of Thing based Security Alert System for Smart Home in order to detect an intruder or any unusual event at home, when nobody is available there. This low-cost home security system utilizes a small pyroelectric Infrared (PIR) module and raspberry pi for minimizing the delay during process of e-mail alert. This paper also confirms the advantage of Raspberry Pi flexibility and broad probability of its usage. Preliminary analyses have shown encouraging results.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117045941","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}