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

Keyword Search Result

[Keyword] all-to-all broadcast(2hit)

1-2hit
  • A Parallel Transmission Scheme for All-to-All Broadcast in Underwater Sensor Networks

    Soonchul PARK  Jaesung LIM  

     
    PAPER-Network

      Vol:
    E93-B No:9
      Page(s):
    2309-2315

    This paper is concerned with the packet transmission scheduling problem for repeating all-to-all broadcasts in Underwater Sensor Networks (USN) in which there are n nodes in a transmission range. All-to-all communication is one of the most dense communication patterns. It is assumed that each node has the same size packet. Unlike the terrestrial scenarios, the propagation time in underwater communications is not negligible. We define all-to-all broadcast as the one where every node transmits packets to all the other nodes in the network except itself. So, there are in total n(n - 1) packets to be transmitted for an all-to-all broadcast. The optimal transmission scheduling is to schedule in a way that all packets can be transmitted within the minimum time. In this paper, we propose an efficient packet transmission scheduling algorithm for underwater acoustic communications using the property of long propagation delay.

  • All-to-All Broadcast in Broadcast-and-Select WDM Networks with Tunable Devices of Limited Tuning Ranges

    Hongsik CHOI  

     
    PAPER-Fiber-Optic Transmission

      Vol:
    E86-B No:9
      Page(s):
    2575-2582

    In this paper, we consider the all-to-all broadcast problem in optical broadcast star networks using Wavelength Division Multiplexing. Our network model assumes that receivers are fixed-tuned and transmitters are tunable such that optical lasers assigned to transmitters have limited access to the network bandwidth; hence, each node must be equipped with multiple optical lasers and/or multiple optical filters in order to maintain a single-hop network. This paper is primarily concerned with single-hop networks, in which each node is assigned a single optical filter. Lower bounds are first established on the number of lasers per each node and the minimum schedule length, and a schedule achieving the minimum schedule length is presented. The results are applicable to arbitrary tuning delays, arbitrary numbers of wavelength channels, and optical lasers' arbitrary tuning ranges. Network models with optical devices having limited tuning ranges have not yet been considered in connection with transmission schedules, and this is the first work in this new direction.