• Title/Summary/Keyword: Tree-Based Network

Search Result 639, Processing Time 0.022 seconds

Deciding Priority of Safety Messages using Decision Tree in IEEE 802.11p/1609.4 Vehicular Network (802.11p/1609 차량네트워크에서 Decision Tree를 이용한 안전메세지 우선순위 결정 기법)

  • Baik, Hyein;Kwon, YongHo;Rhee, Byung Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.794-797
    • /
    • 2015
  • As the interest in VANET is increased, a study on the beacon message transmission between vehicles is actively being made. IEEE 802.11p/1609.4 standard is based on a multichannel system consisting of multiple service channels (SCH) and a control channel (CCH). Multiple SCHs are defined for nonsafety data transfer, while the CCH is used to broadcast safety messages called beacons and control messages (i.e., service advertisement messages). However, most messages broadcast in the only one CCH belong to safety application that must be contested in dense vehicular network. This paper suggests safety message transfer algorithm in dense vehicular congestion. The proposed algorithm is that the priority of safety messages is decided by decision tree and messages are stored in proper queues according to their priorities. Then, safety messages with higher priorities are sent in turn by CCH in the assigned time. The proposed algorithm decreases the beacon transmission delay and increase on the probability of a successful beacon reception in an IEEE 802.11p/1609.4-based network.

  • PDF

Improved Tree-Based ${\mu}TESLA$ Broadcast Authentication Protocol Based on XOR Chain for Data-Loss Tolerant and Gigh-Efficiency (데이터 손실에 강하고 효율적 연산을 지원하는 XOR 체인을 이용한 트리기반 ${\mu}TESLA$ 프로토콜 개선)

  • Yeo, Don-Gu;Jang, Jae-Hoon;Choi, Hyun-Woo;Youm, Heung-Youl
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.2
    • /
    • pp.43-55
    • /
    • 2010
  • ${\mu}TESLA$ broadcast authentication protocol have been developed by many researchers for providing authenticated broadcasting message between receiver and sender in sensor networks. Those cause authentication delay Tree-based ${\mu}TESLA$[3] solves the problem of authentication delay. But, it has new problems from Merkel hash tree certificate structure. Such as an increase in quantity of data transmission and computation according to the number of sender or parameter of ${\mu}TESLA$ chain. ${\mu}TPCT$-based ${\mu}TESLA$[4] has an advantages, such as a fixed computation cost by altered Low-level Merkel has tree to hash chain. However, it only use the sequential values of Hash chain to authenticate ${\mu}TESLA$ parameters. So, It can't ensure the success of authentication in lossy sensor network. This paper is to propose the improved method for Tree-based ${\mu}TESLA$ by using XOR-based chain. The proposed scheme provide advantages such as a fixed computation cost with ${\mu}$TPCT-based ${\mu}TESLA$ and a message loss-tolerant with Tree-based ${\mu}TESLA$.

High Performance Pattern Matching algorithm with Suffix Tree Structure for Network Security (네트워크 보안을 위한 서픽스 트리 기반 고속 패턴 매칭 알고리즘)

  • Oh, Doohwan;Ro, Won Woo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.110-116
    • /
    • 2014
  • Pattern matching algorithms are widely used in computer security systems such as computer networks, ubiquitous networks, sensor networks, and so on. However, the advances in information technology causes grow on the amount of data and increase on the computation complexity of pattern matching processes. Therefore, there is a strong demand for a novel high performance pattern matching algorithms. In light of this fact, this paper newly proposes a suffix tree based pattern matching algorithm. The suffix tree is constructed based on the suffix values of all patterns. Then, the shift nodes which informs how many characters can be skipped without matching operations are added to the suffix tree in order to boost matching performance. The proposed algorithm reduces memory usage on the suffix tree and the amount of matching operations by the shift nodes. From the performance evaluation, our algorithm achieved 24% performance gain compared with the traditional algorithm named as Wu-Manber.

Public Key Authentication using(t, n) Threshold Scheme for WSN ((t, n) 임계치 기법을 이용한 센서네트워크에서의 공개키 인증)

  • Kim, Jun-Yop;Kim, Wan-Ju;Lee, Soo-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.5
    • /
    • pp.58-70
    • /
    • 2008
  • Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. These previous schemes, however, must perform the authentication process one-by-one in hierarchical manner and thus are not fit to be used as primary authentication methods in sensor networks which require mass of multiple authentications at any given time. This paper proposes a new concept of public key-based authentication that can be effectively applied to sensor networks. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t, n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability. The performance advantages of this scheme on memory usage, communication overload and scalability compared to Merkle tree-based authentication are clearly demonstrated using performance analysis.

Clustering Algorithm using the DFP-Tree based on the MapReduce (맵리듀스 기반 DFP-Tree를 이용한 클러스터링 알고리즘)

  • Seo, Young-Won;Kim, Chang-soo
    • Journal of Internet Computing and Services
    • /
    • v.16 no.6
    • /
    • pp.23-30
    • /
    • 2015
  • As BigData is issued, many applications that operate based on the results of data analysis have been developed, typically applications are products recommend service of e-commerce application service system, search service on the search engine service and friend list recommend system of social network service. In this paper, we suggests a decision frequent pattern tree that is combined the origin frequent pattern tree that is mining similar pattern to appear in the data set of the existing data mining techniques and decision tree based on the theory of computer science. The decision frequent pattern tree algorithm improves about problem of frequent pattern tree that have to make some a lot's pattern so it is to hard to analyze about data. We also proposes to model for a Mapredue framework that is a programming model to help to operate in distributed environment.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

Effects of Link Failures on Performance of Packet Scatter Schemes in Fat-Trees (Fat-Tree에서 링크 장애가 패킷분산방식의 성능에 미치는 영향)

  • Lim, Chansook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.9-15
    • /
    • 2013
  • Most of recent studies on data center networks are based on the assumption of symmetrical multi-rooted tree topologies such as a Fat-Tree. While packet scatter schemes are very effective for such a network topology, it is known that various failures can result in an asymmetric topology which degrades TCP performance. In this paper, we reexamine the effects of link failures on packet scatter schemes in Fat-Trees. Our simulation results show that in case of a single link failure in a large-scale Fat-Tree, packet reordering does not occur enough to degrade TCP performance. This implies that we do not necessarily need a complex scheme to make packet schemes robust to link failures.

Directory Cache Coherence Scheme using the Number-Balanced Binary Tree (수 평형 이진트리를 이용한 디렉토리 캐쉬 일관성 유지 기법)

  • Seo, Dae-Wha
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.821-830
    • /
    • 1997
  • The directory-based cache coherence scheme is an attractive approach to solve the caceh coherence problem in a large-scale shared-memory multiprocessor.However, the exsting directory-based schemes have some problens such as the enormous storage overhead for a directory, the long invalidation latency, the heavy network condes-tion, and the low scalability.For resolving these problems, we propose a new directroy- based caceh coherence scheme which is suitable for building scalable, shred-memory multiprocessors.In this scheme, each directory en-try ofr a given memory block is a number-balanced binaty tree(NBBT) stucture.The NBBT has several proper-ties to effciently maintain the directory for the cache consistency such that the shape is unique, the maximum depth is [log$_2$n], and the tree has the minimum number of leaf nodes among the binarry tree with n nodes.Therefore, this scheme can reduce the storage overhead, the network traffic, and the inbalidation latency and can ensutr the high- scalability the large-scale shared-memory multiprocessors.

  • PDF

A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks (트리 기반 센서네트워크에서 전력 소모 균형을 위한 슬랏 스케쥴링 알고리즘)

  • Kim, Je-Wook;Oh, Roon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5A
    • /
    • pp.502-510
    • /
    • 2011
  • In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

An Optimal Installation Strategy for Allocating Energy Storage Systems and Probabilistic-Based Distributed Generation in Active Distribution Networks

  • Sattarpour, Tohid;Tousi, Behrouz
    • Transactions on Electrical and Electronic Materials
    • /
    • v.18 no.6
    • /
    • pp.350-358
    • /
    • 2017
  • Recently, owing to increased interest in low-carbon energy supplies, renewable energy sources such as photovoltaics and wind turbines in distribution networks have received considerable attention for generating clean and unlimited energy. The presence of energy storage systems (ESSs) in the promising field of active distribution networks (ADNs) would have direct impact on power system problems such as encountered in probabilistic distributed generation (DG) model studies. Hence, the optimal procedure is offered herein, in which the simultaneous placement of an ESS, photovoltaic-based DG, and wind turbine-based DG in an ADN is taken into account. The main goal of this paper is to maximize the net present value of the loss reduction benefit by considering the price of electricity for each load state. The proposed framework consists of a scenario tree method for covering the existing uncertainties in the distribution network's load demand as well as DG. The collected results verify the considerable effect of concurrent installation of probabilistic DG models and an ESS in defining the optimum site of DG and the ESS and they demonstrate that the optimum operation of an ESS in the ADN is consequently related to the highest value of the loss reduction benefit in long-term planning as well. The results obtained are encouraging.