• Title/Summary/Keyword: Wireless Access Networks

Search Result 894, Processing Time 0.029 seconds

A Study on the Authentication Mechanism for Wireless Mesh Network (무선 메쉬 네트워크를 위한 인증 메커니즘에 관한 연구)

  • Kim, Tae Kyung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.3
    • /
    • pp.117-126
    • /
    • 2009
  • Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. The integration of WMNs with other networks such as the Internet, cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor networks, etc., This paper presents a secure and efficient authentication mechanism for Wireless mesh network. The validity of proposed mechanism is provided by BAN logic and the efficiency of suggested mechanism is showed through the performance evaluation.

A Priority Time Scheduling Method for Avoiding Gateway Bottleneck in Wireless Mesh Networks (무선 메쉬 네트워크에서 게이트웨이 병목 회피를 위한 우선순위 타임 스케줄링 기법)

  • Ryu, Min Woo;Kim, Dae Young;Cha, Si Ho;Cho, Kuk Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.101-107
    • /
    • 2009
  • In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).

Secure Authentication with Mobile Device for Ubiquitous RFID Healthcare System in Wireless Sensor Networks

  • Kim, Jung-Tae
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.562-566
    • /
    • 2011
  • As telecommunication technologies in telemedicine services are developed, the expeditious development of wireless and mobile networks has stimulated wide applications of mobile electronic healthcare systems. However, security is an essential system requirement since many patients have privacy concerns when it comes to releasing their personal information over the open wireless channels. Due to the invisible feature of mobile signals, hackers have easier access to hospital networks than wired network systems. This may result in several security incidents unless security protocols are well prepared. In this paper, we analyzed authentication and authorization procedures for healthcare system architecture to apply secure M-health systems in the hospital environment. From the analyses, we estimate optimal requirements as a countermeasure to its vulnerabilities.

Adaptive GTS allocation scheme with applications for real-time Wireless Body Area Sensor Networks

  • Zhang, Xiaoli;Jin, Yongnu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1733-1751
    • /
    • 2015
  • The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

A Framework for Proactive Handover in Wireless Networks (무선 네트워크에서 사전 핸드오버를 위한 프레임워크)

  • Duc, Thang Le;Le, Duc Tai;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.173-174
    • /
    • 2014
  • Handover is constantly a challenging issue in wireless networks. Most of the existing solutions are host-based, which are implemented on the wireless terminals and leave the decision making to the terminals. This paper studies the problem of network-based handover in the wireless networks with the constraints of low latency as well as low computational time. To address this problem, we employ the software-defined network (SDN) architecture to facilitate handover. According to the operational model of the SDN, we define a workflow for all involved network entities, and then design a framework implementing the workflow as a complete handover system. The proposed framework aims to establish a channel conveying the mobility-related information of devices and the context information of their vicinity from the switches/access routers to the controllers. Based on collected information, the controller can optimally execute the handover.

Throughput Maximization for a Primary User with Cognitive Radio and Energy Harvesting Functions

  • Nguyen, Thanh-Tung;Koo, Insoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3075-3093
    • /
    • 2014
  • In this paper, we consider an advanced wireless user, called primary-secondary user (PSU) who is capable of harvesting renewable energy and connecting to both the primary network and cognitive radio networks simultaneously. Recently, energy harvesting has received a great deal of attention from the research community and is a promising approach for maintaining long lifetime of users. On the other hand, the cognitive radio function allows the wireless user to access other primary networks in an opportunistic manner as secondary users in order to receive more throughput in the current time slot. Subsequently, in the paper we propose the channel access policy for a PSU with consideration of the energy harvesting, based on a Partially Observable Markov decision process (POMDP) in which the optimal action from the action set will be selected to maximize expected long-term throughput. The simulation results show that the proposed POMDP-based channel access scheme improves the throughput of PSU, but it requires more computations to make an action decision regarding channel access.

Supporting Mobile IP in Ad Hoc Networks with Wireless Backbone (무선 백본 기반 Ad Hoc 네트워크에서의 Mobile IP지원)

  • 신재욱;김응배;김상하
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.223-226
    • /
    • 2003
  • In this paper, we propose new agent discovery and route discovery schemes to support Mobile IP (MIP) in Ad Hoc networks with wireless backbone. The wireless backbone consisting of stationary wireless routers and Internet gateways (IGs) is a kind of wireless access network of IP-based core network. The proposed scheme utilizes favorable features of wireless backbone such as stable links and no energy constraints. In the agent discovery scheme, backbone-limited periodic Agent Advertisement (AA) and proxy-AA messages are used, which reduce network-wide broadcasting overhead caused by AA and Agent Solicitation messages and decentralize MIP processing overhead in IGs. In order to reduce delay time and control message overhead during route discovery far the destination outside Ad Hoc network, we propose a cache-based scheme which can be easily added to the conventional on-demand routing protocols. The proposed schemes can reduce control overhead during agent discovery and route discovery, and efficiently support MIP in Ad Hoc network with wireless backbone.

  • PDF

Wireless sensor networks for underground railway applications: case studies in Prague and London

  • Bennett, Peter J.;Soga, Kenichi;Wassell, Ian;Fidler, Paul;Abe, Keita;Kobayashi, Yusuke;Vanicek, Martin
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.619-639
    • /
    • 2010
  • There is increasing interest in using structural monitoring as a cost effective way of managing risks once an area of concern has been identified. However, it is challenging to deploy an effective, reliable, large-scale, long-term and real-time monitoring system in an underground railway environment (subway / metro). The use of wireless sensor technology allows for rapid deployment of a monitoring scheme and thus has significant potential benefits as the time available for access is often severely limited. This paper identifies the critical factors that should be considered in the design of a wireless sensor network, including the availability of electrical power and communications networks. Various issues facing underground deployment of wireless sensor networks will also be discussed, in particular for two field case studies involving networks deployed for structural monitoring in the Prague Metro and the London Underground. The paper describes the network design, the radio propagation, the network topology as well as the practical issues involved in deploying a wireless sensor network in these two tunnels.

A Novel Multiple Access Scheme via Compressed Sensing with Random Data Traffic

  • Mao, Rukun;Li, Husheng
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.308-316
    • /
    • 2010
  • The problem of compressed sensing (CS) based multiple access is studied under the assumption of random data traffic. In many multiple access systems, i.e., wireless sensor networks (WSNs), data arrival is random due to the bursty data traffic for every transmitter. Following the recently developed CS methodology, the technique of compressing the transmitter identities into data transmissions is proposed, such that it is unnecessary for a transmitter to inform the base station its identity and its request to transmit. The proposed compressed multiple access scheme identifies transmitters and recovers data symbols jointly. Numerical simulations demonstrate that, compared with traditional multiple access approaches like carrier sense multiple access (CSMA), the proposed CS based scheme achieves better expectation and variance of packet delays when the traffic load is not too small.

Medium Access Control with Dynamic Frame Length in Wireless Sensor Networks

  • Yoo, Dae-Suk;Choi, Seung-Sik
    • Journal of Information Processing Systems
    • /
    • v.6 no.4
    • /
    • pp.501-510
    • /
    • 2010
  • Wireless sensor networks consist of sensor nodes which are expected to be battery-powered and are hard to replace or recharge. Thus, reducing the energy consumption of sensor nodes is an important design consideration in wireless sensor networks. For the implementation of an energy-efficient MAC protocol, a Sensor-MAC based on the IEEE 802.11 protocol, which has energy efficient scheduling, has been proposed. In this paper, we propose a Dynamic S-MAC that adapts dynamically to the network-traffic state. The dynamic S-MAC protocol improves the energy consumption of the S-MAC by changing the frame length according to the network-traffic state. Using an NS-2 Simulator, we compare the performance of the Dynamic S-MAC with that of the S-MAC protocol.