• Title/Summary/Keyword: Wireless Broadcast

Search Result 385, Processing Time 0.03 seconds

Optimal Design of Mobile Controlled Location Update Subsystem

  • Kang, Hye-Won;Park, Cheon-Won
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.25-28
    • /
    • 1999
  • Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

  • PDF

Automatic Node Configuration Protocol for Small Sized Mobile Ad-Hoc Networks (소규모 이동 애드혹 네트워크에서의 자동 노드 설정 프로토콜)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.100-109
    • /
    • 2005
  • A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

A Seamless Multicast Scheme to Prevent Packet Loss in Proxy Mobile IPv6 Networks (Proxy Mobile IPv6 네트워크에서 패킷 유실을 방지하는 끊김 없는 멀티캐스트 기법)

  • Kim, Jong-Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.7-20
    • /
    • 2011
  • Recently, Proxy Mobile IPv6(PMIPv6) networks have been studied as the mobility management protocol to effectively use limited wireless resources. And the multicasting, which is core technology of the Internet broadcast system such as mobile IPTV, has been discussed mainly based on PMIPv6 network. However, multicasting based on PMIPv6 network causes disconnection of services because it does not solve problems of packet loss during binding and group joining procedure. Hence, we propose a seamless multicast scheme which prevents packet loss in PMIPv6 networks. The proposed scheme achieves lower latency than the existing scheme because it combines binding and group joining procedure, a1so it does not cause about packet losses due to performing buffering. We proved the performance using the simulations.

A Seamless Multicast Scheme Supporting Global Mobility in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 전역 이동을 지원하는 끊김 없는 멀티캐스트 기법)

  • Kim, Hwan-Gi;Kim, Jong-Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.3
    • /
    • pp.258-267
    • /
    • 2013
  • Recently, Proxy Mobile IPv6(PMIPv6) networks have been drawing attention as the mobility management protocol that uses limited wireless resources effectively. And the multicast, which is a core technology of the Internet broadcast system such as mobile IPTV, has been widely discussed mainly based on PMIPv6 network. However, PMIPv6-based multicast cannot support the global mobility directly between different PMIPv6 domains because PMIPv6 is basically designed for local mobility in single PMIPv6 domain. Moreover, PMIPv6-based multicast causes the disconnection of services because it does not solve the packet loss problem during binding and group joining procedure. In this paper, we propose a global mobility scheme that supports the seamless multicast service in PMIPv6 networks. The proposed scheme supports the global mobility due to the addition of extra signalling messages between LMAs. Also, it achieves low latency because it performs fast binding and group joining procedure. We present the simulation results which show that the proposed scheme achieves the global mobility with low latency through the NS-2 simulation.

Learning based relay selection for reliable content distribution in smart class application

  • Kim, Taehong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2894-2909
    • /
    • 2015
  • As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

Efficient Schemes for Cache Consistency Maintenance in a Mobile Database System (이동 데이터베이스 시스템에서 효율적인 캐쉬 일관성 유지 기법)

  • Lim, Sang-Min;Kang, Hyun-Chul
    • The KIPS Transactions:PartD
    • /
    • v.8D no.3
    • /
    • pp.221-232
    • /
    • 2001
  • Due to rapid advance of wireless communication technology, demand on data services in mobile environment is gradually increasing. Caching at a mobile client could reduce bandwidth consumption and query response time, and yet a mobile client must maintain cache consistency. It could be efficient for the server to broadcast a periodic cache invalidation report for cache consistency in a cell. In case that long period of disconnection prevents a mobile client from checking validity of its cache based solely on the invalidation report received, the mobile client could request the server to check cache validity. In doing so, some schemes may be more efficient than others depending on the number of available channels and the mobile clients involved. In this paper, we propose new cache consistency schemes, effects, efficient especially (1) when channel capacity is enough to deal with the mobile clients involved or (2) when that is not the case, and evaluate their performance.

  • PDF

Implementation of Exclusive OR-Based Video Streaming System (배타적 논리합 기반 비디오 스트리밍 시스템의 구현)

  • Lee, Jeong-Min;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.7
    • /
    • pp.1091-1097
    • /
    • 2022
  • In this paper, we implement the eXclusive OR-based Cast (XC) system that is a video streaming system using exclusive OR operations, and measure various performance metrics in wireless local area network (WLAN) environments. In addition, we investigate the performance improvement of the XC system considering various practical video streaming environments, while conventional studies analyzed the performance of XC through computer simulations in limited environments. To this end, we propose new control messages such as STR_REQ_MSG (SRM) that clients transmit to a video streaming server and STR_CON_MSG (SCM) that is used for the video streaming server to control the clients, and develop a new protocol by using the new control messages. According to the various measurement results using the implemented XC system, XC video streaming system can reduce the consumption of network bandwidth by 8.6% on average and up to 25% compared to the conventional video streaming system. In addition, the outage probability can be also reduced up to 76%.

Performance Analysis of the Amplify-and-Forward Scheme under Interference Constraint and Physical Layer Security (물리 계층 보안과 간섭 제약 환경에서 증폭 후 전송 기법의 성능 분석)

  • Pham, Ngoc Son;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.179-187
    • /
    • 2014
  • The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

Update Frequency Cache Consistency for Reducing Wait Time in Mobile Computing (이동 컴퓨팅 환경에서 대기 시간을 감소시키는 갱신 빈도 캐쉬 일관성 기법)

  • Lee, Chan-Seob;Kim, Dong-Hyuk;Baek, Joo-Hyun;Choi, Eui-In
    • The KIPS Transactions:PartD
    • /
    • v.9D no.6
    • /
    • pp.1017-1024
    • /
    • 2002
  • According as mobile computing environment is generalized by development of wireless networking technology and communication device, mobile host uses local cache for extensibility and early response time. and reduction of limited bandwidth. This time, between mobile host and mobile support station cache need consistency interested person of done data accordingly much techniqueses propose. Existent consistency techniques because detection based techniqueses are used mainly and broadcast periodic invalid message considering frequent disconnection. However, these techniqueses increase abort step through increase or delay of transmission message number by accuracy examination of data. Therefore, because mobile host deletes cached data, and extensity are decreased. Techniques that is proposed in this paper did to perform refering update frequency about object that page request or when complete update operation happens to solve these problem. Therefore, have advantage that response is fast because could run write intention declaration or update by update frequency electively asynchronously when update operation consists and abort step decreases. Also, improved extensity running delete or propagation electively according to update frequency about periodic invalid message gone since disconnection.

An Efficient Concurrency Control Scheme for Mobile Transactions with Skewed Data Access Patterns in Wireless Broadcast Environments (무선 브로드캐스트 환경에서 편향된 데이터 접근 패턴을 갖는 모바일 트랜잭션을 위한 효율적인 동시성 제어 기법)

  • Choi Keun-Ha;Jung Sungwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11b
    • /
    • pp.136-138
    • /
    • 2005
  • 무선 브로드캐스트 환경에서는 모바일 클라이언트의 제한된 배터리와 클라이언트에서 서버로의 제한된 상향 대역폭 등의 문제로 기존의 동시성 제어 기법을 그대로 사용할 수 없다. 이런 문제를 해결하고자 많은 동시성 제어 기법들이 연구되어 왔는데, 지금까지 제안된 기법들은 편향된 데이터의 접근 패턴을 반영한 브로드캐스트 환경을 고려하지 못하고 있다. 무선 브로드캐스트 환경에서 서버는 일반적으로 모바일 클라이언트의 접근 패턴을 고려하여 편향된 접근 빈도를 갖는 데이터 아이템을 브로드캐스트 한다. 본 논문에서는 무선 브로드캐스트 환경에서 편향된 데이터 접근 패턴을 고려한 동시성 제어 기법을 제안한다. 제안하는 기법은 브로드캐스트 디스크 모델에서 전체 메이저 브로드캐스트 주기마다. 모바일 트랜잭션을 위한 제어 정보를 보내는 것이 아니라 일정한 마이너 브로드캐스트 주기마다. 제어 정보를 전송한다. 이는 접근 빈도가 놓은 데이터가 갱신된 경우 갱신된 내용을 마이너 그룹마다 반영하므로 읽기 전용 트랜잭션이 접근하는 데이터가 최신 정보임을 보장할 뿐만 아니라 갱신 트랜잭션이 최종 검증을 위해서 상향 통신 대역폭을 이용하는 횟수를 줄이고, 보다. 빠른 재실행을 통해 모바일 트랜잭션의 평균 응답시간을 줄여줄 수 있다. 또한 모바일 트랜잭션의 요청이 편향된 경우, 반복적인 트랜잭션의 중단, 재실행으로 인한 성능 저하를 개선하고자 정적 백오프 기법을 이용하여 모바일 트랜잭션 간 충돌 가능성을 줄여준다. 마지막으로 시뮬레이션을 통해 기존의 기법들에 비해 평균 접근 시간, 상향 통신 대역폭 등의 사용량이 현저히 줄어드는 것을 보임으로써 제안하는 기법의 성능을 검증한다.한 평균 access time을 최소화하는 동시에 클라이언트들의 제한된 에너지 소비를 최소화하는데 목적이 있다. 제안기법에 대한 평가는 수학적 분석을 통해 HIDAF 기법과 기존의 브로드캐스트 기법의 성능을 비교 분석한다.하였으나 사료효율은 증진시켰으며, 후자(사양, 사료)와의 상호작용은 나타나지 않았다. 이상의 결과는 거세비육돈에서 1) androgen과 estrogen은 공히 자발적인 사료섭취와 등지방 침적을 억제하고 IGF-I 분비를 증가시키며, 2) 성선스테로이드호르몬의 이 같은 성장에 미치는 효과의 일부는 IGF-I을 통해 매개될 수도 있을을 시사한다. 약 $70 {\~} 90\%$의 phenoxyethanol이 유상에 존재하였다. 또한, 미생물에 대한 항균력도 phenoxyethanol이 수상에 많이 존재할수록 증가하는 경향을 나타내었다. 따라서, 제형 내 oil tomposition을 변화시킴으로써 phenoxyethanol의 사용량을 줄일 수 있을 뿐만 아니라, 피부 투과를 감소시켜 보다 피부 자극이 적은 저자극 방부시스템 개발이 가능하리라 보여 진다. 첨가하여 제조한 curd yoghurt는 저장성과 관능적인 면에서 우수한 상품적 가치가 인정되는 새로운 기능성 신제품의 개발에 기여할 수 있을 것으로 사료되었다. 여자의 경우 0.8이상이 되어서 심혈관계 질환의 위험 범위에 속하는 수준이었다. 삼두근의 두겹 두께는 남녀 각각 $20.2\pm8.58cm,\;22.2\pm4.40mm$으로 남녀간에 유의한 차이는 없었다. 조사대상자의 식습관 상태는 전체 대상자의 $84.4\%$가 대부분

  • PDF