http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : ( Xiaoxiong Zhong ) (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
Transport Protocols in Cognitive Radio Networks: A Survey
( Xiaoxiong Zhong ),( Yang Qin ),( Li Li ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.11
Cognitive radio networks (CRNs) have emerged as a promising solution to enhance spectrum utilization by using unused or less used spectrum in radio environments. The basic idea of CRNs is to allow secondary users (SUs) access to licensed spectrum, under the condition that the interference perceived by the primary users (PUs) is minimal. In CRNs, the channel availability is uncertainty due to the existence of PUs, resulting in intermittent communication. Transmission control protocol (TCP) performance may significantly degrade in such conditions. To address the challenges, some transport protocols have been proposed for reliable transmission in CRNs. In this paper we survey the state-of-the-art transport protocols for CRNs. We firstly highlight the unique aspects of CRNs, and describe the challenges of transport protocols in terms of PU behavior, spectrum sensing, spectrum changing and TCP mechanism itself over CRNs. Then, we provide a summary and comparison of existing transport protocols for CRNs. Finally, we discuss several open issues and research challenges. To the best of our knowledge, our work is the first survey on transport protocols for CRNs.
-
IAR-GT: An Incentive Aware Routing based on Game Theory for Selfish Opportunistic Networks
( Li Li ),( Xiaoxiong Zhong ),( Yong Jiang ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.1
In opportunistic networks, nodes may appear some selfishness while transmitting the message, however, most of the existing research works consider the individual selfishness or social selfishness respectively, and these two types of selfishness may coexist in opportunistic networks. In this paper, we propose an Incentive Aware Routing based on Game Theory for selfish OPPNETs, named IAR-GT, which uses Rubinstein-Stahl bargaining game model to incentivize selfish nodes cooperation in data forwarding. IAR-GT scheme not only considers the resources of nodes, but also uses a new method to calculate the social ties between them. Trace-driven simulations show that our incentive aware routing scheme achieves better performances than comparing schemes under two types of selfishness coexistence environments.
-
Interference-Aware Channel Assignment Algorithm in D2D overlaying Cellular Networks
( Liqun Zhao ),( Hongpeng Wang ),( Xiaoxiong Zhong ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.4
Device-to-Device (D2D) communications can provide proximity based services in the future 5G cellular networks. It allows short range communication in a limited area with the advantages of power saving, high data rate and traffic offloading. However, D2D communications may reuse the licensed channels with cellular communications and potentially result in critical interferences to nearby devices. To control the interference and improve network throughput in overlaid D2D cellular networks, a novel channel assignment approach is proposed in this paper. First, we characterize the performance of devices by using Poisson point process model. Then, we convert the throughput maximization problem into an optimal spectrum allocation problem with signal to interference plus noise ratio constraints and solve it, i.e., assigning appropriate fractions of channels to cellular communications and D2D communications. In order to mitigate the interferences between D2D devices, a cluster-based multi-channel assignment algorithm is proposed. The algorithm first cluster D2D communications into clusters to reduce the problem scale. After that, a multi-channel assignment algorithm is proposed to mitigate critical interferences among nearby devices for each D2D cluster individually. The simulation analysis conforms that the proposed algorithm can greatly increase system throughput.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
