• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.724-728
• /
• 1995

A new dynamic channel assignment (DCA) algorithm with rearrangement for cellular mobile communication systems is suggested. Our DCA algorithm is both traffic and interference adaptive, which is based on the mathematical formulation of the maximum packing under a realistic propagation model. In developing the algorithm, we adopt the Lagrangean relaxation technique that has been successfully used in the area of mathematical programming. Computational experiments of the algorithm reveal quite encouraging results. Although our algorithm primarily focuses on microcellular systems, it can be effectively applied to conventional cellular systems under highly nonuniform traffic distributions and interference conditions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.535-538
• /
• 2001

본 논문은 작은 fanout에 대한 불공정성과 hot-spot의 문제를 해결하기 위해 공정하게 입력포트에 접근하여 복사망으로 들어갈 수 있는 멀티캐스트 스위치를 제안하고자 한다. 제안된 스위치는 큰 fanout에 대한 작은 fanout을 가진 입력포트에 도착한 패킷의 불공정한 대우를 해결하여 시스템 전체 지연시간을 줄여 산출량을 극대화할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.956-965
• /
• 2000

In this paper, we propose an efficient traffic grooming algorithm to minimize to number of SONET ADMs which is the dominant cost of system in high speed optical ring networks. It is an optimal traffic grooming algorithm to be applied to both unidirectional ring and bi-directional ring under both uniform traffic and nonuniform traffic. The proposed traffic grooming algorithm consists of two subalgorithms : one is the algorithm to construct full connection-rings as many as possible to minimize gaps by cutting the connections and using redirection method, and the other is the algorithm to groom connection-rings into a wavelength to maximize the number of shared nodes. The simulation results show that the proposed algorithm is superior to conventional algorithm under various network conditions.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.282-290
• /
• 2006

In vertically overlaid cellular systems, a temporary traffic concentration can occur in a hot-spot area, and this adversely affects overall system capacity. In this paper, we develop an adaptive hot-spot operating scheme (AHOS) to mitigate the negative effects from the nonuniform distribution of user location and the variation in the mixture of QoS requirements in orthogonal frequency division multiple access downlink systems. Here, the base station in a macrocell can control the operation of picocells within the cell, and turns them on or off according to the system overload estimation function. In order to determine whether the set of picocells is turned on or off, we define an AHOS gain index that describes the number of subcarriers saved to the macrocell by turning a specific picocell on. For initiating the picocell OFF procedure, we utilize the changes in traffic concentration and co-channel interference to the neighboring cells. According to computer simulation, the AHOS has been proved to have maximize system throughput while maintaining a very low QoS outage probability under various system scenarios in both a single-cell and multi-cell environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1785-1796
• /
• 1998

This paper is concerned with the relationships between optimal number of wavelengths and tuning time in time division multiplexing(TDM) scheduling on wavelength division multiplexing(WDM) optical passive star networks. We assume that the traffic is nonuniform and each node has a tunable transmitter and a fixed receiver. Each node transmits spckets to all other nodes. Most of the earlier protocols on TDM based scheduling for WDM star networks [7, 8, etc.] use whold given wavelength chnnels. But in this paper, we investigate the optimal number of wavelengths that yidels minimum frame length when tuning time exists. It appears within the availble number of wavelengths that yields minimum frame length when tuning time exists. It appears within the available number of wavelengths. We analyze the relationships between optimal number of wavelengths and tuning time by experiments. We analyze the reationships between optimal number of wavelengths and tuning time by experiments. We also discuss on the possibility of reduction of frame length by increasing the number of nodes trans-mitters and receivers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.664-674
• /
• 1996

In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1045-1057
• /
• 1999

Packet-switched multistage interconnection networks(MINs) have been widely used for digital switching systems and super computers. In this paper we show that multiple packets in a switching element can move to the succeeding switching element in one network cycle by fully utilizing the cycle bandwidth. Only one packet movement was usually assumed in typical MINs. we present an analytical model for the MNs with the multiple packet movement scheme, and validate it by computer simulation. Comparisons with the traditional MINs of single packet movement reveal that the throughput is increased up to about 30% for practical size MINs. Similar result was also obtained for delays. The performance increase is more significant when the network traffic is nonuniform.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.6
• /
• pp.1-9
• /
• 2000

This paper presents a Cluster Oriented Multistage Interconnection Network called COMR. COMR can be constructed suitable for the parallel application with localized communication by providing the shortcut path inside the processor-memory cluster which has frequent data communication. We evaluate the performance of COMR with respect to probability of acceptance, bandwidth, cost-effectiveness and average distance under varying degrees of localized communication. According to the result of analysis for performance evaluation, COMR shows higher performance than the regular MINs of the same network size in the highly localized communication. In the worst case, the diameter of an N$\times$N COMR is only n+1 which has only one stage more as compared the MIN with the same network size. Therefore COMR can be used as an attractive interconnection network for parallel applications with not only the localized communication distribution but also the uniform distribution in shared-memory multiprocessor system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.73-80
• /
• 2004

In this paper, we present the cell resequencing buffer to solve the cell sequence integrity problem of the Cyclic banyan network that is a high-performance fault-tolerant cell switch. By offering multiple paths between input ports and output ports, using the deflection self-routing, the Cyclic banyan switch offer high reliability, and it also solves congestion problem for the internal links of the switch. By the way, these multiple paths can be different lengths for each other. Therefore, the cells departing from an identical source port and arriving at an identical destination port can reach to the output port as the order that is different from the order arriving at input port. The proposed cell resequencing buffer is a hardware sliding window mechanism. to solve such cell sequence integrity problem. To calculate the size of sliding window that cause the prime cost of the presented device, we analyzed the distribution of the cell delay through the simulation analyses under traffic load that have a nonuniform address distribution that express tile Property of traffic of the Internet. Through these analyses, we found out that we can make a cell resequencing buffer by which the cell sequence integrity is to be secured, by using a, few of ordinary memory and control logic. The cell resequencing buffer presented in this paper can be used for other multiple paths switching networks.