• Journal of Animal Science and Technology
• /
• v.64 no.3
• /
• pp.500-514
• /
• 2022

The blood-epididymis barrier (BEB) forms a unique microenvironment that is crucial for the maturation, protection, transport, and storage of spermatozoa in the epididymis. To characterize the function of tight junctions (TJs), which are constitutive components of the BEB, we determined the expression and localization of TJ proteins such as zonula occludens (ZO)-1, 2, and 3, occludin, and claudin3 (Cldn3) during postnatal development in the goat epididymis. To assess the expression patterns of TJ proteins in immature (3 months of age) and mature (14 months of age) goat epididymides, two different experimental methods were used including immunofluorescence labeling and western blotting. We show that, ZO-1, 2, and 3, and occludin, were strictly expressed and localized to the TJs of the goat epididymis, whereas Cldn3 was present in basolateral membranes as well as TJs. All TJ proteins examined were more highly expressed in the immature epididymis compared to levels in mature tissue. In conclusion, our study indicates that at least five TJ proteins, namely ZO-1, ZO-2, ZO-3, occludin, and Cldn3, are present in TJs, and the expression strength and pattern of TJ proteins tend to be age dependent in the goat epididymis. Together, these data suggest that the distinct expression patterns of TJ proteins are essential for regulating components of the luminal contents in the epididymal epithelium and for forming adequate luminal conditions that are necessary for the maturation, protection, transport, and storage of spermatozoa in the goat epididymis.

• The Korean Journal of Food And Nutrition
• /
• v.36 no.1
• /
• pp.25-32
• /
• 2023

To increase antioxidant activity and physicochemical quality characteristics, four kinds of berries (blueberry (BEB), blackberry (BKB), cranberry (CNB), raspberry (RSB)) with antioxidant activities were used to replace beet (B) in existing ABC juice. In the experimental group, the pH was decreased while the content of soluble solids was increased significantly. Total polyphenol content was significantly increased in all experimental groups compared to that in the control group. The control group had the lowest polyphenol content at 14.723 ㎍ GAE/g, whereas the blackberry replacement group had the highest polyphenol content at 67.12 ㎍ GAE/g. The total flavonoid content was the lowest in the control group at 8.98 ㎍ QE/g but the highest in the blackberry group at 50.47 ㎍ QE/g. All experimental groups showed significantly higher antioxidant activities than the control group. DPPH & ABTS radical scavenging activities were the lowest in the control group at 15.69% and 19.55%, respectively, but the highest in the blackberry group at 48.24% and 59.43%, respectively. SOD-like activity was also the lowest in the control group at 14.12%, but the highest in the blackberry group at 48.18%. When comparing experimental groups, antioxidant activities (DPPH, ABTS, SOD) and antioxidant components (total polyphenols and total flavonoids) were in the order of BKB > CNB > RSB > BEB > Control. In conclusion, the new ABC juice containing four types of berries is enriched in antioxidants with significantly improved antioxidant activities and physicochemical quality characteristics.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1371-1374
• /
• 2005

지금까지 IEEE 802.11 WLAN 에서 많이 연구되어진 주제는 노드들 간의 공평성(fairness)과 처리량(throughput)을 높이는데 중점이 맞추어진 것들이 대부분이었다. 성능을 높이기 위한 AP의 CW값에 관한 연구는 노드들 간에 관한 연구에 비하여 비교적 적은 편이다. 지금은 노드들과 AP가 충돌하게 되면 BEB(Binary Exponential backoff)방식으로 셋팅되어 사용하게 있기 때문에 1:N의 불공평한(unfairness) 상황이 발생한다. AP에서 노드들로 가는 하향링크(downlink) 전송이 많은 상황에서 AP가 다른 노드들과 똑같은 채널 접근확률을 가지는 것은 바람직하지 않기 때문에 AP에게 우선권(priority)을 주어 전체 성능을 높이는 것이 필요하다. 따라서 본 논문에서는 AP의 CW(Contention Window)값이 변화함에 따라 전체 성능에 끼치는 영향과 노드 수의 변화에 따른 AP의 적절한 백오프 CW값을 분석해 보고자 한다.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.43-51
• /
• 2010

IEEE 802.11 defines distributed coordination function (DCF), which is characterized by CSMA/CA and binary exponential backoff (BEB) algorithm. Most modifications on DCF so far have focused on updating of the contention window (CW) size depending on the outcome of own frame transmission without considering freezing periods experienced in the backoff interval. We propose two simple but novel schemes which effectively utilize the number of freezing periods sensed during the current backoff interval. The proposed schemes can be applied to DCF and its family, such as double increment double decrement (DIDD). Saturation throughput of the proposed schemes is analyzed by means of Bianchi's Markovian model. Computer simulation validates the accuracy of the analysis. Numerical results based on IEEE 802.11b show that up to about 20% improvement of saturation throughput can be achieved by combining the proposed scheme with conventional schemes when applied to the basic access procedure.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.176-180
• /
• 2004

In this paper we introduce a bandwidth allocation algorithm and admission control policy for IEEE 802.16 broadband wireless access standard. The proposed mechanism is practical and compatible to the IEEE 802.16. Our scheme provides QoS support to high priority traffic and high throughput in low priority traffic. The simulation show that the proposed scheme includes QoS support for real-time traffic and we presented that BS determine a efficient contention mini-slot size. We have shown the relationship between traffic size and its QoS requirements and the network performance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.129-133
• /
• 2005

Slotted ALOHA(S-ALOHA) is widely used in local wireless network. We analyze the performance of contention-based model in wireless LAN using S-ALOHA protocol. We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol: whenever a node's message which tries to reserve a channel is involved in a collision for the ith time, it chooses one of the next $2^i$ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study is performed to verify our method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.418-420
• /
• 2005

IEEE 802.11 에서 현재까지 많이 연구되어진 주제는 노드들 간의 공평성(fairness)에 중점을 두거나 처리율(throughput)을 높이는데 초점을 맞추어 진 것들이었다. 전체 처리율을 높이는데 AP의 백오프 방식에 관련해서는 노드들 간에 관한 연구에 비하여 비교적 연구가 적은편이다. 현재 AP와 노드들은 충돌이 발생하면 BEB(Binary Exponential backoff) 방식으로 셋팅되어 사용하고 있기 때문에 1:N의 불공평한(unfairness) 상황이 발생한다. 하향링크(downlink)가 대부분인 환경에서 AP가 다른 노드들과 같은 채널 접근확률을 가진다는 것은 바람직하지 않다. 따라서 AP가 노드들보다 우선권(priority)을 높여서 처리율을 높이는 방안이 필요하다. 그래서 본 논문에서는 AP의 백오프 방식 및 CW(Contention Window)가 변화하는데 따라서 전체 처리율에 어떤 영향을 끼치는가와 노드 수에 따른 AP의 적절한 전략 과 백오프 CW값을 분석해 보았다.

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

IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4825-4847
• /
• 2016

In this paper, we focus on the per-flow throughput analysis of IEEE 802.11 multi-hop ad hoc networks. The importance of an accurate saturation throughput model lies in establishing the theoretical foundation for effective protocol performance improvements. We argue that the challenge in modeling the per-flow throughput in IEEE 802.11 multi-hop ad hoc networks lies in the analysis of the freezing process and probability of collisions. We first classify collisions occurring in the whole transmission process into instantaneous collisions and persistent collisions. Then we present a four-dimensional Markov chain model based on the notion of the fixed length channel slot to model the Binary Exponential Backoff (BEB) algorithm performed by a tagged node. We further adopt a continuous time Markov model to analyze the freezing process. Through an iterative way, we derive the per-flow throughput of the network. Finally, we validate the accuracy of our model by comparing the analytical results with that obtained by simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.119-126
• /
• 2009

In this paper propose a method to reduce data for collision resolution. It is to reduce a damage of the back off algorithm to apply in both wire and wireless networks. Double back off size can be work in the first and the last movement point service as a same time in IEEE 802.16. It propose of the algorithm to be suited to IEEE 802.16 for increasing network access percentage in increase a data treat, delay error range and random access over fuller condition. In the result of the computer simulation, the proposal algorism give a increasing speed more than under the this paper. From this computer simulation result, we can get the confirmation of the small loss in saturated and saturated could be a longer in last network.