• Journal of KIISE:Software and Applications
• /
• v.41 no.8
• /
• pp.569-579
• /
• 2014

In a tactical-edge environment, where multiple weapon resources are coordinated together via services, it is essential to make an efficient binding between an abstract service and a resource that are needed to execute composite services for accomplishing a given mission. However, the tactical network that is used in military operation has low bandwidth and a high rate of packet loss. Therefore, communication overhead between services must be minimized to execute composite services in a stable manner in the tactical network. In addition, a tactical-edge environment changes dynamically, and it affects the connectivity and bandwidth of the tactical network. To deal with these characteristics of the tactical network we propose two service-resource reallocation methods which minimize the communication overhead between service gateways and effectively manage neutralization of gateways during distributed service coordination. We compared the effectiveness of these two - methods in terms of total communication overhead between service gateways and resource-allocation similarity between the initial resource allocation and the reallocation result.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.163-176
• /
• 2016

The contention overhead on the same channel in an NoC architecture can significantly increase a communication delay due to the simultaneous communication requests that occur. To reduce the overall overhead, we propose task-to-tile binding techniques for an NoC-based manycore platform, whereby it is assumed that the task mapping decision has already made. Since the NoC architecture may have multiple memory tiles as its size grows, memory clustering is used to balance the load of memory by making applications access different memory tiles. We assume that the information on the communication overhead of each application is known since it is specified in a dataflow task graph. Using this information, this paper proposes two heurisitics that perform binding of multiple tasks at once based on a proper memory clustering method. Experiments with an NoC simulator prove that the proposed heurisitic shows performance gains that are 25% greater than that of the previous binding heuristic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.801-807
• /
• 2013

WSN consists of hundreds to thousands of sensor nodes. In order to solve the problem of energy consumption imbalance cluster head is reelected in every round, while node authentication scheme is utilized for secure communication. However, re-clustering increases the overhead of sensor nodes and during the node authentication phase the frequent AREQ/AREP message exchange also increases the overhead. Therefore, a secure and energy efficient protocol, by which overhead of sensor nodes is reduced and long time communication is achieved, is required for wireless sensor network. In this paper, an energy efficient and reliable IDE-LEACH protocol for WSN is proposed. The proposed protocol is prolongs networks lifetime about average 20% compared to the LEACH-based protocols and all attending nodes in communication form BS authentication consisted of trusted nodes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.11
• /
• pp.635-642
• /
• 2004

The traditional communication protocols such as TCP/IP are not suitable for PC cluster systems because of their high software processing overhead. To eliminate this overhead, industry leaders have defined the Virtual Interface Architecture (VIA). VIA provides two different data transfer mechanisms, a traditional Send/Receive model and the Remote Direct Memory Access (RDMA) model. RDMA is extremely efficient way to reduce software overhead because it can bypass the OS and use the network interface controller (NIC) directly for communication, also bypass the CPU on the remote host. In this paper, we have implemented VIA-based RDMA mechanism in hardware. Compared to the traditional Send/Receive model, the RDMA mechanism improves latency and bandwidth. Our RDMA mechanism can also communicate without using remote CPU cycles. Our experimental results show a minimum latency of 12.5${\mu}\textrm{s}$ and a maximum bandwidth of 95.5MB/s. As a result, our RDMA mechanism allows PC cluster systems to have a high performance communication method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1559-1565
• /
• 2021

In this paper, an antenna selection scheme is proposed in massive multi-user multiple input multiple output (MU-MIMO) systems. The proposed antenna selection scheme can achieve almost the same performance as a conventional scheme while significantly reducing the overhead of feedback by using deep reinforcement learning (DRL). Each user compares the channel gains of massive antennas in base station (BS) to the L-largest channel gain, converts them to one-bit binary numbers, and feed them back to BS. Thus, the feedback overhead can be significantly reduced. In the proposed scheme, DRL is adopted to prevent the performance loss that might be caused by the reduced feedback information. We carried out extensive Monte-Carlo simulations to analyze the performance of the proposed scheme and it was shown that the proposed scheme can achieve almost the same average sum-rates as a conventional scheme that is almost optimal.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.269-271
• /
• 2003

A method for calculation of mutual inductance from the parallel power-line and earth conduct to communication-line is studied in the paper. The solution for the electromagnetic field produced by an overhead power-line is derived using Maxwell's equations and treating the as a boundary value problem. Total mutual inductance from direct current and image current to communication-line is used Carson's formula for infinitely long parallel conductors.

• ETRI Journal
• /
• v.38 no.2
• /
• pp.280-290
• /
• 2016

To implement high-order multiuser multiple input and multiple output (MU-MIMO) for massive MIMO systems, there must be a feedback scheme that can warrant its performance with a limited signaling overhead. The interference-to-noise ratio can be a basis for a novel form of Codebook (CB)-based MU-MIMO feedback scheme. The objective of this paper is to verify such a scheme's performance under a practical system configuration with a 3D channel model in various radio environments. We evaluate the performance of various CB-based feedback schemes with different types of overhead reduction approaches, providing an experimental ground with which to optimize a CB-based MU-MIMO feedback scheme while identifying the design constraints for a massive MIMO system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.71-76
• /
• 2015

To resolve inefficient content delivery mechanism in conventional internet-based networks, Content-Centric Networks (CCN) has been proposed for wired and wireless networks. One of issues in wireless CCN-based networks is overhead to achieve reliability on content delivery because CCN uses end-to-end two-way handshake with Interest/content packets. In this paper, a novel protocol to reduce overhead and achieve reliability is proposed. The protocol allows Interest packet to request multiple data packets and multiple data packets to be sent in a row without a Interest packets. The protocol is evaluated through the simulations and the performance improvement is proved.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.639-639
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.839-846
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.