• Title/Summary/Keyword: mobile router

Search Result 188, Processing Time 0.02 seconds

Android-Based Devices Control System Using Web Server (웹 서버를 이용한 안드로이드 기반 기기 제어 시스템)

  • Jung, Chee-Oh;Kim, Wung-Jun;Jung, Hoe-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.3
    • /
    • pp.741-746
    • /
    • 2015
  • Recently, as mobile operating system market and wireless communication technology have been rapidly developed, many devices such as smart phones, air conditioners, smart TVs, cleaning robot, and cameras become available with android operating system. Accordingly, collecting variety of information through many everyday use devices with network connections is now enabled. However, in the current market, most devices are controlled individually developed applications, and there is growing need to develop a master application that can control multiple devices. In this paper, we propose and implement a system that can control multiple android-based devices on a Wired/Wireless router(AP) registered through web server. we expect such an effort can attribute to future IoT researches.

A Buffer Management Scheme for Multi-hop Traffic in IEEE 802.11 based Mesh Networks (IEEE 802.11 기반 메쉬 네트워크에서 다중 홉 트래픽을 위한 버퍼 관리 방식)

  • Jang, Kil-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.455-462
    • /
    • 2009
  • In this paper, we propose a buffer management scheme for decreasing the packet loss due to buffer overflow and improving the packet fairness between nodes in IEEE 802.11 based multi-hop mesh networks. In the proposed scheme, each mesh router that is an intermediate node receives fairly packet sent from neighboring mesh routers and mobile nodes, and it improves the reception ratio of multi-hop traffic of neighboring mesh routers. Therefore, the proposed scheme can reduce transmission delay and energy consumption. In order to improving the packet loss and the packet fairness, the proposed scheme uses the modified RTS/CTS under the IEEE 802.11 MAC protocol and reduces the packet loss by recognizing the packet size to send to the destination in advance. By using the simulation, we evaluated the proposed scheme in terms of the packet loss ratio and the number of received packet in each mesh router, and compare it to a traditional scheme.

The Stateless Care of Address Configuration Scheme To Provide an Efficient Internet Service in a Train (철도차량내의 효율적인 인터넷 서비스를 위한 Stateless 기반의 Care of Address 구성방안)

  • Lee, Il-Ho;Lee, Jun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.9
    • /
    • pp.37-46
    • /
    • 2009
  • The movement of the MR loaded on the train is confined to the bidirectional movement along the rail. Therefore, the AR connected to the MR can use the address information of the neighboring ARs and configure CoA in advance before performing L2 and L3 handoff. The MR can acquire new CoA immediately from the present AR after the movement detection procedure. The performance analysis shows that the proposed scheme can provide CoA to the MR about 1.8(s) at minimum and 4.98(s) at maximum faster than the Stateless scheme because the proposed scheme does not carry out any additional CoA and DAD procedure unlike the Stateless scheme.

Improved Route Search Method Through the Operation Process of the Genetic Algorithm (유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법)

  • Ji, Hong-il;Seo, Chang-jin
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.4
    • /
    • pp.315-320
    • /
    • 2015
  • Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

QoS for Mobile MPLS VPN (이동성을 갖는 MPLS VPN에서의 QoS)

  • 송영필;양해권
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.159-163
    • /
    • 2003
  • The term "VPN", or Virtual Private Network, generally means the public network of vendors which is providing a communication net and other network using WWW as a backbone of Its WAN. the existing VPN is expected to reduce expenses and will improve the productivity, however, the network provider should accept the management complexity and the overhead after tunneling and encryption. But MPLS VPN can provide efficient VPN which would not need the address transformation and the additional overhead made by tunneling after giving separately ID. This paper describes the protocol for MPLS VPN which is about a node that moves based on Customer Edge (CE) router and supports a scheme for QoS.

  • PDF

Design of NEMO Simulator Using OMNeT++ (OMNeT++를 이용한 NEMO 시뮬레이터 설계)

  • Yang, Man-Seok;Hong, Jin-Pyo;Kim, Kyoung-Soo;Lee, Kyoung-Jin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11b
    • /
    • pp.1201-1204
    • /
    • 2003
  • 본 논문은 모바일 네트웍 환경에서 기존의 호스트 이동성 뿐만 아니라, 네트워크가 움직이는 Network Mobility를 지원하기 위한 접근방식인 MRTP(Mobile Router Tunneling Protocol)와 NEMO Basic Support Protocol의 표준화 및 개발동향에 대해 살펴보고, 시뮬레이션을 통해 이를 구성 및 모델링 함으로써 Network mobility의 필요성을 증명하고, 이를 위해 해결해야 할 문제점들을 파악하며, Network Mobility 환경에서의 문제를 해결하기 위한 시뮬레이터 설계를 기술한다.

  • PDF

The Framework for Multiple Interface Selection at a Multihomed Mobile Router (멀티호밍 모바일 라우터에서의 다중 인터페이스 선택 프레임워크)

  • Park, Chul-Hyun;Choi, Nak-Jung;Choi, Yang-Hee;Kwon, Tae-Kyoung;Paik, Eun-Kyoung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.297-301
    • /
    • 2006
  • 다수의 네트워크에 접근이 가능한 멀티호밍 기술이 구현된 모바일 라우터는 연결된 사용자들이 요구하는 다양한 서비스 요구 사항에 맞추어 적절한 네트워크를 선택하고 서비스를 제공할 수 있어야 한다. 이를 위해서 본 논문에서는 사용자의 응용 프로그램의 요구 사항과 네트워크의 특성, 그리고 모바일 네트워크, 관리자의 정책이라는 세 가지 정보를 모바일 라우터 내에서 관리하면서, 최적의 네트워크를 선택하여 해당 네트워크와 연결을 가진 인터페이스를 통해 사용자의 트래픽을 전송할 수 있는다중 인터페이스 선택을 위한 프레임워크를 제안한다.

  • PDF

Mobility Management in Multi-Radio Multi-Channel Wireless Mesh Networks

  • Que, Ma. Victoria;Hwang, Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.304-310
    • /
    • 2008
  • In a wireless mesh network, there are two types of nodes: mesh routers and mesh clients. These two contradistinct network entities will be characterized and modeled depending on their role in the network. Mesh routers are essentially not mobile unlike the mesh clients. The differences on these nodes should be noted in any protocol design. In this paper, we present a mobility management for wireless mesh network (WMN). This mobility management handles movement of wireless mesh clients as it leaves from a coverage area of a wireless mesh router to another. We consider signaling overhead and mobility as performance metrics.

A Japanese National Project for Superconductor Network Devices

  • Hidaka, M.
    • Progress in Superconductivity
    • /
    • v.5 no.1
    • /
    • pp.1-4
    • /
    • 2003
  • A five-year project for Nb-based single flux quantum (SFQ) circuits supported by Japan's Ministry of Economy Trade and Industry (METI) in Japan was started in September 2002. Since April 2003, the New Energy and Industrial Technology Development Organization (NEDO) has supported this Superconductor Network Device Project. The aim of the project is to improve the integration level of Nb-based SFQ circuits to several ten thousand Josephson junctions, in comparison with their starting integration level of only a few thousand junctions. Actual targets are a 20 GHz dual processor module for the servers and a 0.96 Tbps switch module for the routers. Starting in April 2003, the Nb project was merged with SFQ circuit research using a high-T$_{c}$ superconductor (HTS). The HTS research targets are a wide-band AD converter for mobile-phone base stations and a sampling oscilloscope for wide-band waveform measurements.

  • PDF

A Receiver-driven TCP Flow Control for Memory Constrained Mobile Receiver (제한된 메모리의 모바일 수신자를 고려한 수신자 기반 TCP 흐름 제어)

  • 이종민;차호정
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.91-100
    • /
    • 2004
  • This paper presents a receiver-driven TCP flow control mechanism, which is adaptive to the wireless condition, for memory constrained mobile receiver. A receiver-driven TCP flow control is, in general, achieved by adjusting the size of advertised window at the receiver. The proposed method constantly measures at the receiver both the available wireless bandwidth and the packet round-trip time. Depending on the measured values, the receiver adjusts appropriately the size of advertised window. Constrained by the adjusted window which reflects the current state of the wireless network, the sender achieves an improved TCP throughput as well as the reduced round-trip packet delay. Its implementation only affects the protocol stack at the receiver and hence neither the sender nor the router are required to be modified. The mechanism has been implemented in real environments. The experimental results show that in CDMA2000 1x networks the TCP throughput of the proposed method has improved about 5 times over the conventional method when the receiver's buffer size is limited to 2896 bytes. Also, with 64Kbytes of buffer site, the packet round-trip time of the proposed method has been reduced in half, compared the case with the conventional method.