• Title/Summary/Keyword: power-based routing

Search Result 240, Processing Time 0.027 seconds

A Design of Multi-hop Network Protocol based on LoRaWAN Gateway

  • Kim, Minyoung;Jang, Jongwook
    • International journal of advanced smart convergence
    • /
    • v.8 no.2
    • /
    • pp.109-115
    • /
    • 2019
  • Currently, LPWA(Low Power Wide Area) communication technology is widely used due to the development of IoT(Internet of Things) technology. Among the LPWA technologies, LoRaWAN(Long Range Wide Area Network) is widely used in many fields due to its wide coverage, stable communication speed, and low-cost modem module prices. In particular, LoRa(Long Range) can easily construct LoRaWAN with a dedicated gateway. So many organizations are building their own LoRaWAN-based networks. The LoRaWAN Gateway receives the LoRa packet transmitted from an End-device installed in the adjacent location, converts it into the Internet protocol, and sends the packet to the final destination server. Current LoRa Gateway uses a single-hop method, and each gateway must include a communication network capable of the Internet. If it is the mobile communication(i.e., WCDMA, LTE, etc.) network, it is required to pay the internet usage fee which is installed in each gateway. If the LoRa communication is frequent, the user has to spend a lot of money. We propose an idea on how to design a multi-hop protocol which enables packet routing between gateways by analyzing the LoRaWAN communication method implemented in its existing single-hop way in this paper. For this purpose, this paper provides an analysis of the standard specification of LoRaWAN and explains what was considered when such protocol was designed. In this paper, two gateways have been placed based on the functional role so as to make the multi-hop protocol realized: (i) hopping gateway which receives packets from the end-device and forwards them to another gateway; and (ii) main gateway which finally transmits packets forwarded from the hopping gateway to the server via internet. Moreover, taking into account that LoRaWAN is wireless mobile communication, a level-based routing method is also included. If the protocol proposed by this paper is applied to the LoRaWAN network, the monthly internet fee incurred for the gateway will be reduced and the reliability of data transmission will be increased.

A Solution for Void Grid in Routing Protocol Supporting Mobile Sink on Sensor Network (센서 네트워크에서 모바일 싱크를 지원하는 라우팅 프로토콜의 void grid를 해결하기 위한 방안)

  • Jo, Ji-Eun;Choe, Jong-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.306-309
    • /
    • 2007
  • 센서 네트워크에서 고려해야 하는 중요한 사항중 하나는 제한된 자원을 가진 센서 네트워크에서 주어진 에너지 소모를 최소화 하여서 네트워크 수명을 연장하는 것이다. 그러나 기존에 제안된 프로토콜은 유동성을 지닌 여러 개의 싱크가 존재할 경우에는 비효율 적인 문제가 발생하였으며 그러한 문제를 해결하기 위해서 여러 가지 프로토콜이 제안 되었다. 본 논문에서는 기존에 제안된 그리드 형태를 이용한 클러스터 기반의 라우팅 프로토콜인 CBPER(Cluster-based -Power-Efficient Routing)을 기반으로 이 프로토콜이 가지는 영구적인 그리드 형성시 발생할 수 있는 void grid 문제를 해결하고자 한다.

  • PDF

Optimal Routing for Distribution System Planning using heuristic strategy (휴리스틱 탐색전략을 이용한 배전계통 계획의 최적경로탐색)

  • Choi, Nam-Jin;Kim, Byung-Seop;Shin, Joong-Rin;Chae, Myung-Suk
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.142-146
    • /
    • 2000
  • This paper Presents a heuristic algorithm based on branch exchange method to solve ORP (Optimal Routing Problem) for distribution system planning. The ORP is a complex task which is generally formulated as a combinatorial optimization problem with various constraints. The cost function of ORP is consisted of the investment cost and the system operation cost that is generally expressed with system power loss. This paper also adopt an specialy designed selection method of maximum loss reduction loop and branch to reduce optimization time. The effectiveness of the proposed algorithm was shown with 32, 69 bus example system.

  • PDF

Optimal Routing Based on Genetic Algorithms for Distribution System Planning (유전 알고리즘을 이용한 배전 계통 계획의 최적 경로 탐색)

  • Kim, Min-Soo;Kim, Byung-Seop;Shin, Joong-Rin;Yim, Han-Suck
    • Proceedings of the KIEE Conference
    • /
    • 1999.11b
    • /
    • pp.137-140
    • /
    • 1999
  • This paper presents an application of the Genetic Algorithms(GA) to solve the optimal routing problem(ORP) in power distribution system planning. Since the ORP is, in general, modeled as a mixed integer problem with some various mathematical constraints, it is hard to solve. In this paper, a new approach was made using the GA method for the ORP to overcome the disadvantages which many conventional methods generally have. For this approach, proposed was in this study a appropriately designed fitness function suited for the ORP. The proposed algorithm has been tested in sample network and the results are presented.

  • PDF

Routing Algorithm in Bluetooth Ad Hoc Networks of Mobile Hosts (Bluetooth Ad Hoc 망 모바일 호스트상의 라우팅 알고리즘 분석)

  • 이광재;김동현;최삼길;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.117-120
    • /
    • 2002
  • Bluetooth uses baseband of 2.4G ISM and composes radio Ad Hoc network based on Ad Hoc wireless connectivity which it used low power and low complexity solution. Bluetooth designed as can play detect, connect, discover service by surrounding other device even if users do not get acquainted all to Bluetooth. This paper operate wish to recognize mobility to routing algorithm how communication method and radio network in Bluetooth.

  • PDF

Development of Real-time Condition Monitoring System for Container Cranes (컨테이너 크레인 실시간 설비진단 시스템 개발)

  • Jung, D.U.;Choo, Y.Y.
    • Journal of Power System Engineering
    • /
    • v.12 no.6
    • /
    • pp.18-23
    • /
    • 2008
  • This paper describes development of real-time condition monitoring system to observe state of a container crane in a port. To analyze the state of a crane, the strength and the direction of wind are measured with sensors along with the load resulted a crane at the moment. The measured signals are processed by especially developed conditioning board and converted into digital data. Measured data are analyzed to define the state of the crane at an indicator. For transmission of these data to the indicator, we implemented wireless sensor network based on IEEE 802.15.4 MAC(Media Access Control) protocol and Bluetooth network protocol. To extend the networking distance between the indicator and sensor nodes, the shortest path routing algorithm was applied for WSN(Wireless Sensor Network) networks. The indicator sends the state information of the crane to monitoring server through IEEE 802.11 b wireless LAN(Local Area Network). Monitoring server decides whether alarm should be issued or not. The performance of developed WSN and Bluetooth network were evaluated and analyzed in terms of communication delay and throughput.

  • PDF

A Metaheuristic Approach Towards Enhancement of Network Lifetime in Wireless Sensor Networks

  • J. Samuel Manoharan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1276-1295
    • /
    • 2023
  • Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.

Flexible Intelligent Exit Sign Management of Cloud-Connected Buildings

  • Lee, Minwoo;Mariappan, Vinayagam;Lee, Junghoon;Cho, Juphil;Cha, Jaesang
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.58-63
    • /
    • 2017
  • Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.

A routing protocol based on Context-Awareness for Energy Conserving in MANET

  • Chen, Yun;Lee, Kang-Whan
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.104-108
    • /
    • 2007
  • Ad hoc networks are a type of mobile network that function without any fixed infrastructure. One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. This paper proposes a method for improving the low power distributed MAC. This method is based on the context awareness of the each nodes energy in clustering. We propose to select a new scheme to optimize energy conserving between the clustering nodes in MANET. And this architecture scheme would use context-aware considering the energy related information such as energy, RF strength, relative distances between each node in mobile ad hoc networks. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

Power, Degree and Selection Information-Aware Connected Dominating Set Construction Algorithm in Ad-hoc Wireless Networks (무선 Ad-hoc 네트워크에서 전력, 연결강도 및 이력 정보를 고려한 Connected Dominating Set 구성 방법)

  • Ha, Deok-Kyu;Song, Young-Jun;Kim, Dong-Woo;Kim, Young-Joon;Lee, In-Sung
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.8
    • /
    • pp.49-56
    • /
    • 2009
  • In this paper, we propose a method of energy level, node degree and selection information based CDS(Connected Dominating Set) construction algorithm for more efficient routing in ad-hoc wireless networks. Constructing CDS in ad-hoc wireless network, it is necessary to make more efficient algorithm that is faster, more simple and has low power consumption. A CDS must be minimized because nodes in the CDS consume more energy in order to handle various bypass traffics than nodes outside the set. It is better not to reconstruct CDS after constructing the most efficient CDS. To overcome this problem, we proposed the CDS construction algorithms based on EL+ND+Sel method. We compared and estimated the performance in each situation of EL + ND and EL + ND + Sel.