• Title/Summary/Keyword: Concurrent Routing

Search Result 13, Processing Time 0.014 seconds

Data Aggregation Method Guaranteeing Minimum Traffic in Multi-hop Automatic Meter Reading Networks (다중 홉 원격검침망에서의 최소 트래픽 보장을 위한 데이터 수집기법에 관한 연구)

  • Hwang, Kwang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.848-857
    • /
    • 2011
  • Due to the advantages of a conveniet, inexpensive installation, flexibility, and scalability, Wireless AMR systems are recently preferred over wired AMR systems. However, a multi-hop supported AMR network, which generally covers large areas, may create energy wastage problem, energy unbalance, and high interference hazard due to a large amount of concurrent-intensive metering data in the network. Therefore in this paper we propose a novel data gathering method which can solve abovementioned problems as well as conserve energy, by reducing the traffic in the network. In addition, the experimental results demonstrate that the proposed scheme shows superior performance to the conventional data transmission method.

A Novel Multi-link Integrated Factor Algorithm Considering Node Trust Degree for Blockchain-based Communication

  • Li, Jiao;Liang, Gongqian;Liu, Tianshi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3766-3788
    • /
    • 2017
  • A blockchain is an underlying technology and basic infrastructure of the Bitcoin system. At present, blockchains and their applications are developing rapidly. However, the basic research of blockchain technology is still in the early stages. The efficiency and reliability of blockchain communication is one of the research problems that urgently need to be studied and addressed. Existing algorithms may be less feasible for blockchain-based communication because they only consider a single communication factor (node communication capability or node trust degree) and only focus on a single communication performance parameter(communication time or communication reliability). In this paper, to shorten the validation time of blockchain transactions and improve the reliability of blockchain-based communication, we first establish a multi-link concurrent communication model based on trust degree, and then we propose a novel integrated factor communication tree algorithm (IFT). This algorithm comprehensively considers the node communication link number and the node trust degree and selects several nodes with powerful communication capacity and high trust as the communication sources to improve the concurrency and communication efficiency. Simulation results indicate that the IFT algorithm outperforms existing algorithms. A blockchain communication routing scheme based on the IFT algorithm can increase communication efficiency by ensuring communication reliability.

A Study on Multicast ATM Switch with Tandem Crosspoints (탠덤크로스포인터 멀티캐스트 ATM 스위치 연구)

  • Ryul, Kim-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.157-165
    • /
    • 2006
  • This paper proposes a new output-buffered multicast ATM switch with tandem crosspoints switching fabric, named the MTCOS(Multicast Tandem Crosspoint Output-buffered Switch). The MTCOS consists of multiple simple crosspoint switch fabrics, named TCSF(Tandem Crosspoint Switch Fabric) , and concentrated output buffers for efficient multicasting. The TCSF resolves the cell delay deviation problem which the self-routing crossbar switches inherently have. Further, it offers multiple concurrent pathes from one input to multiple output ports. It also provides multi-channel switching by easy software configuration and has several desirable characteristics such as scalability, high Performance, and modularity. A shared traffic concentration and output queuing strategies of the MTCOS results in lower cell loss as well as lower cell delay time over a wide range of multicast traffic. Furthermore, it has lower hardware complexity than that of the SCOQ and Knockout multicast switch to achieve the same Knockout concentration rate as the conventional switches. It is shown that the proposed switch can be easily applied to design high performance for any multicast traffic by analytic analysis and computer simulation.

  • PDF