• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.296-305
• /
• 2010

Secondary users should sense the licensed spectrum bands in order to protect the primary users from interference. However, periodic and frequent sensing for immediate detection of primary users usually gives rise to much sensing overhead, and thus will quickly drain the battery as well as deteriorate the performance of a secondary user. To overcome such problems, we focus on the method reducing sensing overhead of each secondary user and propose a distributed fair sensing scheme that the multiple users within a certain area, so-called sensing zone, sense the spectrum bands in a fairly distributed manner and share the results among the users within respective sensing zone. The design of the frame structure for the proposal is also demonstrated while considering the sensing requirements for protecting primary users. The performance results by numerical analyses and computer simulations show that our proposed sensing scheme significantly reduces the sensing overhead of each user compared to the conventional sensing scheme and also satisfies the given sensing requirements for primary user protection.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.975-988
• /
• 2016

Large access providers (ISPs) are seeking for new types of business agreements and pricing models to manage network costs and monetize better the provision of last-mile services. A typical paradigm of such new pricing norms is the proliferation of paid peering deals between ISPs and content providers (CPs), while on top of this, some ISPs are already experimenting with usage-based tariffs, usually through data-plans, instead of the typical fixed-based charging. In this work we define as common platform, the infrastructure in which a single ISP transacts with several CPs through peering agreements. In this context, we examine whether, and under which market conditions, the profitability of the involved stakeholders improves when the establishment of this platform is accompanied by a monetary compensation from the CPs to the ISP (paid peering), v.s. a scenario where their deal is a typical settlement-free one. In both cases, we assume that the ISP implements a usage-based access pricing scheme, implying that end-users will pay more for higher transaction rates with the CPs. Our framework captures some of the most important details of the current market, such as the various business models adopted by the CPs, the end-users' evaluation towards the ISP's and CPs' level of investments and the traffic rates per transaction for the offered services. By analysing the equilibrium derived by a leader-follower game, it turns out (among other practical takeaways) that whether or not the profitability of a CP improves, it highly depends on whether its business model is to sell content, or if it obtains its revenue from advertisements. Finally, we extract that consumer surplus is considerably higher under paid peering, which in turn implies improved levels of social welfare.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.1
• /
• pp.9-16
• /
• 2020

The k-anonymity scheme has been widely used to protect private information when Big Data are distributed to a third party for research purposes. When the scheme is applied, an optimal k value determination is one of difficult problems to be resolved because many factors should be considered. Currently, the determination has been done almost manually by human experts with their intuition. This leads to degrade performance of the anonymization, and it takes much time and cost for them to do a task. To overcome this problem, a simple idea has been proposed that is based on machine learning. This paper describes implementations and experiments to realize the proposed idea. In thi work, a deep neural network (DNN) is implemented using tensorflow libraries, and it is trained and tested using input dataset. The experiment results show that a trend of training errors follows a typical pattern in DNN, but for validation errors, our model represents a different pattern from one shown in typical training process. The advantage of the proposed approach is that it can reduce time and cost for experts to determine k value because it can be done semi-automatically.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.608-614
• /
• 2006

The popularization of high-speed networks and the innovation of high-performance hardware/servers have enlarged the role of large-scale, highly distributed IT infrastructure. Though many criteria on the assessment of IT infrastructure can be considered, the survivability assessment is treated as the most important one due to the essential role as an infrastructure. While assessing the survivability of some given IT infrastructures, we can not only choose the best one among them but also improve their survivability by modifying their structure and security policies. In this paper, we propose a DMKB-based assessment system on the survivability of IT infrastructures, where DMKB is a kind of database which provides the known vulnerabilities and defense mechanism for many system components.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.677-683
• /
• 2006

If a node stops functioning in an ad-hoc wireless network, routing paths involving the node will also fail, when construction of replacement routes is required. A major cause of node failure is energy exhaustion, and route replacements may in turn lead to successive node failures by making more nodes consume their energy. The result could be performance degradation of networks. Therefore it is important to ensure that nodes with limited remaining energy are not included in route construction from the beginning. In this paper we propose a new routing protocol, which takes residue energy of nodes into account in order to prevent node failures resulting from energy shortage. Our routing protocol examines the smallest value of node residue energy ($E_{m}$) from each of all possible routing paths and selects the path which has the largest value of $E_{m}$. We prove, through simulation, that our routing protocol extends the lifetime of nodes which have limited amount of energy, reducing chances of path replacement. It is also shown that our proposed protocol helps alleviate network performance degradation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.1
• /
• pp.87-92
• /
• 2016

In this paper, optimization technique such as particle swarm optimization was used to optimize the parameters of fuzzy Extreme Learning Machine. While the learning speed of conventional neural networks is very slow, that of Extreme Learning Machine is very fast. Fuzzy Extreme Learning Machine is composed of the Extreme Learning Machine with very fast learning speed and fuzzy logic which can represent the linguistic information of the field experts. The general sigmoid function is used for the activation function of Extreme Learning Machine. However, the activation function of Fuzzy Extreme Learning Machine is the membership function which is defined in the procedure of fuzzy C-Means clustering algorithm. We optimize the parameters of the membership functions by using optimization technique such as Particle Swarm Optimization. In order to validate the classification capability of the proposed classifier, we make several experiments with the various machine learning datas.

• The Journal of the Korea Contents Association
• /
• v.6 no.3
• /
• pp.1-11
• /
• 2006

With the improvement of information telecommunication technology, the various service in broadband integrated services digital networks have a wide range of delay, delay jitter and cell loss probability requirements according to traffic specification. Therefore, the design of appropriate control schemes that can satisfy the cell loss, delay requirements with various traffic specification for B-ISDN is an extremely important challenging problem. In this paper, we propose a priority control scheme using a window counter and a cell counter per each type of class. In the proposed priority control scheme, for satisfying required service quality, we performed the priority control scheme using the delay/loss factors obtained by comparing window counter with cell counter. The performance of proposed control scheme is estimated by computer simulation. In the results of simulation, we verified that the proposed method satisfied per class requirements as the results showed that cell loss probability has a order of video, data, voice and delay time has a order of video, voice and data.

• Water for future
• /
• v.25 no.1
• /
• pp.101-110
• /
• 1992

In this paper for simulating spatially and temporally varied moving storm in a watershed a distributed model was developed. The model is conducted by two major flow simulations which overland flow simulation and channel network flow simulation. Two dimensional continuity equation and momentum equation of kinematic approximation are used in the overland flow simulation. On the other hand, in the channel networks simulation two types of governing equations which are one dimensional continuity and momentum equations between two adjacent sections in a channel, and continuity and energy equations at a channel junction are applied. The finite element formulations were used in the overland flow simulation and the implicit finite difference formulations were used in the channel network simulation. The finite element formulations for the overland flow are analyzed by the Gauss elimination method and the finite difference formulations for the channel network flow are analyzed by the double sweep method having advantages of computational speed and reduced computer storages. Several recurrent coefficient equations for channel network simulation are suggested in the paper.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.87-93
• /
• 2002

A complex network and a parallel computer are made up of interconnected switching units. The role of a switching unit is to set up a connection between an input port and an output port, according to the routing information. We proposed our switching network with a remodeled architecture is a newly modified Banyan network with eight input and output ports. We have analysed the maximum throughput of the revised switch. Our analyses have shown that under the uniform random traffic load, the FIFO discipline is limited to 70%, The switching system consists of an input control unit, a switch unit and an output control unit. Therefore the result of the analyses shows that the results of the networking simulation with the new switch are feasible and if we adopt the new architecture of the revised model of the Banyan switch, the hardware complexity can be reduced. The FIFO discipline has increased by about 11% when we compare the switching system with the input buffer system. We have designed and verified the switching system in VHDL using Max＋plusII. We also designed our test environment including micro computers, the base station, and the proposed architecture. We proposed a new architecture of the Banyan switch for BISDN networks and parallel computers.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.117-125
• /
• 2008

With increase of concern about the Ubiquitous application, the necessity of the computer system which is miniaturized is becoming larger. The ARM processor is showing a high share from embedded system market. In this paper, ideal method for RTD-1000 controller construction and development is described using ARM microcontroller. Existing RTD-1000 measures distance of disconnection or defect of sensing casket by measuring receiving reflected wave which was sent via copper wire inside the leaking sensing rod. Using this RTD-1000, leakage and breakage of water and oil pipe can be sensed and it reports damage results to the networks. But, existing RTD-1000 wastes hardware resources much and costs a great deal to installation. Also, it needs a cooling device because the heating problem, and has some problem of the secondary memory unit such as the hard disk. So, long tenn maintenance has some problems in the outside install place. In this paper, for the resolving the problem of RTD-1000, RTD-1000A embedded system based on ARM is proposed and simulated.