Pub Date : 2012-04-01DOI: 10.1109/WCNC.2012.6213921
Eunju Lee, Gillsang Yoon, Jaedon Park, Suil Kim
The multi-input multi-output (MIMO) system with a subcarrier intensity modulation (SIM) scheme in free-space optics (FSO) has a huge merit for ultra wide band communications mainly due to its diversity gain to be able to mitigate the signal scintillation caused by the atmospheric turbulence. In this study, we have analyzed the performance of the orthogonal space-time block codes (OSTBCs) in FSO links. In particular, the power series expressions of the outage probability and average bit error rate (BER) of the OSTBC for any number of antennas are derived in gamma-gamma fading channels using the SIM scheme. According to the analysis, the 3×2 OSTBC scheme could achieve a significantly high signal-to-noise ratio (SNR) gain of 62.5 dB in a strong turbulence regime, and also a moderately high SNR gain of 48 dB in a moderate turbulence regime over the no diversity at the BER of 10-6. Monte Carlo simulation results verify the accuracy of our analysis.
{"title":"Performance analysis of OSTBC in gamma-gamma fading channels","authors":"Eunju Lee, Gillsang Yoon, Jaedon Park, Suil Kim","doi":"10.1109/WCNC.2012.6213921","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213921","url":null,"abstract":"The multi-input multi-output (MIMO) system with a subcarrier intensity modulation (SIM) scheme in free-space optics (FSO) has a huge merit for ultra wide band communications mainly due to its diversity gain to be able to mitigate the signal scintillation caused by the atmospheric turbulence. In this study, we have analyzed the performance of the orthogonal space-time block codes (OSTBCs) in FSO links. In particular, the power series expressions of the outage probability and average bit error rate (BER) of the OSTBC for any number of antennas are derived in gamma-gamma fading channels using the SIM scheme. According to the analysis, the 3×2 OSTBC scheme could achieve a significantly high signal-to-noise ratio (SNR) gain of 62.5 dB in a strong turbulence regime, and also a moderately high SNR gain of 48 dB in a moderate turbulence regime over the no diversity at the BER of 10-6. Monte Carlo simulation results verify the accuracy of our analysis.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131316550","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-04-01DOI: 10.1109/WCNC.2012.6214149
Julien Boite, V. Conan, G. Nguengang, A. Ploix, D. Gaïti
Wireless Mesh Networks have been traditionally deployed to offer Internet access. Following the general trend of convergence, they must increasingly provide customers with communication services whose quality constraints are heterogeneous. For large scale deployments, access to the Internet is provided by multiple gateways installed at different points in the network. Each gateway may be connected to the Internet with different technologies (ADSL, Ethernet, satellite, HF link) offering several alternatives to get out of the network with heterogeneous and dynamic performances. Routing QoS-constrained flows so that they always benefit from the best quality available is a challenging task. In addition to an intelligent gateway selection, it requires a forwarding system able to dynamically balance each flow towards the most suitable gateway. Existing candidates generate unnecessary complexity and overhead. In this paper, we propose a distributed and lightweight tag-based forwarding scheme that brings the flexibility required to work at the flow level, and supports dynamic traffic balancing among gateways with various bandwidth, delay or jitter characteristics. We implemented our forwarding scheme on an experimental testbed and applied it to the enforcement of simple gateway selection strategies. Results demonstrate the interest of our approach and its efficiency to dynamically forward specific flows among competing gateways.
{"title":"Lightweight tag-based forwarding among competing gateways in Wireless Mesh Networks","authors":"Julien Boite, V. Conan, G. Nguengang, A. Ploix, D. Gaïti","doi":"10.1109/WCNC.2012.6214149","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214149","url":null,"abstract":"Wireless Mesh Networks have been traditionally deployed to offer Internet access. Following the general trend of convergence, they must increasingly provide customers with communication services whose quality constraints are heterogeneous. For large scale deployments, access to the Internet is provided by multiple gateways installed at different points in the network. Each gateway may be connected to the Internet with different technologies (ADSL, Ethernet, satellite, HF link) offering several alternatives to get out of the network with heterogeneous and dynamic performances. Routing QoS-constrained flows so that they always benefit from the best quality available is a challenging task. In addition to an intelligent gateway selection, it requires a forwarding system able to dynamically balance each flow towards the most suitable gateway. Existing candidates generate unnecessary complexity and overhead. In this paper, we propose a distributed and lightweight tag-based forwarding scheme that brings the flexibility required to work at the flow level, and supports dynamic traffic balancing among gateways with various bandwidth, delay or jitter characteristics. We implemented our forwarding scheme on an experimental testbed and applied it to the enforcement of simple gateway selection strategies. Results demonstrate the interest of our approach and its efficiency to dynamically forward specific flows among competing gateways.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125320949","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-04-01DOI: 10.1109/WCNC.2012.6214461
T. Nakano, Yutaka Okaie, A. Vasilakos
This paper focuses on throughput and efficiency of molecular communication between a pair of sender and receiver nanomachines. In the molecular communication considered in this paper, the sender transmits molecules at a fixed rate, the molecules propagate in the environment, and the receiver captures and processes the molecules following simple enzyme kinetics. We define throughput as the average number of molecules processed by the receiver per unit time, and efficiency as the throughput divided by the number of molecules transmitted by the sender per unit time. An upper bound on throughput and efficiency at steady-state are first derived. Simulation results are then provided to show that the throughput increases as the transmission rate increases and that the efficiency has an optimal transmission rate to achieve the maximum.
{"title":"Throughput and efficiency of molecular communication between nanomachines","authors":"T. Nakano, Yutaka Okaie, A. Vasilakos","doi":"10.1109/WCNC.2012.6214461","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214461","url":null,"abstract":"This paper focuses on throughput and efficiency of molecular communication between a pair of sender and receiver nanomachines. In the molecular communication considered in this paper, the sender transmits molecules at a fixed rate, the molecules propagate in the environment, and the receiver captures and processes the molecules following simple enzyme kinetics. We define throughput as the average number of molecules processed by the receiver per unit time, and efficiency as the throughput divided by the number of molecules transmitted by the sender per unit time. An upper bound on throughput and efficiency at steady-state are first derived. Simulation results are then provided to show that the throughput increases as the transmission rate increases and that the efficiency has an optimal transmission rate to achieve the maximum.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126890737","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-04-01DOI: 10.1109/WCNC.2012.6214061
Wei-Cheng Chu, K. Ssu
In wireless sensor networks (WSNs) deployed in an outdoor environment, obstacles may occur as a result of a non-uniform distribution of the sensor nodes or the presence of barriers. These obstacles result in a degradation of the network performance, so obstacle identification is a major concern in most WSN applications. This paper develops a Decentralized Boundary Detection (DBD) algorithm for identifying sensor nodes near a hole or obstacle in the WSN. The algorithm does not require any knowledge of the node locations or distances between two nodes. The detection capability is provided even in networks where the sensor nodes have a non-unit disk communication range.
{"title":"Decentralized boundary detection without location information in wireless sensor networks","authors":"Wei-Cheng Chu, K. Ssu","doi":"10.1109/WCNC.2012.6214061","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214061","url":null,"abstract":"In wireless sensor networks (WSNs) deployed in an outdoor environment, obstacles may occur as a result of a non-uniform distribution of the sensor nodes or the presence of barriers. These obstacles result in a degradation of the network performance, so obstacle identification is a major concern in most WSN applications. This paper develops a Decentralized Boundary Detection (DBD) algorithm for identifying sensor nodes near a hole or obstacle in the WSN. The algorithm does not require any knowledge of the node locations or distances between two nodes. The detection capability is provided even in networks where the sensor nodes have a non-unit disk communication range.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126559165","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-04-01DOI: 10.1109/WCNC.2012.6213924
Davood M. Godarzi, K. Arshad, Y. Ko, K. Moessner
Cognitive radio network is defined as an intelligent wireless communication network that should be able to adaptively reconfigure its communication parameters to meet the demands of the transmission network or the user. In this context one possible way to utilize unused licensed spectrum without interfering with incumbent users is through spectrum sensing. Due to channel uncertainties, single cognitive (opportunistic) user cannot make a decision reliably and hence collaboration among multiple users is often required. Here collaboration among large number of users tends to increase power consumption and introduces large communication overheads. In this paper, the number of collaborating users is optimized in order to maximize the probability of detection for any given power budget in a cognitive radio network, while satisfying constraints on the false alarm probability. We show that for the maximum probability of detection, collaboration of only a subset of available opportunistic users is required. The robustness of our proposed spectrum sensing algorithm is also examined under flat Rayleigh fading and AWGN channel conditions.
{"title":"Selecting users in energy-efficient collaborative spectrum sensing","authors":"Davood M. Godarzi, K. Arshad, Y. Ko, K. Moessner","doi":"10.1109/WCNC.2012.6213924","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213924","url":null,"abstract":"Cognitive radio network is defined as an intelligent wireless communication network that should be able to adaptively reconfigure its communication parameters to meet the demands of the transmission network or the user. In this context one possible way to utilize unused licensed spectrum without interfering with incumbent users is through spectrum sensing. Due to channel uncertainties, single cognitive (opportunistic) user cannot make a decision reliably and hence collaboration among multiple users is often required. Here collaboration among large number of users tends to increase power consumption and introduces large communication overheads. In this paper, the number of collaborating users is optimized in order to maximize the probability of detection for any given power budget in a cognitive radio network, while satisfying constraints on the false alarm probability. We show that for the maximum probability of detection, collaboration of only a subset of available opportunistic users is required. The robustness of our proposed spectrum sensing algorithm is also examined under flat Rayleigh fading and AWGN channel conditions.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121634340","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-04-01DOI: 10.1109/WCNC.2012.6214298
G. Ferrante, J. Fiorina, Maria-Gabriella Di Benedetto
In this paper we deal with the problem of minimizing the complexity of an IR-UWB system by the introduction of Time-Reversal, under a power constraint and fixing a reachable performance in terms of BER. An approximate trade-off in the choice of the number of taps at the transmitter and the number of fingers at the receiver is proposed.
{"title":"Complexity reduction by combining time reversal and IR-UWB","authors":"G. Ferrante, J. Fiorina, Maria-Gabriella Di Benedetto","doi":"10.1109/WCNC.2012.6214298","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214298","url":null,"abstract":"In this paper we deal with the problem of minimizing the complexity of an IR-UWB system by the introduction of Time-Reversal, under a power constraint and fixing a reachable performance in terms of BER. An approximate trade-off in the choice of the number of taps at the transmitter and the number of fingers at the receiver is proposed.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126044554","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-04-01DOI: 10.1109/WCNC.2012.6213996
D. Panaitopol, P. Kong, C. Tham, Abdoulaye Bagayoko
Implementing incremental relaying in a practical system is not a trivial task because it requires the destination node to provide feedback on success or failure of a transmission. In practice, the feedback may be affected by propagation impairments and collisions. In this case, the relay and the source should coordinate among themselves in the absence of perfect feedback information such that packet collision will not occur. In view of the challenge, this paper proposes a novel and practical incremental relaying scheme that deals with the imperfect feedback. The key idea is to have pessimistic source and optimistic relay. The proposed scheme is simple and easily implementable. Simulation results show that the proposed scheme can outperform amplify-and-forward (AF), as well as approaching the performance of an idealized incremental AF with perfect feedback information.
{"title":"A practical incremental relaying scheme with imperfect feedback for wireless networks","authors":"D. Panaitopol, P. Kong, C. Tham, Abdoulaye Bagayoko","doi":"10.1109/WCNC.2012.6213996","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213996","url":null,"abstract":"Implementing incremental relaying in a practical system is not a trivial task because it requires the destination node to provide feedback on success or failure of a transmission. In practice, the feedback may be affected by propagation impairments and collisions. In this case, the relay and the source should coordinate among themselves in the absence of perfect feedback information such that packet collision will not occur. In view of the challenge, this paper proposes a novel and practical incremental relaying scheme that deals with the imperfect feedback. The key idea is to have pessimistic source and optimistic relay. The proposed scheme is simple and easily implementable. Simulation results show that the proposed scheme can outperform amplify-and-forward (AF), as well as approaching the performance of an idealized incremental AF with perfect feedback information.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126059324","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-04-01DOI: 10.1109/WCNC.2012.6214206
Ahmed Bader, K. Abed-Meraim, Mohamed-Slim Alouini
Beaconless position-based forwarding protocols have recently evolved as a promising solution for packet forwarding in wireless sensor networks. Quite a few variants of this class of forwarding protocols have been proposed over the years. One common observation is that they have all been evaluated from the perspective of a single node. Although useful, but a solid understanding of the end-to-end performance is still necessary. In this paper, we shed light on the end-to-end performance of beaconless position-based protocols along three distinct dimensions: energy, latency, and back-off probability. The latter is used as a direct indicator of the network's transport capacity. Consequently, we are able to provide an elaborate response to the question: what does it really cost to deliver a packet in a wireless sensor network using position-based beaconless forwarding protocols? In responding to this question, we highlighted the different performance tradeoffs inherent to beaconless position-based protocols. Furthermore, some operational recommendations are also provided.
{"title":"What does it cost to deliver information using position-based beaconless forwarding protocols?","authors":"Ahmed Bader, K. Abed-Meraim, Mohamed-Slim Alouini","doi":"10.1109/WCNC.2012.6214206","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214206","url":null,"abstract":"Beaconless position-based forwarding protocols have recently evolved as a promising solution for packet forwarding in wireless sensor networks. Quite a few variants of this class of forwarding protocols have been proposed over the years. One common observation is that they have all been evaluated from the perspective of a single node. Although useful, but a solid understanding of the end-to-end performance is still necessary. In this paper, we shed light on the end-to-end performance of beaconless position-based protocols along three distinct dimensions: energy, latency, and back-off probability. The latter is used as a direct indicator of the network's transport capacity. Consequently, we are able to provide an elaborate response to the question: what does it really cost to deliver a packet in a wireless sensor network using position-based beaconless forwarding protocols? In responding to this question, we highlighted the different performance tradeoffs inherent to beaconless position-based protocols. Furthermore, some operational recommendations are also provided.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116126062","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-04-01DOI: 10.1109/WCNC.2012.6213958
G. Liebl, T. M. D. Moraes, Akin Soysal, E. Seidel
In this work, we revisit the issue of fair resource allocation in relay-enhanced wireless networks. Our focus this time is on Type-1a relays as proposed for LTE-Advanced. The latter operate as out-band relays, i.e., the backhaul and relay access link use separate carrier frequencies. If carrier aggregation is applied at the macro base station, the backhaul carrier may also contain part of the macro access link. Assuming full buffer traffic on the downstream, we demonstrate how similar resource partitioning strategies at the base station as proposed for in-band relays can be also applied in the out-band case. Furthermore, we propose that for out-band relays, the backhaul link should be considered directly in the regular frequency-selective scheduling process for best performance vs. complexity trade-off. The presented results include the resource consumption and achievable throughput for a hot-spot scenario with 2 out-band relay nodes, as well as a comparison to the in-band case assuming same overall resource budget.
{"title":"Fair resource allocation for the relay backhaul link in LTE-Advanced","authors":"G. Liebl, T. M. D. Moraes, Akin Soysal, E. Seidel","doi":"10.1109/WCNC.2012.6213958","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213958","url":null,"abstract":"In this work, we revisit the issue of fair resource allocation in relay-enhanced wireless networks. Our focus this time is on Type-1a relays as proposed for LTE-Advanced. The latter operate as out-band relays, i.e., the backhaul and relay access link use separate carrier frequencies. If carrier aggregation is applied at the macro base station, the backhaul carrier may also contain part of the macro access link. Assuming full buffer traffic on the downstream, we demonstrate how similar resource partitioning strategies at the base station as proposed for in-band relays can be also applied in the out-band case. Furthermore, we propose that for out-band relays, the backhaul link should be considered directly in the regular frequency-selective scheduling process for best performance vs. complexity trade-off. The presented results include the resource consumption and achievable throughput for a hot-spot scenario with 2 out-band relay nodes, as well as a comparison to the in-band case assuming same overall resource budget.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"4 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932431","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-04-01DOI: 10.1109/WCNC.2012.6214286
Yi Ren, V. Oleshchuk, F. Li, S. Sulistyo
Body Area Network (BAN) consists of various types of small physiological sensors, transmission modules and low computational components and can thus form an E-health solution for continuous all-day and any-place health monitoring. To protect confidentiality of collected data, a shared group key is usually deployed in a BAN, and consequently a secure communication group is generated. In this paper, we propose a bi-directional security and collusion resilience key management scheme for BAN, referred to as FoSBaS. Detailed analysis shows that the scheme can provide both forward security and backward security and resist against collusion attacks. Furthermore, the FoSBaS is implemented on a Sun SPOT based sensor network testbed to evaluate its performance. Experimental results show that a group key can be updated within 102.13 ms with 60.22 mJ energy consumption on a 12 node BAN with 28 bits pairwise key.
{"title":"FoSBaS: A bi-directional secrecy and collusion resilience key management scheme for BANs","authors":"Yi Ren, V. Oleshchuk, F. Li, S. Sulistyo","doi":"10.1109/WCNC.2012.6214286","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214286","url":null,"abstract":"Body Area Network (BAN) consists of various types of small physiological sensors, transmission modules and low computational components and can thus form an E-health solution for continuous all-day and any-place health monitoring. To protect confidentiality of collected data, a shared group key is usually deployed in a BAN, and consequently a secure communication group is generated. In this paper, we propose a bi-directional security and collusion resilience key management scheme for BAN, referred to as FoSBaS. Detailed analysis shows that the scheme can provide both forward security and backward security and resist against collusion attacks. Furthermore, the FoSBaS is implemented on a Sun SPOT based sensor network testbed to evaluate its performance. Experimental results show that a group key can be updated within 102.13 ms with 60.22 mJ energy consumption on a 12 node BAN with 28 bits pairwise key.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125112766","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
扫码关注我们
求助内容：
应助结果提醒方式：