• Journal of information and communication convergence engineering
• /
• 제10권2호
• /
• pp.141-148
• /
• 2012

This paper presents a simple but efficient scheme incorporating a reputation-based approach and a cross-layer approach, called the SIM scheme, for maintaining reliable connectivity and high performance in ad-hoc wireless networks. The SIM scheme incorporates the following two things: an ad-hoc routing scheme with a reputation-based approach exploiting the game theory concept based on an evolutionarily stable strategy, and a cross-layer approach between the network layer and the transport layer employing a reputation-based approach.

• 대한산업공학회지
• /
• 제40권5호
• /
• pp.520-525
• /
• 2014

When the PCF (Point Coordinated Function) MAC protocol is combined with the frame aggregation method to enhance the MAC performance in IEEE 802.11 wireless LANs, the formulae for the optimal frame aggregation level for best PCF MAC performance were derived in our previous study. We extend the formulae for the PCF protocol to derive the optimal frame aggregation level for the connectivity-based multipolling MAC protocol in IEEE 802.11 wireless LANs. By simulations, we compare the performances of IEEE 802.11 wireless LANs with the optimal and random frame aggregation levels. Compared with the random frame aggregation level, the optimal frame aggregation level significantly improves the performance of IEEE 802.11 wireless LANs.

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

• 대한산업공학회지
• /
• 제38권4호
• /
• pp.285-288
• /
• 2012

The connectivity-based reliable multicast MAC protocol was proposed for IEEE 802.11 wireless LANs and the formulae for the lower bounds of the multicast downlink throughput and the uplink throughput of the connectivity-based reliable multicast MAC protocol were derived in our previous study. We provide the tighter throughput lower bounds of the connectivity-based reliable multicast MAC protocol than the lower bounds presented in our previous study.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• Journal of information and communication convergence engineering
• /
• 제11권2호
• /
• pp.69-81
• /
• 2013

Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

• 한국통신학회논문지
• /
• 제35권12A호
• /
• pp.1152-1159
• /
• 2010

무선 메쉬 네트워크는 무선 링크를 통해 백본 네트워크를 형성하여 사용자에게 인터넷 접근을 제공한다. WMN의 주요 이슈는 네트워크 용량이다. 이를 위해 IEEE 802.11 의 멀티 채널과 멀티 레이트를 활용할 수 있다. 채널은 채널 할당에 따라 노드 연결성 (node connectivity)과 채널 다양성 (channel diversity)을 결정한다. 또한, IEEE 802.11 멀티 레이트 네트워크에서는 RA (Rate Anomaly) 문제가 발생하는데, 이는 낮은 레이트 링크들이 높은 레이트 링크의 성능을 심각히 저하시키는 현상이다. 본 논문에서는 노드 연결성과 채널 다양성을 향상시키고 RA문제를 완화하는 레이트 분할 멀티 채널 (Rate Separating Multi-Channel, RSMC) 프로토콜을 제안한다. RSMC는 트리 기반 WMN를 형성하여 채널 다양성을 증가시키고, 다른 레이트를 사용하는 트리 위의 링크들을 채널로 분리시켜 RA를 줄인다. 또한, 노드 연결성을 증가하기 NC (Network Connectivity) 알고리즘을 사용한다. 시뮬레이션을 통해 RSMC이 기존 멀티 채널 프로토콜보다 총 처리율, 노드 연결성, 채널 다양성 측면에서 향상된 성능을 보임을 입증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3335-3356
• /
• 2015

In this paper, we analyze the connectivity of cognitive radio ad-hoc networks in a log-normal shadow fading environment. Considering secondary user and primary user's locations and primary user's active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio ad-hoc networks in three aspects and compare with the connectivity of ad-hoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multi-hop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio ad-hoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user's density and primary user's average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user's average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio ad-hoc networks in practical wireless environment.

• 정보처리학회논문지C
• /
• 제12C권4호
• /
• pp.525-534
• /
• 2005

본 논문에서는 무선 센서 네트워크 상에서 노드들 간의 연결성만을 이용하여 노드의 위치를 추정하는 분산 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘들은 기본적으로 공통 인접 노드의 개수를 이용하여 인접한 두 노드간의 거리를 추정하는 기법에 기반하고 있다. 제안된 알고리즘들의 위치 추정 성능을 모의실험을 통하여 분석 비교하였다.

• 대한산업공학회지
• /
• 제36권2호
• /
• pp.94-100
• /
• 2010

The reliable multicast MAC (Medium Access Control) protocol is needed to guarantee the recipients' nonerroneous reception of the multicast data frames, which can be transmitted by the AP (Access Point) in infrastructure mode IEEE 802.11 wireless LANs. Enhancing the BMMM (Batch Mode Multicast MAC) protocol, in the literature, the connectivity-based reliable multicast MAC protocol was proposed to reduce the RAK (Request for ACKnowledgement) frame transmissions and enhance the multicast MAC performance. However, the number of necessary RAK frame transmissions increases as the number of multicast recipients increases. To alleviate the problem of the larger number of RAK frame transmissions with the larger number of multicast recipients, we propose the clustering algorithm for partitioning the recipients into a small number of clusters, so that the recipients are connected each other within the same clusters. Numerical examples are presented to show the reliable multicast MAC performance improvement by the clustering algorithm.