QoS Provisioning and Energy Saving Scheme for Distributed Cognitive Radio Networks Using Deep Learning

Mduduzi Comfort Hlophe,Bodhaswar T. Maharaj 한국통신학회 2020 Journal of communications and networks Vol.22 No.3

One of the major challenges facing the realization of cognitive radios (CRs) in future mobile and wireless communicationsis the issue of high energy consumption. Since future network infrastructure will host real-time services requiring immediate satisfaction, the issue of high energy consumption will hinder the fullrealization of CRs. This means that to offer the required qualityof service (QoS) in an energy-efficient manner, resource management strategies need to allow for effective trade-offs between QoSprovisioning and energy saving. To address this issue, this paperfocuses on single base station (BS) management, where resourceconsumption efficiency is obtained by solving a dynamic resourceallocation (RA) problem using bipartite matching. A deep learning(DL) predictive control scheme is used to predict the traffic loadfor better energy saving using a stacked auto-encoder (SAE). Considered here was a base station (BS) processor with both processorsharing (PS) and first-come-first-served (FCFS) sharing disciplinesunder quite general assumptions about the arrival and service processes. The workload arrivals are defined by a Markovian arrivalprocess while the service is general. The possible impatience of customers is taken into account in terms of the required delays. Inthis way, the BS processor is treated as a hybrid switching system that chooses a better packet scheduling scheme between meanslowdown (MS) FCFS and MS PS. The simulation results presentedin this paper indicate that the proposed predictive control schemeachieves better energy saving as the traffic load increases, and thatthe processing of workload using MS PS achieves substantially superior energy saving compared to MS FCFS.

최대 흐름 정합을 이용한 실시간 음소인식 시스템 구현

이상엽,박성원 한국게임학회 2012 한국게임학회 논문지 Vol.12 No.1

스마트 디바이스를 이용한 다양한 게임들이 증가하고 있는데, 음소인식은 스마트 디바이스를 사용한 효율적인 입력 방법은 음성이 될 수 있다. 게임에서 음성인식은 매우 빠르게 인식되면서 구동 되어야하는데, 본 연구에서는 게임 분야에서 유용하게 활용할 수 있는 최적화된 음소 인식 방법을 개발하였다. 본 논문에서 제안하는 음소 인식 방법은 음성 파장을 FFT로 전환하고, 해당 값을 Z평면에 도시한 후, 영역 데이터를 추출한 후 데이터베이스에 저장한다. 그리고 해당 값을 가중치 있는 두 갈래 그래프 최대 흐름 정합을 사용하여 음소 인식을 한다. 제안된 방법은 게임 또는 로봇과 같은 분야에서 빠른 음소 인식을 하고자 할 때 매우 유용한 방법이다. There are many of games using smart devices. Voice recognition is can be useful way for input. In the game, voice have to be quickly recognized, at the same time it have to be manipulated promptly as well. In this study, we developed the optimized real-time phoneme recognition using max flow matching that it can be efficiently used in the game field. Firstly, voice wavelength is transformed to FFT, secondly, transformed value is made by a graph in Z plane, thirdly, data is extracted in specific area, and then data is saved in database. After all the value is recognized using weighted bipartite max flow matching. This way would be useful method in game or robot field when researchers hope to recognize the fast voice recognition.

이종의 도로망 데이터 셋에서 면 객체 매칭 기반 변화탐지

김지영,허용,유기윤,김정옥 한국측량학회 2013 한국측량학회지 Vol.31 No.6

By a development of car navigation systems and mobile or positioning technology, it increases interest inlocation based services, especially pedestrian navigation systems. Updating of digital maps is important becausedigital maps are mass data and required to short updating cycle. In this paper, we proposed change detectionfor different network data-sets based on areal feature matching. Prior to change detection, we defined type ofupdating between different network data-sets. Next, we transformed road lines into areal features(block) thatare surrounded by them and calculated a shape similarity between blocks in different data-sets. Blocks that ashape similarity is more than 0.6 are selected candidate block pairs. Secondly, we detected changed-block pairsby bipartite graph clustering or properties of a concave polygon according to types of updating, and calculatedFréchet distance between segments within the block or forming it. At this time, road segments of KAIS mapthat Fréchet distance is more than 50 are extracted as updating road features. As a result of accuracy evaluation,a value of detection rate appears high at 0.965. We could thus identify that a proposed method is able to apply tochange detection between different network data-sets. 차량용 내비게이션의 빠른 확산과 스마트폰 등 개인 단말기의 측위 기술 발달로 사용자 중심위치기반서비스, 특히 보행자 내비게이션 서비스에 대한 관심이 증대되고 있다. 보행자 내비게이션 서비스를 위한 핵심정보인 수치지도는 대용량이고 짧은 갱신주기를 요구하는 경우가 많아 수치지도의 효율적인 갱신이 중요한 이슈가 된다. 본 연구에서는 구축시기가 상이한 이종의 도로망 데이터 셋에 형상유사도 기반 면 객체 매칭을 적용하여 변화 탐지하는 기법을 제안하였다. 변화탐지에 앞서 이종의 도로망 데이터 셋의 면 객체 매칭에서 탐지될 수 있는 갱신 유형을 정의하였다. 면 객체 매칭 기반 변화 탐지를 위하여 이종의 두 도로망 데이터 셋의 선형인 도로객체를 이들로 둘러싸인 면인 블록으로 변환하였다. 변환된 블록을 중첩하여 중첩된 블록 간의 형상유사도를 계산하고, 이 값이 0.6 이상인것을 후보 블록 쌍으로 추출하였다. 객체 유형별로 이분 그래프 군집화와 오목다각형 특성을 적용하여 정의된 갱신유형별 블록 쌍을 탐지하고, 해당 블록 쌍을 구성하거나 내부에 있는 도로 세그먼트 간의 프레셰 거리를 계산하였다. 이때, 프레셰 거리가 50 이상인 도로명주소기본도 도로구간의 도로객체가 갱신 도로객체로 추출된다. 그 결과0.965의 높은 탐색율을 보여 제안된 기법이 이종의 도로망 데이터 셋의 선형 객체의 변화탐지에 적용될 수 있음을확인할 수 있었다.

A Multicast Search Scheme Based on Bipartite Graph Matching Model

Yuan Yao,Zhang Dalin,Wang Qing,Shi Jinglin 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.11

This paper proposes an efficient multicast search scheme based on bipartite graph matching model, aiming at one of the most important problems in the multicast service, how can the wireless network track and locate the mobile uses in the idle state, under the tight bandwidth and delay constraints,. By quantifying the location uncertainty of mobile users with Shannon's entropy, the scheme adopts the LZ78 compression algorithm to design location update scheme and predict the location probability, in order to reduce the cost of location update. The multicast search system need to guarantee the maximum total probability that each user resides at the assigned paging area, for the purpose of an optimal performance on both expected paging delay and paging cost. Therefore, the bigraph-based multicast paging scheme (BMPS) firstly builds the bipartite graph model of multicast search problem, through converting the location probability into weight of the edge. BMPS decides the optimal allocation between the mobile users and location areas, which is mainly achieved by the maximum weight perfect matching in bipartite graph, while modifying the weights dynamically. Simulation results show that BMPS yields a low search delay as well as a low search cost, and reduces the impact of user collision.

Utility-based Resource Allocation with Bipartite Matching in OFDMA-based Wireless Systems

( Kan Zheng ),( Wei Li ),( Fei Liu ),( Wei Xiang ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.8

In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

다자간 화상회의 시스템의 설계 및 구현

주헌식(Joo Heon Sik),이상엽(Lee Sang Yeob) 한국컴퓨터정보학회 2008 韓國컴퓨터情報學會論文誌 Vol.13 No.1

본 논문에서는 가중치 이분 그래프 정합을 이용하여 데이터 최대 흐름을 나타내었다. 가중치 이분 그래프 정합은 전송 데이터 객체를 에지들로 설정하고 서버와 클라이언트에 데이터의 최대 흐름 정합을 유도 한다. 제안한 가중치 이분 그래프 정합을 이용하여 다자간 화상회의 시스템을 구현하였다. 서버에 최대한 데이터를 송신하고 클라이언트에서 최대한 수신함으로서 동영상 프레임의 끊김 현상과 병목현상이 개선되고 이미지가 깨지지 않는 우수한 성능을 나타내었다. 실험결과 기존의 흐름 제어 방법보다 약 2배의 성능을 나타내었다. This paper shows the maximum data flow utilizing the Weight Bipartite Graph Matching system. The Weight Bipartite Graph Matching system sets the data transmission as edges and guides the maximum data flow on the set server and the client. The proposed Weight Bipartite Graph Matching system implements the multi-user interface video conference system. By sending max data to the server and having the client receive the max data, the non-continuance of the motion image frame, the bottleneck phenomenon, and the broken images are prevented due to the excellent capacity. The experiment shows a two-times better excellency than that of the previous flow control.

Modeling and Simulation of Scheduling Medical Materials Using Graph Model for Complex Rescue

Lv, Ming,Zheng, Jingchen,Tong, Qingying,Chen, Jinhong,Liu, Haoting,Gao, Yun Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.5

A new medical materials scheduling system and its modeling method for the complex rescue are presented. Different from other similar system, first both the BeiDou Satellite Communication System (BSCS) and the Special Fiber-optic Communication Network (SFCN) are used to collect the rescue requirements and the location information of disaster areas. Then all these messages will be displayed in a special medical software terminal. After that the bipartite graph models are utilized to compute the optimal scheduling of medical materials. Finally, all these results will be transmitted back by the BSCS and the SFCN again to implement a fast guidance of medical rescue. The sole drug scheduling issue, the multiple drugs scheduling issue, and the backup-scheme selection issue are all utilized: the Kuhn-Munkres algorithm is used to realize the optimal matching of sole drug scheduling issue, the spectral clustering-based method is employed to calculate the optimal distribution of multiple drugs scheduling issue, and the similarity metric of neighboring matrix is utilized to realize the estimation of backup-scheme selection issue of medical materials. Many simulation analysis experiments and applications have proved the correctness of proposed technique and system.

A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites

( Aniket Bhatnagar ),( Varun Gambhir ),( Manish Kumar Thakur ) 한국정보처리학회 2018 Journal of information processing systems Vol.14 No.4

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites

Bhatnagar, Aniket,Gambhir, Varun,Thakur, Manish Kumar Korea Information Processing Society 2018 Journal of information processing systems Vol.14 No.4

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

SOLVING A COMBINATORIAL PROBLEM WITH NETWORK FLOWS

MANEA, FLORIN,PLOSCARU, CALINA 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1

In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graph $G=(V_1 {\cup}{V_2},\;E,\;{\omega})$ outputs the enumeration of all bipartite matchings of given cardinality v and cost c.