Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883506
G. Gonçalves, I. Drago, Ana Paula Couto da Silva, A. Vieira, J. Almeida
Cloud storage systems are currently very popular, generating a large amount of traffic. Indeed, many companies offer this kind of service, including worldwide providers such as Dropbox, Microsoft and Google. These companies, as well as new providers entering the market, could greatly benefit from knowing typical workload patterns that their services have to face in order to develop more cost-effective solutions. However, despite recent analyses of typical usage patterns and possible performance bottlenecks, no previous work investigated the underlying client processes that generate workload to the system. In this context, this paper proposes a hierarchical two-layer model for representing the Dropbox client behavior. We characterize the statistical parameters of the model using passive measurements gathered in 3 different network vantage points. Our contributions can be applied to support the design of realistic synthetic workloads, thus helping in the development and evaluation of new, well-performing personal cloud storage services.
{"title":"Modeling the Dropbox client behavior","authors":"G. Gonçalves, I. Drago, Ana Paula Couto da Silva, A. Vieira, J. Almeida","doi":"10.1109/ICC.2014.6883506","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883506","url":null,"abstract":"Cloud storage systems are currently very popular, generating a large amount of traffic. Indeed, many companies offer this kind of service, including worldwide providers such as Dropbox, Microsoft and Google. These companies, as well as new providers entering the market, could greatly benefit from knowing typical workload patterns that their services have to face in order to develop more cost-effective solutions. However, despite recent analyses of typical usage patterns and possible performance bottlenecks, no previous work investigated the underlying client processes that generate workload to the system. In this context, this paper proposes a hierarchical two-layer model for representing the Dropbox client behavior. We characterize the statistical parameters of the model using passive measurements gathered in 3 different network vantage points. Our contributions can be applied to support the design of realistic synthetic workloads, thus helping in the development and evaluation of new, well-performing personal cloud storage services.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":" 91","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114051052","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883954
K. Wei, Guoqiang Mao, Wuxiong Zhang, Yang Yang, Zihuai Lin, Chung Shue Chen
Heterogeneous network (HetNet) [1] is considered as an energy efficient system structure to alleviate the problem of rapidly increasing power consumption in the wireless communication system. Significant research on HetNet energy efficiency has been conducted. However, most of them only consider power consumption of Base Stations (BSs) while ignoring influence on energy efficiency of Mobile Devices (MDs) brought by new BSs deployment. In this work, we propose a novel power saving metric for HetNet. Under the coexisting scenario of a single macrocell and a single microcell, we analyze the changes in power consumption at both the BSs side and the MDs side with the deployment of a micro BS. Optimum microcell radii for maximum power saving at the MDs sides and for highest network energy efficiency are obtained through analytical studies. It is found that total power saving for microcell MDs is close to 18% with a proper deployment of a microcell. Finally, extensive simulations have been provided to establish the accuracy of our theoretical analyses.
{"title":"Optimal microcell deployment for effective mobile device energy saving in heterogeneous networks","authors":"K. Wei, Guoqiang Mao, Wuxiong Zhang, Yang Yang, Zihuai Lin, Chung Shue Chen","doi":"10.1109/ICC.2014.6883954","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883954","url":null,"abstract":"Heterogeneous network (HetNet) [1] is considered as an energy efficient system structure to alleviate the problem of rapidly increasing power consumption in the wireless communication system. Significant research on HetNet energy efficiency has been conducted. However, most of them only consider power consumption of Base Stations (BSs) while ignoring influence on energy efficiency of Mobile Devices (MDs) brought by new BSs deployment. In this work, we propose a novel power saving metric for HetNet. Under the coexisting scenario of a single macrocell and a single microcell, we analyze the changes in power consumption at both the BSs side and the MDs side with the deployment of a micro BS. Optimum microcell radii for maximum power saving at the MDs sides and for highest network energy efficiency are obtained through analytical studies. It is found that total power saving for microcell MDs is close to 18% with a proper deployment of a microcell. Finally, extensive simulations have been provided to establish the accuracy of our theoretical analyses.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114290241","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883615
Arjun Anand, N. Mehta
In several wireless sensor networks, it is of interest to determine the maximum of the sensor readings and identify the sensor responsible for it. This has been referred to as the max function computation problem in the literature. We propose a novel, decentralized, timer-based max function computation (TMC) algorithm. In it, the sensors do not transmit their readings in a centrally pre-defined sequence. Instead, they are divided into clusters. The computation occurs over two stages. In the first stage, the nodes contend with each other using a decentralized timer scheme to transmit their reading to their cluster heads. In the second stage, the cluster heads contend in a similar manner. The main challenge that arises with the use of the timer scheme is the possibility of collisions, which can make the algorithm fail in finding the maximum. We optimize the algorithm to minimize the average time required to determine the maximum subject to a constraint on the probability that it fails to find it due to collisions. Extensive benchmarking shows that TMC requires lower selection times and far fewer transmissions on average than other approaches proposed in the literature.
{"title":"Quick, decentralized, one-shot max function computation using timer-based selection","authors":"Arjun Anand, N. Mehta","doi":"10.1109/ICC.2014.6883615","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883615","url":null,"abstract":"In several wireless sensor networks, it is of interest to determine the maximum of the sensor readings and identify the sensor responsible for it. This has been referred to as the max function computation problem in the literature. We propose a novel, decentralized, timer-based max function computation (TMC) algorithm. In it, the sensors do not transmit their readings in a centrally pre-defined sequence. Instead, they are divided into clusters. The computation occurs over two stages. In the first stage, the nodes contend with each other using a decentralized timer scheme to transmit their reading to their cluster heads. In the second stage, the cluster heads contend in a similar manner. The main challenge that arises with the use of the timer scheme is the possibility of collisions, which can make the algorithm fail in finding the maximum. We optimize the algorithm to minimize the average time required to determine the maximum subject to a constraint on the probability that it fails to find it due to collisions. Extensive benchmarking shows that TMC requires lower selection times and far fewer transmissions on average than other approaches proposed in the literature.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516588","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884095
Zijie Zheng, Tianyu Wang, Lingyang Song, Zhu Han
Smart meters aided by wireless communications have been widely used to collect the information of the electrical appliances. In this paper, we consider a two-layer heterogeneous smart building network, consisting of a number of cluster-organized smart meters, and a base station (BS). The communication takes two phase: 1) periodical data collection via cluster heads in the first layer, and 2) data transmission from the cluster heads to the BS in the second layer. But, due to the irregular topology of smart meter networks and various types of data traffic of electrical appliances, the data aggregation to the heads and associated spectrum allocation become quite challenging. To solve these problems, we first analyze the relationship between the system performance and the cost of network construction. By using coalition formation game theory, we propose a practical strategy in optimizing channel allocation and cluster-heads deployment. The proposed algorithms are verified through computer simulations.
{"title":"Efficient resource optimization for heterogeneous smart-building networks","authors":"Zijie Zheng, Tianyu Wang, Lingyang Song, Zhu Han","doi":"10.1109/ICC.2014.6884095","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884095","url":null,"abstract":"Smart meters aided by wireless communications have been widely used to collect the information of the electrical appliances. In this paper, we consider a two-layer heterogeneous smart building network, consisting of a number of cluster-organized smart meters, and a base station (BS). The communication takes two phase: 1) periodical data collection via cluster heads in the first layer, and 2) data transmission from the cluster heads to the BS in the second layer. But, due to the irregular topology of smart meter networks and various types of data traffic of electrical appliances, the data aggregation to the heads and associated spectrum allocation become quite challenging. To solve these problems, we first analyze the relationship between the system performance and the cost of network construction. By using coalition formation game theory, we propose a practical strategy in optimizing channel allocation and cluster-heads deployment. The proposed algorithms are verified through computer simulations.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114578272","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884150
Tian Xia, Hsiao-Chun Wu, S. Chang
In this paper, we would like to tackle joint blind frame synchronization and encoder identification of binary low-density parity-check (LDPC) codes for binary phase-shift keying (BPSK) signals. The unknown encoder and the unknown time-delay can be blindly estimated at the same time using the average log-likelihood ratios (LLRs) of syndrome a posteriori probability (APP). To reduce the complexity of the blind frame synchronization, we propose a two-stage search method with a search step-size q by exploiting the quasi-cyclic property of the parity-check matrix. Our proposed new joint scheme is evaluated by the probability of detection resulting from numerous Monte Carlo simulations. The simulation results demonstrate the effectiveness of our proposed joint blind frame-synchronization and encoder-identification scheme for multi-path situations.
{"title":"Joint blind frame synchronization and encoder identification for LDPC codes","authors":"Tian Xia, Hsiao-Chun Wu, S. Chang","doi":"10.1109/ICC.2014.6884150","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884150","url":null,"abstract":"In this paper, we would like to tackle joint blind frame synchronization and encoder identification of binary low-density parity-check (LDPC) codes for binary phase-shift keying (BPSK) signals. The unknown encoder and the unknown time-delay can be blindly estimated at the same time using the average log-likelihood ratios (LLRs) of syndrome a posteriori probability (APP). To reduce the complexity of the blind frame synchronization, we propose a two-stage search method with a search step-size q by exploiting the quasi-cyclic property of the parity-check matrix. Our proposed new joint scheme is evaluated by the probability of detection resulting from numerous Monte Carlo simulations. The simulation results demonstrate the effectiveness of our proposed joint blind frame-synchronization and encoder-identification scheme for multi-path situations.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122015804","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883809
H. Shimizu, H. Asaeda, M. Jibiki, N. Nishinaga
In-network caching is a core technology for saving network resources and improving the response time in Information-/Content-Centric Networking (ICN/CCN). In an ordinary ICN/CCN, content name based routing is used to find cached content in the network. Although there have been several studies on effective and efficient cache retrieval from in-network caches, we propose a novel content hunting scheme, named Local Tree Hunting (LTH) from the point of view to approach the ideal performance. LTH hunts for the closest node to the request node among the nodes with disseminated cache content. It autonomously adjusts the hunting area by changing the size of the hunting tree depending on the degree to which the content has been disseminated through the network. The proposed scheme was verified in a performance analysis; it was shown to have almost the same level of performance as the case of finding the true closest node. System architecture and operations based on the proposed scheme are also described.
网络内缓存是信息/内容中心网络(ICN/CCN)中节省网络资源和提高响应速度的核心技术。在普通的ICN/CCN中，基于内容名的路由用于查找网络中的缓存内容。虽然已经有一些关于从网络缓存中有效和高效检索缓存的研究，但我们从接近理想性能的角度提出了一种新的内容搜索方案，称为局部树搜索(Local Tree hunting, LTH)。LTH在具有分散缓存内容的节点中寻找离请求节点最近的节点。它根据内容通过网络传播的程度，通过改变搜索树的大小来自主调整搜索区域。在性能分析中验证了所提出的方案;结果表明，它的性能几乎与寻找真正最近节点的情况相同。并介绍了基于该方案的系统结构和操作。
{"title":"Content hunting for in-network cache: Design and performance analysis","authors":"H. Shimizu, H. Asaeda, M. Jibiki, N. Nishinaga","doi":"10.1109/ICC.2014.6883809","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883809","url":null,"abstract":"In-network caching is a core technology for saving network resources and improving the response time in Information-/Content-Centric Networking (ICN/CCN). In an ordinary ICN/CCN, content name based routing is used to find cached content in the network. Although there have been several studies on effective and efficient cache retrieval from in-network caches, we propose a novel content hunting scheme, named Local Tree Hunting (LTH) from the point of view to approach the ideal performance. LTH hunts for the closest node to the request node among the nodes with disseminated cache content. It autonomously adjusts the hunting area by changing the size of the hunting tree depending on the degree to which the content has been disseminated through the network. The proposed scheme was verified in a performance analysis; it was shown to have almost the same level of performance as the case of finding the true closest node. System architecture and operations based on the proposed scheme are also described.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122151220","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883343
F. Chiti, R. Fantacci, G. Rigazzi
This paper deals with a clustering approach for VANETs operating in highway scenarios, where a certain degree of correlation among vehicles emerges such that a group mobility pattern is expected. The proposed protocol is inherently mobility driven as the reference metric to select a Cluster Head (CH) takes into account the node connectivity within an estimated coherence time interval. Our clustering protocol handles both cluster set up and maintaining and communications among different clusters. In particular, the inter cluster communications are accomplished by means of relay node selection. The protocol design and validation have been focused on a practical scenario adopting IEEE 802.11p communication standard, highlighting good performance in terms of connection probability, overhead and complexity.
{"title":"A mobility driven joint clustering and relay selection for IEEE 802.11p/WAVE vehicular networks","authors":"F. Chiti, R. Fantacci, G. Rigazzi","doi":"10.1109/ICC.2014.6883343","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883343","url":null,"abstract":"This paper deals with a clustering approach for VANETs operating in highway scenarios, where a certain degree of correlation among vehicles emerges such that a group mobility pattern is expected. The proposed protocol is inherently mobility driven as the reference metric to select a Cluster Head (CH) takes into account the node connectivity within an estimated coherence time interval. Our clustering protocol handles both cluster set up and maintaining and communications among different clusters. In particular, the inter cluster communications are accomplished by means of relay node selection. The protocol design and validation have been focused on a practical scenario adopting IEEE 802.11p communication standard, highlighting good performance in terms of connection probability, overhead and complexity.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122177700","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884102
Yi Liu, Rong Yu, M. Pan, Yan Zhang
Providing adequate and reliable spectrum resources for unlicensed users in spectrum database-based cognitive radio networks is very challenging, mainly due to the dynamic resource availability induced by the licensed users' activities and radio environment. In this paper, we propose an adaptive spectrum access method based on spectrum database for cognitive radio (CR) networks. While making decision to access the licensed spectrum, the secondary users (SUs) not only use the spectrum information informed by the spectrum database but also use the local sensing to confirm the specific condition of the spectrum. The adaptive sensing and access process is modeled as an optimal decision process by maximizing the achievable throughput of CR networks. The dynamic programming algorithm is developed to find the optimal sensing and access policy for each SU. Simulation results show that the proposed sensing and access policies can provide reliability guarantees for finding spectrum opportunities in terms of dynamic radio environment.
{"title":"Adaptive channel access in spectrum database-driven cognitive radio networks","authors":"Yi Liu, Rong Yu, M. Pan, Yan Zhang","doi":"10.1109/ICC.2014.6884102","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884102","url":null,"abstract":"Providing adequate and reliable spectrum resources for unlicensed users in spectrum database-based cognitive radio networks is very challenging, mainly due to the dynamic resource availability induced by the licensed users' activities and radio environment. In this paper, we propose an adaptive spectrum access method based on spectrum database for cognitive radio (CR) networks. While making decision to access the licensed spectrum, the secondary users (SUs) not only use the spectrum information informed by the spectrum database but also use the local sensing to confirm the specific condition of the spectrum. The adaptive sensing and access process is modeled as an optimal decision process by maximizing the achievable throughput of CR networks. The dynamic programming algorithm is developed to find the optimal sensing and access policy for each SU. Simulation results show that the proposed sensing and access policies can provide reliability guarantees for finding spectrum opportunities in terms of dynamic radio environment.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116712856","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884245
Jun Yu Li, Zihuai Lin, B. Vucetic, Ming Xiao, Wen Chen
In this paper, we propose a threshold-based one-bit soft forwarding (TOB-SF) protocol for a multi-source relaying uplink system with network coding. In the TOB-SF protocol, the relay calculates the log-likelihood ratio (LLR) value of each network coded symbol, compares this LLR value with a pre-optimized threshold, and determines whether to transmit or keep silent. We first derive the bit error rate (BER) expression at the destination, based on which, we optimize the threshold to minimize the BER. Then we theoretically prove that the system can achieve the full diversity gain by using this threshold. Further, we optimize the power allocation at the relay to achieve a higher coding gain. Simulation results show that the proposed TOB-SF protocol outperforms other conventional relaying protocols in terms of error performance.
{"title":"One-bit soft forwarding for network coded uplink channels with multiple sources","authors":"Jun Yu Li, Zihuai Lin, B. Vucetic, Ming Xiao, Wen Chen","doi":"10.1109/ICC.2014.6884245","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884245","url":null,"abstract":"In this paper, we propose a threshold-based one-bit soft forwarding (TOB-SF) protocol for a multi-source relaying uplink system with network coding. In the TOB-SF protocol, the relay calculates the log-likelihood ratio (LLR) value of each network coded symbol, compares this LLR value with a pre-optimized threshold, and determines whether to transmit or keep silent. We first derive the bit error rate (BER) expression at the destination, based on which, we optimize the threshold to minimize the BER. Then we theoretically prove that the system can achieve the full diversity gain by using this threshold. Further, we optimize the power allocation at the relay to achieve a higher coding gain. Simulation results show that the proposed TOB-SF protocol outperforms other conventional relaying protocols in terms of error performance.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129781193","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}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883583
Joao P. Amaral, Luís M. L. Oliveira, J. Rodrigues, Guangjie Han, Lei Shu
The recent years realize a progressive transition where fixed computing reached maturity and the mobility age started to thrive. Nowadays, another transition from the mobility age to the “Internet of Everything” (IoE) is taking place. In the IoE vision, several types of quotidian objects will be able to communicate over the Internet. As a result, it is expected that within a decade, IoE will have an economic value of $14.4 trillion, as the number of devices connected to the Internet continues to increase exponentially. The support for security services in these emerging resource-constrained devices is considered a challenge but needs to take into account from the very early stages of the wireless network inception. This paper proposes a network-based intrusion detection system (IDS) for IPv6-enabled wireless sensor networks. The proposed IDS is used to detect security attacks based on traffic signatures and abnormal behaviors.
{"title":"Policy and network-based intrusion detection system for IPv6-enabled wireless sensor networks","authors":"Joao P. Amaral, Luís M. L. Oliveira, J. Rodrigues, Guangjie Han, Lei Shu","doi":"10.1109/ICC.2014.6883583","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883583","url":null,"abstract":"The recent years realize a progressive transition where fixed computing reached maturity and the mobility age started to thrive. Nowadays, another transition from the mobility age to the “Internet of Everything” (IoE) is taking place. In the IoE vision, several types of quotidian objects will be able to communicate over the Internet. As a result, it is expected that within a decade, IoE will have an economic value of $14.4 trillion, as the number of devices connected to the Internet continues to increase exponentially. The support for security services in these emerging resource-constrained devices is considered a challenge but needs to take into account from the very early stages of the wireless network inception. This paper proposes a network-based intrusion detection system (IDS) for IPv6-enabled wireless sensor networks. The proposed IDS is used to detect security attacks based on traffic signatures and abnormal behaviors.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128259711","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：