• Title/Summary/Keyword: ZigBee routing

Search Result 37, Processing Time 0.023 seconds

An Efficient Search Algorithm for Shorten Routing Path in ZigBee Networks (ZigBee 네트워크에서 효율적인 단축 경로 검색 알고리즘)

  • Kim, Doo-Hyun;Cho, Sung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1535-1541
    • /
    • 2009
  • In this paper, we suggest an efficient path searching algorithm that reduces the hop count when each node sends a data in ZigBee networks. As the hop count reduces, the network traffic is also reduces and leads to less energy consumption. This enables the sensor network live longer with limited node power. The proposed path searching algorithm consists of two sub-algorithms. One for upstream process and the other for downstream process. When a node selects its proper routing path, the node not only uses the information of the parent and child node, but it also uses the neighbor nodes for each node. In the simulation, we changed various network environment factors such as network parameters, number of nodes, and number of neighbor nodes and observed their performances. We compare the performance to the previous ZigBee Tree routing algorithm with separate two algorithms, the upstream and the downstream, and then compare the performance when all two algorithms are applied.

ZigBee Security Using Attribute-Based Proxy Re-encryption

  • Seo, Hwajeong;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.4
    • /
    • pp.343-348
    • /
    • 2012
  • ZigBee Network is enabling technology for home automation, surveillance and monitoring system. For better secure network environment, secure and robust security model is important. The paper proposes an application, attribute-based proxy re-encryption on ZigBee networks. The method can distribute the authority to designated sensor nodes to decrypt re-encrypted ciphertext with associated attributes. However, a previous method is required to compute complex pairing operations. The high complexity is not suited to low resource device sensor networks, and it does not provide routing security either. To resolve these problems, we present a novel mechanism. The method can reduce overhead by imposing overhead to full function devices and ensure routing paths as well.

Design and Implementation of an Real-time Bio-signals Monitoring System Using ZigBee and SIP (ZigBee와 SIP를 이용한 실시간 생체 신호 모니터링 시스템의 설계 및 구현)

  • Kim, Young-Joon;Jung, In-Gyo;Yang, Yong-Ho;Kim, Bo-Nam;Lee, In-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.1
    • /
    • pp.62-69
    • /
    • 2008
  • In this paper, we proposed the real-time bio-signals monitoring system that is based on the ZigBee wireless sensor network and SIP. This system makes medical team and user easily confirm user's medical state irrelative to their location and time. The communication between medical sensors and the user's end device uses the ZigBee wireless sensor network. The power consumption was decreased because wireless sensor network does not use the Ad-hoc routing protocol but routing protocol that is based on tree structure. Our proposed system includes a wireless user's end device, monitoring console, SIP server and database server. This real-time bio-signals monitoring system makes possible to implement the U-health care services and improving efficiency of medical treatment services.

Enhanced Routing Algorithm for ZigBee using a Family Set of a Destination Node (목적지의 가족집합을 이용한 향상된 ZigBee 라우팅 알고리즘)

  • Shin, Hyun-Jae;Ahn, Sae-Young;Jo, Young-Jun;An, Sun-Shin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.12
    • /
    • pp.2329-2336
    • /
    • 2010
  • Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.

IEEE 802.15.4 and ZigBee Protocol : ZIGBEE Network Layer Using Ad-hoc On-Demand Distance Vector Routing (IEEE 802.15.4와 ZigBee Protocol : ZIGBEE Network Layer이 사용하는 AODV)

  • Lee Won-Geun
    • Annual Conference of KIPS
    • /
    • 2006.05a
    • /
    • pp.1287-1290
    • /
    • 2006
  • 무선 네트워크의 전송 방식은 유선 네트워크와 다르며, 따라서 유선 네트워크를 기반으로 설계된 인터넷 프로토콜(TCP/IP)은 무선네트워크 환경에서 불안정 하게 작동한다. 본 논문에서는 기존의 유선 인터넷에 맞춰진 전송 프로토콜인 UDP와 TCP를 802.15.4 MAC기반의 ZigBee Protocol 환경에서 사용되는 특성과 AODV 및 확장 프로토콜인 AOMDV를 통해 인터넷에 결합된 네트워크 인터페이스를 가진 노드들의 특성과 관리의 중요함을 확인한다

  • PDF

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.

Allocation algorithm applied building addressing value the coordinate in Smart Grid Environments (스마트그리드 환경에서 좌표 값을 적용한 빌딩 주소 할당 방법)

  • Im, Song-Bin;Oh, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1C
    • /
    • pp.45-53
    • /
    • 2012
  • In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than $Cskip$ algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignmen.

Distributed Borrowing Addressing Scheme for ZigBee/IEEE 802.15.4 Wireless Sensor Networks

  • Park, Sung-Jin;Lee, Eun-Ju;Ryu, Jae-Hong;Joo, Seong-Soon;Kim, Hyung-Seok
    • ETRI Journal
    • /
    • v.31 no.5
    • /
    • pp.525-533
    • /
    • 2009
  • This paper proposes a distributed borrowing addressing (DIBA) scheme to solve problems of failure in address assignments resulting from limited tree depth and width when the distributed address assignment mechanism is used in a ZigBee/IEEE 802.15.4 wireless sensor network. DIBA is a method of borrowing addresses from neighbor nodes for newly entering nodes and assigning the borrowed addresses. Its network or sensing coverage can increase with almost the same overhead as the existing method. DIBA is a simple and lightweight means of addressing and routing, making it suitable for wireless sensor networks. Simulations showed that DIBA is a distributed addressing scheme with consistently excellent performance.

An Algorithm for Improving Hierarchical Routing in ZigBee Networks (ZigBee 네트워크의 계층적 라우팅의 성능 향상을 위한 알고리즘)

  • Ha, J.Y.;Shin, S.Y.;Choi, J.Y.;Lee, J.W.;Kim, N.H.;Kwon, W.H.
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.11-12
    • /
    • 2006
  • An algorithm to improve the efficiency of the hierarchical routing in ZigBee Networks is proposed. By forwarding the data to the nearest neighbor in the hierarchy, more efficient path can be achieved without any control and memory overhead. Simulation results shows the proposed algorithm provides about 20% shorter path.

  • PDF