• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.374-385
• /
• 2010

Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

• Journal of the Optical Society of Korea
• /
• v.13 no.1
• /
• pp.98-106
• /
• 2009

This paper proposes an optical wireless transfer agent method which realizes the continuous and swift data transfer of optical wireless terminals in optical wireless networks. The unguided wireless channel generally shows frequent link disconnections and propagation delays due to weak wireless links. Specially speaking, optical wireless channels have more vulnerable links and roaming propagation delays relative to the weakness of the previous RF channels due to their low signal connectivity and small geographic coverage. Conventional optical wireless network protocols did not consider any fault models about physical link faults. Consequently, they have shown data transfer inefficiency for both data link control and physical wireless link control. To overcome these optical wireless environmental problems, this paper suggests a new wireless access point (or base station) agent system, which provides wireless or mobile clients with previous link layer protocols compensated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3034-3055
• /
• 2014

Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.26-32
• /
• 2014

Vehicular-to-anything (V2X) technology is attractive for wireless vehicular ad-hoc networks (VANETs) because it allows for opportunistic choice of a vehicular protocol between vehicular-to-vehicular (V2V) and vehicular-to-infrastructure (V2I) communications. In particular, achieving seamless connectivity in a VANET with nearby network infrastructure is challenging. In this paper, we propose a density-based opportunistic broadcasting (DOB) protocol, in which opportunistic connectivity is carried out by using the nearby infrastructure and opposite vehicles for solving the problems of disconnection and long end-to-end delay times. The performance evaluation results indicate that the proposed DOB protocol outperforms the considered comparative conventional schemes, i.e., the shortest path protocol and standard mobile WiMAX, in terms of the average end-to-end delay, packet delivery ratio, handover latency, and number of lost packets.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.662-664
• /
• 2011

무선 센서 네트워크에서 관심지역이 각 센서에 의하여 얼마나 잘 센싱되는지의 정도에 대한 커버리지(coverage)와 센서에 의하여 센싱된 데이터를 싱크노드까지 얼마나 잘 전달될 수 있는지의 정도에 관한 연결성(connectivity)은 중요한 연구 분야이다. 이와 관련하여 본 논문에서는 센서 네트워크에서 p-coverage와 q-connectivity ($q{\leq}6$)를 만족하는 최적의 센서 배치패턴 문제에 관한 연구 결과를 기술한다. 특히, 1-coverage의 경우 최적이라 알려진 삼각 격자 패턴에 대하여 p-coverage와 6-connectivity을 만족하도록 하는 배치 방법을 제시한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.65-66
• /
• 2016

최근 과학의 발달로 사물에 대한 다양한 센서와 통신 기능을 부여하여 사람 대 사람 또는 사물 대 사물 서로 교류하는 개념인 IoT(Internet of Things)가 화제이다. IoT를 구성하는 요소 중에 하나인 Wireless Sensor Networks(WSN)에 대한 연구를 한다. WSN은 전쟁터의 정찰과 같은 가혹한 환경에 적용되며 이를 구성하는 센서는 제한된 자원을 가지고 있기 때문에 고장에 취약한 특성이 있다. 따라서 상호 통신이 외부 요인에 의해 단절된 네트워크의 연결 복구에 대한 연구가 지속적으로 이루어지고 있다. 본 논문에서는 이러한 WSN 네트워크의 연결 복구 방식, 연결 복구기법 및 알고리즘의 연구 동향에 대해서 서술한다.

• The Journal of Information Technology
• /
• v.9 no.4
• /
• pp.35-47
• /
• 2006

Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the portability of mobile clients. Mobile computing satisfies user's demands for convenience and performance to use information at any time and in any place, but it has many problems to be solved in the aspect of data management. The purpose of our study is to Implement Real-Time Mobile Query Processing System(MQPS) to solve problems related to database hoarding, the maintenance of shared dataconsistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client server environments. In addition, we proved the superiority of the proposed MQPS by comparing its performance to the C I S(Client-Intercept-Srever) model.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.1
• /
• pp.122-127
• /
• 2016

In this paper, new spectrum sensing schemes based on analog/RF front-end processing are introduced for IoT wireless sensor networks. While the conventional approaches for wireless channel cognition have been issued in signal processing area, the RF spectrum cognition concept makes it feasible to achieve cognitive wireless sensor networks (C-WSNs). The spectrum cognition at RF processing is categorized as four kinds of sensing mechanisms. Two recent reseaches are described as promising candidates for the C-WSN. One senses spectrum by the frequency discriminating receiver, the other senses and detects from the frequency selective super-regenerative receiver. The introduced systems with simple and low-power RF architectures play dual roles of channel sensing and demodulation. simultaneously. Therefore, introduced spectrum sensing receivers can be one of the best candidates for IoT wireless sensor devices in C-WSN environments.