• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.1035-1048
• /
• 2023

The IEEE 802.11 WLAN adopts a random backoff algorithm for its collision avoidance mechanism, and it is well known that the contention-based algorithm may suffer from performance degradation especially in congested networks. In this paper, we design an efficient backoff algorithm that utilizes a reinforcement learning method to determine optimal values of backoffs. The mobile nodes share a common contention window (CW) in our scheme, and using a Q-learning algorithm, they can avoid collisions by finding and implicitly reserving their optimal time slot(s). In addition, we introduce Frame Size Control (FSC) algorithm to minimize the possible degradation of aggregate throughput when the number of nodes exceeds the CW size. Our simulation shows that the proposed backoff algorithm with FSC method outperforms the 802.11 protocol regardless of the traffic conditions, and an analytical modeling proves that our mechanism has a unique operating point that is fair and stable.

• Journal of Forest and Environmental Science
• /
• v.30 no.3
• /
• pp.267-276
• /
• 2014

Collection of lichen together with tree twigs of oak and other trees bearing abundant growth of lichens is a common practice among the villagers and the rivals residing near Oak forests in Kumaun Himalaya. Nainital forest division represents about Twenty nine percent vegetation of the Oak forest in Kumaun Himalaya. In Kumaun, the lichen trade share is decreasing at an alarming rate of 21.93% which requires immediate actions by the Government. Lichen contributed significantly to household earnings with off-farm activities and this sector was found second highest income creator after Agriculture. It is a source of cash income during the season of extraction, which increases economic access to food. It has been observed in the present study that the secondary collector and transporters together get maximum share (>50%) of income generated from lichen, thus economic exploitation of the poorly educated people by the traders was still prevalent in the area. To improve the socio-economic standard of the people of Kumaun, it may is necessary to increase and improve the lichens resources of the area. There is a strong need for scientific management, best harvesting practices and strict monitoring of resources. The present study was conducted to assess the present and future resource potential for the conservation and sustainable management of lichens, existing market mechanism, role of Lichens in economic upliftment and livelihood generation of rural communities in Kumaun Himalaya.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.581-590
• /
• 2003

This paper proposes the routing path selection mechanism for source routing-based PtMP (Point-to-Multipoint) call in ATM switching system. Especially, it suggests PtMP routing path selection method that can share the maximum resource prior to the optimal path selection, guarantee the reduction of path calculation time and cycle prevention. The searching for the nearest branch point from destination node to make the maximum share of resource is the purpose of this algorithm. Therefore among neighbor nodes from destination node by back-tracking, this algorithm fixes the node crossing first the node on existing path having the same Call ID as branch node, constructs the optimal PtMP routing path. The optimal node to be selected by back-tracking is selected by the use of Dijkstra algorithm. That is to say, PtMP routing path selection performs the step of cross node selection among neighboring nodes by back-tracking and the step of optimal node selection(optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of search of routing information table for path selection and path calculation, also solves the cycle prevention easily during path establishment.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.8 no.2
• /
• pp.107-117
• /
• 2013

The main objective of this study lies at examining economic features of IT security investment and comparing alternative mechanisms to achieve optimal provision of IT security resources within a firm. There exists a paucity of economic analysis that provide useful guidelines for making critical decisions regarding the optimal level of provision of IT security and how to share the costs among different users within a firm. As a preliminary study, this study first argues that IT security resources share some unique characteristics of pure public goods, namely nonrivalry of consumption and nonexcludability of benefit. IT security provision problem also suffers from information asymmetry problem with regard to the valuation of an individual user for IT security goods. Then, through an analytical framework, it is shown that the efficient provision condition at the overall firm level is not necessarily satisfied by individual utility maximizing behavior. That is, an individual provision results in a suboptimal solution, especially an underprovision of the IT security good. This problem is mainly due to the nonexcludability property of pure public goods, and is also known as a free-riding problem. The fundamental problem of collective decision-making is to design mechanisms that both induce the revelation of the true information and choose an 'optimal' level of the IT security good within this framework of information asymmetry. This study examines and compares three alternative demand-revealing mechanisms within the IT security resource provision context, namely the Clarke-Groves mechanism, the expected utility maximizing mechanism and the Groves-Ledyard mechanism. The main features of each mechanism are discussed along with its strengths, weaknesses, and different applicability in practice. Finally, the limitations of the study and future research are discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4819-4834
• /
• 2015

The spectral efficiency of cellular networks can be improved when proximate users engage in device-to-device (D2D) communications to communicate directly without going through a base station. However, D2D communications that are not properly designed may generate interference with existing cellular networks. In this paper, we study resource allocation and power control to minimize the probability of an outage and maximize the overall network throughput. We investigate three power control-based schemes: the Partial Co-channel based Overlap Resource Power Control (PC.OVER), Fractional Frequency Reuse based Overlap Resource Power Control (FFR.OVER) and Fractional Frequency Reuse based Adaptive Power Control (FFR.APC) and also compare their performance. In PC.OVER, a certain portion of the total bandwidth is dedicated to the D2D. The FFR.OVER and FFR.APC schemes combine the FFR techniques and the power control mechanism. In FFR, the entire frequency band is partitioned into two parts, including a central and edge sub-bands. Macrocell users (mUEs) transmit using uniform power in the inner and outer regions of the cell, and in all three schemes, the D2D receivers (D2DRs) transmit with low power when more than one D2DRs share a resource block (RB) with the macrocells. For PC.OVER and FFR.OVER, the power of the D2DRs is reduced to its minimum, and for the FFR.APC scheme, the transmission power of the D2DRs is iteratively adjusted to satisfy the signal to interference ratio (SIR) threshold. The three schemes exhibit a significant improvement in the overall system capacity as well as in the probability of a user outage when compared to a conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.868-878
• /
• 2004

In this paper, we analyse feasibility of Zone-based Power Control (ZPC) scheme introduced for CDMA forward link(1) in the reverse link. To operate ZPC scheme in the CDMA systems the maximum power level that can be allocated to each traffic channel should be determined. Because all the service channels share the whole power resource in the forward lint a specific mechanism that determines Maximum power resource to each traffic channel is required to operate ZPC scheme in the forward link. However, ZPC scheme can be easily adopted to the reverse link, because of the fact that the whole power resource of service terminal is only confined to its traffic channel. In other words, we need not to determine the maximum power resource to be allocated in the reverse traffic channel. Simulation results show that ZPC scheme adopted to the reverse link yields a significant performance improvement compared with the conventional TPC(IS-95 TPC) scheme in terms of the power consumption and the traffic capacity of Portables, especially with the increasing number of high-rate data traffics. With the proposed scheme, not only be extended the service coverage of high-rate data traffic to the entire cell service coverage, but also the QoS of low-rate traffic can keep going through the service time, especially, in the situation that the incoming interference is much larger.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.591-595
• /
• 2005

In this paper, we propose the fairness improvement leaky bucket (PILB) algorithm as a traffic policing mechanism. In the proposed algorithm, there is a cell buffer for every ATM connection in order to store date cells. Network decides whether an ATM connection obeys the contracted traffic parameter, and stores data cells in the cell buffer if the connection obeys but is considered as violated the contract due to temporary lack of network resource. By using the proposed algorithm, we can obtain the statistical multiplexing gain that is the superiority of packet switching network. Moreover, when a connection tries to transmit more data cells by violating the contracted traffic parameters, the connection is prevented from using excess network resource, which incurs all connections sharing network resource fairly. The performance of the proposed FILB algorithm is investigated by using the simulation. The result shows that the proposed algorithm provides superior performance and all connections within a group share network resource fairly. The proposed algorithm can be applied not only the ATM network but also IP network.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.471-482
• /
• 2005

The high-speed network permits Grid computing to handle large problem of management areas and share various computational resources. As there are many resources and changes of them in Grid computing, the resources should be detected effectively and matched correctly with tasks to provide high performance. In this paper, we propose a mechanism that maximizes the performance of Grid computing systems. According to a priority, grade and site of heterogeneous resources, we assign tasks to those resources. Initially, a volunteer's priority and ranking are determined by static information like as CPU speed, RAM size, storage size and network bandwidth. And then, the rank of resources is decided by considering dynamic information such as correctness, response time, and error rate. We find that overall Grid system performance is improved and high correctness using resource reallocation mechanism is achieved.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• Environmental and Resource Economics Review
• /
• v.19 no.1
• /
• pp.159-198
• /
• 2010

The Korean government is planning to introduce the Renewable Portfolio Standard (RPS) system to replace the currently used Feed-in-Tariff (FIT) system which is a subsidy-based mechanism to foster the renewable energy industry. The RPS system is a market-oriented system in which the power companies are obliged to use renewable energy sources to produce electricity by a certain ratio of their production level. They can either produce for themselves or simply purchase the REC (renewable energy certificate) in the market to implement. The objective of this article is to compare the RPS system with the current FIT system in terms of the implementing cost to achieve the policy goal to expand the share of renewable energy m the total power generation. The analysis is conducted using Linear Programming models. The results of this study imply several policy suggestions to successfully introduce the RPS system.