• The KIPS Transactions:PartC
• /
• v.19C no.3
• /
• pp.191-208
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) is designed to provide network-based mobility management support to an MN without any involvement of the MN in the mobility related signalling, hence, the proxy mobility entity performs all related signalling on behalf of the MN. The new principal functional entities of PMIPv6 are the local mobility anchor (LMA) and the mobile access gateway (MAG). In PMIPv6, all the data traffic sent from the MN gets routed to the LMA through a tunnel between the LMA and the MAG, but it still has the single point of failure (SPOF) and bottleneck state of traffic. To solve these problems, various approaches directed towards PMIPv6 performance improvements such as route optimization proposed. But these approaches add additional signalling to support MN's mobility, which incurs extra network overhead and still has difficult to apply to multiple-LMA networks. In this paper, we propose a improved route optimization in PMIPv6-based multiple-LMA networks. All LMA connected to the proxy internetworking gateway (PIG), which performs inter-domain distributed mobility control. And, each MAG keeps the information of all LMA in PMIPv6 domain, so it is possible to perform fast route optimization. Therefore, it supports route optimization without any additional signalling because the LMA receives the state information of route optimization from PIG.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.118-127
• /
• 2006

The wireless transmission medium inherently broadcasts a signal to all neighbor nodes in the transmission range. Existing asynchronous MAC protocols do not provide a concrete solution for reliable broadcast in link layer. This mainly comes from that an omnidirectional broadcasting causes to reduce the network performance due to the explosive collisions and contentions. This paper proposes a directional broadcast protocol by using neighborhood information in the link layer based o,1 directional antennas, named MNDB (MAC protocol with Neighborhood for reliable Directional Broadcast). This protocol makes use of neighborhood information and DMACA (Directional Multiple Access and Collision Avoidance) scheme through 4-way handshake to support a reliable directional broadcast. To analyze its performance, MNDB protocol si compared with $RMDB^{[1]}$, the protocol 2 of reference [3], and IEEE 802.11 $protocol^{[9]}$, in terms of the number of collisions, the number of dropped packets, the number of redundant packets, and broadcast delay.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.54-67
• /
• 2000

It is known that the performance of a DS-CDMA system mainly depends on Multiple Access Interference(MAI). The effect of MAI in a reverse link is larger than that of a forward link because of the absence of orthogonality among mobile stations. In this paper we investigate the effect of synchronous transmission in the reverse link, which is compared to the performance of asynchronous transmission in the reverse link. In addition, we consider the effect of interference from Mobile Stations(MSs) in a hand-over region. That is, if we assume that a MS is moving from a serving base station(sowing BS) to a target base station(target BS), the signal of the MS is not orthogonal with the signals of all other MSs within the target BS because the MS is only synchronized with the serving BS. Finally we suggest an interference cancellation scheme to reduce the interference from MSs in the region of hand-over, which can be one of solutions for the capacity degradation due to interference from the MSs in the hand-over region in reverse link synchronous transmission.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.59-65
• /
• 2008

In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.16-27
• /
• 2006

The wireless transmission medium inherently broadcasts a signal to all neighbor nodes in the transmission range. Existing asynchronous MAC protocols do not provide a concrete solution for reliable broadcast in link layer. This mainly comes from that an omni-directional broadcasting causes to reduce the network performance due to the explosive collisions and contentions. This paper proposes a reliable broadcast protocol in link taller based on directional antennas, named MDB(MAC protocol for Directional Broadcasting). This protocol makes use of DAST(Directional Antennas Statement Table) information and D-MACA(Directional Multiple Access and Collision Avoidance) scheme through 4-way handshake to resolve the many collision problem wit]1 omni-directional antenna. To analyze its performance, MDB protocol is compared with IEEE 802.11 DCF protocol [9] and the protocol 2 of reference [3], in terms of the success rate of broadcast and the collision rate. As a result of performance analysis through simulation, it was confirmed that the collision rate of the MDB protocol is lower than those of IEEE 802.11 and the protocol 2 of reference [3], and that the completion rate of broadcast of MDB protocol is higher than those of IEEE 802.11 and the protocol 2 of reference [3].

• The Journal of Society for e-Business Studies
• /
• v.13 no.1
• /
• pp.21-32
• /
• 2008

RFID systems provide technologies of automatic object identification through wireless communications in invisible ranges and adaptability against various circumstances. These advantages make RFID systems to be applied in various fields of industries and individual life. However, it is difficult to use tags with distinction as tags are increasingly used in life because a tag usually stores only one object identifier in common RFID applications. In addition, RFID systems often make serious violation of privacy caused by various attacks because of their weakness of radio frequency communication. Therefore, information sharing methods among applications are necessary for expansive development of RFID systems. In this paper, we propose efficient RFID scheme. At first, we design a new RFID tag structure which supports many object identifiers of different applications in a tag and allows those applications to access them simultaneously. Secondly, we propose an authentication protocol to support the proposed tag structure. The proposed protocol is designed by considering of robustness against various attacks in low cost RFID systems. Especially, the proposed protocol is focused on efficiency of authentication procedure by considering security levels of applications. In the proposed protocol, each application goes through one of different authentication procedures according to their security levels. Finally, we prove efficiency of th proposed scheme compared with the other schemes through experiments and evaluation.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.68-77
• /
• 2006

In accommodating the asymmetric traffic for future wireless multimedia services, the dynamic time division duplexing (D-TDD) scheme is considered as one of the key solutions. With the D-TDD mode, however, the inter-BS and inter-MS interference is inevitable during the cross time slot (CTS) period, and this interference seriously degrades the system performance. To mitigate such interference, we propose a region and time partitioning D-TDD architecture for OFDM systems. Each time slot in the CTS period is split into several minislots, and then each cell is divided into as many regions as the number of minislots per time slot. We then assign the minislots only to the users in its predefined corresponding region. On top of such architecture which inherently separates the interfering entities farther from each other, we design a robust time slot allocation scheme so that the inter-cell interference can be minimized. By the computer simulation, it has been verified that the proposed scheme outperforms the conventional time slot allocation methods in both the outage probability and the bandwidth efficiency.

• Journal of Advanced Navigation Technology
• /
• v.6 no.1
• /
• pp.17-26
• /
• 2002

In this paper, we have analyzed the BER (Bit Error Rate) performance of multi-user detectors employing SIC(Successive Interference Cancellation) and PIC (Parallel Interference Cancellation) which are the representative schemes in the subtractive interference cancellation. We have considered the MUD structure employing HIC (Hybrid Interference Cancellation) which combines SIC with PIC scheme, and then analyzed the BER performance. We have evaluated the BER performance of SIC and HIC schemes which execute the soft decision to generate the tentative data bit for the purpose of the interference cancellation in MAI and noise environments. Through the numerical analysis and computer simulation, it is shown that HIC can remove the effect of MAI more efficiently than the others, that improve the BER performance and increase the capacity of DS-CDMA systems regardless of the power control conditions. The reason is that the SIC scheme in front of HIC can solve the near-far problem caused by the imperfect power control and PIC scheme in the rear of it can improve the performance much more.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.