{"title":"The lexicon-based sentiment analysis for fan page ranking in Facebook","authors":"Phan Trong Ngoc, Myungsik Yoo","doi":"10.1109/ICOIN.2014.6799721","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799721","url":null,"abstract":"The traditional methods to rank a Facebook fan page only rely on the user engagement including the number of posts, comments, and “likes”. The polarity of each comment, which can be positive, neutral, or negative, is ignored in these methods. In this paper, we propose a content-based ranking method in which the user engagement and the comment polarity are all considered. The user comment is analyzed using a lexicon-based approach. We apply the proposed method for the real Facebook dataset collected using the Social Packets crawler. The result shows that the ranks of pages estimated by our method is close to the ranks estimated by engagement based method. More importantly, by concerning the comment polarity, our page ranking is more accurate regarding user opinion.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134239757","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":"Intrusion tolerance mechanisms using redundant nodes for wireless sensor networks","authors":"Min Wei, Keecheon Kim","doi":"10.1109/ICOIN.2014.6799679","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799679","url":null,"abstract":"Wireless sensor networks extend people's ability to explore, monitor, and control the physical world. Wireless sensor networks are susceptible to certain types of attacks because they are deployed in open and unprotected environments. Novel intrusion tolerance architecture is proposed in this paper. An expert intrusion detection analysis system and an all-channel analyzer are introduced. A proposed intrusion tolerance scheme is implemented. Results show that this scheme can detect data traffic and re-route it to a redundant node in the wireless network, prolong the lifetime of the network, and isolate malicious traffic introduced through compromised nodes or illegal intrusions.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134365550","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}
A. Hidaka, K. Asatani, Kazuhisa Fujimura, O. Mizuno
{"title":"A new application level link aggregation and roaming scheme for android terminals","authors":"A. Hidaka, K. Asatani, Kazuhisa Fujimura, O. Mizuno","doi":"10.1109/ICOIN.2014.6799700","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799700","url":null,"abstract":"Link aggregation enables very high-speed and large-capacity data communications by aggregating multiple physical links on a single virtual link. It also enables redundant communications. Several link aggregation methods have been proposed. These methods utilize transport layer link aggregation.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133480810","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 partitioning scheme to guarantee minimum execution time for multiple applications in sensor network nodes","authors":"D. Kim, Beomseok Kim, Jinsung Cho","doi":"10.1109/ICOIN.2014.6799678","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799678","url":null,"abstract":"Due to rapid development of embedded system technologies, miniaturization of low-power sensor nodes becomes possible. Based on these improvements of sensor nodes, several sensor applications can run on a single sensor hardware and all of the applications in sensor network should be guaranteed the real-time requirements and independence. To satisfy these requirements, the virtualization concept was proposed. However, the virtualization cannot be applied to sensor nodes because it requires powerful computing resources. To solve this problem, the partitioning scheme which is categorized into temporal partitioning and spatial partitioning has been proposed. In this paper, we design and implement temporal partitioning scheme for sensor nodes and validate that our implementation guarantees minimum execution time of each partition.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131243797","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":"TDoA localization for wireless networks with imperfect clock synchronization","authors":"Ryangsoo Kim, Taejin Ha, Hyuk Lim, Daewon Jung","doi":"10.1109/ICOIN.2014.6799716","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799716","url":null,"abstract":"With the advent of an ubiquitous computing environment, the need to capture location information and incorporate it into applications has become urgent. In particular, time difference-of-arrival (TDoA) localization is considered to be a cost effective and accurate localization technique. However, the local clocks of the access points (APs) are required to be fully synchronized with each other. If clock offsets exist, TDoA localization can yield a poor localization performance. In this paper, we propose a TDoA-based localization technique that simultaneously estimates the client location and clock offsets of the APs. The simulation and experimental results show that the proposed localization algorithm alleviates the impact of imperfect clock synchronization among APs, thereby improving the localization accuracy.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131655409","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}
Eung-Hyup Kim, Jae-Choong Nam, Jae-In Choi, You-Ze Cho
{"title":"Probability-based spray and wait protocol in Delay Tolerant Networks","authors":"Eung-Hyup Kim, Jae-Choong Nam, Jae-In Choi, You-Ze Cho","doi":"10.1109/ICOIN.2014.6799715","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799715","url":null,"abstract":"Delay Tolerant Networks (DTNs) are one of the most interesting evolutions of MANETs. In DTNs which can be characterized by intermittent connectivity, frequent end-to-end path disruption and topology changes, mobile nodes are enabled to communicate with each other even if a route connecting them never exists. When considering routing protocols of DTNs, a forwarding decision and the buffer management scheme are important to improve the opportunity of successful message delivery. In this paper, we propose improved spray and wait routing based on the delivery probability. The simulation results show that the proposed method provides a better delivery ratio and lower communication overhead compared to existing schemes such as epidemic, spray and wait, and PRoPHET routing protocols.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123887511","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":"Analysis of the match probabilities for the iTrust information network with message forwarding","authors":"L. Moser, P. Melliar-Smith","doi":"10.1109/ICOIN.2014.6799493","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799493","url":null,"abstract":"The iTrust system is a completely distributed and decentralized information publication, search and retrieval system, that is designed to defend against censorship of information in the Internet. In this paper, we investigate the iTrust system with message forwarding, which spreads the responsibility of message distribution more widely across the nodes in the network. We present an analysis of the match probabilities of the iTrust system with message forwarding, in terms of the forwarding fanout, the number of levels of forwarding, and the forwarding probability. We show that, with a forwarding probability of 1.0, relatively small values of the forwarding fanout and the number of levels of forwarding suffice to achieve a high match probability and a reasonable message cost.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125369788","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}
N. Chuangchunsong, S. Kamolphiwong, T. Kamolphiwong, R. Elz, P. Pongpaibool
{"title":"Performance evaluation of IPv4/IPv6 transition mechanisms: IPv4-in-IPv6 tunneling techniques","authors":"N. Chuangchunsong, S. Kamolphiwong, T. Kamolphiwong, R. Elz, P. Pongpaibool","doi":"10.1109/ICOIN.2014.6799698","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799698","url":null,"abstract":"Exhaustion of IPv4 address space is highly aware for most internet players, not only Internet Service Providers (ISPs), but also Telco and Content Providers. A number of IPv4/IPv6 migration/transition tools and mechanisms have been proposed, deployed/implemented world-wide. To make IPv4 networks be able to connect to IPv6 world, 4over6, DS-lite, and 4rd seems to be the most attractive solution according to their features and functions benefits. Beside such benefits, in this paper, we investigate their performance in terms of delay time, and reliability in both inter and intra-communications. Comparison results and analysis of these 3 solutions will be given. We conclude that these figures will provide the factors of scalability and quality-of-service (QoS).","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"40 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120990341","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}
Nirzhar Saha, Ratan Kumar Mondal, Md. Shareef Ifthekhar, Y. Jang
{"title":"Dynamic resource allocation for visible light based wireless sensor network","authors":"Nirzhar Saha, Ratan Kumar Mondal, Md. Shareef Ifthekhar, Y. Jang","doi":"10.1109/ICOIN.2014.6799668","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799668","url":null,"abstract":"Optical signaling has added a new dimension to contemporary wireless sensor network (WSN) as a green and energy efficient technology. Optical wireless communication is considered to replace radio frequency in future sensor network. In fact, Optical wireless communication using visible light has become a benchmark technology in order to improve the speed and robustness of the communication link in indoor wireless sensor network and considered to be featured heavily in future sensor network. In this paper, we propose a novel resource allocation for visible light based WSN. We propose joint power allocation and bandwidth allocation for downlink transmission. Then we propose admission control to guarantee quality of service (QoS) in order to maintain service requirement. The simulation result shows satisfactory performance improvement.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115357920","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}
Kazuhiro Yamaguchi, Kohei Miyasaka, Takaharu Nagahashi, Takuya Akiyama, H. Matsue
{"title":"Transmission performance evaluation for MU-MIMO systems based on Block Diagonalization method in spatially correlated multipath fading environment","authors":"Kazuhiro Yamaguchi, Kohei Miyasaka, Takaharu Nagahashi, Takuya Akiyama, H. Matsue","doi":"10.1109/ICOIN.2014.6799673","DOIUrl":"https://doi.org/10.1109/ICOIN.2014.6799673","url":null,"abstract":"In this paper, transmission performances for MU-MIMO (Multiuser Multiple Input Multiple Output) systems based on BD (Block Diagonalization) method in spatially correlated multipath fading environment are analyzed. The MU-MIMO system for evaluation is constructed as a transmitter having 4 antennas and 2 receivers having 2 antennas. By using the BD algorithm, system performances for the 4×2×2 MU-MIMO system in spatially correlated multipath fading environment are simulated by the computer. In the computer simulation, we measured instantaneous received CINR (Carrier to Interference and Noise Ratio), BER (Bit Error Rate) performance and channel capacity. As compared to the i.i.d conditions, the results show that an instantaneous received CINR has about 3 dB degradation when spatially correlation is 0.5 and the instantaneous received CINR has about 7 dB degradation when it is 0.9. Moreover, BER performances have about 3 dB and 7 dB degradations with spatially correlations are 0.5 and 0.9, respectively. The channel capacity whose average CNR (Carrier to Noise Ratio) is 20 dB have about 3 bit/s/Hz and 8 bit/s/Hz degradation with spatially correlations are 0.5 and 0.9, respectively.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392562","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}