• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3A
• /
• pp.221-228
• /
• 2009

We consider distributed resource allocation among the links in a wireless network to minimize the total transmit power of the network while meeting the target rate required by each link. The problem to be solved is how to change the amount of wireless resource allocated and the number of links sharing the resource according to the interference environment so that the following distributed power control game converges to a stable point. To provide a distributed method with less complexity and lower information exchange than the centralized optimal method, we define the resource sharing level among the links from which the size of resource allocated and the links sharing the resource are determined distributively. It is shown that the performance of the proposed method is better than that of the conventional methods, orthogonal resource allocation only and resource sharing only, as well as it approaches to that of the optimal method.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.568-577
• /
• 2014

We consider a mobile content delivery network (mCDN) in which special mobile devices designated as caching servers (caching-server device: CSD) can provide mobile stations with popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSD's are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We demonstrate that the proposed ODSA takes fewer iterations, on the order of O(log N) searches, for caching N contents in the system to find the optimal solution, as compared to the number of iterations in the conventional subgradient method, with an acceptable accuracy in practice. Furthermore, we identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing the mCDN.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1947-1955
• /
• 1989

With the increasing complexity of cabling at sensory level in process control and manufacturing automation, field buses were introduced to replace the traditional point to point links from each sensor or acruator to its controlling equipments by a single link on which all information is transmitted seriall and multiplexed in time. In this papr, we introduce the BITBUS network as a field bus. For the service discipline of the BITBUS network, two service strategies are proposed to obtain the performance of the network. They are the equal priority cyclic service strategy and the non-equal priority cyclic service strategy. The former assigns equal priority to each node for polling and the latter assumes non-equal priority. The BITBUS network was modeled as a cyclic queueing model and it is analyzed by two methods: the Kuehn's and the Boxma's. Computer simulation was also done for the cyclic queueing model and simulation results were compared with those. Under mathematically non-analyzable environment, only the computer simulation was done. From the simulation result, in order to meet the response time requirement of 5 msec imposed by International Electrotechnical Commission when each node has the average traffic of 5000 messages/sec in manufacturing automation the number of slave nodes should be smaller than 10 at the transmission rate of 2.5 Mbps.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.147-156
• /
• 2001

A high performance routing switch is an essential device to either the high performance parallel processing or communication networks that handle multimedia transfer systems such as VOD. The high performance routing chip called STC104 is a typical example in the technical aspect which has 32 bidirectional links of 100Mbps transfer sped. It has exploited new technologies, such as wormhole routing, interval labeling, and adaptive routing method. The high speed router has been applied into some parallel processing system as a single chip. However, its performance over the various interconnection networks with multiple routing chips has not been studied. In this paper, the strucrtures and characteristics of the STC104 have been investigated in order to evaluate the high speed router. Various topology of the STC104, such as meshes, torus, and N-cube are defined and constructed. Algorithms of packet transmission have been proposed based on the interval labeling and the group adaptive routing method implemented in the interconnected network. Multicast algorithms, which are often requited to the processor networks and broadcasting systems, modified from U-mesh and U-torus algorithms have also been proposed overcoming the problems of point-to-point communication.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.10
• /
• pp.47-55
• /
• 2009

In this study, a robot foot having toes for firm stepping on uneven surface is proposed. The toes are connected to the lower leg by parallel links so that the lower leg can rotate in the rolling and pitching directions during stance phase without ankle joint. The landing performance of the foot on uneven surface was evaluated by relative comparison with that of the most common foot making point contact with the walking surface, since the test conditions considering real uneven surface could be hardly defined for its objective evaluation. Anti-slip margin(ASM) was defined in this study to express the slip resistance of a robot foot when it lands on a projection with half circular-, triangular- or rectangular cross section, assuming that uneven surface consists of projections having these kind of cross sections in different sizes. Based on the ASM analysis, the slip conditions for the two feet were experimentally confirmed. The results showed that the slip resistance of the new foot is not only higher than that of the conventional point contact type foot but also less sensitive to the surface friction coefficient.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.257-264
• /
• 2000

This research suggested a method by which the driver space can be designed to best accommodate the driver's anthropometric characteristics. Three-dimensional manikins and a variable seating buck were developed and used for this study. Manikins were designed with 18 links comprising the 95th percentile male and 5th percentile female data. The seating buck was built to create various driving environments using the distance and the height between the H-point(hip pivot) of the seat and the AHP(accelerator heel point), the angle of the back rest, the angle of the steering wheel, the vertical distance of the steering wheel, and the location of the T.G.S.(transmission gear shift) knob. Measurements of each variable were collected with a coordinate measuring machine by positioning the 3-D manikin under various combinations of the design factors of the seating buck, which was constructed based on mid-size domestic passenger cars. The data were then converted to the joint angles of the driver. The combination of the measurements for an optimal driving environment is suggested by applying sets of the joint angles at which the driver feels comfortable.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.2
• /
• pp.108-120
• /
• 2022

We considered qualitative behaviour of the generalization of Einstein's model of Brownian motion when the key parameter of the time interval of free jump degenerates. Fluids will be characterised by number of particles per unit volume (density of fluid) at point of observation. Degeneration of the phenomenon manifests in two scenarios: a) flow of the fluid, which is highly dispersing like a non-dense gas and b) flow of fluid far away from the source of flow, when the velocity of the flow is incomparably smaller than the gradient of the density. First, we will show that both types of flows can be modeled using the Einstein paradigm. We will investigate the question: What features will particle flow exhibit if the time interval of the free jump is inverse proportional to the density and its gradient ? We will show that in this scenario, the flow exhibits localization property, namely: if at some moment of time t₀ in the region, the gradient of the density or density itself is equal to zero, then for some T during time interval [t₀, t₀ + T] there is no flow in the region. This directly links to Barenblatt's finite speed of propagation property for the degenerate equation. The method of the proof is very different from Barenblatt's method and based on the application of Ladyzhenskaya - De Giorgi iterative scheme and Vespri - Tedeev technique. From PDE point of view it assumed that solution exists in appropriate Sobolev type of space.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2512-2529
• /
• 2015

Wireless mesh networks (WMNs) provide an efficient and flexible method to the field of wireless networking, but also bring many security issues. A mesh point may lose all of its available links during its movement. Thus, the mesh point needs to handover to a new mesh point in order to obtain access to the network again. For multi-domain WMNs, we proposed a new ID-based signcryption scheme and accordingly present a novel ID-based handover protocol for mesh points. The mutual authentication and key establishment of two mesh points which belong to different trust domains can be achieved by using a single one-round message exchange during the authentication phase. The authentication server is not involved in our handover authentication protocol so that mutual authentication can be completed directly by the mesh points. Meanwhile, the data transmitted between the two mesh points can be carried by the authentication messages. Moreover, there are no restrictions on the PKG system parameters in our proposed multi-domain ID-based signcryption scheme so our handover scheme can be easily applied to real WMNs circumstances. Security of the signcryption scheme is proved in the random oracle model. It shows that our protocol satisfies the basic security requirements and is resistant to existing attacks based on the security of the signcryption. The analysis of the performance demonstrates that the protocol is efficient and suitable for the multi-domain WMNs environment.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.922-933
• /
• 2016

IP header compression schemes offer a valuable measure for bandwidth preservation. Such schemes have been practically implemented in infrastructure-based IP networks for point-to-point links. However, minimal research and practical implementation efforts have been conducted in the direction of an IP header compression strategy that can meet the peculiar requirements of multi-hop ad hoc wireless networks. In this paper, we present a practically implemented multi-hop IP header compression scheme using the Robust Header Compression (ROHC) protocol suite. The scheme runs on a novel identifier (ID) based networking architecture, known as an ID-based ad hoc network (IDHOCNET). IDHOCNET additionally solves a number of bottlenecks of pure IP-based ad hoc networks that have emerged owing to IP address auto-configuration service, distributed naming and name resolution, and the role of an IP address as an identifier at the application layer. The proposed scheme was tested on a multi-hop test bed. The results show that the implemented scheme has better gain and requires only O (1) ROHC contexts.