• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2095-2110
• /
• 2015

This paper presents a design for a throughput-efficient online relay selection scheme for dual-hop multi-relay cooperative networks. Problems arise with these networks due to unpredictability of the relaying link quality and high time-consumption to probe the dual-hop link. In this paper, we firstly propose a novel probing and relaying protocol, which greatly reduces the overhead of the dual-hop link estimation by leveraging the wireless broadcasting nature of the network. We then formulate an opportunistic relay selection process for the online decision-making, which uses a tradeoff between obtaining more link information to establish better cooperative relaying and minimizing the time cost for dual-hop link estimation to achieve higher throughput. Dynamic programming is used to construct the throughput-optimal control policy for a typically heterogeneous Rayleigh fading environment, and determines which relay to probe and when to transmit the data. Additionally, we extend the main results to mixed Rayleigh/Rician link scenarios, i.e., where one side of the relaying link experiences Rayleigh fading while the other has Rician distribution. Numerical results validate the effectiveness and superiority of our proposed relaying scheme, e.g., it achieves at least 107% throughput gain compared with the state of the art solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2081-2100
• /
• 2013

In this paper, we propose a cooperative hybrid spectrum sharing protocol by jointly considering interweave (opportunistic) and underlay schemes. In the proposed protocol, secondary users can access the licensed spectrum along with the primary system. Our network scenario comprises a single primary transmitter-receiver (PTx-PRx) pair and a group of M secondary transmitter-receiver (STx-SRx) pairs within the transmission range of the primary system. Secondary transmitters are divided into two groups: active and inactive. A secondary transmitter that gets an opportunity to access the secondary spectrum is called "active". One of the idle or inactive secondary transmitters that achieves the primary request target rate $R_{PT}$ will be selected as a best decode-and-forward (DF) relay (Re) to forward the primary information when the data rate of the direct link between PTx and PRx falls below $R_{PT}$. We investigate the ergodic capacity and outage probability of the primary system with cooperative relaying and outage probability of the secondary system. Our theoretical and simulation results show that both the primary and secondary systems are able to achieve performance improvement in terms of outage probability. It is also shown that ergodic capacity and outage probability improve when the active secondary transmitter is located farther away from the PRx.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.267-274
• /
• 2015

Due to the difficulty of coordination in the cellular uplink, it is a practical challenge how to achieve the optimal throughput scaling with distributed scheduling. In this paper, we propose a distributed and opportunistic user scheduling (DOUS) that achieves the optimal throughput scaling in a single-input multiple-output interfering multiple-access channel, i.e., a multi-cell uplink network, with M antennas at each base station (BS) and N users in a cell. In a distributed fashion, each BS adopts M random receive beamforming vectors and then selects M users such that both sufficiently large desired signal power and sufficiently small generating interference are guaranteed. As a main result, it is proved that full multiuser diversity gain can be achieved in each cell when a sufficiently large number of users exist. Numerical evaluation confirms that in a practical setting of the multi-cell network, the proposed DOUS outperforms the existing distributed user scheduling algorithms in terms of sum-rate.

• 한국ITS학회 논문지
• /
• 제8권3호
• /
• pp.71-82
• /
• 2009

As a solution to spectrum under-utilization problem, Cognitive radio (CR) introduces a dynamic spectrum access technology. In the area, one of the most important problems is how secondary users (SUs) should choose between the available channels, which means how to achieve load balancing between channels. We consider spectrum load balancing problem for CR system in frequency domain and especially in time domain. Our objective is to balance the load among the channels and balance the occupied time length of slots for a fixed channel dynamically in order to obtain a user-optimal solution. In frequency domain, we refer to Dynamic Noncooperative Scheme with Communication (DNCOOPC) used in distributed system and a distributed Dynamic Spectrum Load Balancing algorithm (DSLB) is formed based on DNCOOPC. In time domain, Spectrum Load Balancing method with QoS support is proposed based on Dynamic Feed Back theory and Hash Table (SLBDH). The performance of DSLB and SLBDH are evaluated. In frequency domain, DSLB is more efficient compared with existing Compare_And_Balance (CAB) algorithm and gets more throughput compared with Spectrum Load Balancing (SLB) algorithm. Also, DSLB is a fair scheme for all devices. In time domain, SLBDH is an efficient and precise solution compared with Spectrum Load Smoothing (SLS) method.

• ETRI Journal
• /
• 제38권5호
• /
• pp.952-961
• /
• 2016

In this paper, we study a spectrum sharing network (SSN) where a spectrum sharing device (SSD) coexists with multiple wireless communication systems (WCSs) in the same channel. The SSD can operate with either a duty cycle (DC) channel access mechanism or a listen-before-talk (LBT) channel access mechanism, whereas WCSs operate with an LBT mechanism. An opportunistic channel selection scheme for the SSD in the SSN is first proposed to minimize the outage probability. The optimal data transmission time for the DC-based SSD is derived to further improve the outage probability. We also derive the exact and closed-form outage probability of the proposed channel selection in the SSN by assuming that the number of WCSs operating in each channel is uniformly distributed. The simulation results show that the proposed channel selection scheme outperforms other channel selection schemes. It was also observed that a DC-based SSD with an optimal data transmission time provides a better outage performance than an LBT-based SSD. As the number of available channels increases, the channel selection scheme plays an important role in minimizing the outage probability of the SSNs.

• 융합보안논문지
• /
• 제9권1호
• /
• pp.19-27
• /
• 2009

본 연구에서는 최근 학교 주변에서 발생하는 범죄 사고의 관리 및 예방을 위한 센서 네트워크 기반의 스쿨존 안전관리 시스템을 제안한다. 어린이들에게 부착되는 센서들과 학교 주변의 일정 공간에 펼쳐진 고정된 센서 네트워크 망을 통하여 어린이들의 환경 및 위치 센싱 정보들을 공간 지식화하여 어린이들의 상태를 모니터링 할 수 있는 안전과 관련된 서비스를 제공한다. 또한 학교 주변의 스쿨존 망을 벗어나는 경우 기회주의적 네트워크를 통한 전략적 안전관리 방안을 제안한다. 이러한 시스템이 구축된다면 현재 GPS를 통하여 개개인이 서비스를 받는 시스템에서 발전하여 많은 학생들이 적은 비용으로 쉽게 서비스를 받을 수 있을 것으로 기대한다.

• International Journal of Computer Science & Network Security
• /
• 제23권1호
• /
• pp.153-163
• /
• 2023

This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

• Asian Pacific Journal of Cancer Prevention
• /
• 제15권13호
• /
• pp.5143-5147
• /
• 2014

Cervical cancer screening in Malaysia is by opportunistic Pap smear which contributes to the low uptake rate. To overcome this, a pilot project called the SIPPS program (translated as information system of Pap smear program) had been introduced whereby women aged 20-65 years old are invited for Pap smear and receive recall to repeat the test. This study aimed at determining which recall method is most cost-effective in getting women to repeat Pap smear. A randomised control trial was conducted where one thousand women were recalled for repeat smear either by registered letter, phone messages, phone call or the usual postal letter. The total cost applied for cost-effectiveness analysis includes the cost of sending letter for first invitation, cost of the recall method and cost of two Pap smears. Cost-effective analysis (CEA) of Pap smear uptake by each recall method was then performed. The uptake of Pap smear by postal letter, registered letters, SMS and phone calls were 18.8%, 20.0%, 21.6% and 34.4%, respectively (p<0.05). The CER for the recall method was lowest by phone call compared to other interventions; RM 69.18 (SD RM 0.14) compared to RM 106.53 (SD RM 0.13), RM 134.02 (SD RM 0.15) and RM 136.38 (SD RM 0.11) for SMS, registered letter and letter, respectively. ICER showed that it is most cost saving if the usual method of recall by postal letter be changed to recall by phone call. The possibility of letter as a recall for repeat Pap smear to reach the women is higher compared to sending SMS or making phone call. However, getting women to do repeat Pap smear is better with phone call which allows direct communication. Despite the high cost of the phone call as a recall method for repeat Pap smear, it is the most cost-effective method compared to others.

• 한국통신학회논문지
• /
• 제36권8A호
• /
• pp.712-722
• /
• 2011

Wireless body area network (WBAN)은 인체 주변 영역에서의 통신서비스를 제공한다. WBAN 서비스는 인체 내부에 이식된 의료 응용을 위한 MICS 주파수 대역과 의료 응용과 consumer electronics (CE) 응용 분야 모두를 제공할 수 있는 ISM 주파수 대역에서의 서비스로 이루어지기 때문에 WBAN을 위한 MAC 프로토콜은 의료 응용과 CE 응용간의 상이한 특징과 유연성 (flexibility)을 고려하여 설계되어야 한다. 본 논문에서는 WBAN MAC 프로토콜의 요구사항을 확인하고, WBAN의 요구사항을 만족하는 WBAN MAC 프로토콜을 제안한다. WBAN의 다양한 응용을 위한 전송 유연성을 제공하기 위해서 동적 CFP(Contention Free Period) 할당(Dynamic CFP Allocation)을 제안한다. 또한, 경쟁 기반의 긴급 의료 데이터를 발생하는 의료 응용과 때때로 대량의 데이터를 발생하는 CE 응용을 지원하기 위해서 OCDP(opportunistic contention decision period) 구간과 4-mode Opportunity period를 제안하고, 제안한 방안을 이용하여 Inactive period와 Opportunity period를 일시적으로 전환하여 사용할 수 있는 기법을 제안한다. 다양한 시뮬레이션 결과 IEEE 802.15.4 MAC 프로토콜과 제안하는 WBAN MAC 프로토콜을 비교하였을 때, WBAN 환경에서의 전송 처리량, CFP 이용율, 전송지연 측면에서 증가된 성능 결과를 얻을 수 있었다.

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

In this paper, we propose a two-way relaying scheme using non-orthogonal multiple access (NOMA) technology. In this scheme, two sources transmit packets with each other under the assistance of the decode-and-forward (DF) relays, called as a TWDFNOMA protocol. The cooperative relays exploit successive interference cancellation (SIC) technique to decode sequentially the data packets from received summation signals, and then use the digital network coding (DNC) technique to encrypt received data from two sources. A max-min criterion of end-to-end signal-to-interference-plus-noise ratios (SINRs) is used to select a best relay in the proposed TWDFNOMA protocol. Outage probabilities are analyzed to achieve exact closed-form expressions and then, the system performance of the proposed TWDFNOMA protocol is evaluated by these probabilities. Simulation and analysis results discover that the system performance of the proposed TWDFNOMA protocol is improved when compared with a conventional three-timeslot two-way relaying scheme using DNC (denoted as a TWDNC protocol), a four-timeslot two-way relaying scheme without using DNC (denoted as a TWNDNC protocol) and a two-timeslot two-way relaying scheme with amplify-and-forward operations (denoted as a TWANC protocol). Particularly, the proposed TWDFNOMA protocol achieves best performances at two optimal locations of the best relay whereas the midpoint one is the optimal location of the TWDNC and TWNDNC protocols. Finally, the probability analyses are justified by executing Monte Carlo simulations.