• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.170-177
• /
• 2005

Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.205-214
• /
• 2011

In 3rd generation project partnership long term evolution, wireless multicast techniques which send the same data to multiple users under single frequency networks have attracted much attention. In the multicast system, the transmission mode needs to be selected for efficient data transfer while satisfying the multicast coverage requirement. To achieve this, users' channel state information (CSI) should be available at the transmitter. However, it requires too much uplink feedback resource if all the users are allowed to transmit their CSI at all the time. To solve this problem, in this paper, the multicast coverage prediction is suggested. In the proposed algorithm, each user measures its transition probabilities between the success and the fail state of the decoding. Then, it periodically transmits its CSI to the basestation. Using these feedbacks, the basestation can predict the multicast coverage. From the simulation results, we demonstrate that the proposed scheme can predict the multicast system coverage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.993-999
• /
• 2011

In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7C
• /
• pp.527-537
• /
• 2012

In this paper, we propose unmanned vehicle based tracking network (UVTN) architecture and algorithms which employ multiple autonomous unmanned ground vehicles (AUGV) to efficiently follow targets in a group. The goal of UVTN is to maximize the service coverage while tracking target nodes for monitoring or providing the network access. In order to achieve this goal, UVTN performs periodic expansion and contraction which results in optimized redistribution of AUGV's in the network. Also, enhanced algorithms such as fast contraction and longest first are also discussed to improve the performance of UVTN in terms of the average coverage ratio and traveled distance. Simulation results show that the proposed UVTN and enhanced algorithms can effectively track the moving target and provide the consistent coverage.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.2
• /
• pp.109-116
• /
• 2017

In this paper, we propose an Internet of Things (IoT) platform for ocean observation buoys. The proposed system consists of various sensor modules, a gateway, and a remote monitoring site. In order to integrate sensor modules with various communications interfaces, we propose a controller area network (CAN)-based sensor data packet and a protocol for the gateway. The proposed scheme supports the registration and management of sensor modules so as to make it easier for the buoy system to manage various sensor modules. Also, in order to extend communication coverage between ocean observation buoys and the monitoring site, we implement a multi-hop relay network based on a mesh network that can provide greater communication coverage than conventional buoy systems. In addition, we verify the operation of the implemented multi-hop relay network by measuring the received signal strength indication between buoy nodes and by observing the collected data from the deployed buoy systems via our monitoring site.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1144-1147
• /
• 2013

Dual-mode terminals (DMTs) equipped with cellular and WLAN interfaces have become popular in recent years. Users of DMTs can enjoy high-speed WLAN Internet access and wide area Internet access to cellular networks. However, a DMT may consume power inefficiently when discovering a WLAN with inherently limited service coverage. In this letter, we propose to use smart WLAN discovery (SWD) to minimize the power consumption required for WLAN discovery. To minimize the power consumption of a DMT, an SWD DMT activates its WLAN interface only when the DMT transfers data within the WLAN coverage area. The simulation results of SWD show an improved power-saving performance compared to previous WLAN discovery schemes.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.441-457
• /
• 2014

Observed from the recent performance evaluation of clustering schemes in wireless sensor networks, we found that most of them did not consider various sensor characteristics and its application environment. Without considering these, the performance evaluation results are difficult to be trusted because these networks are application-specific. In this paper, for the fair evaluation, we measured several clustering scheme's performance variations in accordance with sensor data pattern, number of sensors per node, density of points of interest (data density) and sensor coverage. According to the experiment result, we can conclude that clustering methods are easily influenced by POI variation. Network lifetime and data accuracy are also slightly influenced by sensor coverage and number of sensors. Therefore, in the case of the clustering scheme that did not consider various conditions, fair evaluation cannot be expected.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.605-606
• /
• 2012

In this paper, we consider the problem of scheduling sensor activity to prolong the network lifetime while guaranteeing both discrete target coverage and connectivity among all the active sensors and the sink, called connected target coverage (CTC) problem. We proposed a distributed scheme called Distributed Lifetime-Maximizing Scheme (DLMS) to solve the CTC problem. Our proposed scheme significantly reduces the cost of the construction of the connected cover graphs in comparison with the some conventional schemes. In addition, the energy consumption is more balanced so that the network lifetime will be increased. Our simulation results show that DLMS scheme performs much better than the conventional schemes in terms of the network lifetime.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.17-23
• /
• 2012

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, interference and network throughput by simulation on various network topology.