• Journal of the Korea Society of Computer and Information
• /
• v.25 no.11
• /
• pp.89-95
• /
• 2020

In this paper, we present Beamforming (BF) Training (BFT) for asymmetric links in IEEE 802.11ay. IEEE 802.11ay introduced BFT for asymmetric links that aims to increase the BFT success probability for Station (STA) with insufficient link budget to communicate with an Access Point (AP). BFT for asymmetric links utilizes directional BFT allocation to avoid the usage of quasi-omni pattern at the AP side, and thus to increase STA's BFT success rate. However, there are no publicly available simulation tools supporting IEEE 802.11ay. For these reasons, we present in this paper an implementation of BFT for asymmetric links in ns-3 with its novel techniques such as Training RX (TRN-R) subfield and BFT allocation. We then evaluate by simulation the performance of BFT for asymmetric links.

• Coupled systems mechanics
• /
• v.9 no.2
• /
• pp.183-200
• /
• 2020

Connection of adjacent buildings with stiff links is an efficient approach for seismic pounding mitigation. However, use of highly rigid links might alter the torsional response in asymmetric plans and although this was mentioned in the literature, no quantitative study has been done before to investigate the condition numerically. In this paper, the effect of rigid coupling on the elastic lateral-torsional response of two adjacent one-story column-type buildings has been studied by comparison to uncoupled structures. Three cases are considered, including two similar asymmetric structures, two adjacent asymmetric structures with different dynamic properties and a symmetric system adjacent to an adjacent asymmetric one. After an acceptable validation against the actual earthquake, the traditional random vibration method has been utilized for dynamic analysis under Ideal white noise input. Results demonstrate that rigid coupling may increase or decrease the rotational response, depending on eccentricities, torsional-to-lateral stiffness ratios and relative uncoupled lateral stiffness of adjacent buildings. Results are also discussed for the case of using identical cross section for all columns supporting eachplan. In contrast to symmetric systems, base shear increase in the stiffer building may be avoided when the buildings lateral stiffness ratio is less than 2. However, the eccentricity increases the rotation of the plans for high rotational stiffness of the buildings.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.428-439
• /
• 2015

In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O($N^3$) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.59-66
• /
• 2001

In this paper, we propose a dynamic source routing protocol supporting asymmetric paths for mobile Ad Hoc networks that contain unidirectional links. At present, the existing dynamic source routing protocol supports only symmetric paths that consist of bidirectional links for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environment. Thus, we implement a mobile Ad Hoc routing protocol supporting unidirectional links, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected. For performance evaluation, we consider the following factors: average route discovery time and average data reception rate. In order to obtain the factors of the performance evaluation, we did simulation for 900 seconds in the step of 100 seconds with the following scenarios: usage of route cache in intermediate nodes on route path, and different mobility/connection patterns.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.45-54
• /
• 1993

Monitoring processor in a circuit switched network is considered. Monitoring processor monitors communication links offers a grade of service in each link to controller. Such an information is useful for an effective maintenance of system. Two links with asymmetric system parameters and multi-symmetric links are respectively considered. Each links is to be an independent M /M/ 1/ 1/ type. Markov modeling technique is used to represent a model of monitoring processor with FCFS steering protocol. Performance measures considered are ratio of monitored jobs in each link, availability of minitoring processor and throughput of virtual processor in each link. The value of the performance meausres are compared with existing and simulation results.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1209-1218
• /
• 2001

In this dissertation, we propose a dynamic source routing protocol supporting asymmetric path for mobile ad hoc networks. At present, the existing dynamic source routing protocol supports only symmetric path for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile termenals or current wireless environment. Thus, we implement a mobile ad hoc routing protocol supporting asymmetric routing path, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.753-775
• /
• 2010

Greedy forwarding is a key mechanism of geographic routing using distance as a metric. As greedy forwarding only uses 1-hop neighbor node information, it minimizes routing overhead and is highly scalable. In existing greedy forwarding schemes, a node selects a next forwarding node based only on the distance. However, the signal strength in a realistic environment reduces exponentially depending on the distance, so that by considering only the distance, it may cause a large number of data packet retransmissions. To solve this problem, many greedy forwarding schemes have been proposed. However, they do not consider the unreliable and asymmetric characteristics of wireless links and thus cause the waste of limited battery resources due to the data packet retransmissions. In this paper, we propose a reliable and energy-efficient opportunistic greedy forwarding scheme for unreliable and asymmetric links (GF-UAL). In order to further improve the energy efficiency, GF-UAL opportunistically uses the path that is expected to have the minimum energy consumption among the 1-hop and 2-hop forwarding paths within the radio range. Comprehensive simulation results show that the packet delivery rate and energy efficiency increase up to about 17% and 18%, respectively, compared with the ones in PRR${\times}$Distance greedy forwarding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.3
• /
• pp.172-179
• /
• 2013

In this paper, we consider network-coded bi-directional relaying (NCBR) schemes over an asymmetric channel, in which bi-directional links have the different channel quality, as well as the asymmetric traffic load. In order to deal with asymmetric nature, two different types of NCBR schemes are considered: network coding after padding (NaP) and network coding after fragmentation (NaF). Even if NaP has been known as only a useful means of dealing with the asymmetry in traffic load up to now, our analysis shows that its gain can be significantly lost by the asymmetry in channel quality, under the given bit error performance constraint. Furthermore, it is shown that NaF always outperforms NaP, as well as traditional bi-directional relaying scheme.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1219-1224
• /
• 2001

There can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. Thus, in this paper, we extend the existing dynamic source routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links. For performance evaluation, we use combinations of mobility scenario files and connection pattern files from Carnegimelon Univ. We consider received data rate and average route discovery time as evaluation items, which are compared and evaluated for three suggested route discovery methods.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.