• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.356-362
• /
• 1999

DECT(Digital Enhanced Cordless Telecommunications) is the communication protocol and the pico-cellular network that provides a PABX with mobile services on the local area within its cell radius of about 100 to 200m. Compared with GSM, DECT provides low-cost communication services based on the PSTN and it is an ideal supplementary method for the type of in-building mobile communication. In this paper we presented the implementation methods and techniques of the DECT data link communication layer that provided reliable communication services to the upper network layer by performing the functions of link controls, error controls, sequence controls, and flow controls.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.129-139
• /
• 1999

DECT(Digital Enhanced Cordless Telecommunications) is the communication protocol and the pico-cellular network that provides a PABX with mobile services on the local area within its cell radius of about 100 to 200m. Compared with GSM, DECT provides low-cost communication services based on the PSTN and it is an ideal supplementary method for the type of in-building mobile communication. In order to implement the data link communication layer of the DECT system, in this paper we analyzed and designed the structures and functions of it that provided reliable communication and real-time services to the upper network layer by performing the functions of link controls, error controls, sequence controls, and flow controls.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.51-61
• /
• 2014

In the Mobile IPv6 (MIPv6) protocol, a mobile node (MN) is a mobile device with a permanent home address (HoA) on its home link. The MN will acquire a care-of address (CoA) when it roams into a foreign link. It then sends a binding update (BU) message to the home agent (HA) and the correspondent node (CN) to inform them of its current CoA so that future data packets destined for its HoA will be forwarded to the CoA. The BU message, however, is vulnerable to different types of security attacks, such as the man-in-the-middle attack, the session hijacking attack, and the denial-of-service attack. The current security protocols in MIPv6 are not able to effectively protect the BU message against these attacks. The private-key-based BU (PKBU) protocol is proposed in this research to overcome the shortcomings of some existing MIPv6 protocols. PKBU incorporates a method to assert the address ownership of the MN, thus allowing the CN to validate that the MN is not a malicious node. The results obtained show that it addresses the security requirements while being able to check the address ownership of the MN. PKBU also incorporates a method to verify the reachability of the MN.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.177-184
• /
• 2006

A handover is a technology that enables data transmission and receipt seamlessly while a mobile station moves from the current base station to another base station. The handover is basically classified into two types; a horizontal handover which changes a radio link only without changing a network link, and a vertical handover which changes both in heterogeneous networks. In this paper, we propose a vertical handover protocol in a dual base station which supports both of W-CDMA and WiBro networks based on SDR (Software Defined Radio), verify the rightness using a state transition diagram and a Petri-net, and evaluate the performance of the proposed protocol using NS-2 simulator.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.6
• /
• pp.614-620
• /
• 2006

Today the automobile has been changed from a mechanical system to an electronic control system fly the development of the electronic technology. In the automobile body, most of these electronic control devices are networked and managed fully by the CAN protocol. But, when a network system is overloaded, unexpected transmission delay for relative low priority objects occurs due to the static priority definition of the CAN protocol. To resolve this problem, this paper proposes a dynamic precedence queue mechanism that creates a queue for the low priority object and its relevant objects to be transmitted, which becomes urgent in an overloaded network system to keep the maximum allowable time delay. For the generated queue, the highest priority is assigned to transmit the queued objects within the shortest time. The mechanism is implemented in the logical link layer of CAN, which does not require any modification of the old CAN hardware. Effectiveness of the proposed mechanism is verified by the real experiments with an automobile network system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.515-517
• /
• 2003

In this paper we examine the effects of the required portions of guard timing spaces in a MAC frame of ETSI BRAN HIPERLAN/2 system such as inter-mobile guard timing space in UL(Up Link) duration, inter-RCH(Random CHannel) guard timing space, sector switch guard timing space. In particular, we calculate the number of OFDM(Orthogonal Frequency Division Multiplexing) symbols required for these guard timing spaces in a MAC frame. We them evaluate the throughput of HIPERLAN/2 system as we vary parameter such as the guard time values defined in [2], the number of DLCCs(Data Link Control Connections), and the number of RCHs. Finally we show by numerical results that the portions for the 새심 summation of required guard timing spaces in a MAC frame are not negligible, and that they should be properly considered when trying to evaluate the performance of MAC protocol of HIPERLAN/2 system and also when determining the number of RCHs as well as the number of DLCCs in UL PDU trains at an AP/CC(Access Point/Central Controller).

• Journal of Communications and Networks
• /
• v.4 no.4
• /
• pp.266-281
• /
• 2002

The General Packet Radio Service (GPRS) is being deployed by GSM network operators world-wide, and promises to provide users with “always-on” data access at bandwidths comparable to that of conventional fixed-wire telephone modems. However, many users have found the reality to be rather different, experiencing very disappointing performance when, for example, browsing the web over GPRS. In this paper, we examine the causes, and show how unfortunate interactions between the GPRS link characteristics and TCP/IP protocols lead to poor performance. A performance characterization of the GPRS link-layer is presented, determined through extensive measurements taken over production networks. We present measurements of packet loss rates, bandwidth availability, link stability, and round-trip time. The effect these characteristics have on TCP behavior are examined, demonstrating how they can result in poor link utilization, excessive packet queueing, and slow recovery from packet losses. Further, we show that the HTTP protocol can compound these issues, leading to dire WWW performance. We go on to show how the use of a transparent proxy interposed near the wired-wireless border can be used to alleviate many of these performance issues without requiring changes to either client or server end systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.694-702
• /
• 2009

Geographical routing protocol, where nodes only need local information exchange to make routing decisions, is a very efficient routing scheme for wireless sensor networks in scalability. However, pure geographical routing does not take account of wireless link condition. If wireless link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose geographical routing scheme considering wireless link condition, where reliable data transmission is made and the consumed energy is minimized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.3
• /
• pp.247-254
• /
• 2014

For wireless multimedia sensor network (WMSN), it is crucial to select appropriate channels to deliver multimedia data stream generated by image and voice sensors periodically or continuously. Although most of previous researches assume that fixed channels are used for wireless sensor networks, they causes limit to support various application areas. In this paper, we apply link-setup algorithms developed for wireless cognitive radio networks for searching common channels between two nodes without common control channels. We also show the algorithm causes serious performance degradation as the total number of used channels increases, and then propose a new link-setup algorithm to resolve the problem. Therefore, the proposed algorithm shows 30 % higher performance compared to existing algorithms.