• Journal of information and communication convergence engineering
• /
• 제8권3호
• /
• pp.273-276
• /
• 2010

Opportunistic spectrum access (OSA) allows unlicensed users to share licensed spectrum in space and time with no or little interference to primary users, with bring new research challenges in MAC design. We propose a cognitive MAC protocol using statistical channel information and selecting appropriate idle channel for transmission. The protocol based on the CSMA/CA, exploits statistics of spectrum usage for decision making on channel access. Idle channel availability, spectrum hole sufficiency and available channel condition will be included in algorithm statistical information. The model include the control channel and data channel, the transmitter negotiates with receiver on transmission parameters through control channel, statistical decision results (successful rate of transmission) from exchanged transmission parameters of control channel should pass the threshold and decide the data transmission with spectrum hole on data channel. The proposed protocol's simulation will show that proposed protocol does improve the throughput performance via traditional opportunistic spectrum access MAC protocol.

• 한국통신학회논문지
• /
• 제33권2A호
• /
• pp.191-197
• /
• 2008

시변 무선채널에서 버스트한 패킷을 효율적으로 전송하기 위해서는 다중사용자 다이버시티 이득을 극대화할 수 있는 opportunistic 스케줄링 기법이 중요한 기술적 요소가 되고 있다. 본 논문에서는 무선 LAN 네트워크에 적용 가능한 분산화된 opportunistic 스케줄링기법을 제안하였다. Opportunistic 스케줄링방식의 하나인 비례공정 알고리즘은 중앙집중형 네트워크에 적용되었으나 본 논문에서는 확률적 방식을 이용하여 분산화된 방식의 비례공정 스케줄링 (DPFS: Distributed Proportional Fair Scheduling) 방식과 매체 접근제어 방식을 설계하였다. 제안한 DPFS방식에서는 각각의 수신기들은 채널상태를 파악한 후 독립적으로 자신의 우선순위를 확률적 방법으로 계산하기 때문에 모든 수신기의 채널 정보를 수집하는데 필요한 오버헤드를 크게 줄일 수 있다. 성능분석을 위하여 시뮬레이션을 수행하였으며 제안된 스케줄링 방식이 기존의 분산 스케줄링방식에 비하여 전송률 성능에서 우수함을 보이고 있으며 관련 파라미터를 조절함으로써 공평성과 전송률성능에 대한 제어가 가능함을 보이고 있다.

• 한국인터넷방송통신학회논문지
• /
• 제13권6호
• /
• pp.71-78
• /
• 2013

최근 기회전송 증가 릴레이 시스템은 무선 페이딩 채널에서 시스템 성능을 효과적으로 개선하기 위하여 많은 연구가 되고 있다. 그러나 대부분의 기회전송 증가 릴레이 시스템 연구는 소스-목적지 사이에 직접 경로가 존재하는 시스템을 대상으로 성능을 해석하고 있고 직접 경로가 없이 소스-릴레이-목적지의 간접 경로만 존재하는 시스템에 대한 해석은 매우 적다. 따라서 본 논문에서는 직접 경로가 존재하지 않는 기회전송 증가 릴레이 시스템에서 먼저 부분적인 채널 정보만으로 릴레이를 선택하여 전송하고, 만약 통신이 실패하면 전체 채널정보를 이용하여 최적의 증가 릴레이를 사용하여 정보를 전송하는 프로토콜을 제안하였다. 그리고 제안한 전송 프로토콜을 적용한 시스템의 성능을 해석적으로 유도하고 그 결과를 시뮬레이션 결과와 비교하여 유도결과를 입증하였다. 본 논문의 결과는 소스-목적지간에 직접 경로가 존재하지 않는 이동통신 시스템과 양방향 TV 방송 시스템에 기회전송 증가 릴레이 시스템을 도입하였을 경우 시스템 설계 및 성능 예측에 직접 활용할 수 있을 것으로 생각된다.

• 한국통신학회논문지
• /
• 제36권11A호
• /
• pp.892-902
• /
• 2011

Cong Shen과 Micael P. Fitz에 의해 제안된 OSO(opportunistic spatial orthogonalization)는 주 사용자가 모든 라이선스 주파수 대역을 점유하고 있는 동안에 부 사용자들이 그 주파수 대역을 동시에 사용할 수 있도록 하는 기법이다. 본 논문에서는 single-input multi-output system을 기반으로 하여, 주 사용자의 송신 전략을 유지하며 주 사용자의 송신기에서 활성 부 사용자의 수신기로 가는 간섭을 고려한 활성 부 사용자 선택 알고리즘을 소개한다. 제안한 알고리즘은 주 사용자에게 최소한의 전송 용량(throughput)을 보장하며 기존 OSO 방법보다 더 높은 성능을 보인다. 우리는 모의실험을 통해 여러 제약 조건 하에서 제안한 알고리즘의 성능을 검증한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5805-5825
• /
• 2019

Smartphones are important platforms because of their sophisticated computation, communication, and sensing capabilities, which enable a variety of applications in the Internet of Things (IoT) systems. Moreover, advancements in hardware have enabled sensors on smartphones such as environmental and chemical sensors that make sensor data collection readily accessible for a wide range of applications. However, dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users that vary throughout the day, which greatly affects the efficacy of sensor data collection. Therefore, it is necessary to consider phone users mobility patterns to design data collection schedules that can reduce the loss of sensor data. In this paper, we propose a mobility-based weighted adaptive opportunistic scheduling framework that can adaptively adjust to the dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users and provide prioritized scheduling based on various application scenarios, such as velocity, region of interest, and sensor type. The performance of the proposed framework is compared with other scheduling frameworks in various heterogeneous smartphone user mobility scenarios. Simulation results show that the proposed scheduling improves the transmission rate by 8 percent and can also improve the collection of higher-priority sensor data compared with other scheduling approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1034-1051
• /
• 2016

Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2004년도 추계종합학술대회 논문 초록집
• /
• pp.371-371
• /
• 2004

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3731-3750
• /
• 2014

This paper considers a wideband cognitive radio network (WCRN) which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and studies the ergodic throughput of the WCRN that operated under: the wideband sensing-based spectrum sharing (WSSS) scheme and the wideband opportunistic spectrum access (WOSA) scheme. In our analysis, besides the average interference power constraint at PU, the average transmit power constraint of SU is also considered for the two schemes and a novel cognitive radio sensing frame that allows data transmission and spectrum sensing at the same time is utilized, and then the maximization throughput problem is solved by developing a gradient projection method. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.

• ETRI Journal
• /
• 제29권2호
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• Journal of Computing Science and Engineering
• /
• 제8권3호
• /
• pp.173-179
• /
• 2014

In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in the network. Since each node sends a message to another node with a different location and less direction entropy, DEFS utilizes those nodes that are more likely to travel to various locations to forward the messages to the destination nodes. Experiments were performed on the network simulator NS-2. The results show that DEFS provides better balance than the typical forwarding schemes, such as Epidemic, PRoPHET, and WAIT.