• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.451-458
• /
• 2010

To detect and recover packet losses over wireless links is very important in terms of reliability in packet transmission. Most wireless communication systems adopt an automatic repeat request (ARQ) protocol operating at link layer. However, it has been constantly addressed that the interaction not harmonized sufficiently between ARQ and TCP rather degrades TCP performance. In this paper, therefore, we propose an improved scheme from the aspect of the interaction with TCP loss recovery mechanism that can be applied to selective repeat ARQ (SR-ARQ) protocol and prove that the proposed scheme improves TCP performance significantly by OPNET simulations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.347-353
• /
• 2005

WiBro (Wireless Broadband Internet) system is going to be commercialized before long. The high portable internet system is abie to be connected to the high-speed internet using 2.3 CHz frequency bandwidth, anytime and anywhere. An effective scheduling for UCS, rtPS. nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that arc the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities With each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.469-474
• /
• 2006

In this paper, we develop a method that derive the average sector throughput of HSDPA system. This proposed method reflects the effects of AMC, scheduling and multi-code transmission, and is performed by simple calculation procedures such as link budget analysis. Link budget table is used to estimate a cell coverage in general. We modify the link budget table in order to calculate C/I of the user according to the location of the user in CDMA packet system employing AMC. Furthermore, we utilize the proposed method to analyze the effects of scheduling and multi-code transmission.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.221-231
• /
• 2011

A joint multipath routing algorithm and channel allocation and scheduling for wireless multihop and multichannel systems is discussed. In packet transmission, distribution of packets to multiroutes makes it possible to reduce the transmission cost of the channels. Cross-layer cooperation of routing, channel allocation, and scheduling is an effective method of packet distribution. As a framework for the cooperation, we propose a multiroute distance vector routing (MDVR) scheme. In the MDVR scheme, the routing table is logically placed in between the routing and link layers, and the table plays the role of a service access point between these two layers. To evaluate the performance of MDVR, simulation is performed in a multichannel, multihop environment. The simulation results show that the MDVR framework can be efficiently implemented in the form of a distributed routing algorithm. It is also shown that in MDVR, the system-wise channel efficiency is almost 25% higher than that in a conventional single-route routing approach.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.25-33
• /
• 2008

In this paper we propose uplink packet transmission scheme based on Synchronized RA. The scheme can afford to support diverse QoS required from diverse multimeda traffics. In order to minimze the collision probability occurred in contention based channel access, we assign a reservation access channel additionally to the traffic channels. Access probability function for controlling collisions occurred in the reservation access channel is applied. Through assigning different access probability to each traffic user with respect to priority issued by his required QoS, the proposed scheme guarantees minimum throughput required by higher priority users in the whole range of system load.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.6
• /
• pp.1064-1070
• /
• 2010

Korea Department of Defense has been developing Link-K, Korean Joint Tactical Datalink, to support their independent joint operations and trying to enlarge the scope of Link-K tactical message delivery to nodes in IP based tactical networks for sharing situation awareness more broadly. A Link-K tactical message size is too small to fit into an IP packet, inefficiently wasting most of the IP packet space of the low bandwidth IP-based tactical networks. This paper proposes a new Link-K tactical message aggregation and delivery method when tactical messages need to be sent to some nodes located at IP-based tactical networks. With numerical analysis and OPNET simulation studies, we prove the effectiveness and efficiency of the proposed method.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.121-129
• /
• 2012

In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.1
• /
• pp.42-49
• /
• 2009

Most Vehicular Ad hoc Network (VANET) applications rely heavily on broadcast transmission of traffic related information to all reachable nodes within a certain geographical area. Among various broadcast approaches, flooding is the first broadcasting technique. Each node rebroadcasts the received message exactly once, which results in broadcast storm problems. Some mechanisms have been proposed to improve flooding in Mobile Ad hoc Networks (MANET), but they are not effective for VANET and only a few studies have addressed this issue. We propose two distance-based and timer-based broadcast suppression techniques: 15P(15percent) and slotted 15P. In the first (distance based) scheme, node's transmission range is divided into three ranges (80%,15%and5%). Only nodes within 15% range will rebroadcast received packet. Specific packet retransmission range (15%) is introduced to reduce the number of messages reforwarding nodes that will mitigate the broadcaststorm. In the second (timer-based) scheme, waiting time allocation for nodes within 15% range isused to significantly reduce the broadcaststorm. The proposed schemes are distributed and reliedon GPS information and do not requireany other prior knowledge about network topology. To analyze the performance of proposed schemes, statistics such as link load and the number of retransmitted nodes are presented. Our simulation results show that the proposed schemes can significantly reduce link load at high node densities up to 90 percent compared to a simple broadcast flooding technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1106-1114
• /
• 2003

Several analytic models describe transmission control protocol (TCP) performance such as steady-state throughput as an averaged ratio of number of transmissions to latency. For more detailed analysis of TCP latency, the latency during packet losses are recovered should be considered. In this paper, we derive the expected duration of loss recovery latency considering the number of packet losses recovered by retransmissions. Based on the numerical results verified by simulations, TCP using selective acknowledgement (SACK) option is more effective than TCP NewReno from the aspect of loss recovery latency.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.