• Title/Summary/Keyword: Routing Scheme

Search Result 821, Processing Time 0.024 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.

Contribution-Level-Based Opportunistic Flooding for Wireless Multihop Networks (무선 다중 홉 환경을 위한 기여도 기반의 기회적 플러딩 기법)

  • Byeon, Seung-gyu;Seo, Hyeong-yun;Kim, Jong-deok
    • Journal of KIISE
    • /
    • v.42 no.6
    • /
    • pp.791-800
    • /
    • 2015
  • In this paper, we propose the contribution-level-based opportunistic flooding in a wireless multihop network which achieves outstanding transmission efficiency and reliability. While the potential of the the predetermined relay node to fail in its receipt of broadcast packets is due to the inherent instability in wireless networks, our proposed flooding actually increases network reliability by applying the concept of opportunistic routing, whereby relay-node selection is dependent on the transmission result. Additionally, depending on the contribution level for the entire network, the proposed technique enhances transmission efficiency through priority adjustment and the removal of needless relay nodes. We use the NS-3 simulator to compare the proposed scheme with dominant pruning. The analysis results show the improved performance in both cases: by 35% compared with blind flooding from the perspective of the transmission efficiency, and by 20~70% compared to dominant pruning from the perspective of the reliability.

Efficient Clustering Algorithm based on Data Entropy for Changing Environment (상황변화에 따른 엔트로피 기반의 클러스터 구성 알고리즘)

  • Choi, Yun-Jeong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3675-3681
    • /
    • 2009
  • One of the most important factors in the lifetime of WSN(Wireless Sensor Network) is the limited resources and static control problem of the sensor nodes. In order to achieve energy efficiency and network utilities, sensor nodes can be well organized into one cluster and selected head node and normal node by dynamic conditions. Various clustering algorithms have been proposed as an efficient way to organize method based on LEACH algorithm. In this paper, we propose an efficient clustering algorithm using information entropy theory based on LEACH algorithm, which is able to recognize environmental differences according to changes from data of sensor nodes. To measure and analyze the changes of clusters, we simply compute the entropy of sensor data and applied it to probability based clustering algorithm. In experiments, we simulate the proposed method and LEACH algorithm. We have shown that our data balanced and energy efficient scheme, has high energy efficiency and network lifetime in two conditions.

A clustering algorithm based on dynamic properties in Mobile Ad-hoc network (에드 혹 네트워크에서 노드의 동적 속성 기반 클러스터링 알고리즘 연구)

  • Oh, Young-Jun;Woo, Byeong-Hun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.3
    • /
    • pp.715-723
    • /
    • 2015
  • In this paper, we propose a context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm in Mobile Ad Hoc Networks. The existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. The proposed algorithm performs cluster formation using a range of direction and threshold of velocity for the base-station, we calculate the exchange of the cluster head node probability using the direction and velocity for maintaining cluster formation. The DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes.

NetLogo Extension Module for the Active Participatory Simulations with GoGo Board (고고보드를 이용한 능동적 참여 모의실험을 위한 NetLogo 확장 모듈)

  • Xiong, Hong-Yu;So, Won-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1363-1372
    • /
    • 2011
  • Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

Proposal Scheme of a D2D Communication in Smart Shipyard (스마트 조선소내 D2D 통신 기술 적용 방안 제안)

  • Kim, Su-Hyun;Lee, Seong Ro;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1261-1266
    • /
    • 2014
  • Smart shipyard, all of the business of shipyard by using a mobile application, and the rapid spread of smart equipment, the overload of infrastructure due to a variety of mobile services is expected. Because macrocell and femtecell to reduce the overloading of existing infrastructure, additional core network devices have a problem, in this paper, the efficiency of resources than the communication over the existing infrastructure smart shipyard network to improve, to apply the D2D communication technology that can reduce the load on the infrastructure. The proposed routing path plan in accordance with the transfer method and the traffic type of network configuration and D2D equipment navigation and data for applying a smart shipyard. Whether to execute the function to overload traffic in the core network can send to the optimized path was confirmed by using the state transition diagram. Smart shipyard, by applying D2D communication allow efficient traffic handling than conventional communication method.

Adjacency-Based Mapping of Mesh Processes for Switch-Based Cluster Systems of Irregular Topology (비규칙 토폴로지 스위치 기반 클러스터 시스템을 위한 메쉬 프로세스의 인접 기반 매핑)

  • Moh, Sang-Man
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.2
    • /
    • pp.1-10
    • /
    • 2010
  • Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

A Multibit Tree Bitmap based Packet Classification (멀티 비트 트리 비트맵 기반 패킷 분류)

  • 최병철;이정태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.339-348
    • /
    • 2004
  • Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and performance.

A Study on Proposal of the Ship's Routing on Kwangyang Harbor (광양항의 항로설정에 관한 연구)

  • Jeong, Jung-Shic;Park, Young-Soo;Jong, Jae-Yong;Kim, Chol-Seong;Yang, Won-Jae
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.29 no.1
    • /
    • pp.213-221
    • /
    • 2005
  • In the present maritime traffic conditions of Gwangyang harbor, there exists many hazardous factors which may lead to huge accidents including marine oil pollution. To mitigate the danger to vessels in Gwangyang harbor and to secure the safety of maritime environment, we established one way traffic between No.3 Route and No.4 Route, Designed of deep water line on No.3 route, Extended one-way route for Myo-Do Passage etc.

  • PDF

Multi-hop Packet Relay MAC Protocol Considering Channel Conditions in UWB-based WPANs (UWB 기반의 WPAN에서 채널 상태를 고려한 다중 홉 중계 방식의 MAC 프로토콜)

  • Wang Weidong;Seo Chang-Keun;Jeong Soon-Gyu;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.792-803
    • /
    • 2005
  • Ultra wide band (UWB) technology will be applied in the high rare wireless personal area networks (WPANs) for its high rate, low power, and innate immunity to multipath fading. In this paper, a power aware multi-hop packet relay MAC protocol in UWB based WPANs is proposed and a power aware path status factor (PAPSF), which is derived from SINR and power resource condition of each device, is used to select a suitable relay node. Compared with relaying by piconet coordinator (PNC), which is easily chosen by other ad hoc routing protocol, the new scheme can achieve hi임or throughput, decrease the time required for transmitting high power signal and we can easily distribute the battery power consumption from PNC to other devices in the piconet to prevent the PNC device using up its battery too fast and finally avoid PNC handover too frequently.