• Title/Summary/Keyword: 중계네트워크

Search Result 366, Processing Time 0.02 seconds

A Cluster Group Head Selection using Trajectory Clustering Technique (궤적 클러스터링 기법을 이용한 클러스터 그룹 헤드 선정)

  • Kim, Jin-Su;Shin, Seung-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.12
    • /
    • pp.5865-5872
    • /
    • 2011
  • Multi-hop communication in clustering system is the technique that forms the cluster to aggregate the sensing data and transmit them to base station through midway cluster head. Cluster head around base station send more packet than that of far from base station. Because of this hot spot problem occurs and cluster head around base station increases energy consumption. In this paper, I propose a cluster group head selection using trajectory clustering technique(CHST). CHST select cluster head and group head using trajectory clustering technique and fitness function and it increases the energy efficiency. Hot spot problem can be solved by selection of cluster group with multi layer and balanced energy consumption using it's fitness function. I also show that proposed CHST is better than previous clustering method at the point of network energy efficiency.

A Hand-off Technique for Cellular Networks Using Game Theory (셀룰라 네트워크에서 게임 이론을 이용한 핸드오프 기법)

  • Hong, Jin-Dae;Lee, Sin-Kyu;Kim, Hyun-Tae;Ra, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2399-2404
    • /
    • 2009
  • In cellular network systems one of the most significant quality metrics to measure quality of performance is the average number of call drops in a system. It ensures that the active calls in the system are successfully completed without being dropped in the mid communication for ultimate customer satisfaction. Hand-off mechanism increases cellular system reliability by seamless continuation of active calls by transferring active calls from one base station to another. In this paper, we study and propose a simple hand-off mechanism using game theory. We conclude that using the simple QoS utility function proposed in this paper, our optimal deterministic hand-off strategy is to transfer the active calls to the base station with greater signal-to-interference ratio (SIR) and greater number of available channels.

Design of Network-based AIS Reference Station System (네트워크 기반 AIS 기준국 시스템 설계)

  • Seo, Ki-Yeol;Park, Sang-Hyun;Jeong, Ho-Cheol;Cho, Deuk-Jae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.824-830
    • /
    • 2010
  • In order to prepare for increasing performance requirement for Differential Global Navigation Satellite System (DGNSS) services of International Maritime Organization (IMO) and International Association of Lighthouse Authorities (IALA), this paper focuses on design of network-based Automatic Identification System (AIS) reference station system that can perform the functionality of Differential Global Positioning System (DGPS) reference station in an AIS base station system. AIS base station receives the differential corrections from the DGPS reference station, and it is not a method for transmitting the received differential corrections to onboard AIS units, but it is a method for generating the optimized differential corrections for onboard AIS units in AIS coverage. Therefore this paper proposes an algorithm for generating the differential corrections at AIS reference station, and performs the performance assessment of the proposed algorithm based on DGPS correction data measured from a DGPS reference station. Finally this paper discusses the test results and efficiency of the proposed system.

Efficient Relay Selection Algorithm Using S-MPR for Ad-Hoc Networks Based on CSMA/CA (CSMA/CA 기반 애드혹 네트워크에서 S-MPR을 이용한 효율적인 중계 노드 선택 알고리즘)

  • Park, Jong-Ho;Oh, Chang-Yeong;Ahn, Ji-Hyoung;Seo, Myung-Hwan;Cho, Hyung-Weon;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.657-667
    • /
    • 2012
  • In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.

Development of Vending Machine for Electricity Based on Z-Wave Mesh Network (Z-Wave 메쉬 네트워크 기반의 전기 자판기 개발)

  • Kang, Ki-beom;Ahn, Hyun-kwon;Kim, Han-soo;Lee, Seung-hyun;Jwa, Jeong-woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1256-1262
    • /
    • 2016
  • As the population of camping is increased in campsites and auto camp sites, the electrical equipment can safely supply electricity to users in a variety of electricity bill policy is required in the campsite. In this paper, we develop the vending machine for electricity that can control the outdoor electrical outlet from the management server using the Z-Wave WPAN and android mobile application. The developed vending machine for electricity consists of the management server, the controller, the outdoor outlet box, and the mobile application. The management server provides reservation and electricity bill payment to users. The management server controls the electrical outlet box through the controller to safely supply electricity to users. The controller that is a relay device between the management server and the switch controls switches based on Z-Wave mesh network. Outdoor electrical outlet box has 2 meter switches. We receive the relevant authorization to provide commercial electricity services using the outdoor electrical outlet box in the campsite.

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.

Epidemic & Prediction based Routing Protocol for Delay Tolerant Network (DTN에서 에피데믹과 예측 기반 알고리즘을 이용한 라우팅 프로토콜)

  • Dho, Yoon-Hyung;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.404-407
    • /
    • 2014
  • Delay Tolerant Network (DTN) is a networking architecture that is designed to solve network problem in unstable and stressed environments using the Store-Carry-Forward method. Different form general networks, DTN does not guarantee the end-to-end connectivity, it is hard for the exiting TCP/IP based protocols to normally work due to the characteristic such as large latency and unstable link connectivity. And the condition that send massage without the information of the destination occurs frequently. Thus, suitable routing protocols for DTN are required and being researched. In this paper, we propose a novel routing protocol for DTN utilizing epidemic and prediction based algorithm to prevent the defect of previously DTN routing protocols such as the absence of the holistic view of the network. Proposed algorithm predicted destination using the mobility information recorded in neighbor node's history and utilize epidemic based algorithm when occurred condition without destination's information. This algorithm is enhanced in terms of delivery ratio, decreases latency and overhead in sparse network such as DTN.

  • PDF

MLP-A(Multi Link Protection for Airborne Network Verifying) algorithms and implementation in multiple air mobile/verification links (다중 공중 이동/검증 링크에서의 MLP-A 알고리즘 및 구현)

  • Youn, Jong-Taek;Jeong, Hyung-jin;Kim, Yongi;Jeon, Joon-Seok;Park, Juman;Joo, Taehwan;Go, Minsun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.3
    • /
    • pp.422-429
    • /
    • 2022
  • In this paper, the intermediate frequency transmission signal level between the network system-based baseband and RF unit consisting of multi-channel airborne relay devices and a lot of mission devices, which are currently undergoing technology development tasks, is kept constant at the reference signal level. Considering the other party's receiving input range, despite changes in the short-range long-range wireless communication environment, it presents a multi-link protection and MLP-A algorithm that allows signals to be transmitted stably and reliably through signal detection automatic gain control, and experiments and analysis considering short-distance and long-distance wireless environments were performed by designing, manufacturing, and implementing RF units to which MLP-A algorithms were applied, and applying distance calculation equations to the configuration of multiple air movements and verification networks. Through this, it was confirmed that a stable and reliable RF communication system can be operated.

A Reputation based Cooperative Routing Scheme for End-to-End Reliable Communications in Multi-hop Wireless Networks (다중 홉 무선 네트워크에서 종단 간 신뢰성 통신을 위한 평판 기반의 협력적 라우팅 기법)

  • Kim, Tae-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1593-1608
    • /
    • 2009
  • If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

  • PDF

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF