• 대한임베디드공학회논문지
• /
• 제13권2호
• /
• pp.93-100
• /
• 2018

In this paper, we present a novel scheme of data transmission for logistics vehicles connected with 3G mobile communication networks. The proposed method enhances the efficiency of data transmission by varying the packet transmission period according to the vehicle speed and by reducing the amount of transmitted data using a reduced packet structure. The main contribution is to present the experimental verification in which the proposed method is applied to commercial logistics vehicles that operate with networked data transmission modules. Being compared with the existing method, the proposed scheme shows superior performance in terms of data reduction and transmission speed.

• 한국멀티미디어학회논문지
• /
• 제19권8호
• /
• pp.1460-1465
• /
• 2016

In this paper, we propose an energy efficient and multimedia traffic friendly MAC protocol (EEMF-MAC) that controls sender's wakeup period based on the data packet's transmission urgency and the receiver's wakeup periods based on the received data packet traffic loads. The protocol is useful for applications such as object tracking, real time data gathering, in which priority-based packet transmission is required. The basic idea of EEMF-MAC is that it uses the priority concept with transmission urgency of sender's data packet to reduce the transmission delay of the urgent data and it also uses duty cycling technique in order to achieve energy efficiency. EEMF-MAC showed a better performance in energy efficiency and packet transmission delay compared to existing protocols, RI-MAC and EE-RI-MAC.

• ETRI Journal
• /
• 제34권6호
• /
• pp.827-837
• /
• 2012

We propose a flow admission control (FAC) for setting up a wire-speed connection for new flows based on their negotiated bandwidth. It also terminates a flow that does not have a packet transmitted within a certain period determined by the users. The FAC can be used to provide a reliable transmission of user datagram and transmission control protocol applications. If the period of flows can be set to a short time period, we can monitor active flows that carry a packet over networks during the flow period. Such powerful flow management can also be applied to security systems to detect a denial-of-service attack. We implement a network processor called a flow management network processor (FMNP), which is the second generation of the device that supports FAC. It has forty reduced instruction set computer core processors optimized for packet processing. It is fabricated in 65-nm CMOS technology and has a 40-Gbps process performance. We prove that a flow router equipped with an FMNP is better than legacy systems in terms of throughput and packet loss.

• Journal of Communications and Networks
• /
• 제6권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.652-657
• /
• 2004

As the real-time multimedia applications through Internet increase, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example meeting this necessity. The TCP-friendly (TFRC) is an UDP-based protocol that controls the transmission rate based on the available round transmission time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used for the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• 한국통신학회논문지
• /
• 제27권7B호
• /
• pp.706-718
• /
• 2002

In bluetooth system, there are two kinds of interference. One is the frequency static interference, for example 802.11 direct sequence, the interferer uses fixed frequency band. Another is frequency dynamic interference, for example other piconets or 802.11 frequency hopping, the interferer uses dynamic frequency channel and cant be estimated. In this paper we introduce a novel solution of hybrid method of Listen-Before-Talk (LBT) and Adaptive Frequency Hopping (AFH) to address the coexistence of bluetooth and Direct Sequence of wireless local area network (WLAN). Before any bluetooth packet transmission, in the turn around time of the current slot, both the sender and receiver sense the channel whether there is any transmission going on or not. If the channel is busy, packet transmission is withdrawn until another chance. This is the LBT in Bluetooth. Because of asymmetry sense ability of WLAN and bluetooth, AFH is introduced to combat the left front-edge packet collisions. In monitor period of AFH, LBT is performed to label the channels with static interference. Then, all the labeled noisy channels are not used in the followed bluetooth frequency hopping. In this way, both the frequency dynamic and frequency static interference are effectively mitigated. We evaluate the solution through packet collision analysis and a detail realistic simulation with IP traffic. It turns out that the hybrid method can combat both the frequency dynamic and frequency static interference. The packet collision analysis shows it almost doubles the maximal system aggregate throughput. The realistic simulation shows it has the least packet loss.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.254-260
• /
• 2017

Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.274-277
• /
• 2008

Rekeying is the process of changing the encryption key of an ongoing communication. The main objective is to limit the amount of data encrypted with the same key. The IEEE 802.11 standard defines the Wired Equivalent Privacy, or WEP, encapsulation of 802.11 data frames. MAC at sender encrypts the payload (frame body and CRC) of each 802.11 frame before transmission using RC4 stream cipher. MAC at receiver decrypts and passes data to higher level protocol. WEP uses symmetric key stream cipher (RC4) where same key will be used for data encryption and decryption at the sender and the receiver. WEP is not promising with the advancement of the wireless technology existing today. We propose to use the existing information to define the security attributes. This will eliminate the steps that regenerated keys have to be sent to each other over certain period. The rekeying scheme is according to the number of bytes transmitted. Therefore, even the attacker has recorded the packets, it will be insufficient information and time for the attacker to launch the attacks as the key is not deterministic. We develop a packet simulation software for packet transmission and simulate our propose scheme. From the simulation, our propose scheme will overcome the weak WEP key attack and provide an alternative solution to wireless packet transmission. Besides that, our solution appears to be a software approach where only driver updates are needed for the wireless client and server.

• Journal of information and communication convergence engineering
• /
• 제3권2호
• /
• pp.90-92
• /
• 2005

As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network Structure (data generator, virtual server, Server 1, 2, 3), and finds out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume.