{"title":"Multiple division soft pilot reuse in massive MIMO cellular networks","authors":"Di Gao, Xu Zhu, Yi Huang","doi":"10.1109/INFOCOMAN.2016.7784240","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784240","url":null,"abstract":"Pilot is a limited resource in most wireless communication system including massive Multiple-Input Multiple-Output (MIMO) cellular networks. Facing the rapid increase of wireless users, how to reuse pilot appropriately has become a point of research interest. This paper introduces a new method, named `Multiple Division Soft Pilot Reuse (MD-SPR)', which is a development of classical Soft Pilot Reuse (SPR) method. MD-SPR has a more elaborate way to divide regions for different degrees of pilot reuse, which may apply more than two reuse factors in one cell simultaneously. It is more convenient for MD-SPR to take account of both user capacity and pilot contamination, and make a balanced decision between them. Compared to single-used mode and classical SPR, MD-SPR is able to achieve better performance on SINR, transmission rate, limit of user's quantity, etc. It provides a novel technique to utilize pilot resources more efficiently in future systems. Numerical results from simulation have been obtained to verify the advantages of MD-SPR.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129085869","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":"IT demand management models in organizations","authors":"Luis Palacios Quichiz, Sussy Bayona-Oré","doi":"10.1109/INFOCOMAN.2016.7784212","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784212","url":null,"abstract":"Demand Management is a key part of IT governance, which in turn supports decisions making at company corporate governance level. It is through IT Demand Management (ITDM) (Spanish GDTI), that business areas get the added value and meet its strategic objectives. In this article, a review of the current ITDM Models is done, using the systematic review methodology. The research questions are aimed to identify suitable ITDM models. Models outcomes set in a number of objectives, phases and developing steps, but it is clear that they yet have inherent limitations in order to get the effective ITDM implementation. The business alignment is one main critical success factor of ITDM.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128159145","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":"High speed pipeline ADC using dual-input op-amp to cancel memory effect","authors":"Linfeng Wang, Qiao Meng, Dong Li, Fei Li","doi":"10.1109/INFOCOMAN.2016.7784254","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784254","url":null,"abstract":"A 100bit 200MS/s Pipeline ADC suing op-amp sharing and capacitor sharing architecture is proposed. In op-amp sharing pipeline ADC architecture, memory effect of residual charge occurs due to sharing an op-amp between two adjacent stages of the pipeline ADC. The proposed dual-input op-amp removes the memory effect in analog domain without complicated digital calibration. The dual-input op-amp simplifies the analog circuit, which reduces the die area. The ADC is implemented in TSMC 0.18μm 1P6M CMOS technology. The supply voltage is 1.8V. The simulation result shows 57.7dB SNDR and 61.13dB SFDR with a 98MHz input operating at a 200MS/s sampling rate. The area is 1.2mm × 1.2mm.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124476200","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 new AODV route discovery protocol to achieve fair routing for mobile ad hoc networks","authors":"Masaru Yoshimachi, Yoshifumi Manabe","doi":"10.1109/INFOCOMAN.2016.7784247","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784247","url":null,"abstract":"We propose a new routing protocol for MANET (Mobile Ad hoc NETwork). This protocol achieves the fairness of the amount of communication among nodes. The amount of communication generation in MANET differs among nodes. Thus, there might be nodes that have much self-benefit communication and nodes with much other-benefit communication. The ratio of self-benefit communication to other-benefit communication differs among nodes in MANET. MANET is a network made up of equal ability nodes. Therefore this ratio is expected to be equal among the nodes. A protocol has been proposed to achieve the fairness using the ratio of self-benefit communication to other-benefit communication. However, the protocol has two problems. The definition of the ratio of self-benefit communication and other-benefit communication do not fully reflect the cost and benefit for the node. AODV routing protocol cannot obtain routes to achieve fairness. We propose a new routing protocol that improves the fairness definition and route discovery to achieve fairness.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123246463","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 study on the establishment of intelligent construction CALS through the analysis of local and overseas cases","authors":"Tae-Hak Kim, Hyun Ok","doi":"10.1109/INFOCOMAN.2016.7784257","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784257","url":null,"abstract":"Currently, construction firms are striving to establish an efficient decision-making environment by introducing numerous information technologies, but the existing technology is cumbersome to use in recording and storing data, and requires intricate search skills to weave through massive datasets. Moreover, due to the limitations of the search algorithm that disproportionately focuses on keyword search results, many unwanted problems and limitations, including deterioration of work satisfaction and of the system utilization level, are being exposed. Therefore, this study proposed methods of establishing an intelligent construction CALS based on big data, along with the potential establishment of intelligent construction CALS as well as the application of a search engine algorithm.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133290959","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":"Using Blowfish encryption to enhance security feature of an image","authors":"Shreyank N. Gowda","doi":"10.1109/INFOCOMAN.2016.7784228","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784228","url":null,"abstract":"The use of images to hide information is a feature which leaves little doubt in a viewer's mind. Using any medium to hide information refers to a method called steganography. When we use an image as a medium then that method is called image steganography. The most famous method to now is the Least Significant Bit Algorithm (LSB). In that method, the least significant bit of each pixel is taken and information is hidden in that. This however is easily breakable. Hence an alternative and more secure solution is provided. First the data is encrypted using the Blowfish algorithm. Next an innovative method is presented. This encrypted block is broken down to `n' smaller blocks and `n' images are chosen at random and each image is made to hide a block of the encrypted data. To maintain the correct sequence of blocks a hash table is maintained. This is then encrypted using LSB to a new image called the hashing image. This hashing image is sent along with the `n' other images. To extract the data out, first the hash image is obtained and using this the encrypted block is reassembled and then original data is obtained by decryption.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":" 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826411","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":"Software-based fast failure recovery in load balanced SDN-based datacenter networks","authors":"Behrouz Raeisi, A. Giorgetti","doi":"10.1109/INFOCOMAN.2016.7784222","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784222","url":null,"abstract":"Load balancing is currently considered as a candidate solution to tackle the emerging problem of increasing bandwidth demand in intra-datacenter networks. Furthermore, because a short disruption of data transfer would corrupt the result of a long procedure of computation, fast failure management mechanisms are considered as integral part of current datacenters. In this paper, we propose a method which uses active probing to detect and manage failures in an OpenFlow based datacenter network exploiting load balancing among equal cost multiple paths. The proposed method is scalable and effective based on the actions it takes without involving the controller in the fast failure recovery procedure.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336510","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":"Game theory MiniMax filter design for indoor positioning and tracking system using visible light communications","authors":"F. M. Alsalami","doi":"10.1109/INFOCOMAN.2016.7784242","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784242","url":null,"abstract":"This paper uses visible light communication (VLC) to perform indoor positioning and tracking. VLC utilizes the data transmitted by light emitting diodes (LEDs) which are used for illumination. MiniMax filter is proposed to perform state estimation. Design parameters of MiniMax filter are driven as the game equilibrium solution of zero sum game. Estimation performance of this filter is compared with the conventional state estimator Kalman filter. MATLAB simulator is used to explore the relative performance of both filters. Results show that MiniMax filter outperform Kalman filter in the existence adversary disturbance noise. While in the absence of adversary disturbance noise two filters have similar performance.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115327348","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":"Dynamic load balanced routing in IP networks","authors":"Kuang-Yi Li, Chieh-Wen Chen, Steven S. W. Lee","doi":"10.1109/INFOCOMAN.2016.7784246","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784246","url":null,"abstract":"In this paper, we address the dynamic load balanced routing problem in IP networks. In current IP networks, shortest paths are selected for routing based on static link weight metrics. Due to the lack of stringent synchronization among routers, dynamically changing link weight would generate transient loops. How to perform dynamic load balanced routing without generating traffic loops become a challenging task. In this work, we propose two approaches, Local Traffic Rerouting (LTR) and Global Traffic Rerouting (GTR), to resolve the problem. Both approaches use a set of static link weight metrics. Each router obtains the metrics through standard link state routing protocol. Based on the link metrics, in each router, a directed acyclic graph (DAG) for each destination node is derived. Taking the advantage of the property that there is no loop in a DAG, each router can make its decision to dynamically select next hop node for routing. The major difference between LTR and GTR is that the former uses only local information while the latter uses global information on routing decision. In LTR, each router monitors its links to obtain the bandwidth utilization. In GTR, the local link utilization information is broadcast to the whole network through routing protocol so each node in the network knows the state of the whole network. We have conducted simulations and experiments to make performance comparisons among various routing approaches. The results indicate that LTR and GTR significantly outperform conventional static routing on minimizing link utilization of the most congested link. They also have performance close to a per flow based centralized controlled routing that is served for a lower bound for performance evaluations.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130113389","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":"Research on the structural evolution of Shanghai Cooperation Organization network","authors":"Zi-Han Lin, Duoyong Sun, Bo Li, Kun Wang","doi":"10.1109/INFOCOMAN.2016.7784221","DOIUrl":"https://doi.org/10.1109/INFOCOMAN.2016.7784221","url":null,"abstract":"The Shanghai Cooperation Organization (SCO) has become a model for regional cooperation since its inception. Researches related to this regional organization have received more and more attention. Some scholars have evaluated the organizational cooperation structure based on cross-sectional data. However, the dynamic changing of relations between member states over time has not yet been addressed adequately, and the influential factors are also not clear. In this paper, we aim to fill the gap in literature by exploring how the SCO cooperative relation evolves over time. We construct a longitudinal cooperation network model of SCO based on the bilateral trade flows data among member states' from 1996 to 2013. The results have shown that the cooperation among member states is enhanced over time. China and Russia's degree centrality, eigenvector centrality and bonacich power always notably higher than the other countries and occupy the core position during the cooperation. The cooperation network is influenced by the GDP of member state, the geographic distance and some other factors.","PeriodicalId":268061,"journal":{"name":"2016 6th International Conference on Information Communication and Management (ICICM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116236593","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}