• 디지털콘텐츠학회 논문지
• /
• 제14권3호
• /
• pp.357-365
• /
• 2013

스마트폰의 대중화는 무선 통신의 사용 패턴을 음성 중심에서 데이터 통신 중심으로 바꾸어 놓았다. 무선 데이터 통신에 대한 요구는 지속적으로 증가하고 있으며 이를 만족시키기 위한 기반 시설 확충 비용이 크게 늘어나고 있다. 본 논문에서는 기회적 네트워크와 (opportunistic networks) 무선 통신을 함께 활용하여 멀티미디어 콘텐츠를 사용자들에게 배포함으로써 무선 통신의 사용량을 경감시킬 수 있는 기법을 제시한다. 이러한 기법을 사용함으로써 무선 통신 기반시설 확충에 대한 필요를 낮춤으로써 비용을 절약하는 동시에 사용자들의 데이터 통신에 대한 요구 또한 만족시킬 수 있다. 본 논문에서 제안한 기법은 에이전트 기반 시뮬레이션을 (agent-based simulation) 통하여 검증 하였다. 시뮬레이션 결과는 사용 환경에 따라 최대 70% 정도의 무선 통신 사용량을 기회적 네트워크를 통한 콘텐츠 배포로 대체할 수 있음을 보여 주었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.593-609
• /
• 2012

We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1481-1501
• /
• 2019

In opportunistic network, the behavior of a node is autonomous and has social attributes such as selfishness.If a node wants to forward information to another node, it is bound to be limited by the node's own resources such as cache, power, and energy.Therefore, in the process of communication, some nodes do not help to forward information of other nodes because of their selfish behavior. This will lead to the inability to complete cooperation, greatly reduce the success rate of message transmission, increase network delay, and affect the overall network performance. This article proposes a hybrid incentive mechanism (Mim) based on the Reputation mechanism and the Credit mechanism.The selfishness model, energy model (The energy in the article exists in the form of electricity) and transaction model constitute our Mim mechanism. The Mim classifies the selfishness of nodes and constantly pay attention to changes in node energy, and manage the wealth of both sides of the node by introducing the Central Money Management Center. By calculating the selfishness of the node, the currency trading model is used to differentiate pricing of the node's services. Simulation results show that by using the Mim, the information delivery rate in the network and the fairness of node transactions are improved. At the same time, it also greatly increases the average life of the network.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2144-2165
• /
• 2016

In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

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

We study the problem of optimal opportunistic spectrum access with unknown and heterogeneous channel dynamics in cognitive radio networks. There is neither statistic information about the licensed channels nor information exchange among secondary users in the respective systems. We formulate the problem of maximizing network throughput. To achieve the desired optimization, we propose a win-shift lose-stay algorithm based only on rewards. The key point of the algorithm is to make secondary users tend to shift to another channel after receiving rewards from the current channel. The optimality and the convergence of the proposed algorithm are proved. The simulation results show that for both heterogeneous and homogenous systems the proposed win-shift lose-stay algorithm has better performance in terms of throughput and fairness than an existing algorithm.

• 한국정보통신학회논문지
• /
• 제17권6호
• /
• pp.1318-1323
• /
• 2013

본 논문은 비 슬롯 모드 인지 무선망에서 기회적 스펙트럼 접속 방식의 성능을 시뮬레이션을 통해 비교 분석한다. 비교 분석할 두 가지 기회적 스펙트럼 방식은 다음과 같다. 첫 번째 방식은 어떤 채널에서 전송을 성공한 경우 동일한 채널을 다시 센싱하고, 실패한 경우 가장 오래전에 선택했던 채널을 센싱하는 방식이다. 두 번째 방식은 어떤 채널에서 전송에 실패한 경우 동일한 채널을 다시 센싱하고, 성공한 경우 가장 오래전에 선택했던 채널을 센싱하는 방식이다. 본 논문에서는 일차 사용자가 채널을 점유하는 기간에 따라 두 방식 사이의 성능을 비교한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권2호
• /
• pp.83-87
• /
• 2014

This paper introduces a refined opportunistic interference alignment (OIA) technique that uses minimum mean square error (MMSE) detection at the receivers in multiple-input multiple-output multi-cell uplink networks. In the OIA scheme under consideration, each user performs the optimal transmit beamforming and power control to minimize the level of interference generated to the other-cell base stations, as in the conventional energy-efficient OIA. The result showed that owing to the enhanced receiver structure, the OIA scheme shows much higher sum-rates than those of the conventional OIA with zero-forcing detection for all signal-to-noise ratio regions.

• 전기학회논문지
• /
• 제56권12호
• /
• pp.2262-2264
• /
• 2007

In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. Proportional fair scheduling is one of the opportunistic scheduling schemes and used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS). In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains up to 23% higher throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

• ETRI Journal
• /
• 제29권1호
• /
• pp.120-123
• /
• 2007

In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real-time (RT) and non-realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross-layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.