http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Pei Changxing (검색결과 5 건)
- 무료
- 기관 내 무료
- 유료
-
Performance Analysis of Two-Way AF Cooperative Networks with the Nth Relay Selection
Yao Chenhong,Pei Changxing,Guo Jing 보안공학연구지원센터 2016 International Journal of Future Generation Communi Vol.9 No.8
In this letter, we propose a novel two-way amplify- and-forward (AF) relay selection scheme over independent flat Nakagami-m fading channels. In the proposed schemes, two users first sequentially broadcast their respective information to all the relays. Then, the Nth best-relay perform AF protocol on the received signals sent from the two users and forward them to both users. The Nth best-relay is selected to optimize the end-to- end performance of the system transmission. The performance of the proposed system is quantified by deriving the lower bound of the overall outage probability and average symbol error rate (SER). The effectiveness of our proposed selection scheme and analytical results is verified by simulations.
-
Secure Communication in Two-Way Relay Networks with Channel Estimation Errors
Yao Chenhong,Pei Changxing,Guo Jing 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.8
In this paper, we investigate the secrecy outage probability (SOP) for the cooperative amplify-and-forward (AF) two-way relay networks (TWRN) with channel estimation (CE) errors under Rayleigh fading channels. In the proposed system, two sources simultaneously broadcast their respective information to all the relays firstly. Then, the optimal relay performs AF protocol on the received signals sent from the two sources and forward them to both sources. In both phases, An eavesdropper receives the signals from sources and relay nodes illegally. The performance of the proposed system is quantified by deriving the upper bound of the overall outage probability. Impact of CEs on the system is illustrated by simulations.
-
Collision-Free Arbitration Protocol for Active RFID Systems
Honggang Wang,Changxing Pei,Bo Su 한국통신학회 2012 Journal of communications and networks Vol.14 No.1
Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An ef-ficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tonedetection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612,which is an obvious improvement when compared to the framedslotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.
-
Collision-Free Arbitration Protocol for Active RFID Systems
Wang, Honggang,Pei, Changxing,Su, Bo The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.1
Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tone-detection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612, which is an obvious improvement when compared to the framed-slotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.
-
An Ensemble Cascading Extremely Randomized Trees Framework for Short-Term Traffic Flow Prediction
( Fan Zhang ),( Jing Bai ),( Xiaoyu Li ),( Changxing Pei ),( Vincent Havyarimana ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.4
Short-term traffic flow prediction plays an important role in intelligent transportation systems (ITS) in areas such as transportation management, traffic control and guidance. For short-term traffic flow regression predictions, the main challenge stems from the non-stationary property of traffic flow data. In this paper, we design an ensemble cascading prediction framework based on extremely randomized trees (extra-trees) using a boosting technique called EET to predict the short-term traffic flow under non-stationary environments. Extra-trees is a tree-based ensemble method. It essentially consists of strongly randomizing both the attribute and cut-point choices while splitting a tree node. This mechanism reduces the variance of the model and is, therefore, more suitable for traffic flow regression prediction in non-stationary environments. Moreover, the extra-trees algorithm uses boosting ensemble technique averaging to improve the predictive accuracy and control overfitting. To the best of our knowledge, this is the first time that extra-trees have been used as fundamental building blocks in boosting committee machines. The proposed approach involves predicting 5 min in advance using real-time traffic flow data in the context of inherently considering temporal and spatial correlations. Experiments demonstrate that the proposed method achieves higher accuracy and lower variance and computational complexity when compared to the existing methods.
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
