• Title/Summary/Keyword: rss

Search Result 409, Processing Time 0.026 seconds

Performance Analysis of Handover Trigger Based on Signal Strength Measurement (신호 강도 측정 기반 핸드오버 결정 방법의 성능 분석)

  • Park, Jae-Sung;Lim, Yu-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.603-610
    • /
    • 2007
  • Effective handover decision is important for providing seamless services to mobile users. In this paper, we propose an analysis framework to evaluate the performance of handover decision based on received signal strength (RSS) measurements in terms of the late notification and false alarm probability. In our framework, we consider mobility of a mobile user, signaling delays for exchanging messages related to handover protocols, cell sizes and RSS measurement interval to stabilize RSS reading due to random measurement errors. By quantitatively scrutinizing the impact of each parameter on the late notification and false alarms, we suggest the research directions for effective handover decision mechanism that may provide fast and reliable handover.

Analysis of Unobservable RSS Queueing Systems (관측불가능한 임의순서규칙 대기행렬시스템 분석)

  • Park, Jin-Soo;Kim, Yun-Bae
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • The times of service commencement and service completion had been used for inferring the queueing systems. However, the service commencement times are difficult to measure because of unobservable nature in queueing systems. In this paper, for inferring queueing systems, the service commencement times are replaced for arrival times which can be easily observed. Determining the service commencement time is very important in our methods. The methods for first come first served(FCFS), last come first served(LCFS) queueing discipline are already developed in our previous work. In this paper, we extend to random selection for service(RSS) queueing discipline. The performance measures we used are mean queueing time and mean service time, the variances of two. The simulation results verify our proposed methods to infer queueing systems under RSS discipline.

  • PDF

Performance Analysis of the Cooperative Localization Algorithm with Virtual Reference Nodes in Wireless Sensor Networks (무선 센서네트워크 환경에서 VRN을 이용한 협력 위치추정 알고리즘의 성능 분석)

  • Jeong, Seung-Heui;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.619-626
    • /
    • 2008
  • In this paper, we proposed a RSS based cooperative localization algorithm using VRN for wireless sensor networks, which can estimate the BN position. The proposed localization system monitoring all nodes estimates a position of BN, and calculates an intersection area with cooperative localization. From the results, we confirm that BN intersection area is reduced as the number of RN is increased. In addition, the fewer RN exists, the more iteration needs at least 4 times. Moreover, the propose algorithm using 4 RNs is improved 71.6% estimation performance than conventional method. Therefore, the cooperative localization algorithm with VRN provides higher localization accuracy than RSS based conventional method.

  • PDF

A Personalized Mobile Service Method of RSS News Channel Contents for Ubiquitous Environment (유비쿼터스 환경을 위한 RSS 뉴스 채널 컨텐츠의 개인화 모바일 서비스 기법)

  • Han, Seung-Hyun;Ryu, Dong-Yeop;Lim, Young-Hwan
    • The KIPS Transactions:PartD
    • /
    • v.14D no.4 s.114
    • /
    • pp.427-434
    • /
    • 2007
  • Although wireless devices are the most suitable device for ubiquitous environment, they have restrictive capacities when using internet services than desktop environments. Therefore this research proposes a wireless internet service method that uses contents-based personalization. The existing websites can easily and promptly access desired news articles and other data through RSS-linked web contents and by the personalization method. The proposed method will make using wireless internet easier while lowering contents production costs. Moreover, personalized mobile web news contents that satisfy the preferences of users can be serviced.

Transmission Power Minimization with Network Coding for Mobile Terminals in Cellular Relay Networks

  • Du, Guanyao;Xiong, Ke;Li, Dandan;Qiu, Zhengding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2098-2117
    • /
    • 2012
  • This paper jointly investigates the bandwidth allocation, transmission strategy and relay positions for two-way transmission aware cellular networks with network coding (NC). Our goal is to minimize the transmission power of mobile terminals (MTs). Consider a cellular system, where multiple MTs exchange information with their common base station, firstly, we propose an efficient bandwidth allocation method and then give a transmission strategy for each MT to determine whether to use relay stations (RSs) for its two-way transmission with the BS or not. To further improve the system performance, the optimal positions of RSs are also jointly discussed. A GA-based algorithm is presented to obtain the optimum positions for RSs. Besides, the impacts of frequency reuse on MT's transmission power and system spectral efficiency (SE) under different number of relays are also discussed in our work. Numerical results show that the proposed NC aware scheme can extend MTs' battery life at least 6% more than traditional method.

Attack-Resistant Received Signal Strength based Compressive Sensing Wireless Localization

  • Yan, Jun;Yu, Kegen;Cao, Yangqin;Chen, Liang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4418-4437
    • /
    • 2017
  • In this paper a three-phase secure compressive sensing (CS) and received signal strength (RSS) based target localization approach is proposed to mitigate the effect of malicious node attack. RSS measurements are first arranged into a group of subsets where the same measurement can be included in multiple subsets. Intermediate target position estimates are then produced using individual subsets of RSS measurements and the CS technique. From the intermediate position estimates, the residual error vector and residual error square vector are formed. The least median of residual error square is utilized to define a verifier parameter. The selected residual error vector is utilized along with a threshold to determine whether a node or measurement is under attack. The final target positions are estimated by using only the attack-free measurements and the CS technique. Further, theoretical analysis is performed for parameter selection and computational complexity evaluation. Extensive simulation studies are carried out to demonstrate the advantage of the proposed CS-based secure localization approach over the existing algorithms.

Optimal Resource Planning with Interference Coordination for Relay-Based Cellular Networks

  • Kim, Taejoon;An, Kwanghoon;Yu, Heejung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5264-5281
    • /
    • 2017
  • Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

Adaptive Scanning Scheme for Mobile Broadband Wireless Networks based on the IEEE 802.16e Standard (802.16e 표준 기반 광대역 무선 이동 망을 위한 동적 스캐닝 기법)

  • Park, Jae-Sung;Lim, Yu-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.151-159
    • /
    • 2008
  • Mobile broadband wireless network is emerging as one of the hottest research areas due to technical advances, and the demands of users who wish to enjoy the same network experience on the move. In this paper, we investigate the handover process at the medium access control (MAC) layer in an IEEE 802.16e-based system. In particular, we identify problems concerned with the scan initiation Process called cell reselection and propose a received signal strength (RSS) estimation scheme to dynamically trigger a scanning process. We show how the RSS estimation scheme can timely initiate a scanning process by anticipating RSS values considering scan duration required.

  • PDF

A study on story generation model of blogging (블로그 글쓰기의 스토리생성 모델 연구)

  • Yun, Hyun-Jung
    • Journal of Digital Contents Society
    • /
    • v.15 no.1
    • /
    • pp.29-38
    • /
    • 2014
  • The purpose of this study is to analyze story generation model of blogging. This study considers the structural factors like RSS, Trackback of the blog that generate stories. RSS pushes stories and this makes 'Story Unit'. By contrast, Trackback pulls stories and this makes 'Story extension'. By applying the concept of C. S. Peirce's "interpretant" for analysis process of story generation, story transformation, and story circulation on a blog, this study examines the meaning that each process create. This study suggests the process of story generation model on blogging as an integrated symbol and presents the model in storytelling perspective.

Efficient Kernel Based 3-D Source Localization via Tensor Completion

  • Lu, Shan;Zhang, Jun;Ma, Xianmin;Kan, Changju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.206-221
    • /
    • 2019
  • Source localization in three-dimensional (3-D) wireless sensor networks (WSNs) is becoming a major research focus. Due to the complicated air-ground environments in 3-D positioning, many of the traditional localization methods, such as received signal strength (RSS) may have relatively poor accuracy performance. Benefit from prior learning mechanisms, fingerprinting-based localization methods are less sensitive to complex conditions and can provide relatively accurate localization performance. However, fingerprinting-based methods require training data at each grid point for constructing the fingerprint database, the overhead of which is very high, particularly for 3-D localization. Also, some of measured data may be unavailable due to the interference of a complicated environment. In this paper, we propose an efficient kernel based 3-D localization algorithm via tensor completion. We first exploit the spatial correlation of the RSS data and demonstrate the low rank property of the RSS data matrix. Based on this, a new training scheme is proposed that uses tensor completion to recover the missing data of the fingerprint database. Finally, we propose a kernel based learning technique in the matching phase to improve the sensitivity and accuracy in the final source position estimation. Simulation results show that our new method can effectively eliminate the impairment caused by incomplete sensing data to improve the localization performance.