{"title":"Survey of target localization methods in wireless sensor networks","authors":"Zhenxing Luo, P. S. Min","doi":"10.1109/ICON.2013.6781940","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781940","url":null,"abstract":"This paper reviews target localization methods in wireless sensor networks. Target localization methods have been investigated extensively due to their wide applications. Main target localization methods include time delay of arrival methods, direction of arrival methods, energy-based target localization methods, radio mapping methods and so on. In this paper, three main categories of localization methods are reviewed. Moreover, possible future research directions are also given.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127698238","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":"SIEM with LSA technique for Threat identification","authors":"Pavarit Dairinram, Damras Wongsawang, Pagaporn Pengsart","doi":"10.1109/ICON.2013.6781951","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781951","url":null,"abstract":"Security in the heterogeneous and complex network is very challenged for administrators. They need to handle with a lot of devices, and perform the task of protection and prevention plan for securing the network from the threats. The Security Information and Event Management (SIEM) is one of the most common tools that helps administrators to deal with current situation. It helps to manage and identify the threats. Moreover, it will initiate a proper an action to protect the network against the right threats and also generate a report for the administrators. However, the amount of threats is increasing rapidly, and the variation of threats is also another issue for identifying. The Latent Semantic Analysis (LSA) was proposed in this paper to help alleviate these problems. It would improve the performance by reducing the unnecessary noise in a huge data generated from devices. It is also used to detect a similar threat pattern relying on similarity between threats and events/logs. The experiments showed that LSA approach can help eliminating not significant data used in the threat identifying process without degradation of the accuracy.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130245265","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":"Access LUT without CAM - Improved Pearson hashing for collision reduction","authors":"Chung-Ping Hung, P. S. Min","doi":"10.1109/ICON.2013.6781942","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781942","url":null,"abstract":"While lookup table (LUT) is widely used in virtually every kind of computing devices, to achieve low access latency with low cost is always challenging. Although Content-Addressable Memory (CAM) can be used to implement LUT, it is not very cost-effective to add such an expensive device dedicated for LUT in most cases. On the other hand, using hash functions to implement LUT, which can achieve O(1) fast lookup in most cases without special hardware, is more preferable. The performance of a hash table based LUT depends on the collision rate. In this paper, we propose a hash function based on Pearson hashing which can effectively reduce the collision rate and thus improve the performance of LUT by adding a dynamically generated permutation table. We demonstrate the LUT performance can be significantly improved from very low additional cost.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132186426","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":"Loss behavior of an Internet router with self-similar input traffic via Fractal point process","authors":"Rajaiah Dasari, M. R. Perati","doi":"10.1109/ICON.2013.6781958","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781958","url":null,"abstract":"It has been reported that modeling a self-similar network traffic is of key importance for the traffic engineering. Self-similarity or long range dependence causes degradation of Internet router performance. Therefore, it is decisive for an appropriate buffer design of a router. In this paper, we investigate loss behaviour of network router with pseudo self-similar traffic input. We use Fractal point process (FPP) as input process as it generates self-similar traffic. For queueing analysis, input process is Markov modulated Poission process (MMPP), which is fitted for FPP by equating the second-order statistics of counting function. The reason is, FPP is not suitable for queueing based performance evaluation. FPP involves another parameter fractal onset time (FOT) besides Hurst parameter. Effect of FOT on loss behavior is examined.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133607344","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":"Power consumption modeling of femto-assisted cellular networks using Renewal Reward Process","authors":"Rahul Thakur, Anik Sengupta, C. Murthy","doi":"10.1109/ICON.2013.6781964","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781964","url":null,"abstract":"The demand for bandwidth in cellular networks is ever increasing and most of it originates from indoor users. Femtocells are low-power, low-cost home base stations that can be deployed by end users in homes/offices to satisfy this need without incurring significant deployment and running costs. Widespread deployment of femtocells appear a potential reality in near future, and hence, it is of interest to study its energy saving measures. One promising energy efficiency technique is the introduction of sleep mode on femtocells, allowing them to switch off their radio and associated processing when there are no active devices within their range. In this paper, we model sleep-mode behavior in femtocells using Renewal-Reward-Process and determine the lower bound on power consumption that can be achieved. Power consumption for user equipments and macrocell base station are also modeled to evaluate overall network power consumption. The analytical model is verified through extensive simulation.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"270 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120869869","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}
Xin Fang, Sheng Fang, N. Ying, Haiyan Cao, Chao Liu
{"title":"The performance of massive MIMO systems under correlated channel","authors":"Xin Fang, Sheng Fang, N. Ying, Haiyan Cao, Chao Liu","doi":"10.1109/ICON.2013.6781998","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781998","url":null,"abstract":"Most researches on the massive multiple-input multiple-output (MIMO) systems are based on the assumption that the MIMO channels are independent, in reality, the above assumption is very difficult to realize when the number of multiple antennas are very large. Hence the simulation on massive MIMO systems under correlated channels has some degree of guiding significance for practical application of massive MIMO systems. Simulation results show that the performance of massive MIMO systems becomes worse when the correlation coefficients of the channels increase. And when the channel correlation coefficient becomes smaller than a certain small value, the performance of massive MIMO systems will be enhanced quickly as the number of Base Station (BS) antennas increases; while the channel correlation coefficient is larger than the certain value, the performance is enhanced slowly as the number of BS antennas increases.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126436996","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}
Yun Li, Chao Liao, Xue Zhu, M. Daneshmand, Chonggang Wang
{"title":"Optimal energy-efficient relay selection in cooperative cellular networks","authors":"Yun Li, Chao Liao, Xue Zhu, M. Daneshmand, Chonggang Wang","doi":"10.1109/ICON.2013.6781966","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781966","url":null,"abstract":"In this paper, we consider relay selection technique in a cooperative cellular network where user terminals act as relays to help the communications between a base station (BS) and cell-edge users (CEUs). We firstly build cooperative sets for source mobile users according to their transmission radius. Then, transmission power sets are built for all mobile users according to SNR thresholds. Finally, Energy Efficient Cooperative-Sets-based Maximum Weighted Matching (EECS-MWM) algorithm is proposed to select the optimal relay for source users to maximize the system energy efficiency. The performance of proposed scheme is evaluated and compared with existing methods in terms of system energy efficiency, capacity, and the number of successful matched user pairs, which show that EECS-MWM can improve the performance of the cooperative cellular networks.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786956","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}
Koheix Ichikawa, S. Date, H. Abe, Hiroaki Yamanaka, Eiji Kawai, S. Shimojo
{"title":"A network performance-aware routing for multisite virtual clusters","authors":"Koheix Ichikawa, S. Date, H. Abe, Hiroaki Yamanaka, Eiji Kawai, S. Shimojo","doi":"10.1109/ICON.2013.6781935","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781935","url":null,"abstract":"Despite the development of virtualization technologies in computing resources, how best to build virtual networks is still an open issue. Virtual network is an important technology that can hide physical network topologies and policies and provide a dedicated virtual computing environment for each user. However, it is difficult to figure out the actual mapping between a physical network and a virtual network from a logical point of view; the difficulty will cause performance degradation in the virtual network and inefficient network routing. We have therefore proposed a network performance-aware routing mechanism using SDN technologies. By using SDN technology, we can control the network in a centralized manner. Our proposed system automatically aggregates the information on network performance, and then defines an appropriate routing policy by solving optimal path problems based on the observed network performance. We have improved the performance of the inter-domain network for a multisite virtual cluster with the proposed system. We have also started to deploy the proposed system into an actual environment consisting of different multiple organizations.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124662368","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":"Hardware-based hash functions for network applications","authors":"Fumito Yamaguchi, H. Nishi","doi":"10.1109/ICON.2013.6781990","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781990","url":null,"abstract":"For rich network services, it is indispensable to reconstruct TCP stream in the middle of the network. In this reconstruction function, managing a large number of streams is a crucial as an embedded hardware for achieving high-throughput processing. In this case, hashing is a well-used solution as an ID key of TCP streams. Since CRC hashes have simple tree structure of XOR logics and are perfectly composed of combination logics, they can easily be hardware implemented and enables low-latency calculation of the hash values. Therefore, CRC hash has been used in network applications where low-latency and high speed operations are necessary. Some of their usages include data identification, load balancing, encryption, and checksum. Although CRC hashes may be well suited for hardware implementation, it is not the top choice when collision rates and distribution of hash values are considered. For some network workloads, CRC hashing shows very uneven distribution of hash values and can lead to decrease in the overall performance of network systems. In this study, two hashes, Jenkins hash and MurmurHash, are implemented on a FPGA as TCP connection manager and evaluated for their aptitude for hashing used in hardware-based network applications.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"52 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":"125295265","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":"Maximum lifetime of reinforced barrier-coverage in Wireless Sensor Networks","authors":"Hyunbum Kim, J. Cobb","doi":"10.1109/ICON.2013.6781988","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781988","url":null,"abstract":"A subset of sensors in wireless sensor networks provides barrier-coverage over an area of interest if the sensor nodes are dividing the area into two regions such that any object moving from one region to another is guaranteed to be detected by a sensor. In many practical scenarios, it may be desirable to detect an intruder that enters the region through any of its sides and exits through any other of its sides. That is, not only detect top-down movement, but also side-to-side, and even turn from one side to another. In this paper, we introduce a new barrier-coverage problem whose objective is to maximize the network lifetime such that any penetration of the intruder is detected. To solve the problem, we create a new form of sensor barriers, which we refer to as reinforced barriers, which can detect any movement variation of the attacker. Also, we propose three approaches to obtain these barriers from a given layout of sensor nodes, and we then compare their relative performances through extensive simulations.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"153 2 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":"133107809","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}