• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.63-65
• /
• 2006

As OFDM-based systems exhibits robustness over wireless channel, it is possible to consider them the next generation of the wireless communications including the mobile communications. However, there is a critical point that OFDM-based systems can receive the distorted signal due to the frequency-offset. Therefore, it is necessary to accurately estimate the frequency-offset for OFDM-based systems to be adopted as the next wireless communication systems. In this paper, the efficient frequency-offset estimation scheme based on MUSIC is presented in 802,1la WLAN systems. As shown in the simulation result, this scheme can improve and optimize the estimation performance.

• 한국산업정보학회논문지
• /
• 제14권4호
• /
• pp.8-15
• /
• 2009

초고속 접속을 위한 차세대 광대역 무선 이동 통신 기술의 하나로서, 중계기를 활용한 다중 입출력 기술이 유력하게 연구되고 있다. 본 논문에서는 채널 선택적 중계기 기반의 다중 입출력 전송 시스템을 제안한다. 중계기와 단말기 사이의 채널 상태에 따라 선택적으로 부채널을 사용함으로써 수신 성능을 크게 향상시킬 수 있다. 실험 결과를 통해, 제안된 중계기 기반 시스템의 성능이 기존의 시스템 성능보다 우수한 특성을 나타냄을 확인하였다.

• Journal of Communications and Networks
• /
• 제11권4호
• /
• pp.337-349
• /
• 2009

In this paper, we introduce a novel mobility model for mobile sinks in which the sinks move towards randomly distributed destinations, where each destination is associated with a mission. The novel mobility model is termed the random mobility with destinations. There have been many studies on mobile sinks; however, they merely support two extreme cases of sink mobility. The first case features the most common and general mobility, with the sinks moving randomly, unpredictably, and inartificially. The other case takes into account mobility only along predefined or determined paths such that the sinks can gather data from sensor nodes with minimum overhead. Unfortunately, these studies for the common mobility and predefined path mobility might not suit for supporting the random mobility with destinations. In order to support random mobility with destination, we propose a new protocol, in which the source nodes send their data to the next movement path of a mobile sink. To implement the proposed protocol, we first present a mechanism for predicting the next movement path of a mobile sink based on its previous movement path. With the information about predicted movement path included in a query packet, we further present a mechanism that source nodes send energy-efficiently their data along the next movement path before arriving of the mobile sink. Last, we present mechanisms for compensating the difference between the predicted movement path and the real movement path and for relaying the delayed data after arriving of the mobile sink on the next movement path, respectively. Simulation results show that the proposed protocol achieves better performance than the existing protocols.

• 산업공학
• /
• 제17권spc호
• /
• pp.111-121
• /
• 2004

In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

• 한국통신학회논문지
• /
• 제29권3B호
• /
• pp.349-359
• /
• 2004

그 동안 Mobile-IP환경에서 멀티캐스팅을 지원하기 위한 많은 프로토콜들이 제시되었으나, 기존의 프로토콜들은 비최적 경로로의 데이터 전송, 호스트의 이동 시 데이터의 손실 문제로 인해 멀티캐스트 데이터 전송에 신뢰성이 떨어지는 문제점을 가지고 있다. 따라서 본 논문에서는 기존 방법의 문제점들을 고찰해 보고, Mobile IP 네트워크에서 이러한 문제점들을 보완하는 신뢰성 있고 효율적인 새로운 멀티캐스트 라우팅 프로토콜을 제안한다. 제안하는 프로토콜은 호스트의 이동 및 여러 요인으로 발생하는 데이터 손실 문제를 이전 에이전트를 이용한 다양한 방법을 통해 보상받게 되므로 신뢰성 있는 데이터 전송을 할 수 있게 한다. 또한 멀티캐스트 그룹의 환경변화에 따라 본 논문에서 제안된 조건에 부합하는 경우 멀티캐스트 트리에 바로 연결시키는 기능을 수행하여 전송 경로를 최적에 가깝게 설정함으로써 좀더 효율적인 멀티캐스트 서비스가 가능하도록 한다. 이러한 점들은 다양한 환경에서의 시뮬레이션 결과를 통해 확인한 수 있다.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.45-53
• /
• 2013

Multi-hop cellular networks (MCNs), which reduce the transmit power, mitigate the inter-cell interference, and improve the system performance, have been widely studied nowadays. The relay selection scheme is a key technique that achieves these advantages, and inappropriate relay selection causes frequent relay switchings, which deteriorates the overall performance. In this study, we analyze the conditions for relay switching in MCNs and obtain the expressions for the relay switching rate and relay activation time. Two mobile-based relay selection schemes are proposed on the basis of this analysis. These schemes select the relay node with the longest relay activation time and minimal relay switching rate through mobility prediction of the mobile node requiring relay and available relay nodes. We compare the system performances via simulation and analyze the impact of various parameters on the system performance. The results show that the two proposed schemes can obtain a lower relay switching rate and longer relay activation time when there is no reduction in the system throughput as compared with the existing schemes.

• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

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

The increasing demand from passengers in vehicles to improve safety, traffic efficiency, and comfort has lead to the growing interest of Wi-Fi based vehicle-to-infrastructure (V2I) communications. Although the V2I system provides fast and cost-effective Internet connectivity to vehicles via roadside Wi-Fi access points (APs), it suffers from frequent handoffs due to the high mobility of vehicles and the limited coverage of Wi-Fi APs. Recently, the Mobile AP (MAP) platform has emerged as a promising solution that overcomes the problem in the V2I systems. The main advantage is that MAPs may yield longer service duration to the nearby vehicles that have similar mobility patterns, yet they provide smaller link capacities than the roadside APs. In this paper, we present a new association control technique that harnesses available connection duration as well as achievable link bandwidth in high-speed vehicular network environments. We also analyze the tradeoff between two association metrics, namely, available connection duration and achievable link bandwidth. Extensive simulation studies based on real traces demonstrate that our scheme significantly outperforms the previous methods.

• Journal of Communications and Networks
• /
• 제13권2호
• /
• pp.102-112
• /
• 2011

In this paper, we propose a privacy-preserving emergency call scheme, called PEC, enabling patients in life-threatening emergencies to fast and accurately transmit emergency data to the nearby helpers via mobile healthcare social networks (MHSNs). Once an emergency happens, the personal digital assistant (PDA) of the patient runs the PEC to collect the emergency data including emergency location, patient health record, as well as patient physiological condition. The PEC then generates an emergency call with the emergency data inside and epidemically disseminates it to every user in the patient's neighborhood. If a physician happens to be nearby, the PEC ensures the time used to notify the physician of the emergency is the shortest. We show via theoretical analysis that the PEC is able to provide fine-grained access control on the emergency data, where the access policy is set by patients themselves. Moreover, the PEC can withstandmultiple types of attacks, such as identity theft attack, forgery attack, and collusion attack. We also devise an effective revocation mechanism to make the revocable PEC (rPEC) resistant to inside attacks. In addition, we demonstrate via simulation that the PEC can significantly reduce the response time of emergency care in MHSNs.

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.341-349
• /
• 2021

Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.