• Title/Summary/Keyword: Address Assignment

Search Result 70, Processing Time 0.035 seconds

Adaptable PANID Generation Scheme for Resolving Address Conflict Based on Hash Mechanism in IoT Environment (IoT 환경을 위한 Hash 기반 동적 Zigbee PANID 생성 및 충돌 회피 방안)

  • Lee, Jaeho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2392-2400
    • /
    • 2015
  • Zigbee, which was a representative standard technology for dealing low energy and mesh networks in large deployment area such as smart home, smart building, and massive sensor networks, has been developed and deployed for increasing communication area by using Ad hoc method. It has been originally developed based on IEEE 802.15.4 standard so every node needs 48bit unique address defined by IEEE. However, it is absolutely inefficient to assign an unique address to every communication node where it would be deployed through large-scale network area, e.g., smart lighting and massive sensor networks, because there could be variously multiple companies to deploy network infrastructure and they could have different policy to assign node ID. To prevent the problem, this paper proposes a method of dynamic PANID assignment in overall Personal Coordinators, and also proposes a method for addressing PANID conflict problem which could be derived from dynamic PANID assignment.

Design and Implementation of Beacon based Wireless Sensor Network for Realtime Safety Monitoring in Subway Stations (지하철 역사에서 실시간 안전 모니터링 위한 비컨 기반의 무선 센서 네트워크 설계 및 구현)

  • Kim, Young-Duk;Kang, Won-Seok;An, Jin-Ung;Lee, Dong-Ha;Yu, Jae-Hwang
    • Journal of the Korean Society for Railway
    • /
    • v.11 no.4
    • /
    • pp.364-370
    • /
    • 2008
  • In this paper, we proposed new sensor network architecture with autonomous robots based on beacon mode and implemented real time monitoring system in real test-bed environment. The proposed scheme offers beacon based real-time scheduling for reliable association process with parent nodes and dynamically assigns network address by using NAA (Next Address Assignment) mechanism. For the large scale multi-sensor processing, our real-time monitoring system accomplished the intelligent database processing, which can generate not only the alert messages to the civilians but also process various sensing data such as fire, air, temperature and etc. Moreover, we also developed mobile robot which can support network mobility. Though the performance evaluation by using real test-bed system, we illustrate that our proposed system demonstrates promising performance for emergence monitoring systems.

Effective address assignment method in hierarchical structure of Zigbee network (Zigbee 네트워크 계층 구조에서의 효율적인 주소 할당 방법)

  • Kim, Jae-Hyun;Hur, Soo-Jung;Kang, Won-Sek;Lee, Dong-Ha;Park, Yong-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.20-28
    • /
    • 2007
  • Zigbee sensor network base on IEEE802.15.4 has local address of 2 byte on transmit packet data which is pick up the address for each sensor node. Sensor network is requested low power, low cost, many nodes at hues physical area. There for Zigbee is very good solution supporting for next Ubiquitous generation but the Zigbee sensor network has address allocation problem of each sensor node. Is established standard from Zigbee Alliance, to the address allocation method uses Cskip algorithm. The Cskip algorithm use the hazard which allocates an address must blow Hop of the maximum modification and child node number. There is to address allocation and from theoretically it will be able to compose a personal 65536 sensor nodes only actual with concept or space, only 500 degree will be able to compose expansion or the low Zigbee network. We proposed an address allocation method using coordinate value for Zigbee sensor network.

A Scheme of IP address Auto-configuration for Mobile Ad-hoc NETwork (이동 애드혹 네트워크에서 자동주소 설정 기술)

  • Hwang, Jin-Ok;Youn, Joo-Sang;Park, So-Young;Min, Sung-Gi
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.489-491
    • /
    • 2009
  • Recently, a range of diverse networks are undergoing speedy evolution and inspiring variety applications. Among many networks, mobile Ad-Hoc networks (MANETs) are active working with a part of routing protocols. But, the majority of routing protocols have required a unique identifier, such as an IP address. At this while, IP address assignment scheme in MANET remains unsolved. When a centralized agent server is not exist, IP address is an critical issue such as a single MANET. This paper look over previous work about basic principles, also we suggest simple solution to overcome the power of two ($2^m$).

  • PDF

Absolute Differentiated Services for Optical Burst Switching Networks Using Dynamic Wavelength Assignment (동적 파장 할당 기법을 이용한 광 버스트 스위칭 네트워크에서의 절대적 QoS 제공)

  • 김성창;최진식;강민호
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.8-15
    • /
    • 2003
  • In this paper, we address how to provide absolute differentiated services for optical burst switching (OBS) networks based on dynamic wavelength assignment. Unlike existing quality of service (QoS), such as buffer-based and offset-time based scheme, our proposed dynamicvirtual lambda partitioning (DVLP) scheme does not mandate any buffer or extra offset time, but can achieve absolute service differentiation between classes. This new DVLP scheme shares wavelength resources based on several different priority of classes in an efficient and QoS guaranteed manner. The performance results show that the proposed scheme effectively guarantees a target blocking probability of each traffic classes both in Poisson and Self-similar traffic environment.

On the Use of Adaptive Weight Functions in Wavelength-Continuous WDM Multi-Fiber Networks under Dynamic Traffic

  • Miliotis Konstantinos V.;Papadimitriou Georgios I.;Pomportsis Andreas S.
    • Journal of Communications and Networks
    • /
    • v.7 no.4
    • /
    • pp.499-508
    • /
    • 2005
  • In this paper, we address the problem of efficient routing and wavelength assignment (RWA) in multi-fiber wavelength division multiplexing (WDM) networks without wavelength translation, under dynamic traffic. We couple Dijkstra's shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for regular and irregular WDM multi-fiber network topologies in terms of blocking probability and overall link utilization.

An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System (임베디드 시스템에서 DSP를 위한 메모리 접근 변수 저장의 최적화 ILP 알고리즘)

  • Chang, Jeong-Uk;Lin, Chi-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.59-66
    • /
    • 2013
  • In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. Therefor, we proved to reduce the execution time of programs.

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 Enhancement Technique of IP Address Reusability over the Dynamic IP Address Assignment Method (동적 IP 주소 할당방식의 IP주소 재사용 효율 증가 기법)

  • Bae Byeong-Sook;Yang Jun-Whan;Kim Jae-Dong;Min Kyeong-Seon
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2003.08a
    • /
    • pp.244-248
    • /
    • 2003
  • DHCP를 이용한 동적 IP주소 할당방식에서 클라이언트가 네트워크 접속을 해제하면서 IP 주소를 자동적으로 반납하지 않음으로 인해 IP 주소 회수가 즉각 이루어지지 않아 IP 주소 재활용을(reusability)이 저하된다. IP 주소의 재활용율을 증가시키면서 DHCP 서버의 부하증가 및 네트워크의 트래픽 증가 최소화를 위한 두 가지 기법으로 DHCP 서버에서 IP 주소의 임대시간을 적응적으로 조정하는 기법과 ICMP echo request 및 reply 메시지를 통한 클라이언트의 동작유무 확인을 통해 비동작 클라이언트의 IP 주소 회수 기법을 제안한다.

  • PDF

Address Assignment and outing Rules for 6Bone KR Evolution (6Bone KR 진화를 위한 주소 할당 및 라우팅 규칙)

  • 이종국;신명기
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.483-485
    • /
    • 1998
  • 6Bone(IPv6 Backbone)은 IPv6 환경의 개발 촉진 및 진화를 위해 만든 전세계적인 실험망이다. 본 논문은 국내 6Bone인 6Bone KR의 구축을 위해 주소 할당 및 라우팅 규칙을 정의한 내용을 기술한다. 기존의 6Bone 주소 구조를 알아보고, 6Bone KR의 주소 체계가 어떻게 기존의 6Bon을 따르면서, 6Bone KR의 계층적 전개를 위한 연결 규칙을 가지는 가를 살펴본다. 그리고 현재 6Bone KR이 구성된 상황과 개발한 연결 테스트의 프로그램을 소개한다. 이밖에 6Bone KR진화를 위한 몇 가지 고려사항들을 분석하고, 이것을 기반으로 Renumbering을 이용한 새로운 이동 IPv6 환경을 제안한다.

  • PDF