• Title/Summary/Keyword: Tree-Based Network

Search Result 639, Processing Time 0.021 seconds

An Efficient Core Migration Protocol for Tree Building in Mobile Ad Hoc Multicast Protocol (Ad Hoc네트워크에서 효율적인 코어-기반 멀티캐스트 트리 구축)

  • 이창순;김갑식
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.3
    • /
    • pp.99-104
    • /
    • 2003
  • Ad-hoc is the wireless network and consists of moving Hosts in environments which don't have a network-based Frame. Because ad-hoc is considered as broadcast network and network which has useful benefits, multicast muting protocols have been studied on ad-hoc network For this work we scrutinized ad-hoc and multicast routing protocols presented in previous works. And we presents a protocol for Ad-hoc network.

  • PDF

Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm (우선순위 제어기법을 기반으로 한 재순환 Shuffle-Exchage 상호연결 ATM 스위치)

  • Park, Byeong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1949-1955
    • /
    • 2000
  • This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

  • PDF

Self-Organized Hierarchy Tree Protocol for Energy-Efficiency in Wireless Sensor Networks

  • THALJAOUI, Adel
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.9
    • /
    • pp.230-238
    • /
    • 2021
  • A sensor network is made up of many sensors deployed in different areas to be monitored. They communicate with each other through a wireless medium. The routing of collected data in the wireless network consumes most of the energy of the network. In the literature, several routing approaches have been proposed to conserve the energy at the sensor level and overcome the challenges inherent in its limitations. In this paper, we propose a new low-energy routing protocol for power grids sensors based on an unsupervised clustering approach. Our protocol equitably harnesses the energy of the selected cluster-head nodes and conserves the energy dissipated when routing the captured data at the Base Station (BS). The simulation results show that our protocol reduces the energy dissipation and prolongs the network lifetime.

Re-Ordering of Users in the Group Key Generation Tree Protocol (사용자 순서 재조정을 통한 그룹 키 생성 트리 프로토콜)

  • Hong, Sung-Hyuck
    • Journal of Digital Convergence
    • /
    • v.10 no.6
    • /
    • pp.247-251
    • /
    • 2012
  • Tree-based Group Diffie-Hellman (TGDH) is one of the efficient group key agreement protocols to generate the GK. TGDH assumes all members have an equal computing power. As one of the characteristics of distributed computing is heterogeneity, the member can be at a workstation, a laptop or even a mobile computer. Therefore, the group member sequence should be reordered in terms of the member's computing power to improve performance. This research proposes a reordering of members in the group key generation tree to enhance the efficiency of the group key generation.

A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices (블루투스 장치 간의 평균 홉 수를 줄이기 위한 트리 스캐터넷 형성 알고리즘)

  • Kang, Seung-Ho;Kang, Dae-Wook;Lim, Hyeong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.11C no.3
    • /
    • pp.401-408
    • /
    • 2004
  • The Bluetooth Scatternet based on tree structure has several merits such as small numb of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.

On Minimum Cost Multicast Routing Based on Cost Prediction

  • Kim, Moon-Seong;Mutka, Matt W.;Hwang, Dae-Jun;Choo, Hyun-Seung
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.500-508
    • /
    • 2009
  • We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

Game Traffic Classification Using Statistical Characteristics at the Transport Layer

  • Han, Young-Tae;Park, Hong-Shik
    • ETRI Journal
    • /
    • v.32 no.1
    • /
    • pp.22-32
    • /
    • 2010
  • The pervasive game environments have activated explosive growth of the Internet over recent decades. Thus, understanding Internet traffic characteristics and precise classification have become important issues in network management, resource provisioning, and game application development. Naturally, much attention has been given to analyzing and modeling game traffic. Little research, however, has been undertaken on the classification of game traffic. In this paper, we perform an interpretive traffic analysis of popular game applications at the transport layer and propose a new classification method based on a simple decision tree, called an alternative decision tree (ADT), which utilizes the statistical traffic characteristics of game applications. Experimental results show that ADT precisely classifies game traffic from other application traffic types with limited traffic features and a small number of packets, while maintaining low complexity by utilizing a simple decision tree.

Performance Analysis of Virtual Conference System in the IPv6 Multicast Network (IPv6 멀티캐스트 네트워크에서 가상 학술회의 시스템의 성능 분석)

  • Eom, Tai-Rang;Do, Jin-Sook;Lee, Kyung-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.45-54
    • /
    • 2003
  • In the Protocol-Independent Multicast Sparse Mode(PIM-SM), we need a careful selection scheme for the Rendezvous Point(RP) which influences much on the QoS due to the delay among multicast group members and packet loss The QoS based RP selection schemes choose RPs which satisfy the restriction conditions such as bandwidth, delay, and other QoS parameters In this paper, we propose a new RP selection scheme which is a variation of the group-based RP selection scheme The new algorithm, MCT(Maximum Cross Tree), is implemented by taking advantages of the topology-based selection scheme and the group-based selection scheme as well In order to verify the proposed algorithm, we first measure the multicast traffic data of the Virtual Conference System implemented on the IPv6 network via KOREN, then expand the results to two types of network models and analyze the performance by computer simulation.

An Efficient Group Key Distribution Mechanism for the Secure Multicast Communication in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 안전한 멀티캐스트 통신을 위한 효율적인 그룹 키 분배 방식)

  • Lim Yu-Jin;Ahn Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.339-344
    • /
    • 2006
  • Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

Intelligent On-demand Routing Protocol for Ad Hoc Network

  • Ye, Yongfei;Sun, Xinghua;Liu, Minghe;Mi, Jing;Yan, Ting;Ding, Lihua
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1113-1128
    • /
    • 2020
  • Ad hoc networks play an important role in mobile communications, and the performance of nodes has a significant impact on the choice of communication links. To ensure efficient and secure data forwarding and delivery, an intelligent routing protocol (IAODV) based on learning method is constructed. Five attributes of node energy, rate, credit value, computing power and transmission distance are taken as the basis of segmentation. By learning the selected samples and calculating the information gain of each attribute, the decision tree of routing node is constructed, and the rules of routing node selection are determined. IAODV algorithm realizes the adaptive evaluation and classification of network nodes, so as to determine the optimal transmission path from the source node to the destination node. The simulation results verify the feasibility, effectiveness and security of IAODV.