• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.3-8
• /
• 2013

In this paper, we present an energy-efficient base station operation with base station sharing in wireless cellular networks. Firstly, cost functions are modeled related with the amount of energy usage and traffic load. We use game theory and formulate an energy bill game, where the players are the service operators which are operating base stations and their strategies are the bill of their base station energy consumption and hand-over traffic load to the others service operators. We show that the global optimal performance in terms of minimizing the energy costs is achieved at the Nash equilibrium of the formulated energy bill game. Simulation results confirm that the proposed approach can reduce the energy bill of the service operator, and show the relationship between the energy cost saving and various parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2085-2094
• /
• 2012

In this paper, we propose a wireless access network virtualization algorithm based on a digital unit (DU)-radio unit (RU) separated network structure in a cellular network with multiple radio access technologies (RATs). The proposed wireless access network virtualization algorithm consists of a baseline access network virtualization, RAT virtualization, and access path migration algorithms. Final wireless access network virtualization is performed by sequentially performing these procedures. Through system-level simulations which assume 3GPP LTE and WiMAX systems, the performance of the proposed wireless access network virtualization is evaluated in terms of system throughput for two scenarios according to asymmetry of network traffic load. Numerical results show that our proposed wireless access network virtualization algorithm achieves significant system throughput gain even in asymmetric traffic load and user distribution situations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1204-1227
• /
• 2020

The tradeoff between energy conservation and traffic balancing is a dilemma problem in Wireless Sensor Networks (WSNs). By analyzing the intrinsic relationship between cluster properties and long distance transmission energy consumption, we characterize three node sets of the cluster as a theoretical foundation to enhance high performance of WSNs, and propose optimal solutions by introducing rendezvous and Mobile Elements (MEs) to optimize energy consumption for prolonging the lifetime of WSNs. First, we exploit an approximate method based on the transmission distance from the different node to an ME to select suboptimal Rendezvous Point (RP) on the trajectory for ME to collect data. Then, we define data transmission routing sequence and model rendezvous planning for the cluster. In order to achieve optimization of energy consumption, we specifically apply the economic theory called Diminishing Marginal Utility Rule (DMUR) and create the utility function with regard to energy to develop an adaptive energy consumption optimization framework to achieve energy efficiency for data collection. At last, Rendezvous Transmission Algorithm (RTA) is proposed to better tradeoff between energy conservation and traffic balancing. Furthermore, via collaborations among multiple MEs, we design Two-Orbit Back-Propagation Algorithm (TOBPA) which concurrently handles load imbalance phenomenon to improve the efficiency of data collection. The simulation results show that our solutions can improve energy efficiency of the whole network and reduce the energy consumption of sensor nodes, which in turn prolong the lifetime of WSNs.

• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.51-58
• /
• 2002

A electronic business user is increased rapidly, and load of a electronic business system and network traffic are increased rapidly. Also, the data which included an audio and video is increasing in a electronic business system gradually, and According to this an Internet service businessman is paying for an enormous cost for management of a system and a maintenance of a line. It is brought a delay of a response speed about a service wish of a Web customer this system load and network traffic raise. Also, this decreases customer satisfaction and becomes an important factor to decrease competitive power of an e-business enterprise. In this study, we proposed the electronic business system that improved answer delay time about a Web customer in an e-business system based on the .net which was a the latest version of Microsoft company, and analyzed performance of a proposal system through an experiment. In the experiment result, the system that proposed it can have response time to have been improved and fast adaptability about various requests of a Web customer. Also, in a proposed system, a decrease gets a delay of a response speed to occur because of the multiple user done.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.716-719
• /
• 2003

P2P (Peer to Peer) is part that is discussed much in the latest Internet and is interested. P2P changes the structure of Client-Server into Information sharing between client that is the structure of p2p. But perfect P2P system has many problems awaiting solution. In this treatise we can realize network communication to compose one virtual server and one virtual client which is intergrated several client and distributed computer that decentralize network traffic into the traffic of several pc by sharing resource and cpu between client. Our nam purpose is not real P2P system but realization, organization of the P2P internet system which is composed by distributed computing and network load balancing in P2P internet system environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.204-211
• /
• 2012

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1055-1063
• /
• 2002

In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.2
• /
• pp.1-13
• /
• 2014

In IEEE 802.11p/1609-based vehicular networks, vehicles are allowed to exchange safety and control messages only within time periods, called control channel (CCH) interval, which are scheduled periodically. Currently, the length of the CCH interval is set to the fixed value (i.e. 50ms). However, the fixed-length intervals cannot be effective for dynamically changing traffic load. Hence, some protocols have been recently proposed to support variable-length CCH intervals in order to improve channel utilization. In existing protocols, the CCH interval is subdivided into safety and non-safety intervals, and the length of each interval is dynamically adjusted to accommodate the estimated traffic load. However, they do not consider the presence of hidden nodes. Consequently, messages transmitted in each interval are likely to overlap with simultaneous transmissions (i.e. interference) from hidden nodes. Particularly, life-critical safety messages which are exchanged within the safety interval can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning. In this paper, we therefore propose a new interference-aware Dynamic Safety Interval (DSI) protocol. DSI calculates the number of vehicles sharing the channel with the consideration of hidden nodes. The safety interval is derived based on the measured number of vehicles. From simulation study using the ns-2, we verified that DSI outperforms the existing protocols in terms of various metrics such as broadcast delivery ration, collision probability and safety message delay.