• Title/Summary/Keyword: Wireless communication technology

Search Result 2,523, Processing Time 0.028 seconds

Grid-based Cloaking Area Creation Scheme supporting Continuous Query Processing for Location-based Services of Peer-to-Peer Environment (P2P 환경의 위치 기반 서비스에서 연속적인 질의 처리를 지원하는 그리드 기반 Cloaking 영역 설정 기법)

  • Kim, Hyeong-Il;Lee, Ah-Reum;Chang, Jae-Woo
    • Spatial Information Research
    • /
    • v.18 no.3
    • /
    • pp.53-62
    • /
    • 2010
  • Recent development in wireless communication technology, like GPS, and mobile equipments, like PDA and cellular phone, make location-based services (LBSs) popular. However, because, users continuously request a query to a server in the LBSs by using their exact locations, privacy information could be in danger. Therefore, a mechanism for users' privacy protection is required for the safe and comfortable use of LBSs by mobile users. For this, we, in this paper, propose a grid-based cloaking area creation scheme supporting continuous LBSs in peer-to-peer environment. The proposed scheme creates a cloaking area by using Chord protocol, so as to support the continuous LBSs in peer-to-peer environment. Finally, we show from a performance analysis that our cloaking scheme outperforms the existing cloaking schemes, in terms of service time.

Design of Time Synchronizer for Advanced LR-WPAN Systems (개선된 LR-WPAN 시스템을 위한 시간 동기부 설계)

  • Park, Mincheol;Lee, Dongchan;Jang, Soohyun;Jung, Yunho
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.5
    • /
    • pp.476-482
    • /
    • 2014
  • Recently, with the growth of various sensor applications, the need of wireless communication systems which can support variable data rate is increasing. IEEE 802.15.4 LR-WPAN system using 2.45 GHz frequency band is very popular for the sensor applications. However, since LR-WPAN only supports the data rate of 250 kbps, it has a limit to be applied to various sensor networks. Therefore, we define the preamble structure which can support the data rates of 31.25 kbps, 62.5 kbps, 125 kbps, and present the low-complexity hardware architecture for time synchronizer based on double-correlation algorithm which can resist the CFO (carrier frequency offset). Implementation results show that the proposed time synchronizer include the logic slice of 18.36 K and four DSP48s, which are reduced at the rate of 79.1% and 99.4%, respectively, compared with existing architecture.

Design of Low Power CMOS LNA for using Current Reuse Technique (전류 재사용 기법을 이용한 저전력 CMOS LNA 설계)

  • Cho In-Shin;Yeom Kee-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1465-1470
    • /
    • 2006
  • This paper presents a design of low power CMOS LNA(Low Noise Amplifier) for 2.4 GHz ZigBee applications that is a promising international standard for short area wireless communications. The proposed circuit has been designed using TSMC $0.18{\mu}m$ CMOS process technology and two stage cascade topology by current reuse technique. Two stage cascade amplifiers use the same bias current in the current reused stage which leads to the reduction of the power dissipation. LNA design procedures and the simulation results using ADS(Advanced Design System) are presented in this paper. Simulation results show that the LNA has a extremely low power dissipation of 1.38mW with a supply voltage of 1.0V. This is the lowest value among LNAs ever reported. The LNA also has a maximum gain of 13.38dB, input return loss of -20.37dB, output return loss of -22.48dB and minimum noise figure of 1.13dB.

A Study on User Authentication of Mobile Internet Environment Based on WPKI - (무선 인터넷 환경의 WPKI 기반 사용자 인증에 관한 연구)

  • Lee, Cheol-Seung;Park, Young-Ok;Lee, Ho-Young;Lee, Jeon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.560-563
    • /
    • 2003
  • In this paper describes for use Authentication with the WPKI and Kerberos protocol. this paper is the security structure that defined in a WAP forum and security and watches all kinds of password related technology related to the existing authentication system. It looks up weakness point on security with a problem on the design that uses wireless public key-based structure and transmission hierarchical security back of a WAP forum, and a server-client holds for user authentication of an application level all and all, and it provides one counterproposal. Therefore, We offer authentication way solution that connected X.509 with using WIM for complement an authentication protocol Kerberos and its disadvantages.

  • PDF

DANCE : Small AP On/Off Algorithms in Ultra Dense Wireless Network (DANCE : 초고밀도 통신망에서의 소형기지국 온-오프 알고리즘)

  • Lee, Gilsoo;Kim, Hongseok;Kim, Young-Tae;Kim, Byoung-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1135-1144
    • /
    • 2013
  • Deploying small cells is a reliable and influential solution to handle the skyrocketing traffic increase in the cellular network, and the small cell technology is evolving to ultra-dense network (UDN). In this paper we propose a small cell on/off algorithm with a simple but essential framework composed of access point (AP), user equipment (UE), and small cell controller (SCC). We propose Device-Assisted Networking for Cellular grEening (DANCE) algorithms that save the energy consumption by tying to minimize the number of turned-on APs while maintaining the network throughput. In doing so, SCC firstly gathers the feedback messages from UEs and then makes a decision including a set of turned-on APs and user association. DANCE algorithm has several variations depending on the number of bits of the UE's feedback message (1 bit vs. N bit), and is divided into AP-first, UE-first, or Proximity ON according to the criteria of selecting the turned-on APs. We perform extensive simulations under the realistic UDN environment, and the results confirm that the proposed algorithms, compared to the baseline, can significantly enhance the energy efficiency, e.g., more than a factor of 10.

Mixed-Integer Programming based Techniques for Resource Allocation in Underlay Cognitive Radio Networks: A Survey

  • Alfa, Attahiru S.;Maharaj, B.T.;Lall, Shruti;Pal, Sougata
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.744-761
    • /
    • 2016
  • For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

Mobile Interface in Condor Distributed Systems (콘도 분산 시스템의 모바일 인터페이스)

  • 이송이
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.75-88
    • /
    • 2004
  • Condor is a distributed batch system for sharing the workload among the computers connected by a network. Condor distributed system was developed on the basis that every machine in a Condor pool is always connected by a network to run a Condor Job. Due to advances in wireless communication and mobile computing technology, conventional distributed computer systems can now include “mobile” clients as well as “fixed” clients. Moreover, mobile users want to lower their power consumption by off-loading potentially power and resource consuming jobs. In this paper, we describe the design and implementation of mobile interface for mobile clients in Condor distributed batch system. The main purpose of this work is to enable users on mobile computers to interact with Condor environment any time anywhere regardless of their connection to a Condor pool. The mobile Condor distributed system also aims to provide mobile users the same Condor services without making any significant changes to the existing Condor system.

A Study on Gamers Segmentation based upon Uses and Gratifications of Mobile games (모바일게임 이용 충족이론을 기반으로 한 모바일 게이머 유형 분석에 관한 연구)

  • Han, Kwang-Hyun;Kim, Tae-Ung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.133-164
    • /
    • 2005
  • Mobile games have emerged as the most innovative entertainment technology, adding new revenue streams, taking advantage of the potential of wireless applications and service offerings. Mobile games, like any other types of computer game, offer a unique value for users in providing an exciting digital experience in virtual worlds. Players can become empowered through the development of new characters and strategies within games to achieve rewarding successes against the computers and other players. The overall trend for mobile games is towards bigger, more colorful, more involving and exciting contents, which will build upon the developing capabilities of mobile phones and networks in order to bring new styles, concepts and experiences of game play to the users. In this paper, we attempt to investigate the demographic factors which play critical roles in determining the level of playing times; classify mobile gamers based on their motives for playing games; and empirically test differences in their demographic factors and mobile game usage. Statistical results show that significant differences in playing times exist, depending upon their age, gender, mobile device, mobile phone usage, mobile game experiences, and preferred games genres. Applying Factor analysis, we have identified Escape, Social interaction, Challenge and Competition, Fantasy, Diversion and Relaxation, Ease of Accessibility as key motivators for playing mobile games. Additional cluster analysis shows that the categorization of gamers, according to their usage habits and the key motivators for playing, can be made as follows: M-gamers, Multi-gamers and Communication-focused gamers. Further correlation of these grouping with socio-economic data shows the significant differences in gaming habits and patterns of mobile phone use.

  • PDF

A Cache Consistency Scheme to Consider Period of Data in Mobile Computing Environments (이동 컴퓨팅 환경에서 데이터의 주기성을 고려한 캐쉬 일관성 기법)

  • Lim, Jong-Won;Hwang, Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.4
    • /
    • pp.421-431
    • /
    • 2007
  • Due to the rapid development of wireless communication technology, demands on data services in mobile computing environment are gradually increasing. In mobile computing environments, a mobile host began to use cache to overcome the weak point. Caching at mobile host could reduce the bandwidth consumption and query response time, but mobile host must maintain cache consistency. In this paper, we propose a cache consistency strategy to consider the period of data usage. The server allows an effective broadcasting by classifying data into two groups of periodic and non-periodic. By classifying the data, it prevent from elimination of cache after disconnection of periodic data by using expired time. By storing IR(Invalidation Report) messages, this scheme divides cached data by selection after disconnection. Consequently, we have shown much improvement in total consumption of bandwidth than the conventional scheme.

  • PDF

Design and Implementation of Time Synchronizer for Advanced ZigBee Systems (개선된 지그비 시스템을 위한 시간 동기부 설계 및 구현)

  • Hwang, Hyunsu;Jung, Yongcheol;Jung, Yunho
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.5
    • /
    • pp.453-461
    • /
    • 2016
  • Recently, with the growth of various sensor applications, the need of wireless communication systems which can support variable data rate is increasing. Therefore, advanced ZigBee (AZB) systems that support the various data rate under 250 kbps are proposed. However, the preamble structure for AZB systems causes the complexity increase of time synchronization circuits. In this paper, we propose preamble structure and time synchronization algorithm which can solve the problem of the complexity increase of time synchronization circuits. Implementation results show that the proposed time synchronizer for AZB systems include the logic slices of 6.92 k and, which are reduced at the rate of 62.3% compared with existing architecture.