• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.205-214
• /
• 2008

To transfer large amount of packets fast in sensor network, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. If interval is too long, delay also becomes too long but if interval is too short, the fail of transfer request would increase. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next Packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.235-243
• /
• 2007

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. The longer the interval, the higher the delay and the shorter the delay, the larger the fail of transfer request. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed.In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission timee. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1311-1321
• /
• 2010

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In this paper, we propose SET(SendDoneEventbasedTransmission Technique)which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In SET, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore SET could provide high packet transmission rate given large amount of packets.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.181-184
• /
• 2007

In this paper, a CSSMA/AI MAC protocol in packet CDMA network is presented. The main features of this protocol are the code status sensing and reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.235-244
• /
• 2004

There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.4
• /
• pp.349-360
• /
• 2002

In ITU H.323 teleconference system, the RTP/RTCP protocol is offered to transfer real-time multimedia stream. Both sender and receiver hate experience in packet loss and jitter which result from network congestion over Internet. Audio quality over Internet depends on the number of lost packets and on jitter between successive packets. The goal of our study is to improve the speech quality over Internet by checking the packet loss characteristics of the network and adopting the but for control management mechanism at the receiver. We suggest a dynamic redundant audio transmission mechanism which examines the packet loss rate and uses the feedback information through RTCP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.475-478
• /
• 2004

In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The proposed protocol is based on the code status sensing and reservation scheme. In the proposed protocol, the base station broadcast the rode status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected rode and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission lot the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet through the reserved code for the successive frames.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1115-1120
• /
• 2004

In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The main features of this protocol are the code status sensing and code reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.9-12
• /
• 2000

A forward error correction (FEC) is usually used to correct the errors of the real-time data occurred at the reciever side which require a real-time transmission. The data transmission is peformed after being encapsulating by RTP and UDP. In the ITU-T study group 16, four FEC schemes using the XORing are presented. In the paper, a new supplementary scheme is proposed. In the delay problem the new scheme performs better than the scheme 3 but in the recovery ability for successive packet loss is worse than scheme 3. The proposed scheme which supplements the present schemes can be adapted easily to the current network environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1032-1035
• /
• 1996

While Ethernet and TCP/IP are the most widely used protocol, for Real-time system, it is not applicable because it doesn't guarantee the deterministic transmission time. Furthermore, the TCP acknowledgement scheme and sliding window algorithm enforce to collide packets. Although various Collision-Free CSMA protocol was presented, it is very difficult to implement in well known OS(UNIX, WilidowsNT) because we have to modify network kernel. This paper presents another transmission protocol based on modified UDP. The colliding probability can be minimized by avoiding successive packet transmission and decreasing competition duration. The proposed algorithm can be used for the soft real-time industrial automation network.