• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.268-277
• /
• 2016

Load balancing is a significant technique to prolong a network's lifetime in sensor network. This paper introduces a hybrid approach named as Load Distributing Hybrid Routing Protocol (LDHRP) composed with a border node routing protocol (BDRP) and greedy forwarding (GF) strategy which will make the routing effective, especially in mobility scenarios. In an existing solution, because of the high network complexity, the data delivery latency increases. To overcome this limitation, a new approach is proposed in which the source node transmits the data to its respective destination via border nodes or greedily until the complete data is transmitted. In this way, the whole load of a network is evenly distributed among the participating nodes. However, border node is mainly responsible in aggregating data from the source and further forwards it to mobile sink; so there will be fewer chances of energy expenditure in the network. In addition to this, number of hop counts while transmitting the data will be reduced as compared to the existing solutions HRLBP and ZRP. From the simulation results, we conclude that proposed approach outperforms well than existing solutions in terms including end-to-end delay, packet loss rate and so on and thus guarantees enhancement in lifetime.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.174-179
• /
• 2005

In the SONET/SDH based ASON, one VC3 connection contains 21 VC12 calls. Hence, it can serve up to 21 VC12 calls. When a new VC12 call arrives, if there exists at least one available VC3 connection in the network, that VC12 call is severed immediately. However, if there is no available VC3 connection, that VC12 call has to wait a certain time, called setup latency, for the a new VC3 connection to be established. This is inconvenient for the customers. On the other hand, if there are more VC3 connections than the network requires, this can waste network resources. In this paper, we proposed the solution for these problems. In order to reduce the number of VC12 calls which have to wait, we setup a new VC3 before all VC12 time slots are occupied. Furthermore, to avoid the waste of the network resources, we do not establish all VC3 connections at the same time, but do establish step by step.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.765-784
• /
• 2019

The smart city is one of the most promising, prominent, and challenging applications of the Internet of Things (IoT). Smart cities rely on everything connected to each other. This in turn depends heavily on technology. Technology literacy is essential to transform a city into a smart, connected, sustainable, and resilient city where information is not only available but can also be found. The smart city vision combines emerging technologies such as edge computing, blockchain, artificial intelligence, etc. to create a sustainable ecosystem by dramatically reducing latency, bandwidth usage, and power consumption of smart devices running various applications. In this research, we present a comprehensive survey of emerging technologies for a sustainable smart city network. We discuss the requirements and challenges for a sustainable network and the role of heterogeneous integrated technologies in providing smart city solutions. We also discuss different network architectures from a security perspective to create an ecosystem. Finally, we discuss the open issues and challenges of the smart city network and provide suitable recommendations to resolve them.

• Smart Structures and Systems
• /
• v.32 no.3
• /
• pp.179-193
• /
• 2023

This study explores an alternative to the existing centralized process for data anomaly detection in modern Internet of Things (IoT)-based structural health monitoring (SHM) systems. An edge intelligence framework is proposed for the early detection and classification of various data anomalies facilitating quality enhancement of acquired data before transmitting to a central system. State-of-the-art deep neural network pruning techniques are investigated and compared aiming to significantly reduce the network size so that it can run efficiently on resource-constrained edge devices such as wireless smart sensors. Further, depthwise separable convolution (DSC) is invoked, the integration of which with advanced structural pruning methods exhibited superior compression capability. Last but not least, quantization-aware training (QAT) is adopted for faster processing and lower memory and power consumption. The proposed edge intelligence framework will eventually lead to reduced network overload and latency. This will enable intelligent self-adaptation strategies to be employed to timely deal with a faulty sensor, minimizing the wasteful use of power, memory, and other resources in wireless smart sensors, increasing efficiency, and reducing maintenance costs for modern smart SHM systems. This study presents a theoretical foundation for the proposed framework, the validation of which through actual field trials is a scope for future work.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.280-282
• /
• 2019

Windows 환경에서 상용 저지연 NIC를 이용하여 컴퓨터 네트워크 통신 지연을 감소시킬 수 있다. 일반적으로 시스템의 커널에서 네트워크 처리를 담당하지만 본 논문은 커널을 우회하여 NIC에서 처리하여 운영체제에서 발생하는 지연을 최소화한다. 상용 NIC과 광섬유 케이블을 사용하여 네트워크 지연에 대한 비교결과를 보이며 네트워크 저지연 시스템의 구성을 제시한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.5
• /
• pp.219-230
• /
• 2017

General-Purpose Graphics Processing Units (GPGPUs) build massively parallel architecture and apply multithreading technology to explore parallelism. By using programming models like CUDA, and OpenCL, GPGPUs are becoming the best in exploiting plentiful thread-level parallelism caused by parallel applications. Unfortunately, modern GPGPU cannot efficiently utilize its available hardware resources for numerous general-purpose applications. One of the primary reasons is the inefficiency of existing warp/thread block schedulers in hiding long latency instructions, resulting in lost opportunity to improve the performance. This paper studies the effects of hardware thread scheduling policy on GPGPU performance. We propose a novel warp scheduling policy that can alleviate the drawbacks of the traditional round-robin policy. The proposed warp scheduler first classifies the warps of a thread block into two groups, warps with long latency and warps with short latency and then schedules the warps with long latency before the warps with short latency. Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks when encountering a high contention degree at the memory and interconnection network. Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy. This paper also shows that the GPGPU performance can be improved by approximately 8.9% on average when the two proposed techniques are combined.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.342-350
• /
• 2001

The Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency, and delayed routing convergence. At the extreme, high levels of routing instability can lead to the loss of internal connectivity in wide-area networks. In this paper, we investigate the variation of domain degree and domain count of the inter-domain network over time by using linear regression model in order to analyze the topology variation of inter-domain network. We Also propose an efficient policy management model to reduce the instability in the inter-domain routing system. The proposed model can be used to identify whether a routing policy is adequate to reduce convergence time that is required to return to a normal state when BGP routing instability happens. Experimental analysis shows that the proposed model can be used to set up routing policy in domains for the purpose of minimizing the effects and the propagation of BGP routing instability.

• Smart Media Journal
• /
• v.4 no.1
• /
• pp.25-32
• /
• 2015

Powering wireless sensors with energy harvested from the environment is coming of age due to the increasing power densities of both storage and harvesting devices and the electronics performing energy efficient energy conversion. In order to maximize the functionality of the wireless sensor network, minimize missing packets, minimize latency and prevent the waste of energy, problems like congestion and inefficient energy usage must be addressed. Many sleep-awake protocols and efficient message priority techniques have been developed to properly manage the energy of the nodes and to minimize congestion. For a WSN that is operating in a strictly energy constrained environment, an energy-efficient transmission strategy is necessary. In this paper, we present a novel transmission priority decision scheme for a heterogeneous body sensor network composed of normal nodes and an energy harvesting node that acts as a cluster head. The energy harvesting node's decision whether or not to clear a normal node for sending is based on a set of metrics which includes the energy harvesting node's remaining energy, the total harvested energy, the type of message in a normal node's queue and finally, the implementation context of the wireless sensor network.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.120-125
• /
• 2000

SNMP(Simple Network Management Protocol) could have the overhead of network, if the number of the agent system which is managed by the management system is increased by the polling for the collection of network management information and the reply traffic for it. In this Paper, the polling method used in SNMP is improved, and Group Polling method is proposed. This can reduce the overhead of network, on case that the agent system is to be increased. The proposed method collects information by grouping agent systems, and have smaller reply latency time and communication overhead than the previous method. So if the number of agent system or the Polling count is numerous, the proposed method is more efficient. As the result of the prototype test, the increasement of agent system can have small variation of traffic and transmission delay time.