• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• 한국통신학회논문지
• /
• 제32권10A호
• /
• pp.1023-1033
• /
• 2007

This study considers a joint congestion control, routing and power control for energy-constrained wireless networks. A mathematical model is introduced which includes maximization of network utility, maximization of network lifetime, and trade-off between network utility and network lifetime. The framework would maximize the overall throughput of the network where the overall throughput depends on the data flow rates which in turn is dependent on the link capacities. The link capacity on the other hand is a function of transmit power levels and link Signal-to-Interference-plus-Noise-Ratio (SINR) which makes the power allocation problem inherently difficult to solve. Using dual decomposition techniques, subgradient method, and logarithmic transformations, a joint algorithm for rate and power allocation problems was formulated. Numerical examples for each optimization problem were also provided.

• 한국통신학회논문지
• /
• 제32권5B호
• /
• pp.295-303
• /
• 2007

An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.219-221
• /
• 2012

The concave utility in the Network Utility Maximization (NUM) problem is only suitable for elastic flows. In networks with multiclass traffic, the utility can be concave, linear, step or sigmoidal. Hence, the basic NUM becomes a nonconvex optimization problem. The current approach utilizes the standard dual-based decomposition method. It does not converge in case of scarce resource. In this paper, we propose an algorithm that always converges to a local optimal solution to the nonconvex NUM after solving a series of convex approximation problems. Our techniques can be applied to any log-concave utilities.

• 한국통신학회논문지
• /
• 제34권1A호
• /
• pp.76-83
• /
• 2009

본 논문에서는 OFDMA를 이용하는 시스템에서의 elastic 서비스를 위한 공평성을 고려한 opportunistic 스케줄링 기법에 대하여 연구한다. 본 논문에서는 각 유저의 만족도를 유틸리티로 정의한 후 네트워크 유틸리티 극대화 기법을 이용한다. 이러한 유틸리티는 각 유저가 이용하는 서비스에 따라 서로 다르게 정의할 수 있으며 elastic 서비스의 경우에는 평균 전송률이 높을수록 유저의 만족도가 높아지게 된다. 이를 반영하기 위하여 각 유저의 유틸리티를 평균 전송률에 대한 함수로 정의한다. 또한 각 유저 사이의 공평한 자원 배분을 위한 조건을 유저들의 유틸리티를 이용하여 정의하고 이를 만족하는 동시에 각 유저의 유틸리티의 합으로 정의되는 네트워크 유틸리티를 극대화 하기위한 opportunistic 스케줄링 기법을 연구한다. 본 논문에서는 각각의 공평성 조건에 대한 opportunistic 스케줄링 문제를 최적화 문제로 정의하고 이를 dual 기법과 stochastic sub-gradient 기법으로 풀어 스케줄링 기법을 구현하도록 한다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (2)
• /
• pp.360-362
• /
• 1998

In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

• 전자공학회논문지
• /
• 제50권5호
• /
• pp.18-24
• /
• 2013

네트워크 코딩은 브로드캐스트와 오버히어링 특성을 통해 네트워크의 처리율 향상을 가져오는 기법으로 널리 연구되고 있다. 본 논문에서는 인트라세션 네트워크 코딩 방법을 사용하여 멀티채널, 멀티라디오, 멀티세션으로 구성된 무선 멀티홉 네트워크 환경의 네트워크 유틸리티 향상을 위한 네트워크 유틸리티 최대화 문제를 모델링한다. 그리고 주어진 환경에서의 유틸리티 최대화 문제의 해를 구하기 위해 혼잡 제어 알고리즘, 분산 레이트 제어 알고리즘 그리고 휴리스틱 자원 할당 알고리즘을 제안한다. MATLAB을 사용하여 제안한 알고리즘에 대한 성능 평가를 하였으며 멀티채널, 멀티라디오, 멀티세션의 변화에 따른 네트워크 유틸리티를 구하였다. 그 결과, 제안한 세 가지 알고리즘을 통해 무선 멀티홉 네트워크에서 처리율 향상이 이루어짐을 알 수 있으며 본 논문에서 제안한 알고리즘을 통해 네트워크 처리율 최적화 문제에 대한 솔루션을 제시하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
• /
• pp.1491-1494
• /
• 2003

Video adaptation in response to dynamic resource conditions and user preferences is required as a key technology to enable universal multimedia access (UMA) through heterogeneous networks by a multitude of devices in a seamless way. Although many adaptation techniques exist, selections of appropriate adaptations among multiple choices are often ad hoc. To provide a systematic solution, we present a general conceptual framework to model video entity, adaptation, resource, utility, and relations among them. It allows for formulation of various adaptation problems as resource-constrained utility maximization. We apply the framework to a practical case of dynamic bit rate adaptation. Furthermore, we present a description tool, which has been accepted as a part of the MPEG-21 Digital Item Adaptation (DIA), along with a brief overview of the .elated descriptors to support terminal and network quality of service (QoS).

• 기술사
• /
• 제34권5호
• /
• pp.29-33
• /
• 2001

This paper summarizes the design and construction of the roof canopy structure for the SEOUL 2002 World Cup Main Stadium with a design inspired by Korean traditional beauty emphasizing images of the Pangpae kite. The stadium has also been designed for maximization of its post-World Cup utility to be used on as every basis by the citizens. The stadium canopy is a unique spatial network of truss members with a tensile membrane roof suspended from 16 masts. The canopy covers 40,950 ㎡. which is clad with a pre-stressed tensile membrane of PTFE coated fiberglass fabric and the glass.

• ETRI Journal
• /
• 제36권6호
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.