Pub Date : 2012-06-14DOI: 10.1109/ComNet.2012.6217738
Zakia Jellali, L. N. Atallah
Channels exhibiting a sparse impulse response arise in a number of communication applications. In this paper, we address the problem of sparse channel estimation in Orthogonal Frequency Division Multiplexing (OFDM) systems. Our goal is to compare the accuracy of the Matching Pursuit (MP) [1] approach to an optimized threshold-based approach, named the Probabilistic Framework Estimator (PFE) [2]. The comparison of the two considered approaches is carried in the two scenarios of a priori and no priori knowledge about the channel degree of sparsity (CDS). To this end, the PFE algorithm is extended to the case of known probability of active taps. Also, an adapted version of the MP, to the case of unknown number of paths, is proposed.
{"title":"Matching Pursuit versus threshold-based approach for channel estimation in OFDM systems","authors":"Zakia Jellali, L. N. Atallah","doi":"10.1109/ComNet.2012.6217738","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217738","url":null,"abstract":"Channels exhibiting a sparse impulse response arise in a number of communication applications. In this paper, we address the problem of sparse channel estimation in Orthogonal Frequency Division Multiplexing (OFDM) systems. Our goal is to compare the accuracy of the Matching Pursuit (MP) [1] approach to an optimized threshold-based approach, named the Probabilistic Framework Estimator (PFE) [2]. The comparison of the two considered approaches is carried in the two scenarios of a priori and no priori knowledge about the channel degree of sparsity (CDS). To this end, the PFE algorithm is extended to the case of known probability of active taps. Also, an adapted version of the MP, to the case of unknown number of paths, is proposed.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121602184","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217734
M. Karray, Yasir Khan
Since a long time wireless networks have been offering two types of services: variable bit-rate such as mail and constant bit-rate such as voice. Recently they also offer service for streaming calls such as mobile television. The objective of the present paper is to study the problem of allocating (and sharing) the resources for this new type of calls and to compare the performance of different allocation strategies. The allocation strategy implemented in real networks is an iterative time-sharing strategy. We build an explicit formulation of this strategy which permits not only a faster implementation, but also an analytical evaluation of its performance. Moreover we describe an optimal allocation strategy consisting of assigning the resources in priority to the least consuming ones. A cornerstone to evaluate and compare the different allocation strategies is the so-called outage probability defined for each location as the probability that a user in this location doesn't get his required bit-rate. We compare the efficiency of different numerical methods to calculate it; and show that the inverse Laplace method is rapid and efficient. We also calculate the increase of the outage probability of the time-sharing strategy compared to the optimal one. Finally, we validate a method permitting to calculate analytically the average of the outage probabilities over the different locations.
{"title":"Evaluation and comparison of resource allocation strategies for new streaming services in wireless cellular networks","authors":"M. Karray, Yasir Khan","doi":"10.1109/ComNet.2012.6217734","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217734","url":null,"abstract":"Since a long time wireless networks have been offering two types of services: variable bit-rate such as mail and constant bit-rate such as voice. Recently they also offer service for streaming calls such as mobile television. The objective of the present paper is to study the problem of allocating (and sharing) the resources for this new type of calls and to compare the performance of different allocation strategies. The allocation strategy implemented in real networks is an iterative time-sharing strategy. We build an explicit formulation of this strategy which permits not only a faster implementation, but also an analytical evaluation of its performance. Moreover we describe an optimal allocation strategy consisting of assigning the resources in priority to the least consuming ones. A cornerstone to evaluate and compare the different allocation strategies is the so-called outage probability defined for each location as the probability that a user in this location doesn't get his required bit-rate. We compare the efficiency of different numerical methods to calculate it; and show that the inverse Laplace method is rapid and efficient. We also calculate the increase of the outage probability of the time-sharing strategy compared to the optimal one. Finally, we validate a method permitting to calculate analytically the average of the outage probabilities over the different locations.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125482507","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217747
Olfa Gaddour, A. Koubâa, S. A. Chaudhry, M. Tezeghdanti, Rihab Chaâri, M. Abid
In this paper, we simulate and analyze the performance of the network formation process with the RPL (IPv6 Routing Protocol for Low Power and Lossy Networks), which is a routing protocol specifically designed for Low power and Lossy Networks (LLN) compliant with 6LoWPAN (IPv6 Low power Wireless Personal Area Networks). One motivation behind this work is that RPL is the first prospective candidate routing protocol for low-power and lossy networks, which are a main component in the next generation Internet-of-Things. RPL is still under development, although having gained maturity, and is open to improvements. Indeed, there is a need to understand well its behavior, and investigate its relevance. Our analysis is based on the ContikiRPL accurate and realistic simulation model developed under Contiki operating system. The performance of RPL is evaluated and analyzed for different network settings to understand the impact of the protocol attributes on the network formation performance, namely in terms energy, storage overhead, communication overhead, network convergence time and the maximum hop count. We argue through simulation that RPL provides several features that make it suitable to large scale networks.
在本文中，我们使用RPL (IPv6 Routing Protocol for Low Power and Lossy Networks)来模拟和分析网络形成过程的性能，RPL是一种专门为低功耗和有损网络(LLN)设计的路由协议，符合6LoWPAN (IPv6低功耗无线个人区域网络)。这项工作背后的一个动机是，RPL是低功耗和有损网络的第一个潜在候选路由协议，这是下一代物联网的主要组成部分。RPL虽然已经成熟，但仍在发展中，并且可以改进。的确，有必要很好地理解它的行为，并调查其相关性。我们的分析是基于ContikiRPL在Contiki操作系统下开发的精确逼真的仿真模型。通过对不同网络设置下RPL的性能进行评估和分析，了解协议属性对网络形成性能的影响，即能量、存储开销、通信开销、网络收敛时间和最大跳数。我们通过仿真论证了RPL提供了几个使其适合大规模网络的特性。
{"title":"Simulation and performance evaluation of DAG construction with RPL","authors":"Olfa Gaddour, A. Koubâa, S. A. Chaudhry, M. Tezeghdanti, Rihab Chaâri, M. Abid","doi":"10.1109/ComNet.2012.6217747","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217747","url":null,"abstract":"In this paper, we simulate and analyze the performance of the network formation process with the RPL (IPv6 Routing Protocol for Low Power and Lossy Networks), which is a routing protocol specifically designed for Low power and Lossy Networks (LLN) compliant with 6LoWPAN (IPv6 Low power Wireless Personal Area Networks). One motivation behind this work is that RPL is the first prospective candidate routing protocol for low-power and lossy networks, which are a main component in the next generation Internet-of-Things. RPL is still under development, although having gained maturity, and is open to improvements. Indeed, there is a need to understand well its behavior, and investigate its relevance. Our analysis is based on the ContikiRPL accurate and realistic simulation model developed under Contiki operating system. The performance of RPL is evaluated and analyzed for different network settings to understand the impact of the protocol attributes on the network formation performance, namely in terms energy, storage overhead, communication overhead, network convergence time and the maximum hop count. We argue through simulation that RPL provides several features that make it suitable to large scale networks.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134320984","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217748
Asma Ben Hadj Hmida, S. Cherif, Hichem Besbes
In this paper, we treat the orthogonal space-time block coded signals. Those codes present a redundancy that can be exploited for the enhancement of the detection. We first study the classical energy detector based STBC and prove the benefits of spatial diversity in enhancing the capability of signal detection. Taking advantage of the Alamouti code structure, we propose two statistical metric tests based on high order moments and we evaluate their performances. Simulations results show that the proposed algorithms intend to offer better performance compared to the classical energy detector. Indeed, the first proposed metric test improves the performance in terms of the accuracy of the detection. In fact, the detection probability is improved by almost 18% at 1% false alarm. In the other hand, the second proposed metric offers better performance in terms of robustness to the noise uncertainty, 80% compared to the classical energy detector for an uncertainty level equal to 1 and 2dB.
{"title":"Spectrum sensing based on STBC higher order statistics for cognitive radio systems","authors":"Asma Ben Hadj Hmida, S. Cherif, Hichem Besbes","doi":"10.1109/ComNet.2012.6217748","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217748","url":null,"abstract":"In this paper, we treat the orthogonal space-time block coded signals. Those codes present a redundancy that can be exploited for the enhancement of the detection. We first study the classical energy detector based STBC and prove the benefits of spatial diversity in enhancing the capability of signal detection. Taking advantage of the Alamouti code structure, we propose two statistical metric tests based on high order moments and we evaluate their performances. Simulations results show that the proposed algorithms intend to offer better performance compared to the classical energy detector. Indeed, the first proposed metric test improves the performance in terms of the accuracy of the detection. In fact, the detection probability is improved by almost 18% at 1% false alarm. In the other hand, the second proposed metric offers better performance in terms of robustness to the noise uncertainty, 80% compared to the classical energy detector for an uncertainty level equal to 1 and 2dB.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123447003","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217735
Z. Trabelsi, Hishem El Sayed, S. Zeidan
In this paper, we present a mechanism that utilizes network traffic behavior and packet matching statistics to optimize dynamically the ordering of the firewall filtering rules. The proposed technique segments the traffic space, calculates the matching rate for each filtering rule and deduces statistics means and variances over a predefined window of segments. The means and variances are used to update the positions of the filtering rules in the security policy. Through experiments using simulated firewall and network traffic generator, the proposed mechanism is shown to be efficient and easy to deploy in practical firewall implementation. This work demonstrates that the use of dynamic rule-ordering improves the filtering processing time and allows firewall administrators to analyze further the network traffic behavior and accordingly adjust the initial order of the filtering rules.
{"title":"Firewall packet matching optimization using network traffic behavior and packet matching statistics","authors":"Z. Trabelsi, Hishem El Sayed, S. Zeidan","doi":"10.1109/ComNet.2012.6217735","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217735","url":null,"abstract":"In this paper, we present a mechanism that utilizes network traffic behavior and packet matching statistics to optimize dynamically the ordering of the firewall filtering rules. The proposed technique segments the traffic space, calculates the matching rate for each filtering rule and deduces statistics means and variances over a predefined window of segments. The means and variances are used to update the positions of the filtering rules in the security policy. Through experiments using simulated firewall and network traffic generator, the proposed mechanism is shown to be efficient and easy to deploy in practical firewall implementation. This work demonstrates that the use of dynamic rule-ordering improves the filtering processing time and allows firewall administrators to analyze further the network traffic behavior and accordingly adjust the initial order of the filtering rules.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"32 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114135357","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217744
Imen Turki, I. Kammoun, M. Siala
In this paper, we investigate limited feedback precoding for two single-user MIMO systems. The first one employs spatial diversity at the transmitter and Maximum Ratio Combining at the receiver. The second one uses spatial multiplexing at the transmitter and V-BLAST signal processing at the receiver. For both systems, the precoder is selected at the receiver among a codebook and its index is conveyed to the transmitter through an error free feedback channel. For the first system, we consider two Grassmannian precoding codebooks and show through simulation results that a small number of feedback bits can reach the theoretical performance. For the case of a single-user system based on spatial multiplexing, we propose a novel criterion for selecting among codebook matrices the optimum precoding matrix at the receiver which maximizes the minimum signal to interference and noise ratio over the transmitted substreams. Simulation results show that our proposed selection criterion outperforms three other criteria introduced in the literature for the spatial muliplexing MIMO system. They also show a significant enhancement over the unprecoded spatial multiplexing system.
{"title":"Precoding for MIMO systems with Grassmannian codebooks","authors":"Imen Turki, I. Kammoun, M. Siala","doi":"10.1109/ComNet.2012.6217744","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217744","url":null,"abstract":"In this paper, we investigate limited feedback precoding for two single-user MIMO systems. The first one employs spatial diversity at the transmitter and Maximum Ratio Combining at the receiver. The second one uses spatial multiplexing at the transmitter and V-BLAST signal processing at the receiver. For both systems, the precoder is selected at the receiver among a codebook and its index is conveyed to the transmitter through an error free feedback channel. For the first system, we consider two Grassmannian precoding codebooks and show through simulation results that a small number of feedback bits can reach the theoretical performance. For the case of a single-user system based on spatial multiplexing, we propose a novel criterion for selecting among codebook matrices the optimum precoding matrix at the receiver which maximizes the minimum signal to interference and noise ratio over the transmitted substreams. Simulation results show that our proposed selection criterion outperforms three other criteria introduced in the literature for the spatial muliplexing MIMO system. They also show a significant enhancement over the unprecoded spatial multiplexing system.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124306541","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217727
Fatma Zouaidi, H. Boujemaa, M. Siala
In this paper, we evaluate the performance of Automatic Repeat reQuest (ARQ) protocols for MIMO (Multiple In Multiple Out) Systems using fixed and adaptive Modulation based on the instantaneous Signal to Noise Ratio (SNR). Transmit Antenna Selection (TAS) or/and Space Time Block Coding (STBC) are used. At the receiver, Maximum Ration Combining (MRC), Selection Combining (SC), Generalized SC (GSC), Minimum Selection GSC (MSGSC) and Maximum Likeliood (ML) detection are used. We also propose a combination of TAS and STBC where STBC is performed over two selected best antennas. We provide an analysis of the throughput performance of ARQ for MIMO systems using different transmitting and receiving techniques. Simulation results are also provided to confirm the accuracy of the theoretical analysis.
{"title":"ARQ protocols for MIMO systems","authors":"Fatma Zouaidi, H. Boujemaa, M. Siala","doi":"10.1109/ComNet.2012.6217727","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217727","url":null,"abstract":"In this paper, we evaluate the performance of Automatic Repeat reQuest (ARQ) protocols for MIMO (Multiple In Multiple Out) Systems using fixed and adaptive Modulation based on the instantaneous Signal to Noise Ratio (SNR). Transmit Antenna Selection (TAS) or/and Space Time Block Coding (STBC) are used. At the receiver, Maximum Ration Combining (MRC), Selection Combining (SC), Generalized SC (GSC), Minimum Selection GSC (MSGSC) and Maximum Likeliood (ML) detection are used. We also propose a combination of TAS and STBC where STBC is performed over two selected best antennas. We provide an analysis of the throughput performance of ARQ for MIMO systems using different transmitting and receiving techniques. Simulation results are also provided to confirm the accuracy of the theoretical analysis.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361054","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217746
Imen Elbouabidi, Ikbel Daly, F. Zarai
To provide secure 3GPP LTE-WLAN interworking, Extensible Authentication Protocol-Authentication and Key Agreement (EAP-AKA) is used. However, EAP-AKA has several vulnerabilities such as disclosure of user identity, man-in-the-middle attack, Sequence Number (SQN) synchronization, and additional bandwidth consumption. Therefore, in this paper, we propose new re-authentication protocol for wireless 3GPP LTE. The proposed protocol guarantees stronger security, mutual authentication, and resistance against many attacks. The suggested solution proves its effectiveness following the studies of simulation which carried out according to different criteria handoff latency, loss and blocking rate.
{"title":"Secure handoff protocol in 3GPP LTE networks","authors":"Imen Elbouabidi, Ikbel Daly, F. Zarai","doi":"10.1109/ComNet.2012.6217746","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217746","url":null,"abstract":"To provide secure 3GPP LTE-WLAN interworking, Extensible Authentication Protocol-Authentication and Key Agreement (EAP-AKA) is used. However, EAP-AKA has several vulnerabilities such as disclosure of user identity, man-in-the-middle attack, Sequence Number (SQN) synchronization, and additional bandwidth consumption. Therefore, in this paper, we propose new re-authentication protocol for wireless 3GPP LTE. The proposed protocol guarantees stronger security, mutual authentication, and resistance against many attacks. The suggested solution proves its effectiveness following the studies of simulation which carried out according to different criteria handoff latency, loss and blocking rate.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121580519","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217733
M. Sarkiss, M. Kamoun
Recently, Energy Efficient (EE) communications have received increasing interest specially in cellular networks. Promising techniques, such as MIMO and Base Station (BS) Cooperation schemes, have been widely studied in the past to improve the spectral efficiency and the reliability. Nowadays, the purpose is to investigate how these techniques can reduce the energy consumption of the systems. In this paper, we address for a single user scenario the energy efficiency of two BSs cooperation under limited backhaul capacity. In order to evaluate the EE metric, we provide an information-theoretical analysis based on the outage probability. Then, we identify by numerical results the cooperation scenarios that can save energy depending on the backhaul capacity.
{"title":"Energy efficiency analysis of base station cooperation under limited backhaul capacity","authors":"M. Sarkiss, M. Kamoun","doi":"10.1109/ComNet.2012.6217733","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217733","url":null,"abstract":"Recently, Energy Efficient (EE) communications have received increasing interest specially in cellular networks. Promising techniques, such as MIMO and Base Station (BS) Cooperation schemes, have been widely studied in the past to improve the spectral efficiency and the reliability. Nowadays, the purpose is to investigate how these techniques can reduce the energy consumption of the systems. In this paper, we address for a single user scenario the energy efficiency of two BSs cooperation under limited backhaul capacity. In order to evaluate the EE metric, we provide an information-theoretical analysis based on the outage probability. Then, we identify by numerical results the cooperation scenarios that can save energy depending on the backhaul capacity.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125660950","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 : 2012-06-14DOI: 10.1109/ComNet.2012.6217736
Yosra Ben Saied, Alexis Olivereau
Considering the global identification and security challenges in IoT, the Host Identity Protocol (HIP) emerges as the most suitable solution for key establishment between two peers, allowing secure and uninterrupted connections. However, the heterogeneous nature of IoT entities coupling resource-constrained networks and powerful Internet complicates the use of HIP on small devices due to its expensive cryptographic operations. In this paper we present the HIP Tiny EXchange, a distributed lightweight key exchange protocol designed to reduce the requirements of HIP Basic EXchange in order to be supported by resource-constrained nodes.
{"title":"HIP Tiny Exchange (TEX): A distributed key exchange scheme for HIP-based Internet of Things","authors":"Yosra Ben Saied, Alexis Olivereau","doi":"10.1109/ComNet.2012.6217736","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217736","url":null,"abstract":"Considering the global identification and security challenges in IoT, the Host Identity Protocol (HIP) emerges as the most suitable solution for key establishment between two peers, allowing secure and uninterrupted connections. However, the heterogeneous nature of IoT entities coupling resource-constrained networks and powerful Internet complicates the use of HIP on small devices due to its expensive cryptographic operations. In this paper we present the HIP Tiny EXchange, a distributed lightweight key exchange protocol designed to reduce the requirements of HIP Basic EXchange in order to be supported by resource-constrained nodes.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131919653","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
扫码关注我们
求助内容：
应助结果提醒方式：