• Journal of Digital Contents Society
• /
• v.14 no.3
• /
• pp.349-356
• /
• 2013

Products of Wi-Fi devices in recent years offer higher throughput and have longer signal coverage which also bring unnecessary signal interference to neighboring wireless networks, and result in decrease of network throughput. Signal interference is an inevitable problem because of the broadcast nature of wireless transmissions. However it could be optimized by reducing signal coverage of wireless devices. On the other hand, smaller signal coverage also means lower transmission power and lower data throughput. Therefore, in this paper, we analyze the relationship among signal strength, coverage and interference of Wi-Fi networks, and as a tradeoff between transmission power and data throughput, we propose a range-aware Wi-Fi network scheme which controls transmission power according to positions and RSSI(Received Signal Strength Indication) of Wi-Fi devices and analyze the efficiency of the proposed scheme by simulation.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1084-1090
• /
• 2015

In this paper, we propose a Tabu search algorithm to efficiently deploy the sensor nodes for maximizing the network sensing coverage in wireless sensor networks. As the number of the sensor nodes in wireless sensor networks increases, the amount of calculation for searching the solution would be too much increased. To obtain the best solution within a reasonable execution time in a high-density network, we propose a Tabu search algorithm to maximize the network sensing coverage. In order to search effectively, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum network sensing coverage and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.139-146
• /
• 2007

Mobile Sensor Network(MSN) is actively studied due to the advent of mobile sensors such as Robomote and Robotic Sensor Agents(RSAs), However, existing studies on MSN have mainly focused on coverage hole problem which occurs in Stationary Sensor Network(SSN). To address coverage hole problem, these studies make mobile sensors move temporarily so that they do not make the best use of the mobility of mobile sensors, Thus, a mechanism utilizing the continuous movement of mobile sensors is proposed to improve the network coverage performance. However, this mechanism is presently immature and does not explain how to make routing path and send data from mobile sensors to a sink node, Therefore, to efficiently make routing path and send data from mobile sensors to a sink node, we propose a communication protocol for mobile sensor network where mobile sensors continuously move. The proposed protocol deploys not only mobile sensors but also stationary sensors which send sensing data to a sink node instead of mobile sensors. Simulation results show that the proposed protocol improves the performance in terms of network coverage and traffic overhead, compared to conventional SSN protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.453-461
• /
• 2010

A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.639-642
• /
• 2003

본 논문에서는 청소로봇이 전 청소 영역을 CCPP(Complete Coverage Path Planning)를 이용해 경로를 생성한 후 재 경로계획 시 장애물의 미소한 변화로도 기존에 생성한 전 경로패턴을 바꾸지 않고 수정 할 수 있는 CD(Cell Decomposition)와 FN(Flow Network)을 이용한 CCPP 방식을 제안 하였다. 그리고 제안된 경로 계획에 대해 시뮬레이션으로 결과를 제시하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.697-705
• /
• 2010

In Wireless Sensor Networks (WSNs), blanket (area) coverage analysis is generally carried to find the minimum number of active sensor nodes required to cover a monitoring interest area with the desired fractional coverage-threshold. Normally, the coverage analysis is performed using the stochastic geometry as a tool. The major component of such coverage analysis is the assumed sensing model. Hence, the accuracy of such analysis depends on the underlying assumption of the sensing model: how well the assumed sensing model characterizes the real sensing phenomenon. In this paper, we review the coverage analysis for different deterministic and probabilistic sensing models like Boolean and Shadow-fading model; and extend the analysis for Exponential and hybrid Boolean-Exponential model. From the analytical performance comparison, we demonstrate the redundancy (in terms of number of sensors) that could be resulted due to the coverage analysis based on the detection capability mal-characterizing sensing models.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.17-24
• /
• 2023

The objective of this paper is to use Geographical Information Systems for identifying Digital Divide in Riyadh Neighborhoods, Saudi Arabia. Geo-database was created that includes Streets, Neighborhoods, ICT Access Data and Coverage Map for Riyadh. We used QGIS and overlay for analysis, intersection selected as tool for this paper. The results indicate that after analyzing the use of information communication technology in all regions of the Kingdom it turns that Riyadh, Ash Sharqiyyah and Makkah in average with percentage 50%, While Al Jawf, Al Madinah, and Najran are the least with percentage 42%. Then we focused on Riyadh to analyze the digital divide because it is the capital of Saudi Arabia and occupations the highest percent of communications towers in the KSA due to population density. Regarding coverage of the 4G, the neighborhoods at the center have recorded very high coverage score. While neighborhoods at the edges of the city have low values of coverage score. Same for 3G, it is more intense in the center and the coverage percentage is higher than 4G. For 2G we found it had the highest coverage compared to 3G or 4G

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.64 no.4
• /
• pp.321-326
• /
• 2015

Smart metering is one of the most implementable internet-of-thing service. In order to implement the smart metering, a wireless communication network should be newly designed and evaluated so as to satisfy quality-of-service of smart metering. In this paper, we consider a wireless network for the smart metering implemented with multi-purpose wireless chips and channel coding-functioned micro controllers. Especially, channel coding is newly adopted to improve successful frame transmission probability. Based on the successful frame transmission probability, average transmission delay and delay violation probability are analyzed. Using the analytical results, service coverage expansion is evaluated. Through the delay analysis, service feasibility can be verified. According to our results, channel coding needs not to be utilized to improve the delay performance if the smart metering service coverage is several tens of meters. However, if more coverage is required, chanel coding adoption definitely reduces the delay time and improve the service feasibility.

• 한국ITS학회:학술대회논문집
• /
• 2010.05a
• /
• pp.10-13
• /
• 2010