• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.50-60
• /
• 2015

A Block-Time-Bounded Time Division Multiple Access (BTB-TDMA) medium access control protocol, which estimates the propagation delay of nodes according to their location and moving velocity information, has been proposed for underwater acoustic networks. BTB-TDMA provides nodes with their transmission schedules by a time block that is a time unit, newly designed for BTB-TDMA. In this paper, we investigate how the receiver collision, that is induced by the asymmetry between node's uplink and downlink propagation delay due to its mobility, affects the performance of BTB-TDMA. To do this, we analytically obtain the collision rate, the channel access delay, and the channel utilization by considering the asymmetry of propagation delay. Then, simulations are extensively performed with respect to the length of a time block by varying the number of nodes, the network range, and the node's velocity. Thus, the simulation results can suggest performance criteria to determine the optimal length of a time block which minimizes the collision rate and concurrently maximizes the channel access delay and the channel utilization.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.