• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.47-56
• /
• 2009

We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.

• International Journal of Internet, Broadcasting and Communication
• /
• 제15권3호
• /
• pp.43-51
• /
• 2023

Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2052-2055
• /
• 2003

본 논문은 MDC의 전송 중 발생한 에러를 검출하고, 그 에러를 정정하는 알고리즘을 제안한다. 이 알고리즘은 기존의 MDC 와 같이 약간의 redundancy를 가지는 두 개의 sub-bitstream 을 생성하는데, 한쪽 sub-bitstream에 에러가 발생하였을 때, 다른 한쪽의 sub-bitstream을 이용하여, 발생한 비트 에러를 정정한다. 제안된 알고리즘에 대한 BER-SNR실험은 Generalized Gaussian source를 임의적으로 발생시켜서 결과를 얻어내었다. sub-bitstream에서 에러가 발생하였을 때 우리가 제안한 알고리즘은 BER<10/sup -3/에서 기존 알고리즘보다 약 12㏈ 높은 성능을 얻을 수 있었다.

• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.173-181
• /
• 2016

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

• 한국통신학회논문지
• /
• 제33권1C호
• /
• pp.68-78
• /
• 2008

The transmission of multimedia information over error-prone channels such as wireless networks has become an important area of research. In this paper, we propose two Error Concealment(EC) schemes for wireless transmission of JPEG2000 image. The Multiple Representation(MR) is employed as the preprocessing in our schemes, whereas the main error concealing operation is applied in wavelet domain at receiver side. The compressed code-stream of several subsampled versions of original image is transmitted over a single channel with random bit errors. In the decoder side, the correctly reconstructed wavelet coefficients are utilized to recover the corrupted coefficients in other sub-images. The recovery is carried out by proposed basic(MREC-BS) or enhanced(MREC-ES) methods, both of which can be simply implemented. Moreover, there is no iterative processing during error concealing, which results a big time saving. Also, the simulation results confirm the effectiveness and efficiency of our proposed schemes.

• 한국인터넷방송통신학회논문지
• /
• 제10권6호
• /
• pp.263-268
• /
• 2010

본 논문에서는 802.11n WLAN 시스템에서 우수한 오류성능을 유지하고 시스템 용량을 개선하기 위해 순환 지연 다이버시티와 블록 대각화 프리코딩 기법을 적용한 다중 사용자 MIMO OFDM 시스템을 제안하였다. 순환 지연 다이버시티(CDD : Cyclic Delay Diversity) 기법은 주파수 다이버시티를 이용하여 OFDM 시스템의 성능을 향상시키는 기법이다. 또한 블록 대각화 프리코딩 기법은 다중 사용자 MIMO 채널 환경에서 만들어진 여러 거지 프리코딩 기법 중 하나로 특이값 분해를 이용하여 zero-forcing을 하는 간단한 방법으로 구성되어 있다. 모의실험 결과를 통해 본 논문에서 제안하는 방법이 기존의 프리코딩을 사용하지 않는 CDD MIMO-OFDM 시스템에 비하여 높은 시스템 용량 성능을 보임을 확인할 수 있다.

• ETRI Journal
• /
• 제36권1호
• /
• pp.183-186
• /
• 2014

In this letter, we consider a cooperation system with multiple untrusted relays (URs). To keep the transmitted information confidential, we obtain joint channel characteristics (JCCs) through combining the channels from the source to the destination. Then, in the null space of the JCCs, jammers construct artificial noise to confuse URs when the source node broadcasts its data. Through a distributed implementation algorithm, the weight of each node can be obtained from its own channel state information. Simulation results show that high-level security of the system can be achieved when internal and external eavesdroppers coexist.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1599-1610
• /
• 2019

Intelligent services have expanded as Internet of Things (IoT) technology has evolved and new requirements emerge to accommodate various services. One new requirement is transmitting data over long distances with low-power. Researchers have developed low power wide area (LPWA) network technology to satisfy the requirement; this can improve IoT network infrastructure and increase the range of services. However, network coverage expansion causes several problems. The traffic load is concentrated at a specific gateway, which causes network congestion and leads to decreased transmission efficiency. Therefore, the approach proposed in this paper attempts to recognize and then avoid congestion through gateway channel hopping. The LPWA network employs multiple channels, so wireless channel hopping is available in a gateway. Devices that are not delay sensitive wait for the gateway to reappear on their wireless channel; delay sensitive devices change the wireless channel along the hopping gateway. Thus, the traffic load and congestion in each wireless channel can be reduced improving transmission efficiency. The proposed approach's performance is evaluated by computer simulation and verified in terms of transmission efficiency.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.