• Title/Summary/Keyword: Mobile Relay

Search Result 233, Processing Time 0.023 seconds

Neighbor Discovery Protocol Based on Inhibited and Priority Access Controls for Multihop Cellular Networks (멀티홉 셀룰러 네트워크에서 억제 및 우선순위 접속 제어기반의 이웃노드 탐색 프로토콜)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2533-2540
    • /
    • 2013
  • In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

A Prediction Method using WRC(Weighted Rate Control Algorithm) in DTN (DTN에서 노드의 속성 정보 변화율과 가중치를 이용한 이동 예측 기법)

  • Jeon, Il-Kyu;Oh, Young-jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.113-115
    • /
    • 2015
  • In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

  • PDF

Packet Discrimination Method Using Artificial Frequency Offsets for Low Decoding Power Consumption in Heterogeneous Cooperative Communication Systems (이기종 협력 통신시스템에서 디코딩 전력소모 감소를 위한 인위적인 주파수 오프셋을 이용한 패킷 구별 기법)

  • Chae, Seungyeob;Yeo, Gyuhak;Rim, Minjoong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.7
    • /
    • pp.372-379
    • /
    • 2014
  • When a hand-held device with limited battery transmits and receives data using short-range wireless communication systems, such as WLAN(Wireless Local Area Network) or high speed WPAN(Wireless Personal Area Network), instead of mobile communication systems, the device is able to reduce the power consumption due to the reduced transmission distance. However, if there are many WLAN or high speed WPAN systems around the device, non-negligible power may be consumed by receiving and decoding the packets which have nothing to do with the device. In this paper, we propose a scheme reducing the power consumption by including physical-layer ID in WLAN or WPAN packets and avoiding unnecessary packet receptions. Also, we describe a method to determine the optimum number of physical-layer IDs.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

Design and Implementation of an Automatic Switching Technology Between Ad-Hoc and Infrastructure Modes in Wireless LANs (무선 LAN에서 Ad-Hoc과 Infrastructure 모드의 자동전환 기술 설계 및 구현)

  • Shin Taek-Su;Jo Sung-Min;Min Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.892-899
    • /
    • 2006
  • In this paper, we propose an automatic switching technology between the ad-hoc and the infrastructure modes without user intervention in the IEEE 802.11b wireless LAN. Also, we design our proposed technology and implemented on the Linux machine. For this operation, the area within an Access Point (AP) coverage is defined as a switching area, and a node without any transmission in this area is assumed to be able to relay frames between the AP and nodes in the shaded area that is outside the coverage and cannot reach the AP. By using the proposed technology, it is possible to provide the seamless Internet access service to nodes at the ad-hoc mode in the shaded area. In this paper, we explains the operation of the detection method of the switching area, presents the flowchart and implementation environment. To prove the operation of our technology, we obtain the results of captured packets transmitted between nodes and throughput results through ftp transmission experiment. Hence, we can see that our proposed scheme can be improve the wireless access service in wireless and mobile networks.

Performance Analysis of Single-frame Mode and Multi-Frame Mode in IEEE802.16j MMR System (IEEE802.16j MMR 시스템에서 Single-Frame 방식과 Multi-Frame 방식의 성능 분석)

  • Kim, Seung-Yeon;Kim, Se-Jin;Yoo, Chang-Jin;Ryu, Seung-Wan;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6B
    • /
    • pp.403-410
    • /
    • 2008
  • In this paper, we investigate the performance of MMR system in Non-transparent mode. The IEEE 802.16j MMR system has two node of operation, Single-frame (in band) and Multi-frame (out band) mode. In the analysis, we assume that channel interference between MR-BS and RS, or between RSs anywhere in the given area is ignored. The performance is presented in terms of the delay and the frame efficiency by varying number of RS and BS coverage to RS coverage ratio and the maximum coverage area of a BS by varying traffic density. Analytical results show that the Single-frame is more efficient than Multi-frame in frame efficiency and coverage extension.

Residual Voltage Reduction of Coaxial Surge Arrestor Using Ceramic Filler (세라믹 필터를 이용한 동축 서지어레스터의 잔류전압 저감)

  • Eom, Ju-Hong;Cho, Sung-Chul;Lee, Tae-Hyung;Lee, Young-Chul
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.2
    • /
    • pp.46-53
    • /
    • 2007
  • Extension of the mobile communication and the rapidly developing services connected with wireless multimedia(W-CDMA, DMB, Wibro, and so on) need great many base station transceiver systems, antennas, and many signal transmission line to embody these services. The min communication appliances system is exposed always in danger of transient overvoltage by direct stroke or induced lightning surge flowing in through antenna because the antenna of base station transceiver system or relay equipment is combined with expensive communication network equipments through signal transmission line. Now, gas discharge tube(GDT) or narrow band stub arrestor which is used by the surge protector for communication use is exposing limitations as for lightning surge protective means of the communication facility with high speed and wide frequency band. Therefore, for improving performance of surge arrestor, we applied ceramic filter which can reduce lightning surge invading from antenna effectively, and proved that ceramic filter is effective in residual voltage reduction through the experimental research.

DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol (DT-GPSR: 지연감내형 GPSR 라우팅 프로토콜)

  • Nam, Jae-Choong;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.189-197
    • /
    • 2016
  • Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

Design of r-Sensor Protocol and Hardware Implementation for Intelligent Home Service (지능형 홈서비스를 위한r-Sensor프로토콜설계 및 하드웨어 구현)

  • Kwak, Tae-Kil;Lee, Bum-Sung;Jung, Jin-Wook;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2113-2119
    • /
    • 2006
  • In this paper, we design the r-Sensor protocol for reliable data transmission in the Intelligent Home Service based on the wireless sensor network environment. The r-Sensor protocol improve the reliability of data transmission and node fairness using simple routing algorithm, congestion control, and loss recovery method that minimize the load of relay node. Reposed routing algorithm find out upstream and downstream nodes using the Network Management packet. Meanwhile, loss recovery algorithm uses the Aggregated-Nack. To apply supposed algorithm, the IHS-AMR(Intelligent Home Service - Automatic Meter Reader) and sensor node are designed and implemented in hardware. The IHS-AMR provides remote metering service and also offers home safety service by internetworking with sensor network, mobile phone network and internet.

An Enhanced Greedy Message Forwarding Protocol for High Mobile Inter-vehicular Communications (고속으로 이동하는 차량간 통신에서 향상된 탐욕 메시지 포워딩 프로토콜)

  • Jang, Hyun-Hee;Yu, Suk-Dae;Park, Jae-Bok;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.3
    • /
    • pp.48-58
    • /
    • 2009
  • Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.