• Title/Summary/Keyword: 애드 혹 무선 네트워크

Search Result 303, Processing Time 0.024 seconds

Resource Collision Avoidance Method Based on Mobility Model in Flying Ad hoc Networks (비행 애드혹 네트워크에서 시분할 다중접속 기반 자원 충돌 회피 기법)

  • Bang, Jung-hyun;Lee, Hye-jin;Kang, Shin-hee;Song, Mi-jin;Oh, Yu-taek;Lee, Ga-on
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.300-302
    • /
    • 2022
  • In this paper, We propose a mobility model-based resource collision avoidance technique that can share radio resources without resource collision between UAV in a FANET environment. The proposed technique tries to reduce the occurrence of resource collisions by estimating UAV mobility based on information obtained from GPS devices installed in UAV. Through simulations, The performance was compared with the contention-based protocol, and it was confirmed that the proposed algorithm can reduce resource collisions.

  • PDF

Load Balancing Schemes in the MANET with Multiple Internet Gateways (다중 인터넷 게이트웨이를 갖는 MANET의 부하 균등화 기법)

  • Kim, Young-Min;Lim, Yu-Jin;Yu, Hyun;Lee, Jae-Hwoon;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.621-626
    • /
    • 2006
  • A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

Design and Implementation of Network Self-Configuration Based on Bluetooth (Bluetooth 기반 네트워크 자동형성 설계 및 구현)

  • Kang, Seong-Ho;Choo, Young-Yeol
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1376-1384
    • /
    • 2008
  • Numerous researches on network self-configuration have been conducted on Wireless Sensor Network (WSN) and Ad Hoc network but the results have not been applied yet for factory automation. This paper presents development of intelligent process management systems conducting process monitoring and control irrelevant to physical position of a plant operator. The systems are indispensable for diagnosis of rotating machines which cannot exploit wired network. The system was implemented in a Personal Digital Assistant (PDA) using Bluetooth communication protocol. When a mobile terminal reaches to communication range of the process management server, the server detects the mobile terminal to reconfigure plant network automatically. The server authenticates a user of the terminal to download and installs monitoring and control program considering authorized level of the user. If the terminal leaves communication range of the server, it deletes the node from the network and removes the program automatically to save resources and prevent security problems such as missing terminal. Operation of developed functions was verified in a testbed emulating steel-making plant.

  • PDF

Rerouting Method for MANET Using Local Path Modification (MANET에서 부분 경로 변경을 이용한 재라우팅 기법)

  • Suh, Hyo-Joong;Hwang, Hoyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.9
    • /
    • pp.620-628
    • /
    • 2014
  • Various on-demand manner routing protocols have been proposed for efficient energy consumption in mobile ad-hoc networks. Some of the protocols tried to extend the network lifetime by periodically rerouting paths according to the energy consumption rate of nodes. However, those protocols suffer from frequent flooding and high overhead. This paper proposed a new routing protocol called ALPMR (Adaptive Local Path Modification Routing) that extends the network lifetime by using local path rerouting. The proposed ALPMR protocol performs local rerouting around nodes with little remaining energy as well as data congestion, thus reduces flooding and routing overhead and can extend the network lifetime. The performance of ALPMR protocol is observed using ns-2 simulator.

Stochastic Mobility Model Design in Mobile WSN (WSN 노드 이동 환경에서 stochastic 모델 설계)

  • Yun, Dai Yeol;Yoon, Chang-Pyo;Hwang, Chi-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.8
    • /
    • pp.1082-1087
    • /
    • 2021
  • In MANET(mobile ad hoc network), Mobility models vary according to the application-specific goals. The most widely used Random WayPoint Mobility Model(RWPMM) is advantageous because it is simple and easy to implement, but the random characteristic of nodes' movement is not enough to express the mobile characteristics of the entire sensor nodes' movements. The random mobility model is insufficient to express the inherent movement characteristics of the entire sensor nodes' movements. In the proposed Stochastic mobility model, To express the overall nodes movement characteristics of the network, the moving nodes are treated as random variables having a specific probability distribution characteristic. The proposed Stochastic mobility model is more stable and energy-efficient than the existing random mobility model applies to the routing protocol to ensure improved performances in terms of energy efficiency.

On Generating Backbone Based on Energy and Connectivity for WSNs (무선 센서네트워크에서 노드의 에너지와 연결성을 고려한 클러스터 기반의 백본 생성 알고리즘)

  • Shin, In-Young;Kim, Moon-Seong;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.41-47
    • /
    • 2009
  • Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

  • PDF

A Key Management Scheme for Ad hoc Sensor Networks (애드 혹 센서 네트워크를 위한 키 관리 방안)

  • Kim Seung-Hae;Chung Byung-Ho;Wang Gi-Cheol;Cho Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.32-40
    • /
    • 2006
  • It is very important to establish a pairwise key securely in wireless sensor networks. Because sensor networks consist of devices with weak physical security, they are likely to be compromised by an attacker. However, some approaches using key pre-distribution and other approaches using one hop local keys are known to be very vulnerable to threats caused by compromised nodes, even a small number. This paper proposes a scheme where each node establishes three hop local keys and employs them for a later pairwise key establishment. When any two nodes agree a pairwise key, all nodes on the route between two nodes contribute to the agreement of the pairwise key. Here, the initial three hop local keys are employed for encrypting a secret key delivered from a node to other nodes. Therefore, the proposed scheme bothers attackers to compromise much more nodes than the scheme using one hop local keys only. The simulation results have proven that the proposed scheme provides better performance and higher security than the scheme using one hop local keys in terms of message exchange, the number of encryption and decryption, and pairwise key exposure rate.

Iterative Approximation of Carrier Sensing Radius in CSMA-based Wireless Ad Hoc Networks (CSMA 기반 무선 애드 혹 네트워크에서 반송파 감지 반경의 반복적 근사 기법)

  • Seol, Jae-Young;Kim, Seong-Lyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12A
    • /
    • pp.1006-1014
    • /
    • 2011
  • Recently, as CSMA technique has been increasingly adopted in various wireless networks, extensive researches to analyze the statistical characteristics of CSMA-based wireless networks have been done. Despite the ongoing efforts, there still remain many difficulties in the analysis because of unexpectable operational behavior of CSMA. Previous literature studying CSMA networks used the concept of the carrier sensing radius to reflect the carrier sensing function. However, since the carrier sensing radius based on the protocol model is not affected by the aggregate interference from other nodes, the derived statistical models cannot avoid approximation errors especially if the network is under high interference. In this paper, we propose an algorithm to derive the carrier sensing radius considering the physical model, where the carrier sensing radius reflecting the aggregate interference is found. For the purpose of this, we analyze the aggregate interference model and the behavior of CSMA function. Based on the analysis, we propose an iterative approximation algorithm for the physical carrier sensing radius. Extensive simulations and results show that the proposed algorithm can contribute to considerably reduce the statistical modeling error of a CSMA network under various channel conditions.

Multi-hop Routing Protocol based on Neighbor Conditions in Multichannel Ad-hoc Cognitive Radio Networks (인지 무선 애드혹 네트워크에서의 주변 상황을 고려한 협력적 멀티홉 라우팅 방법)

  • Park, Goon-Woo;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.369-379
    • /
    • 2011
  • During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

A Routing Protocol of Optimal Medium per Hop based on a Max-Win Method (OMH-MW) for Overlapped Maritime Data Networks with Multiple Media (다중무선매체로 중첩된 해상데이터망을 위한 최다승기반 홉 단위 최적매체 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.35 no.5
    • /
    • pp.667-674
    • /
    • 2011
  • Data networks at sea will be overlapped networks with not only traditional carriers such as RF, satellites but also BWA like wireless LAN, WiBro, and WCDMA in near future. In this paper, an overlapped MANET model for data networks at sea, and a routing protocol (OMH-MW) selecting optimal transmission medium for each hop in routes are proposed. OMH-MW measures the optimality of each medium regarding the transmission characteristics of each application and those of the medium in together. The most suitable medium to each link is selected as the link in routes. Performances are compared with those of the MWR (Max-Win based Routing protocol searching optimal routes with only one medium).