• Journal of Power Electronics
• /
• v.17 no.6
• /
• pp.1694-1706
• /
• 2017

Models and experiments for magnetic resonance coupling wireless power transmission (MRC-WPT) topologies such as the chain topology and branch topology are studied in this paper. Coupling mode theory based energy resonance models are built for the two topologies. Complete energy resonance models including input items, loss coefficients, and coupling coefficients are built for the two topologies. The storage and the oscillation model of the resonant energy are built in the time domain. The effect of the excitation item, loss item, and coupling coefficients on MRC systems are provided in detail. By solving the energy oscillation time domain model, distance enhancing models are established for the chain topology, and energy relocating models are established for the branch topology. Under the assumption that there are no couplings between every other coil or between loads, the maximum transmission capacity conditions are found for the chain topology, and energy distribution models are established for the branch topology. A MRC-WPT experiment was carried out for the verification of the above model. The maximum transmission distance enhancement condition for the chain topology, and the energy allocation model for the branch topology were verified by experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3468-3495
• /
• 2015

In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.177-181
• /
• 2013

As smart devices and OS with communication capabilities based latest NFC (Near Field Communication) have been spreaded, many applications with using existing RFID are being replaced to NFC. Smart NFC technology and existing services and devices can be easily combined convergence and advantage of smart phones, such as authentication and billing, medical care, the creation of a new paradigm of Network Communication are to be expected. By developing H/W, S/W of the Smart NFC Security Authenticator(SNSA), satisfying with wireless communication test results within accepted reference value, analyzing and testing the impact of topology, the signal performance of Daisy Chain Topology was much better than Star Topology's.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.106-113
• /
• 2017

In this paper, we propose a suitable network topology for the Ethernet based Train Communication Network (TCN) for control system in a autonomous multi-articulated vehicle. We propose a network topology considering the structural constraints such as the number of cables and ports, and the performance constraints such as network response time and maximum throughput. We compare the network performances of star topology and daisy chain topology as well as hybrid topology, which is proposed in previous studies and a compromise between daisy chain and star topology. Here, the appropriate number of nodes in a group is obtained for the configuration of the hybrid topology. We first derive estimates of the network performance through simulation with different topologies, and then, implement the network by connecting the actual devices with each network topology. The performance of each topology is measured using various network performance measurement programs and the superiority of the proposed topology is described through comparison.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.27-34
• /
• 2016

In the train system, railway vehicles are connected in a line. Therefore, this feature should be considered in composing network topology in a train system. Besides, inter-car communication should be distinguished from in-car communication. As for the inter-car communication, the hybrid topology was proposed to use rather than the conventional ring, star, daisy-chain, and bus topologies. In the hybrid topology, a number of cars are bound to be a group. Then star topology is used for the communication in a group and daisy-chain topology is used for the communication between groups. Hybrid topology takes the virtue of both star and daisy-chain topologies. Hence it maintains communication speed with reducing the number of connecting cables between cars. Therefore, it is important to choose the number of cars in a group to obtain higher performance. In this paper, we focus on the optimization of hybrid topology for railway cars. We first assume that the size of data and the frequency of data production for each car is identical. We also assume that the importance for the maximum number of cables to connect cars is variable as well as the importance of the communication speed. Separated weights are granted to both importance and we derive the optimum number of cars in a group for various number of cars and weights.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.282-295
• /
• 2007

Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.161-169
• /
• 2024

A semi-well ordered set is a partially ordered set in which every non-empty subset of it contains a least element or a greatest element. It is defined as an extension of the concept of well ordered sets. An attempt is made to identify the properties of a semi-well ordered set equipped with the order topology.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.631-638
• /
• 2005

we prove that, given any compact metric space X, there exists a residual subset R of H(X), the space of all homeomorphisms on X, such that if $\in$ R has a totally chain-transitive attractor A, then any g sufficiently close to f has a totally chain transitive attractor A$\_{g}$ which is convergent to A in the Hausdorff topology.