The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] broadcasting(104hit)

101-104hit(104hit)

  • Fault Tolerance of an Information Disseminating Scheme on a Processor Network

    Kumiko KANAI  Yoshihide IGARASHI  Kinya MIURA  

     
    PAPER-Algorithms, Data Structures and Computational Complexity

      Vol:
    E75-A No:11
      Page(s):
    1555-1560

    We discuss fault tolerance of an information disseminating scheme, t-disseminate on a network with N processors, where each processor can send a message to t directions at each round. When N is a power of t+1 and at most tlogt+1N-1 (at most t) processors and/or edges have hailed, logt+1N+(f1)/t rounds (logt+1N+2 rounds) suffice for broadcasting information to all destinations from any source by t-disseminate. For a arbitrary N, logt+1N2f/t1 rounds (logt+1N+2 rounds) suffice for broadcasting information to all destinations from any source by t-disseminate if at most t(logt+1N1)/2 (at most t/2) processors and/or edges have failed.

  • A Continuous Measurement of G/T for Satellite Broadcasting Receiving Systems

    Yuliman PURWANTO  Yasutaka OGAWA  Manabu OHMIYA  Kiyohiko ITOH  

     
    PAPER-Satellite Communication

      Vol:
    E75-B No:8
      Page(s):
    767-774

    Weather conditions affect the performance of satellite broadcasting receiving systems. For example, snow accretion on antennas degrades G/T seriously because it reduces received signal power and also can increase antenna noise. We need a continuous measurement of G/T to evaluate the effect of the weather conditions to the satellite broadcasting receiving systems. However, a conventional method cannot perform the continuous measurement because the antenna under test must be oriented in a specific direction (to the zenith) to obtain a noise level in a satellite broadcasting channel. This paper presents the continuous measurement of G/T for the satellite broadcasting receiving systems. We describe details of the measurement method. In our measurement system, a standard antenna is placed at the inside of a room in order to prevent the weather conditions from affecting the gain of the standard antenna. The power flux density at the inside of the room is different from that at the outside where the antennas under test are placed. Employing the effective gain of the standard antenna, we take the difference of the power flux density into account. Moreover, we propose a method to estimate the noise level in the satellite broadcasting channel from the values at the outside of the channel, and clarify the accuracy of the noise estimation. Then, we show measurement results of the G/T values for several receiving systems. From these results, we show that the G/T measurement system has high precision. Also, from the specifications of the antenna gain and typical values of the noise figure, it is expected that the measurement system has a sufficient accuracy.

  • Information Disseminating Schemes for Fault Tolerance in Hypercubes

    Svante CARLSSON  Yoshihide IGARASHI  Kumiko KANAI  Andrzej LINGAS  Kinya MIURA  Ola PETERSSON  

     
    PAPER-Graphs, Networks and Matroids

      Vol:
    E75-A No:2
      Page(s):
    255-260

    We present schemes for disseminating information in the n-dimensional hypercube with some faulty nodes/edges. If each processor can send a message to t neighbors at each round, and if the number of faulty nodes/edges is k(kn), then this scheme will broadcast information from any source to all destinations within any consecutive n+[(k+l)/t] rounds. We also discuss the case where the number of faulty nodes is not less than n.

  • Optimal Schemes for Disseminating Information and Their Fault Tolerance

    Yoshihide IGARASHI  Kumiko KANAI  Kinya MIURA  Shingo OSAWA  

     
    PAPER

      Vol:
    E75-D No:1
      Page(s):
    22-29

    We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t1 and t2 any of these schemes can broadcast information within any consecutive logt+1N2 rounds, and for an arbitrary t they can broadcast information within any consecutive logt+1N3 rounds.

101-104hit(104hit)