• Title/Summary/Keyword: Network topology

Search Result 1,186, Processing Time 0.032 seconds

An Adaptable Destination-Based Dissemination Algorithm Using a Publish/Subscribe Model in Vehicular Networks

  • Morales, Mildred Madai Caballeros;Haw, Rim;Cho, Eung-Jun;Hong, Choong-Seon;Lee, Sung-Won
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.3
    • /
    • pp.227-242
    • /
    • 2012
  • Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

Communications Protocol Used in the Wireless Token Rings for Bird-to-Bird

  • Nakajima, Isao;Juzoji, Hiroshi;Ozaki, Kiyoaki;Nakamura, Noboru
    • Journal of Multimedia Information System
    • /
    • v.5 no.3
    • /
    • pp.163-170
    • /
    • 2018
  • We developed a multicast communication packet radio protocol using a time-sharing tablet system ("wireless token ring") to achieve the efficient exchange of files among packet radio terminals attached to swans. This paper provides an overview of the system and the protocol of the packet communications. The packet device forming the main part of the transceiver developed is the Texas Instruments CC2500. This device consists of one call-up channel and one data transmission channel and could improve error frame correction using FEC (forward error correction) with 34.8 kbps MSK and receiving power of at least -64 dBm (output 1 dBm at distance of 200 m using 3 dBi antenna). A time-sharing framework was determined for the wireless token ring using call sign ordinals to prevent transmission right loss. Tests using eight stations showed that resend requests with the ARQ (automatic repeat request) system are more frequent for a receiving power supply of -62 dBm or less. A wireless token ring system with fixed transmission times is more effective. This communication protocol is useful in cases in which frequency resources are limited; the energy consumed is not dependent on the transmission environment (preset transmission times); multiple terminals are concentrated in a small area; and information (position data and vital data) is shared among terminals under circumstances in which direct communication between a terminal and the center is not possible. The method allows epidemiological predictions of avian influenza infection routes based on vital data and relationships among individual birds based on the network topology recorded by individual terminals. This communication protocol is also expected to have applications in the formation of multiple in vivo micromachines or terminals that are inserted into living organisms.

The Simplified PWM Method using Serial Communication in Cascaded H-Bridge Multilevel Inverter (직렬통신을 이용한 H-브릿지 멀티레벨 인버터의 PWM 구현방법)

  • Park Young-Min;Ryu Han-Seong;Lee Hyun-Won;Lee Se-Hyun;Lee Chung-Dong;Yoo Jl-Yoon
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.9 no.6
    • /
    • pp.620-627
    • /
    • 2004
  • As h-bridge multilevel inverter is connected with series of single phase power cell, so it obtain high voltage using low voltage power semi-conductor and output voltage similar to sine wave. In this topology, the number of power cell increases in proportion to the output voltage level. Therefore, there are drawbacks that are responsibility against operating ability of main controller and signal wire increase. However, we can overcome this problems by the substitution of serial communication for the PWM signal in power cell control. Additionally, it has merits of reliability and maintenance. This paper deals with the synchronization and phase-shift method of power cell PWM using CAN(Controller Area Network) communication interrupt in H-bridge multilevel inverter. The advantages of proposed method are signal-line simplification using serial communication between main controller and cell controller, burden reduction in main controller, modularization of power cell, easy protection of each power cell, expandability improvement and reliability increase of control signal and power cell. This paper establishes propriety and reliability of proposed method through experiment of 13-level H-bridge multilevel inverter.

Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation (지연시간 한계의 만족과 효율적인 최소 지연변이 멀티캐스트 트리 생성 알고리즘)

  • Kim Moon-Seong;Choo Hyun-Seung;Lee Young-Ro
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.105-110
    • /
    • 2005
  • With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about $3.6{\%}{\~}11.1{\%}$ in terms of normalized surcharge for DUVCA. The time complexity of our algorithm is $O(mn^2)$.

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.

Diels-Alder Cycloaddition of Cyclopentadiene with Ethylacrylate Catalyzed by Mesoporous Al-MCM-48 and Al-MCM-41 Catalysts

  • Shon, Jeong-Kuk;Sim, Jae-Yi;Thakur, Santosh Singh;Ko, Eun-Mi;Kong, Soo-Sung;Choi, Ji-Yun;Kang, Min;Senapati, Bidyut Kumar;Choi, Doo-Seoung;Ryu, Do-Hyun;Kim, Ji-Man
    • Bulletin of the Korean Chemical Society
    • /
    • v.29 no.10
    • /
    • pp.1993-1997
    • /
    • 2008
  • In the present work, Diels-Alder reaction of cyclopentadiene with ethylacrylate has been carried out by using two types of mesoporous solid acid catalysts (Al-MCM-41, Al-MCM-48) with different pore structures. The specific topology of Al-MCM-48 (cubic Ia3d structure composed of two independent 3-D channel systems) exhibit higher activity and stereo-control than those of Al-MCM-41 (hexagonal packing of 1-D channels). The physical properties of Al-MCM-48 catalyst, such as high accessibility of reactants to the acid sites, spatial confinement in the nanoscopic reactors, and 3-D channel network structure that are effective adsorption and diffusion of reactants, play a crucial role in the present study.

A New Embedding of Pyramids into Regular 2-Dimensional Meshes (피라미드의 정방형 2-차원 메쉬로의 새로운 임베딩)

  • 장정환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.257-263
    • /
    • 2002
  • A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$+1)/2, 2$^{N3}$+2. [3.2$^{N4}$+1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.

A Leader Election Algorithm and Performance Evaluation for Mobile Ad hoc Networks (이동 에드 혹 네트워크를 위한 제어노드 선택 알로리즘 및 성능 평가)

  • Parvathipuram Pradeep;Yang Gi-Chul;Oh Sooyul
    • The KIPS Transactions:PartC
    • /
    • v.11C no.6 s.95
    • /
    • pp.829-834
    • /
    • 2004
  • Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geographical area and are loose]y bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.

A Novel Resource Allocation Scheme for QoS guarantee of Assured Service in Differentiated Services (DiffServ 방식의 Assured Service에서 QoS 보장을 위한 효율적인 자원 할당 방안)

  • Hur, Kyeong;Cho, Seong-Dae;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8C
    • /
    • pp.758-770
    • /
    • 2002
  • In this paper, we propose a novel resource allocation scheme which can maximize capacity for QoS guarantee of Assured Service in Differentiated Services. Performance of the proposed resource allocation scheme is analyzed with each buffer management scheme such as RIO and Adaptive RIO. To prevent an early random drop of the admitted In-profile packet, Adaptive RIO scheme updates parameters of RIO scheme every time interval according to the estimated numbers of maximum packet arrivals of In-profile traffic and Out-of-profile traffic during the next time interval. The numbers of maximum packet arrivals during the next time interval are estimated based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. We can find from simulation results that proposed resource allocation scheme with Adaptive RIO can guarantee QoS and can maximize capacity for Assured Service.

Intrusion Detection Technique using Distributed Mobile Agent (Distributed Mobile Agent를 이용한 침입탐지 기법)

  • Yang, Hwan Seok;Yoo, Seung Jae;Yang, Jeong Mo
    • Convergence Security Journal
    • /
    • v.12 no.6
    • /
    • pp.69-75
    • /
    • 2012
  • MANET(Mobile Ad-hoc Network) is target of many attacks because of dynamic topology and hop-by-hop data transmission method. In MANET, location setting of intrusion detection system is difficult and attack detection using information collected locally is more difficult. The amount of traffic grow, intrusion detection performance will be decreased. In this paper, MANET is composed of zone form and we used random projection technique which reduces dimension without loss of information in order to perform stable intrusion detection in even massive traffic. Global detection node is used to detect attacks which are difficult to detect using only local information. In the global detection node, attack detection is performed using received information from IDS agent and pattern of nodes. k-NN and ZBIDS were experimented to evaluate performance of the proposed technique in this paper. The superiority of performance was confirmed through the experience.