• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.6
• /
• pp.1-8
• /
• 1982

In this paper a new analytic method for Ladder networks by weighted tree is proposed. In contrast to conventional tree concept that represents only information structure, in this paper, a tree with hierarchical structure is established by giving wei체t of impedance Z and admittance Y to branch and representing each node of its branch as a pair of voltage and current. Then, by defining generation level from tree structure and by parsing between standand level and arbitrary level, driving point impedance, transfer function and transfer impedance are simultaneously obtained instead of complex calculation method by inspection. The validity of this method is proved by the reciprocal theorem and this method is applied to four-terminal constants and the feedback network.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.255-266
• /
• 2007

RSVP (Resource reSerVation Protocol) is the Internet standard protocol for supporting QoS (Quality of Service) requirements by reserving network resources between the sender and the receiver. Several problems, such as common path identification and resource pre-reservation, should be solved to apply RSVP in wireless mobile environments. To resolve these problems, this paper proposes DBRA (Dynamic Branch Router Approach) based on two designated entities, candidate access routers and a branch router. While several RSVP sessions between a branch router and candidate routers are managed, DBRA makes use of only one RSVP session between the sender and a branch router. Based on a network simulation, the proposed scheme has been compared with MRSVP (Mobile RSVP) and HMRSVP (Hierarchical MRSVP) in terms of the average packet transmission rate, bandwidth utilization and RSVP session failure rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.4
• /
• pp.387-393
• /
• 2013

In shipyard site, a ship is constructed by integrating lots of modules that are made in several sites with different capabilities and specifications. Recently, it needs to make a shipyard to be smart with wired and wireless broadband networks between hierarchical shipyards. In this paper, we propose an installation of LTE femtocell local gateway at a remote shipyard, an information exchange method between hierarchical shipyards, and an offload method to separate the general traffic. We define the mode change in a femtocell gateway for supporting the offload of the general traffic between the headquarter and a remote shipyard, the offload data management and trigger message, and cache entry fields. To show the operation of our proposed off-loading function, we consider the transcipient message flow at the femtocell gateway with its state transition diagram. Hence, it is expected to increase the productivity of shipyard industry with mobile communications and broadband Internet technologies.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.88-99
• /
• 2007

P2P systems are distributed data sharing systems, and each node in them plays the role of client as well as server. There are several studies using Distributed Hash Table, such as Chord, CAN, Tapestry, Pastry, but these systems don't consider the physical latency, therefore they have a weakness of difficulty to guarantee stable performance. To improve this problem, we present the TP2P system. This system is a self-organizing hierarchical overlay system and it uses Chord routing mechanism for lookup data. This system is organized by several subnets, each subnet is organized by physically close nodes, and global network organized by all nodes. In each subnet, one node finds a data, it saves in a node in the subnet, therefore it has higher probability to reduce physical lookup latency than Chord system. And each node has global information of some nodes in its subnet, and it is used to lookup data, therefore the number of hops decrease about 25% as well as the physical lookup latecy are reduced.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.10-17
• /
• 2010

Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.676-686
• /
• 2005

The Internet users as well as network providers are eager to have different qualities of service among users beyond the best-effort. In this paper, we propose a scheduling algorithm that provides a differentiated service in the granularity of user sessions. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR) algorithm that is an extension of an existing DRR algorithm. A main advantage is that H-DRR provides service differentiation for throughput-intensive applications such as FTP as well as delay-sensitive applications such as telnet or VoIP without distinguishing the types of applications. The most importance in providing a service differentiation in term of network providers is to have controllability and predictability. We show that H-DRR is superior to DRR in terms of controllability and predictability through both mathematical analysis and simulation experiments. Nevertheless, H-DRR requires O(1) complexity for implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.446-453
• /
• 2013

Clustering schemes have been adopted as an efficient solution to prolong network lifetime and improve network scalability. In such clustering schemes cluster ratio is represented by the rate of the number of cluster heads and the number of total nodes, and affects the performance of clustering schemes. In this paper, we mathematically analyze an optimal clustering ratio in wireless sensor networks. We consider a multi-hop to one-hop transmission case and aim to provide the optimal cluster ratio to minimize the system hop-count and maximize packet reception ratio between nodes. We examine its performance through a set of simulations. The simulation results show that the proposed optimal cluster ratio effectively reduce transmission count and enhance energy efficiency in wireless sensor networks.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1433-1442
• /
• 1996

Data distribution of SPMD(Single Program Multiple Data) pattern is one of main features of HPF (High Performance Fortran). This paper describes design is sues for such data distribution and its efficient execution model on TICOM IV computer, named SPAX(Scalable Parallel Architecture computer based on X-bar network). SPAX has a hierarchical clustering structure that uses distributed shared memory(DSM). In such memory structure, it cannot make a full system utilization to apply unanimously either SMDD(shared Memory Data Distribution) or DMDD(Distributed Memory Data Distribution). Here we propose another data distribution model, called DSMDD(Distributed Shared Memory Data Distribution), a data distribution model based on hierarchical masters-slaves scheme. In this model, a remote master and slaves are designated in each node, shared address scheme is used within a node and message passing scheme between nodes. In our simulation, assuming a node size in which system performance degradation is minimized,DSMDD is more effective than SMDD and DMDD. Especially,the larger number of logical processors and the less data dependency between distributed data,the better performace is obtained.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.89-95
• /
• 2013

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. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.121-129
• /
• 2011

One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.