Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks
Information security has been received more and more attention for next-generation wireless sensor networks. In this paper, we consider the problem of resource management based on security satisfaction ratio with fairness-aware in two-way relay networks. Multiple source nodes exchange information wi...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/819195 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849685471598215168 |
|---|---|
| author | Jun Zhao Zhaoming Lu Xiangming Wen Haijun Zhang Shenghua He Wenpeng Jing |
| author_facet | Jun Zhao Zhaoming Lu Xiangming Wen Haijun Zhang Shenghua He Wenpeng Jing |
| author_sort | Jun Zhao |
| collection | DOAJ |
| description | Information security has been received more and more attention for next-generation wireless sensor networks. In this paper, we consider the problem of resource management based on security satisfaction ratio with fairness-aware in two-way relay networks. Multiple source nodes exchange information with the help of relay node in the presence of an eavesdropper, and diverse security requirements are taken into account with coexistence of security users and normal users. The joint problem of power allocation, and subchannel pairing and allocation aims to maximize the security satisfaction ratio for legitimate users subject to limited power and subchannel constraints. We model the security resource management problem as a mixed integer programming problem, which is decomposed into three subproblems, distributed power allocation, distributed subchannel allocation, and distributed subchannel pairing, and then solved it in constraint particle swarm optimization (CPSO), binary CPSO (B_CPSO), and classic Hungarian algorithm (CHA) method, respectively. Moreover, a suboptimal subchannel pairing algorithm is proposed to reduce the computational complexity compared with the CHA. Simulations are conducted to evaluate the effectiveness of the proposed algorithms. |
| format | Article |
| id | doaj-art-bf0b320cb0cd4705b699c82168a1d689 |
| institution | DOAJ |
| issn | 1550-1477 |
| language | English |
| publishDate | 2015-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-bf0b320cb0cd4705b699c82168a1d6892025-08-20T03:23:07ZengWileyInternational Journal of Distributed Sensor Networks1550-14772015-07-011110.1155/2015/819195819195Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay NetworksJun Zhao0Zhaoming Lu1Xiangming Wen2Haijun Zhang3Shenghua He4Wenpeng Jing5 Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada, V6T 1Z4 Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaInformation security has been received more and more attention for next-generation wireless sensor networks. In this paper, we consider the problem of resource management based on security satisfaction ratio with fairness-aware in two-way relay networks. Multiple source nodes exchange information with the help of relay node in the presence of an eavesdropper, and diverse security requirements are taken into account with coexistence of security users and normal users. The joint problem of power allocation, and subchannel pairing and allocation aims to maximize the security satisfaction ratio for legitimate users subject to limited power and subchannel constraints. We model the security resource management problem as a mixed integer programming problem, which is decomposed into three subproblems, distributed power allocation, distributed subchannel allocation, and distributed subchannel pairing, and then solved it in constraint particle swarm optimization (CPSO), binary CPSO (B_CPSO), and classic Hungarian algorithm (CHA) method, respectively. Moreover, a suboptimal subchannel pairing algorithm is proposed to reduce the computational complexity compared with the CHA. Simulations are conducted to evaluate the effectiveness of the proposed algorithms.https://doi.org/10.1155/2015/819195 |
| spellingShingle | Jun Zhao Zhaoming Lu Xiangming Wen Haijun Zhang Shenghua He Wenpeng Jing Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks International Journal of Distributed Sensor Networks |
| title | Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks |
| title_full | Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks |
| title_fullStr | Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks |
| title_full_unstemmed | Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks |
| title_short | Resource Management Based on Security Satisfaction Ratio with Fairness-Aware in Two-Way Relay Networks |
| title_sort | resource management based on security satisfaction ratio with fairness aware in two way relay networks |
| url | https://doi.org/10.1155/2015/819195 |
| work_keys_str_mv | AT junzhao resourcemanagementbasedonsecuritysatisfactionratiowithfairnessawareintwowayrelaynetworks AT zhaominglu resourcemanagementbasedonsecuritysatisfactionratiowithfairnessawareintwowayrelaynetworks AT xiangmingwen resourcemanagementbasedonsecuritysatisfactionratiowithfairnessawareintwowayrelaynetworks AT haijunzhang resourcemanagementbasedonsecuritysatisfactionratiowithfairnessawareintwowayrelaynetworks AT shenghuahe resourcemanagementbasedonsecuritysatisfactionratiowithfairnessawareintwowayrelaynetworks AT wenpengjing resourcemanagementbasedonsecuritysatisfactionratiowithfairnessawareintwowayrelaynetworks |