• Title/Summary/Keyword: Node-to-Link

Search Result 584, Processing Time 0.023 seconds

A Signal Characteristic Based Cluster Scheme for Aeronautical Ad Hoc Networks

  • Tian, Yu;Ma, Linhua;Ru, Le;Tang, Hong;Song, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3439-3457
    • /
    • 2014
  • Clustering is an effective method for improving the performance of large scale mobile ad hoc networks. However, when the moving speed is very fast, the topology changes quickly, which leads to frequent cluster topology updates. The drastically increasing control overheads severely threaten the throughput of the network. SCBCS (Signal Characteristic Based Cluster Scheme) is proposed as a method to potentially reduce the control overheads caused by cluster formation and maintenance in aeronautical ad hoc networks. Each node periodically broadcasts Hello packets. The Hello packets can be replaced by data packets, which preserve bandwidth. The characteristics of the received packets, such as the Doppler shift and the power of two successive Hello packets, help to calculate the relative speed and direction of motion. Then, the link connection lifetime is estimated by the relative speed and direction of motion. In the clustering formation procedure, the node with the longest estimated link connection time to its one-hop neighbors is chosen as the cluster head. In the cluster maintenance procedure, re-affiliation and re-clustering schemes are designed to keep the clusters more stable. The re-clustering phenomenon is reduced by limiting the ripple effect. Simulations have shown that SCBCS prolongs the link connection lifetime and the cluster lifetime, which can reduce the topology update overheads in highly dynamic aeronautical ad hoc networks.

Study on the Building Method of a Sensor Network based on BLE Beacons with WPTS (WPTS BLE 비콘 기반 센서 네트워크 구축 방안 연구)

  • Jang, Ho-Deok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.1
    • /
    • pp.8-13
    • /
    • 2022
  • This paper investigates the method to implement a RF (Radio Frequency) energy harvesting sensor node and to build a sensor network using a CATV network and a leaky coaxial cable. The power supply of a sensor node is designed with the WPTS (Wireless Power Transfer System) receiver operating at 915MHz. A sensor network has limited coverage by the loss of RF signal at a wireless transmission link. The paper proposes to build a sensor network that the BLE signal of a sensor and the signal of a WPTS power transmitter are transmitted through a coaxial cable of a CATV network by utilizing WOC (WiFi over Coax) technology and radiates at a leaky coaxial cable. The length of a leaky coaxial cable and the total loss of a wire link are allowed to the point that the RSSI of a sensor node is more than the minimum value (-78dBm) and lead to extend wireless coverage.

IPv6 Networking with Subnet ID Deprecated

  • Kim, Young Hee;Kim, Dae Young;Park, Jong Won
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.2
    • /
    • pp.49-57
    • /
    • 2017
  • This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

A Routing Protocol for Improving Node Survivability in Tactical Ad-hoc Network (전술 Ad-hoc 네트워크에서 노드 생존성 향상을 위한 프로토콜 설계)

  • Kim, Young-An;Park, Gun-Woo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.1
    • /
    • pp.56-64
    • /
    • 2013
  • TICN, a next-generation tactical communication network based on a wireless network, acts as the backbone of the whole network. TICN requires the routing which takes both survivability of passage, reliability, and safety of wireless link into consideration. A tactical network like TICN may maintain the passage for just a short period of time due to topology's frequent changes; In this process all nodes, dependent on batteries for their necessary energy, are restricted by batteries' durability in due course. To overcome this shortcoming, the up-to-date protocols consider only either of diminishing or balancing out energy consumptions. Thus there was a limitation to enhancing both throughput and energy efficiency. The thesis proposes a protocol which regards both throughput and energy efficiency, and enhances node survivability by means of minimizing and balancing energy consumption of the whole network. The protocol brings out an improvement in throughput and makes each node's energy usage more effective.

An Efficient Routing Scheme based on Link Quality and Load Balancing for Wireless Sensor Networks (무선 센서 네트워크에서 링크 상태 및 트래픽 분산 정보를 이용한 효과적인 라우팅 방법)

  • Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.11-19
    • /
    • 2010
  • ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

Optimal Path Finding Considering Smart Card Terminal ID Chain OD - Focused on Seoul Metropolitan Railway Network - (교통카드 단말기ID Chain OD를 반영한 최적경로탐색 - 수도권 철도 네트워크를 중심으로 -)

  • Lee, Mee Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.40-53
    • /
    • 2018
  • In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.

Searching and Autoalignment Method for Indoor Free-space Optical Communication (실내용 자유 공간 광 통신을 위한 수신단의 위치 탐색 및 자동 링크 정렬 방법)

  • Lee, Kwanyong;Cho, Seung-Rae;Lee, Chang-Hee
    • Korean Journal of Optics and Photonics
    • /
    • v.30 no.6
    • /
    • pp.230-236
    • /
    • 2019
  • We propose and demonstrate a searching and autoalignment method for indoor optical wireless communication, using a cost-effective retroreflective sheet and a microelectromechanical system (MEMS) mirror. We use an extremum-seeking method for a single axis and beam steering with a MEMS mirror to maintain a line of sight (LOS) with the optical link. This autoalignment method shows a receiver sensitivity of -31.87 dBm for a bit rate of 2.5 Gb/s over a 7 m communication link.

Using The Fixed ZRP Based MANET (MANET 기반의 Fixed ZRP를 이용한 효율적인 경로 탐색 기법)

  • Kim, Nack Hyun;Lee, Hoon Jae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.463-466
    • /
    • 2009
  • MANET(Mobile Ad-Hoc Network) mean network that configured to mobile device without the help of Fixed infra. Node in MANET constraints have such as liquidity and battery. Node concentrated areas or the size of the network becomes large that causes some issues. It's the problem of routing overhead when path set, path navigation and reset path. In this paper ZRP(Zone Routing Protocol) and ZHLS(Zone-Based Hierarchical Link State) are analyzed. As a result, offers the Fixed ZRP.

  • PDF

Link Energy Efficiency Routing Strategy for Optimizing Energy Consumption of WBAN (WBAN의 에너지 소비 최적화를 위한 링크 에너지 효율 라우팅 전략)

  • Lee, Jung-jae
    • Journal of Internet Computing and Services
    • /
    • v.23 no.5
    • /
    • pp.1-7
    • /
    • 2022
  • IoT technology that utilizes wireless body area networks (WBAN) and biosensors is an important field in the health industry to minimize resources and monitor patients. In order to integrate IoT and WBAN, a cooperative protocol that constitutes WBAN's limited sensor nodes and rapid routing for efficient data transmission is required. In this paper we propose an we propose an energy efficient and cooperative link energy-efficient routing strategy(LEERS) to solve the problems of redundant data transmission detection and limited network sensor lifetime extention. The proposed scheme considers the hop count node congestion level towards the residual energy sink and bandwidth and parameters. In addition, by determining the path cost function and providing effective multi-hop routing, it is shown that the existing method is improved in terms of residual energy and throughput

Cross-Layer Service Discovery Scheme for Hybrid Ad-hoc Networks (하이브리드 애드-혹 네트워크를 위한 크로스-레이어 서비스 검색 기법)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.223-228
    • /
    • 2009
  • Efficient service discovery mechanism is a crucial feature for a hybrid ad-hoc network supporting extension of a wireless ad-hoc network to the Internet. We propose an efficient cross-layer service discovery mechanism using non-disjoint multi-path source routing protocol for hybrid ad-hoc networks. Our scheme has advantages of multi-path routing protocol and cross-layer service discovery. Intuitively, it is not difficult to imagine that the cross-layer service discovery mechanism could result in a decreased number of messages compared to the traditional approach for handling routing independently from service discovery. By simulation, we show that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.