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

• Journal of Computing Science and Engineering
• /
• 제4권3호
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

• 한국시뮬레이션학회논문지
• /
• 제17권1호
• /
• pp.9-16
• /
• 2008

싱크의 이동성은 센서 네트워크에서 보다 많은 라우팅 변화를 발생시킨다. 능동적인 싱크의 이동으로 필요한 정보에 대한 적극적인 수집이 가능할 것이며, 이는 네트워크의 효용성을 더욱 높일 것이다. 하지만 고정된 싱크와 달리 싱크가 이동성을 가지게 되면 센서 노드와의 통신 연결이 지속적으로 변경될 수 있다. 라우팅 변동에 의한 경로 재설정이 불가피하게 되는 것이다. 이동 싱크로의 경로 설정에는 싱크에서 노드로의 경로 설정과 노드에서 이동 싱크로의 경로 설정 두 가지가 있다. 센서 네트워크에서 노드는 많은 제약을 가지고 있다. 노드에서 싱크로의 연결 설정을 발생할 경우 경로 배정에 대한 부담을 줄이는 방안이 제시되어야 한다. 따라서 본 논문에서는 노드에서 이동 싱크로의 경로 설정을 위한 에이전트 방식을 제안한다. 에이전트 방식은 중계 노드를 통하여 경로 설정이 필요한 노드와 이동 싱크와의 신속한 연결 방안을 제공한다.

• 한국시뮬레이션학회논문지
• /
• 제13권2호
• /
• pp.53-63
• /
• 2004

In ad hoc networks, the link survivability is firstly considered if a routing between two mobile nodes takes place through wireless environments, because all of mobile nodes participating in a connection dynamically move to anywhere. Also, mobile nodes have multi-role to implement a communication without a static system supported by wired networks. Hence, it is difficult that all mobile nodes continuously provide a reliable connection when the nodes operate each role for the connection. Therefore, it is desired to maximize the lifetime of a route as long as possible for the reliable communication. In this paper, we propose a proactive link management scheme that can provide the continuous route supported by the link handover. It consider the wireless link quality and the power lifetime of a node so that the link handover is implemented for the link survivability without disconnecting the route on the communication.

• 융합보안논문지
• /
• 제12권4호
• /
• pp.91-96
• /
• 2012

무선 네트워크의 많은 분야 중에서 MANET(Mobile Ad-hoc Network)은 상당히 발전이 되어있는 기술이다. MANET을 구성하는 노드들은 다중 홉 무선 연결을 이용하여 데이터 전달을 하게 된다. 이러한 환경에서 노드들의 데이터 접근 성능과 가용성을 향상시킬 수 있는 방법이 캐싱 기법이다. 기존의 많은 연구들은 이동 노드들의 다중 홉 연결을 향상시키기 위해 동적인 라우팅 프로토콜에 대해 많은 연구가 이루어져왔다. 그러나 노드들의 이동으로 인하여 유효한 캐시 정보의 관리 및 유지가 쉽지 않다. 본 논문에서는 이동 노드가 원하는 정보의 캐시 발견시 오버헤드를 줄이고 노드들의 이동으로 인한 연결 관리를 위해 클러스터 기반 캐싱 기법을 제안하였다. 그리고 각 클러스터 헤드에서 유효한 캐시 테이블을 유지할 수 있도록 하기 위해 HLP를 이용하였다. 본 논문에서 제안한 기법의 효율성은 실험을 통해 확인하였다.

• Steel and Composite Structures
• /
• 제36권5호
• /
• pp.493-506
• /
• 2020

The load-slip relationship of the shear connection is an important parameter in design and analysis of composite structures. In this paper, a load-slip curve prediction method of the shear connection based on the artificial neural networks (ANNs) is proposed. The factors which are significantly related to the structural and deformation performance of the connection are selected, and the shear stiffness of shear connections and the transverse coordinate slip value of the load-slip curve are taken as the input parameters of the network. Load values corresponding to the slip values are used as the output parameter. A twolayer hidden layer network with 15 nodes and 10 nodes is designed. The test data of two different forms of shear connections, the stud shear connection and the perforated shear connection with flange heads, are collected from the previous literatures, and the data of six specimens are selected as the two prediction data sets, while the data of other specimens are used to train the neural networks. Two trained networks are used to predict the load-slip curves of their corresponding prediction data sets, and the ratio method is used to study the proximity between the prediction loads and the test loads. Results show that the load-slip curves predicted by the networks agree well with the test curves.

• Structural Engineering and Mechanics
• /
• 제43권3호
• /
• pp.349-370
• /
• 2012

Variable-node finite element families, termed (4 + k + l + m + n)-node elements with an arbitrary number of nodes (k, l, m, and n) on each of their edges, are developed based on the generic point interpolation with special bases having slope discontinuities in two-dimensional domains. They retain the linear interpolation between any two neighboring nodes, and passes the standard patch test when subdomain-wise $2{\times}2$ Gauss integration is employed. Their shape functions are automatically generated on the master domain of elements although a certain number of nodes are inserted on their edges. The elements can provide a flexibility to resolve nonmatching mesh problems like mesh connection and adaptive mesh refinement. In the case of adaptive mesh refinement problem, so-called "1-irregular node rule" working as a constraint in performing mesh adaptation is relaxed by adopting the variable-node elements. Through several examples, we show the performance of the variable-node finite elements in terms of accuracy and efficiency.

• 한국멀티미디어학회논문지
• /
• 제21권6호
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• 한국인터넷방송통신학회논문지
• /
• 제11권6호
• /
• pp.169-175
• /
• 2011

본 논문은 Ad Hoc 네트워크 내의 노드간 통신뿐만 아니라 외부의 인터넷 접속을 제공하는 이동용 IP 라우터 설계에 관한 것이다. Ad Hoc 네트워크는 유선 인프라스트럭쳐 도움 없이 노드간 서로 협력하여 정보를 교환할 수 있는 네트워크이고, 이동 IP 라우터는 네트워크를 하나의 이동 단위로 간주하여, 이동하는 공간에서도 정지된 공간에서와 같은 인터넷 접속을 지원한다. Ad Hoc 네트워크 의 라우팅을 수용하면서 원활한 인터넷 접속을 제공하고자 한다. 이를 통하여 이동용 IP 라우터는 Ad Hoc 단말에게 인터넷 접속 서비스, 라우팅, 및 이동성을 등과 같은 다양한 무선통신 서비스를 제공해 줄 수 있다.

• 한국정보통신학회논문지
• /
• 제9권1호
• /
• pp.58-64
• /
• 2005

본 논문은 Ad-hoc 네트워크에서의 전송을 효율적으로 하기 위한 클러스터링 알고리즘에 대해 실험을 통하여 살펴보았다. Ad-hoc 네트워크상 노드들은 정보전송과 위치등록, 노드간의 라우팅 경로 유지를 위해 많은 패킷전송이 이루어진다. 이러한 환경에서의 트래픽은 고정망에서 보다 이동성 변수에 따라 더욱 많은 수가 발생하게 될 것이다. 본 논문에서는 무선 Ad-hoc 다중 홉에서의 트래픽 제어를 위한 클러스터링 알고리즘을 통해 패킷 전송효율을 분석하여 그 결과를 제시한다.