• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.477-488
• /
• 2013

Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2473-2475
• /
• 1998

In this paper, we implemented RS232C serial communication by the 2 wires(Data,GND), and multiple access, by the applying Collision Sensing Multiple Access(CSMA) Protocol. Multiple access is implemented by assigning a unique ID to each controller. The multiple access control operation starts by sending a command packet from a host to another host and the command packet is composed of ID bytes of source and target host computer, data bytes and the check sum, byte. In host computer, after sending command packet, the collision from loop back data. If collision is detected, it means a command packet was collided with another command packet for another host. The packet communication of the controller enables the multiple acces of the controller through the common serial data link. The application of this serial communication through CSMA protocol and the usage of two wires, have an effect on saving the wires and convenient of layout work.

• Journal of Navigation and Port Research
• /
• v.27 no.3
• /
• pp.283-288
• /
• 2003

Recently, the growth of applications and services over high-speed Internet increases, ATM networks as wide area back-bone has been a major solution. As the conventional TCP/IP suite is still the standard protocol used to support upper application on current. Internet, the issues regarding whether TCP/IP will operate efficiently on top of an ATM infrastructure and how to control its QoS still remain for studies. TCP uses a window-based protocol for flow control in the transport layer. When TCP uses the UBR service in ATM layer, the control method is only buffer management. If a cell is discarded in ATM layer, one whole packet of TCP will be lost; this fact occur the most TCP performance degradation. Several dropping strategies, such as Tail Drop, EPD, PPD, SPD, FBA, have been proposed to improve the TCP performance over ATM. In this paper, to improve the TCP performance, we propose a packet dropping scheme that is based on comparison with EPD, SPD and FBA. Our proposed scheme is applied to schemes discussed in the previous technology. Our proposed scheme does not need to know each connection's mean packet size. When the buffer exceeds the given threshold, it is based on comparison between the number of dropped packet and the approved packet. Our results are reported and discussed for comparing these discarding schemes under similar conditions. Although the number of virtual channel (VC) is increased, the simulation results showed that the proposed scheme can allocate more fairly each VC than other scheme.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.595-603
• /
• 2003

To provide mobile nodes with continuous communication services, it is important to reduce the packet losses during handoffs. The handoffs of mobile nodes cause packet losses and decrease of TCP throughput on account of a variety of factors. One of those is the congestion in the new cell. Due to the congestion, not only the node moving into the cell but also the already existing nodes that were successfully communicating in the cell suffer the performance degradation. In this paper we propose a new handoff mechanism called‘packet freeze control’, which avoids the congestion caused by handoffs by regulating the influx of traffic burst into the new cell. Packet freeze control is applicable to a wireless network domain in which FAs(Foreign Agents) are connected hierarchically and constitute a logical tree. It gradually increases the number of packets transferred to the new cell by buffering packets in the FAs on the packet delivery path over the wireless network domain. The simulation results show that the proposed mechanism not only reduces the packet losses but also enhances the TCP throughput of other mobile nodes in the cell.

• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.682-692
• /
• 2018

In this paper, we propose an ARQ packet error control scheme using multiple threads in delivering massive capacity of multimedia based on MMT(MPEG Media Transport) protocol. On the sending side, each frame that constitutes an image is packetized into MMT packets based on MMT protocol. The header of the packet stores the sequence number of the frames contained in the packet and the time of presentation information. The payload of the packet stores the direct information that comprises the frame. The generated MMT packet is transmitted to the IP network. The receiving side checks if any error has occurred in the received packet. For any identified error, it controls the error through ARQ error control scheme and reconfigure the frame according to the information stored in the header of the received packet. At this point, a multi-threading based transport design is constructed so that each thread takes over a single frame, which increases the transmission efficiency of massive capacity multimedia. The efficiency of the multi-threading transport method is verified by solving the problems that might arise when using a single-thread approach if packets with errors are retransmitted.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.43-51
• /
• 1983

A small-scale packet switching system is designed in compliance with the CCITT Recommen-dation X.25 Each switching node is controlled by a single microcomputer for all functions including terminal access control, packet-level control and link control. Basic protocol functions are successfdly implemented for the three basic hierarchical Igvels, and their results are discussed in detail.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.32-43
• /
• 2000

In this paper, we investigate the existing medium access control (MAC) protocols to integrate the voice and data services in packet-based CDMA networks and furthermore, propose a new approach to circumvent the operational limits inherent in them. We propose the $P^2R$-CDMA (Prioritized Packet Reservation Code Division Multiple Access) protocol for the uplink in the synchronous multi-code CDMA system, which employs the centralized frame-based slot reservation along with the dynamic slot assignment in the base station using the QoS-oriented dynamic priority of individual terminal. The simulation results show that, as compared with the existing scheme based on the adaptive permission probability control (APC), the proposed approach can significantly improve the system capacity while guaranteeing the real-time requirement of voice service.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.2
• /
• pp.121-127
• /
• 2007

Frequent occurrences of a fire cause tremendous loss of human lives and their property. Recently, in order to cope with such catastrophic accidents, researches on fire-fighting robots are carried out in developed countries. Under the dangerous situations, it is sometimes impossible for fire-fighting men to access the firing place because of explosive materials, smoke, high temperature and so on. In such an environment, fire-fighting robots can be useful to extinguish the fire. It is usually very dangerous place where fire-fighting robots operate. Hence, these robots should be controlled by remote users who are for away from the firing place exploiting remote communication systems. This paper considers the communication systems between fire-fighting robots and remote users. The communication systems consist of two parts; digital packet communication systems and analog image communication systems. Digital packet communication systems transfer data packets in order to control fire-fighting robots and to check the state of the fire-fighting robots. Remote users watch the video around the fire-fighting robots by exploiting the analog image communication systems. In the future, the more prosperous the commercial communication network systems will be, the more evolved the communication systems for fire-fighting robots are.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.108-117
• /
• 2002

TCP, which was developed on the basis of wired links, supposes that packet losses are caused by network congestion. In a wireless network, however, packet losses due to data corruption occur frequently. Since TCP does not distinguish loss types, it applies its congestion control mechanism to non-congestion losses as well as congestion losses. As a result, the throughput of TCP is degraded. To solve this problem of TCP over wireless links, previous researches, such as split-connection and end-to-end schemes, tried to distinguish the loss types and applied the congestion control to only congestion losses; yet they do nothing for non-congestion losses. We propose a novel transport protocol for wireless networks. The protocol called VS-TCP (Variable Segment size Transmission Control Protocol) has a reaction mechanism for a non-congestion loss. VS-TCP varies a segment size according to a non-congestion loss rate, and therefore enhances the performance. If packet losses due to data corruption occur frequently, VS-TCP decreases a segment size in order to reduce both the retransmission overhead and packet corruption probability. If packets are rarely lost, it increases the size so as to lower the header overhead. Via simulations, we compared VS-TCP and other schemes. Our results show that the segment-size variation mechanism of VS-TCP achieves a substantial performance enhancement.