• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.161-169
• /
• 2002

Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

• 한국통신학회논문지
• /
• 제27권11C호
• /
• pp.1158-1163
• /
• 2002

In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.

• 한국정보통신학회논문지
• /
• 제13권12호
• /
• pp.2555-2562
• /
• 2009

본 논문에서 제안한 알고리즘은 IP데이터망에서 웜 스캐닝 공격을 탐지하는 TRW 알고리즘을 분석하고 음성망에 적용하기 위해 연결 과정과 연결 종료 과정을 설계하며, 이를 카운트하는 확률 함수를 정의하였다. 제안한 알고리즘을 평가하기 위해 임계치를 설정하고, 공격 트래픽 종류에 따른 연결확률을 변화시켜 알고리즘의 효율성을 측정하였으며, 공격패킷의 공격 속도에 따른 탐지시간을 측정하였다. 평가 결과 본 논문에서 제안한 알고리즘은 공격 속도가 초당 10패킷일 경우, DDoS 공격이 시도되고 약 1.2초 후에 탐지를 하고 초당 20개일 경우에는 약 0.5초 후에 탐지함을 확인하였다.

• Journal of Electrical Engineering and Technology
• /
• 제8권3호
• /
• pp.649-657
• /
• 2013

DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.11-20
• /
• 1997

It is a recent trend that mobile communications and PCS are intergrated into the broadband network. Broadband mutlimedia traffic will be transported over the integrated network. In this paper, we propose a connection re-routing method for fast inter-switch hadoffs and dynamic resurce reservation scheme, which is based on the proposed re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing, the proposed re-routing method is to reserve VPI/VCIs for possible inter-swich handoff calls in advance. Our reservation scheme is to statistically reserve the fixed resources for possible inter-switch handoff calls, according to the QoS of the handoff calls. The simmulation reslts show that our proposed scheme satisfies the required QoS of handoff calls and keep the dropping probability of handoff calls lower than other schemes.

• 한국정보과학회논문지:정보통신
• /
• 제27권2호
• /
• pp.149-159
• /
• 2000

이동 컴퓨팅 환경에서 이동 호스트의 캐쉬 유지를 위한 정보 전송 기법에는 브로드캐스팅을 기반으로 한 무효화와 전파 기법이 있다. 기존 연구들은 일반적으로 제한된 통신 대역폭과 잦은 접속단절 상태에 적응할 수 있는 무효화 기법을 제안한다. 그러나 사용빈도가 높은 공유 데이타에 대한 무효화는 이동 호스트의 빈번한 캐쉬 요청을 발생시킨다. 전파 기법은 캐쉬 요청은 감소시킬 수 있지만, 잦은 부분단절 및 접속단절 상태에서 메시지 파손 및 분실 가능성이 높아 시스템 성능을 저하시킨다. 이 논문에서는 이러한 문제점을 해결하기 위해 무선 네트워크의 연결 상태에 따라 무효화와 전파 메시지의 브로드캐스팅 비율을 동적으로 조절하는 적응적 캐쉬 유지 기법을 제안한다. 제안한 기법은 네트워크가 안정된 연결 상태를 유지할 때는 전파 메시지를 브로드캐스팅하여 캐쉬 요청을 감소시키고 서버의 응답시간을 단축시킨다. 잦은 부분단절 및 접속단절이 발생하여 가용 통신 대역폭이 감소하면, 점차적으로 무효화 메시지의 브로드캐스팅 비율을 늘려 메시지의 파손 및 손실 확률을 최소화한다. 따라서 제안한 기법은 기존의 두 기법이 이동 컴퓨팅 환경에서 가지는 문제점을 해결하였다.

• Journal of Information Processing Systems
• /
• 제10권4호
• /
• pp.568-580
• /
• 2014

To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.

• Journal of applied mathematics & informatics
• /
• 제41권4호
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• 전자공학회논문지
• /
• 제49권11호
• /
• pp.132-138
• /
• 2012

VANET(Vehicular Ad-hoc Network)을 지원하기 위해 IEEE 802.11p 규격이 표준화 진행중에 있다. 802.11 MAC 프로토콜은 전송률에 관계없이 모든 노드들에 동일한 확률의 채널 획득 기회를 부여하므로, 전송률이 낮은 노드가 상대적으로 채널 점유시간이 길어져서 전송률이 높은 노드도 전송률이 낮은 노드의 전송률로 하향 평준화되는 문제와, 노드가 많아질 경우 충돌 확률이 높아지는 문제가 있다. 본 논문에서 제안하는 알고리듬은 일단 채널을 획득한 단말기가 다른 노드와의 채널획득 경쟁의 우위를 일정 기간 유지하는 알고리듬에, 현재 전송률에 따라 적절히 연속전송 한계값을 정하는 TXOP 개념을 더했다. CW의 폭을 표준보다 더 넓게 설정여 효과적으로 충돌을 회피하면서도 대기시간을 최소화하면서 또한 채널 점유 시간에 따라 연속전송 한계값을 다르게 정하는 방법을 통해 전체 네트워크의 향상을 보이고 있다.

• International journal of advanced smart convergence
• /
• 제12권4호
• /
• pp.55-62
• /
• 2023

Slotted-Aloha (S-Aloha) has been widely employed in random access networks owing to its simple implementation in a distributed manner. To enhance the throughput performance of the S-Aloha, connection-based slotted-Aloha (CS-Aloha) has been proposed in recent years. The fundamental principle of the CS-Aloha is to establish a connection with a short-sized request packet before transmitting data packets. Subsequently, the connected node transmits long-sized data packets in a batch of size M. This approach efficiently reduces collisions, resulting in improved throughput compared to the S-Aloha, particularly for a large M. In this paper, we address the short-term fairness of the CS-Aloha, as quantified by Jain's fairness index. Specifically, we evaluate how equitably the CS-Aloha allocatestime slots to all nodes in the network within a finite time interval. Through simulation studies, we identify the impact of system parameters on the short-term fairness of the CS-Aloha and propose an optimal transmission probability to support short-term fairness.