• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.300-302
• /
• 2022

In this paper, We propose a mobility model-based resource collision avoidance technique that can share radio resources without resource collision between UAV in a FANET environment. The proposed technique tries to reduce the occurrence of resource collisions by estimating UAV mobility based on information obtained from GPS devices installed in UAV. Through simulations, The performance was compared with the contention-based protocol, and it was confirmed that the proposed algorithm can reduce resource collisions.

• Journal of Satellite, Information and Communications
• /
• v.9 no.1
• /
• pp.51-56
• /
• 2014

High-availability seamless redundancy (HSR) is a protocol for fault-tolerant Ethernet (FTE) networks. It provides two frame copies and each copy is forwarded on a separate physical path, which provides zero fail-over time. Therefore, the HSR is becoming a potential candidate for various real-time FTE applications. However, the generation and circulation of unnecessary frames due to the duplication of every sending frame is inherent drawback of HSR. Such drawback degrades the performance of the network and may deplete its resources. In this paper, we present a new algorithm called port locking (PL) based on the media access control (MAC) address to solve the abovementioned problem in popular connected-rings network. Our approach makes the network gradually learn the locations of the source and the destination nodes without relying on network control frames. It then prunes all the rings that do not contain the destination node by locking corresponding rings' entrance ports. With the PL algorithm, the traffic can be significantly reduced and therefore the network performance will be greatly enhanced specially in a large scale connected-rings network. Analytical results are provided to validate the PL algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.251-259
• /
• 2014

In this paper, we propose Low Energy Service Discovery (LESD) protocol for common discovery mode of IEEE 802.15.8 Peer Aware Communications (PAC). In order to minimize power consumption, Basic Repetition Block (BRB) is defined. Device is able to select operating mode and synchronize other devices through it. Proposed MAC procedure is Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based on overhearing technique. Even if device has not been received response signal since transmitted request signal, it is able to discover other devices of same group through the overhearing technique. IEEE 802.15.8 PAC has required that performances of common discovery mode are presented about discovered devices during the simulation time, discovery latency and average power consumption. By considering the number of devices per group and channel environment, two scenarios are evaluated through system level simulation and the simulation results of proposed scheme are compared with CSMA/CA in same simulation conditions. As a result, proposed scheme is able to get high energy efficiency of devices as well as increase the number of discovered devices during simulation time when the longer the number of devices is distributed over a limited area.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.109-117
• /
• 2010

Building a large-scale testbed for Future Internet is very important to evaluate a new protocol and new network architecture designed by clean-slate approach. In Korea, new Future Internet testbed project, called FIRST (Future Internet Research for Sustainable Testbed), has been started since Mar. 2009 to design and test new protocols. This project is working together with ETRI and 5 universities. The FIRST@PC is to implement a virtualized hardware-accelerated PC-node by extending the functions of NetFPGA card and build a Future Internet testbed on the KOREN and KREONET for evaluating newly designed protocols and interesting applications. In this paper, we first briefly introduce FIRST@PC project and explain a 'MAC in IP Capsulator' user-space program using raw-socket in Linux to interconnect OpenFlow enabled switch sites on the KOREN and KREONET. After that, we address test results for TCP throughput performance for varying packet size. The test results show that the software based capsulator can support a reasonable bandwidth performance for most of applications.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.17-26
• /
• 2013

ISO/IEC 29157 originally developed in the Republic of Korea and is based on commercially available PicoCast v1.0. ISO/IEC JTC1 SC6 was registered by the international standard on May 2010. A single platform for a variety of applications and media formats to support development objectives were. ISO/IEC 29157 based wireless networks, ie, Pico-net to master node periodically transmit sync signal is synchronized to the number of slave nodes have the communications structure. Pico-net also supports a variety of network topologies and direct communication between nodes(single-hop communication) and QoS is guaranteed. But Pico-net network structure has the following problems. Loss of communication problems due to mobile nodes, resulting in limitations of node mobility and wireless network operation range of conventional wireless networks operating range less than 1/4 was reduced to the problem. In this paper, a possible solution to the problems mentioned is proposed, using multi-hop communication technology and sync signal transmission technology between nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.31-40
• /
• 2004

In this paper, we analyze mathematically the performance of the gated service scheduling in the Interleaved Polling with Adaptive Cycle Time(IPACT) was proposed to control upstream traffic for Gigabit Ethernet-PONs. In the analysis, we model EPON MAC protocol as a polling system and use mean value analysis. We divide arrival rate λ into three regions and analyze each region accordingly In the first region in which λ value is very small, there are very few ONUs' data to be transmitted. In the second region in which λ has reasonably large value, ONUs have enough data for continuous transmission. In the third region, ONUs' buffers are always saturated with data since λ value is very large. We obtain average packet delay, average Queue size, average cycle time of the gated service. We compare analysis results with simulation to verify the accuracy of the mathematical analysis. Simulation requires much time and effort to evaluate the performance of EPONs. On the other hand, mathematical analysis can be widely used in the design of EPON systems because system designers can obtain various performance results rapidly. We can design appropriate EPON systems for varioustraffic property by adjusting control parameters.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.6
• /
• pp.1-10
• /
• 2021

The interest in underwater acoustic sensor networks (UWASNs), along with the rapid development of underwater industries, has increased. To operate UWASNs efficiently, it is important to adopt well-designed medium access control (MAC) protocols that prevent collisions and allow the sharing of resources between nodes efficiently. On the other hand, underwater channels suffer from a narrow bandwidth, long propagation delay, and low data rate, so existing terrestrial node pairing schemes for non orthogonal multiple access (NOMA) cannot be applied directly to underwater environments. Therefore, a multi-dimensional node pairing scheme is proposed to consider the unique underwater channel in UWASNs. Conventional NOMA schemes have considered the channel quality only in node pairing. Unlike previous schemes, the proposed scheme considers the channel gain and many other features, such as node fairness, traffic load, and the age of data packets to find the best node-pair. In addition, the sender employs a list of candidates for node-pairs rather than path loss to reduce the computational complexity. The simulation results showed that the proposed scheme outperforms the conventional scheme by considering the fairness factor with 23.8% increases in throughput, 28% decreases in latency, and 5.7% improvements in fairness at best.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.63-74
• /
• 2009

In 2005, Wang et al. discovered devastating collision attacks on the main hash functions from the MD4 family. After the discovery of Wang, many analysis results on the security of existing hash-based cryptographic schemes are presented. At CRYPTO'07, Fouque, Leurent and Nguyen presented full key-recovery attacks on HMAC/NMAC-MD4 and NMAC-MD5[4]. Such attacks are based on collision attacks on the underlying hash function, and the most expensive stage is the recovery of the outer key. At EUROCRYPT'08, Wang, Ohta and Kunihiro presented improved outer key recovery attack on HMAC/NMAC-MD4, by using a new near collision path with a high probability[2]. This improves the complexity of the full key-recovery attack on HMAC/NMAC-MD4 which proposed by Fouque, Leurent and Nguyen at CRYPTO'07: The MAC queries decreases from $2^{88}$ to $2^{72}$, and the number of MD4 computations decreases from $2^{95}$ to $2^{77}$. In this paper, we propose improved outer key-recovery attack on HMAC/NMAC-MD4 with $2^{77.1246}$ MAC queries and $2^{37}$ MD4 computations, by using divide and conquer paradigm.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.11-19
• /
• 2010

ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.