A Parallel Transmission Scheme for All-to-All Broadcast in Underwater Sensor Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.9 pp.2309-2315
- Publication Date
- 2010/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.2309
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Soonchul PARK, Jaesung LIM, "A Parallel Transmission Scheme for All-to-All Broadcast in Underwater Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 9, pp. 2309-2315, September 2010, doi: 10.1587/transcom.E93.B.2309.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.2309/_p
Copy
@ARTICLE{e93-b_9_2309,
author={Soonchul PARK, Jaesung LIM, },
journal={IEICE TRANSACTIONS on Communications},
title={A Parallel Transmission Scheme for All-to-All Broadcast in Underwater Sensor Networks},
year={2010},
volume={E93-B},
number={9},
pages={2309-2315},
abstract={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.},
keywords={},
doi={10.1587/transcom.E93.B.2309},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - A Parallel Transmission Scheme for All-to-All Broadcast in Underwater Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2309
EP - 2315
AU - Soonchul PARK
AU - Jaesung LIM
PY - 2010
DO - 10.1587/transcom.E93.B.2309
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2010
AB - 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.
ER -
English
