• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.601-607
• /
• 2005

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology information within PG referring bandwidth and delay parameter. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current star topology aggregation. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.645-652
• /
• 2004

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology in-formation within PG referring bandwidth and delay parameter. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multi pie-links aggregation. And we apply it to current star topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.361-368
• /
• 2011

In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

• Macromolecular Research
• /
• v.16 no.5
• /
• pp.434-440
• /
• 2008

Three-armed, star-shaped molecules containing 4-(N,N-diphenyl)amino-4'-nitroazobenzene chromophores were synthesized to study the diffraction behavior after inscribing surface relief gratings. The two molecules differed in terms of their mode of chromophore attachment to the core. In compound 5, they were bound to the core laterally through alkylene spacers, whereas the chromophores were tethered perpendicularly to the core in compound 4. Although 60 wt% of the polar azobenzene chromophores was comprised of large molecules, no aggregation behavior was observed in the absorption spectra of the thin films. The surface relief gratings were elaborated on the surface of the molecular films by the two-beam interference method. The dynamics of grating formation were studied in terms of the diffraction efficiency using two different film samples made up of two star-shaped molecules. The maximum diffraction efficiency of D-$(ENAZ)_3$, compound 4, was measured to be about 30%, which was significantly high. The mode of chromophore attachment affected the dynamic properties of the diffraction gratings.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.171-173
• /
• 2000

본 논문에서는 ATM PNNI(Private Network-Network Interface) 망에서 경로 배정을 위해 필요로 하는 링크 상태 정보(link state information)를 효율적으로 집단화(aggregation)하는 두 가지 방법을 제시한다. 이 방법들은 집단화할 동료 집단(peer group)의 경계노드(border node)들을 셔플넷(shufflenet)이나 de Bruijn 그래프의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법(full-mesh approach)의 N2에서 aN(a는 정수, N은 경계노드 수)으로 줄인다. 이는 공간 복잡도가 0(N)인 신장 트리(apanning tree) 방법에서 필요로 하는 링크의 수와 비슷하지만, 신장 트리 방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장점이다. 모의 실험 결과 셔플넷 방법은 aN개의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었고, de Bruijn 방법은 정보의 정확성에서는 셔플넷 방법에 못 미치지만 가장 널리 사용되고 있는 별모양 방법(star approach) 방법보다는 훨씬 정확하며, 계산 복잡도 면에서 셔플넷 방법보다 효율적이었다.

• Ocean and Polar Research
• /
• v.30 no.1
• /
• pp.79-87
• /
• 2008

Hydroacoustic technique was used to analyze spatiotemporal stability and distribution of demersal fish aggregations in the coastal region to overcome some limitations of the existing methods such as net and diving. The survey was carried out in the Baekeum Bay on the south coast of Korea in January 2007. The bottom depth in the study site ranges from 7 to 25 m. In order to outline aggregations of demersal fish initial scanning using 200 kHz split-beam transducer was randomly conducted over the large area. Having detected fish aggregation in the specific region, intensive acoustic survey of irregular star pattern was carried out along 14 transects across the area in question. The results of the acoustic survey show that all demersal fish aggregations are concentrated about 5 m from sea bottom having a slight slope and remain steady with no spatial or temporal variations during acoustic survey. The hydroacoustic method used in this study offers a new approach to understand vertical and horizontal distribution, spatiotemporal stability, and biomass estimate of demersal fish aggregations in coastal regions. Additionally, the number of individual fish estimated from in situ acoustic target strength data can be used to understand the standing stock of demersal fish aggregation.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.50 no.1
• /
• pp.30-38
• /
• 2014

Hydro-acoustic survey was carried out to investigate the spatial characteristics of fish distribution near two artificial reefs (AO: large octagonal semi-sphere and AC: combined custom built) having different types in Jeju marine ranching area. The survey system consisted of scientific echo sounder (EK60), DGPS system, and ECDIS (Mecys). Field survey was conducted on August and October 2012 with star survey and line transect survey line method, and species composition was investigated from gill net fishing survey. The acoustic signals from individual fishes and small fish schools were mainly recorded around AO, but large and strong signals from large fish school were mainly detected in the top layer of and the water column near AC. The echogram suggest that the fish aggregation for the two types of AO and AC exist the significant difference in fish species and spatial distribution pattern.

• 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.