• Title/Summary/Keyword: broadcast

Search Result 8,474, Processing Time 0.034 seconds

Performance of active PNC Handover and PNC Heart Beat based Beacon Alignment Schemes for Wireless PAN Systems (WPAN에서의 신속한 망 복구를 위한 능동적인 PNC 핸드오버방법 및 PNC Heart Beat 의 비컨 프레임 정렬 방식의 성능분석)

  • Nam Hye-Jin;Kim Jae-Young;Jeon Young-Ae;Lee Hyung-Soo;Kim Se-Han;Yoon Chong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.117-128
    • /
    • 2006
  • For the legacy IEEE 802.15.3 WPAN protocol, an unpredictable piconet coordinator(PNC) leaving from a piconet without a proper handoff procedure causes an absence of PNC, and thus the piconet gets collapsed. In addition, several beacons from PNCs in adjacent piconets may be collided on a device(DEV) located between those piconets. This beacon collision eventually makes the DEV leave from the piconet. To remedy these two problems, we here propose an Active Seamless Coordinator Switching(ASCS) scheme and a PNC HB based Beacon Alignment(PHBA) one. In the ASCS scheme, a PNC assigns a number of DEVs as next possible PNCs in sequence for provisioning against the abrupt breakdown of the current active PNC. Each nominated DEV proactively sends a probe frame to confirm the operation status of the active PNC. For the case of no response from the PNC, the nominated DEV tries to become a new PNC immediately. In the second PHBA scheme, each PNC is allow to broadcast a special Heart Beat(HB) frame randomly during a superframe period. When a DEV receives a HB frame from other PNC, it promptly sends the related PNCs a special Hiccup Beat(HCB) frame with the superframe information of its associated PNC. As a result, the HCB frame makes both PNCs align their superframe beginning time in order to yield no more beacon collisions. For these two proposed schemes, we show the performance by simulations. We can confirm the enhancement of throughput for each superframe and average frame transfer delay, since each scheme can reduce the duration of piconet collapse. Finally, it is worth while to note that the proposed schemes can be operated with frames those are permitted in the legacy WPAN standard.

GPS-based monitoring and modeling of the ionosphere and its applications for high accuracy correction in China

  • Yunbin, Yuan;Jikun, Ou;Xingliang, Huo;Debao, Wen;Genyou, Liu;Yanji, Chai;Renggui, Yang;Xiaowen, Luo
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.203-208
    • /
    • 2006
  • The main research conducted previously on GPS ionosphere in China is first introduced. Besides, the current investigations include as follows: (1) GPS-based spatial environmental, especially the ionosphere, monitoring, modeling and analysis, including ground/space-based GPS ionosphere electron density (IED) through occultation/tomography technologies with GPS data from global/regional network, development of a GNSS-based platform for imaging ionosphere and atmosphere (GPFIIA), and preliminary test results through performing the first 3D imaging for the IED over China, (2) The atmospheric and ionospheric modeling for GPS-based surveying, navigation and orbit determination, involving high precisely ionospheric TEC modeling for phase-based long/median range network RTK system for achieving CM-level real time positioning, next generation GNSS broadcast ionospheric time-delay algorithm required for higher correction accuracy, and orbit determination for Low-Earth-orbiter satellites using single frequency GPS receivers, and (3) Research products in applications for national significant projects: GPS-based ionospheric effects modeling for precise positioning and orbit determination applied to China's manned space-engineering, including spatial robot navigation and control and international space station intersection and docking required for related national significant projects.

  • PDF

An Efficient Route Discovery using Adaptive Expanding Ring Search in AODV-based MANETs (AODV 기반의 MANET에서 적응적인 확장 링 검색을 이용한 효율적인 경로 탐색)

  • Han, Seung-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.425-430
    • /
    • 2007
  • Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.

Enhanced Grid-Based Trajectory Cloaking Method for Efficiency Search and User Information Protection in Location-Based Services (위치기반 서비스에서 효율적 검색과 사용자 정보보호를 위한 향상된 그리드 기반 궤적 클로킹 기법)

  • Youn, Ji-Hye;Song, Doo-Hee;Cai, Tian-Yuan;Park, Kwang-Jin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.8
    • /
    • pp.195-202
    • /
    • 2018
  • With the development of location-based applications such as smart phones and GPS navigation, active research is being conducted to protect location and trajectory privacy. To receive location-related services, users must disclose their exact location to the server. However, disclosure of users' location exposes not only their locations but also their trajectory to the server, which can lead to concerns of privacy violation. Furthermore, users request from the server not only location information but also multimedia information (photographs, reviews, etc. of the location), and this increases the processing cost of the server and the information to be received by the user. To solve these problems, this study proposes the EGTC (Enhanced Grid-based Trajectory Cloaking) technique. As with the existing GTC (Grid-based Trajectory Cloaking) technique, EGTC method divides the user trajectory into grids at the user privacy level (UPL) and creates a cloaking region in which a random query sequence is determined. In the next step, the necessary information is received as index by considering the sub-grid cell corresponding to the path through which the user wishes to move as c(x,y). The proposed method ensures the trajectory privacy as with the existing GTC method while reducing the amount of information the user must listen to. The excellence of the proposed method has been proven through experimental results.

A New Web Cluster Scheme for Load Balancing among Internet Servers (인터넷 환경에서 서버간 부하 분산을 위한 새로운 웹 클러스터 기법)

  • Kim, Seung-Young;Lee, Seung-Ho
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.115-122
    • /
    • 2002
  • This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server's status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.

Development of Hardware for the Architecture of A Remote Vital Sign Monitor (무선 체온 모니터기 아키텍처 하드웨어 개발)

  • Jang, Dong-Wook;Jang, Sung-Whan;Jeong, Byoung-Jo;Cho, Hyun-Seob
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.7
    • /
    • pp.2549-2558
    • /
    • 2010
  • A Remote Vital Sign Monitor is an in-home healthcare system designed to wirelessly monitor core-body temperature. The Remote Vital Sign Monitor provides accuracy and features which are comparable to hospital equipment while minimizing cost with ease-of-use. It has two parts, a bandage and a monitor. The bandage and the monitor both use the Chipcon2430(CC2430) which contains an integrated 2.4GHz Direct Sequence Spread Spectrum radio. The CC2430 allows Remote Vital Sign Monitor to operate at over a 100-foot indoor radius. A simple user interface allows the user to set an upper temperature and a lower temperature that is monitored with respect to the core-body temperature. If the core-body temperature exceeds the one of two defined temperatures, the alarm will sound. The alarm is powered by a low-voltage audio amplifier circuit which is connected to a speaker. In order to accurately calculate the core-body temperature, the Remote Vital Sign Monitor must utilize an accurate temperature sensing device. The thermistor selected from GE Sensing satisfies the need for a sensitive and accurate temperature reading. The LCD monitor has a screen size that measures 64.5mm long by 16.4mm wide and also contains back light, and this should allow the user to clearly view the monitor from at least 3 feet away in both light and dark situations.

Clustering based Routing Algorithm for Efficient Emergency Messages Transmission in VANET (차량 통신 네트워크에서 효율적인 긴급 메시지 전파를 위한 클러스터링 기반의 라우팅 알고리즘)

  • Kim, Jun-Su;Ryu, Min-Woo;Cha, Si-Ho;Lee, Jong-Eon;Cho, Kuk-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.8
    • /
    • pp.3672-3679
    • /
    • 2012
  • Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

A Cluster-Organizing Routing Algorithm by Diffusing Bitmap in Wireless Sensor Networks (무선 센서 네트워크에서의 비트맵 확산에 의한 클러스터 형성 라우팅 알고리즘)

  • Jung, Sangjoon;Chung, Younky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.269-277
    • /
    • 2007
  • Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

  • PDF

Development of Embedded Type VOD Client System (임베디드 형태의 VOD 클라이언트 시스템의 개발)

  • Hong Chul-Ho;Kim Dong-Jin;Jung Young-Chang;Kim Jeong-Do
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.6 no.4
    • /
    • pp.315-324
    • /
    • 2005
  • VOD(video on demand) is a video service by users' order, that is, a video service on demand. That means the users can select and watch the video content that has been saved on sewer, out of broadcasting in the usual process like TV. At present the client of VOD system bases on PC. As the PC-based client uses the software MPEG decoder, the main processor specification has an effect on the capacity. Also people, who don't know how to use their PC, cannot be provided the VOD service. The purpose of this paper is to show the process of the development the VOD client system Into the embedded type with hardware MPEG-4 decoder. The main processor is the SC1200 of x86 Family in National Semiconductor with a built-in video processor and the memory is 128Mbyte SDRAM. Also, in order that the VOD service can be provided using the Internet, the Ethernet controller is included. As the hardware MPEG-4 decoder is used in the embedded VOD client system, which is developed, it can make the low capacity of the main processor. Therefore it is able to be developed as a low-price system. The embedded VOD client system is easy for anyone to control easily with the remote control and can be played through TV.

  • PDF

Performance Analysis of Location-Aware System based on Active Tags (능동태그 기반 위치인식 시스템의 성능 분석)

  • So, Sun-Sup;Eun, Seong-Bae;Kim, Jin-Chun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.2
    • /
    • pp.422-429
    • /
    • 2007
  • Location awareness is one of the key functionalities to build an U-city. Recently, many of works of the location-aware systems are emerging to commercially apply to on-going large-scale apartment complex based on U-city. As dwellers or cars being attached with active tags are moving in the U-city complex, the active tags periodically broadcast their own identifiers and receivers fixed along the street or in building use those information to calculate location of them. There are several issues to be considered for such an environment. The first is that the number of active tags operating in the same region are large as much as tens of thousands, and the second is that the active tags should be alive without change of batteries more than a year, hence low power consumption is very important. In this paper we propose i) a new architecture for location-aware system considering such issues, ii) technical issues to implement it using active tags, and iii) a mathematical analytic model to investigate overall performance and verify it by comparing with actual experimental results. Through the analysis we can show the theoretical boundary of the lowest packet loss rate and the maximum number of tags with acceptable performance for the systems based on active tags. The results can be applied to practical design of location-based systems of U-City projects.