RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
          펼치기
        • 주제분류
        • 발행연도
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • SCIESCOPUS

        Adaptive Route Optimization in Hierarchical Mobile IPv6 Networks

        Sangheon Pack,Xuemin Shen,Mark, J.W. IEEE Computer Society 2007 IEEE TRANSACTIONS ON MOBILE COMPUTING Vol.6 No.8

        <P>By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIP6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. However, if a mobile node (MN)'s session activity is high and its mobility is relatively low, HMIPv6 may degrade end-to-end data throughput due to the additional packet tunneling at the MAP. In this paper, we propose an adaptive route optimization (ARO) scheme to improve the throughput performance in HMIPv6 networks. Depending on the measured session-to-mobility ratio (SMR), ARO chooses one of the two different route optimization algorithms adaptively. Specifically, an MN informs a correspondent node (CN) of its on-link care-of address (LCoA) if the CN's SMR is greater than a predefined threshold. If the SMR is equal to or lower than the threshold, the CN is informed with the MN's regional CoA (RCoA). We analyze the performance of ARO in terms of balancing the signaling overhead reduction and the data throughput improvement. We also derive the optimal SMR threshold explicitly to achieve such a balance. Analytical and simulation results demonstrate that ARO is a viable scheme for deployment in HMIPv6 networks.</P>

      • SCISCIESCOPUS

        Mobility Management in Mobile Hotspots with Heterogeneous Multihop Wireless Links

        Sangheon Pack,Xuemin Shen,Mark, J.W.,Jianping Pan Institute of Electrical and Electronics Engineers 2007 IEEE communications magazine Vol.45 No.9

        <P>In this article we study two representative mobility management schemes for mobile hotspots with heterogeneous multihop wireless links: the NEMO basic support protocol at the network layer and the SIP-based network mobility support protocol at the application layer. We evaluate their salient features and quantify their handoff latency. It is shown that the SIP-based network mobility support protocol can easily be deployed and reduce the tunneling overhead incurred in the NEMO basic support protocol. However, it increases handoff latency due to longer message length. We also discuss several open research issues for seamless mobility support in mobile hotspots.</P>

      • SCISCIESCOPUS

        Performance Analysis of Mobile Hotspots with Heterogeneous Wireless Links

        Sangheon Pack,Rutagemwa, H.,Xuemin Shen,Mark, J.W.,Lin Cai IEEE 2007 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.6 No.10

        <P>Mobile hotspot enabling Internet access services in moving vehicles is an important service for ubiquitous computing. In this paper, we propose an analytical framework for studying the packet loss behavior and throughput in a mobile hotspot with heterogeneous wireless links. We first develop a two-state Markov model for the integrated wireless wide area network (WWAN) and wireless local area network (WLAN). We then derive the expressions that describe the experienced packet loss probability, packet loss burst length, and throughput. Finally, we present simulation results to verify the accuracy of our analysis. It is concluded that adaptive and cross-layer approaches should be deployed to improve the performance of mobile hotspots.</P>

      • SCISCIESCOPUS

        FW-DAS: Fast Wireless Data Access Scheme in Mobile Networks

        Giwon Lee,Insun Jang,Sangheon Pack,Xuemin Shen IEEE 2014 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.13 No.8

        <P>In wireless data access applications, reduction of both the access latency and the wireless traffic volume is essential. In this paper, we propose a fast wireless data access scheme (FW-DAS) for wireless data access applications in which data objects are frequently updated and fast access to data objects is indispensable. In FW-DAS, different operation modes are defined depending on the data object popularity, and only popular data objects are proactively pushed to the access point/base station to minimize the access latency while mitigating the traffic load over the wireless link. An analytical model for the access latency is developed and an operation mode selection algorithm is introduced to reduce the access latency. Extensive simulation results show the effects of access-to-update ratio, data popularity, cache size, data object size, and wireless bandwidth. Analytical and simulation results demonstrate that FW-DAS can reduce the access latency with reasonable traffic load compared with poll-each-read (PER)/callback (CB) and their combinations.</P>

      • SCIESCOPUSKCI등재

        Capacity Analysis of UWB Networks in Three-Dimensional Space

        Cai, Lin X.,Cai, Lin,Shen, Xuemin,Mark, Jon W. The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.3

        Although asymptotic bounds of wireless network capacity have been heavily pursued, the answers to the following questions are still critical for network planning, protocol and architecture design: Given a three-dimensional (3D) network space with the number of active users randomly located in the space and using the wireless communication technology, what are the expected per-flow throughput, network capacity, and network transport capacity? In addition, how can the protocol parameters be tuned to enhance network performance? In this paper, we focus on the ultra wideband (UWB) based wireless personal area networks (WPANs) and provide answers to these questions, considering the salient features of UWB communications, i.e., low transmission/interference power level, accurate ranging capability, etc. Specifically, we demonstrate how to explore the spatial multiplexing gain of UWB networks by allowing appropriate concurrent transmissions. Given 3D space and the number of active users, we derive the expected number of concurrent transmissions, network capacity and transport capacity of the UWB network. The results reveal the main factors affecting network (transport) capacity, and how to determine the best protocol parameters, e.g., exclusive region size, in order to maximize the capacity. Extensive simulation results are given to validate the analytical results.

      • SCISCIESCOPUS

        Vehicular Passenger Mobility-Aware Bandwidth Allocation in Mobile Hotspots

        Younghyun Kim,Haneul Ko,Sangheon Pack,Shen, Xuemin Sherman IEEE 2014 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.13 No.6

        <P>In this paper, we propose a vehicular passenger mobility-aware bandwidth allocation (V-MBA) scheme in mobile hotspots. The V-MBA scheme consists of both call admission control and bandwidth adjustment functions to lower handoff vehicle service dropping probability and efficiently utilize resource of base station. Specifically, a handoff priority scheme with guard bandwidth is employed to protect handoff vehicle service. Also, bandwidth is dynamically assigned to each vehicle by exploiting vehicular passenger movement pattern that includes getting on and off events at a station. We evaluate the V-MBA scheme by developing a continuous-time Markov chain model. Simulation results demonstrate that the V-MBA scheme can guarantee low new vehicle service blocking probability and handoff vehicle service dropping probability through flexible bandwidth allocation.</P>

      • Flexible Proportional-Rate Scheduling for OFDMA System

        Leith, A.,Alouini, M-S,Dong In Kim,Xuemin Shen,Zhiqiang Wu IEEE 2013 IEEE transactions on mobile computing Vol.12 No.10

        <P>In this paper, we study the sum-rate maximization algorithms for downlink and uplink orthogonal frequency division multiple access (OFDMA) systems under proportional-rate constraint (PRC) and minimum-rate constraint. We develop a low-complexity weighted channel signal-to-noise ratio (w-SNR)-based ranking scheme for user selection on each subchannel in OFDMA combined with waterfilling (WF) power allocation. Both offline and online optimization algorithms are developed to optimize the SNR weight vector to maximize the sum rate while satisfying several constraints, such as PRC. The offline weight optimization technique relies on the analytical throughput results developed in this paper, and the online weight adaptation method tracks the user rates and meets the PRC using a subgradient search. Furthermore, we introduce a novel SNR operating region test to enhance the multiuser diversity gain and the sum rate. The proposed schemes have a low complexity, which is linear to the numbers of users and subchannels. Simulation results verify the accuracy of the developed analytical rates and fairness formulas, and show that the proposed w-SNR schemes can achieve higher sum rates than several benchmark schemes that provide the PRC with either short-term or long-term fairness.</P>

      • Mobility-Aware Call Admission Control Algorithm With Handoff Queue in Mobile Hotspots

        Younghyun Kim,Haneul Ko,Sangheon Pack,Wonjun Lee,Xuemin Shen IEEE 2013 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY Vol.62 No.8

        <P>In this paper, we propose a mobility-aware call admission control (MA-CAC) algorithm with a handoff queue (HQ) in mobile hotspots, where different admission control policies are employed, depending on the vehicle mobility. Specifically, when a vehicle is static, a handoff priority scheme with guard channels is studied to protect vehicular handoff users because handoff users may get on the vehicle. In addition, an HQ is examined during stopping to further accept handoff users. On the other hand, for a moving vehicle, no guard channels for handoff users are allocated to maximize channel utilization. By means of Markov chains, we evaluate MA-CAC with an HQ in terms of new-call blocking probability (NCBP), handoff-call dropping probability (HCDP), handoff-call waiting time in the HQ, and channel utilization. Analytical and simulation results demonstrate that MA-CAC with an HQ can lower both the HCDP and the NCBP while maintaining high channel utilization.</P>

      • KCI등재

        PEC: A Privacy-Preserving Emergency Call Scheme for Mobile Healthcare Social Networks

        Xiaohui Liang,Rongxing Lu,Le Chen,Xiaodong Lin,Xuemin (Sherman) Shen 한국통신학회 2011 Journal of communications and networks Vol.13 No.2

        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.

      • SCIESCOPUSKCI등재

        PEC: A Privacy-Preserving Emergency Call Scheme for Mobile Healthcare Social Networks

        Liang, Xiaohui,Lu, Rongxing,Chen, Le,Lin, Xiaodong,Shen, Xuemin (Sherman) The Korea Institute of Information and Commucation 2011 Journal of communications and networks Vol.13 No.2

        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.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼