• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.276-283
• /
• 2012

Nowadays, wireless sensor networks (WSNs) comprise a tremendously growing infrastructure for monitoring the physical or environmental conditions of objects. WSNs pose challenges to mitigating energy dissipation by constructing a reliable and energy saving network. In this paper, we propose a novel network construction and routing method by defining three different duties for sensor nodes, that is, node gateways, cluster heads, and cluster members, and then by applying a hierarchical structure from the sink to the normal sensing nodes. This method provides an efficient rationale to support the maximum coverage, to recover missing data with node mobility, and to reduce overall energy dissipation. All this should lengthen the lifetime of the network significantly.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1065-1078
• /
• 2023

In vehicular networks, diverse safety information can be shared among vehicles through internet connections. In vehicle-to-internet communications, vehicles on the road are wirelessly connected to different cloud networks, thereby accelerating safety information exchange. Onboard sensors acquire traffic-related information, and reliable intermediate nodes and network services, such as navigational facilities, allow to transmit safety information to distant target vehicles and stations. Using vehicle-to-network communications, we minimize delays and achieve high accuracy through consistent connectivity links. Our proposed approach uses intermediate nodes with two-hop separation to forward information. Target vehicle detection and routing of safety information are performed using machine learning algorithms. Compared with existing vehicle-to-internet solutions, our approach provides substantial improvements by reducing latency, packet drop, and overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.33-40
• /
• 2017

In this paper, we propose a sink-location management and data-routing scheme to effectively support the mobile sink in solar-powered WSN. Battery-based wireless sensor networks (WSNs) have a limited lifetime due to their limited energy, but solar energy-based WSNs can be supplied with energy periodically and can operate forever. On the other hand, introduction of mobile sink in WSNs can solve some energy unbalance problem between sink-neighboring nodes and outer nodes which is one of the major challenges in WSNs. However, there is a problem that additional energy should be consumed to notify each sensor node of the location of the randomly moving mobile sink. In the proposed scheme, one of the nodes that harvests enough energy in each cluster are selected as the cluster head, and the location information of the mobile sink is shared only among the cluster heads, thereby reducing the location management overhead. In addition, the overhead for setting the routing path can be removed by transferring data in the opposite direction to the path where the sink-position information is transferred among the heads. Lastly, the access node is introduced to transmit data to the sink more reliably when the sink moves frequently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.601-603
• /
• 2013

The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.623-625
• /
• 2012

The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.257-257
• /
• 2004

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.369-372
• /
• 2003

In this paper, we propose impr oved binary tree vector quantization based on spatial sensitivity which is one of the human visual properties. We combine the weights based on spatial masking effect according to changes of three primary colors in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get the better result in subjective qualify test and PSNR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3738-3750
• /
• 2015

Sybil attack is a special kind of attack which is difficult to be detected in Wireless Sensor Network (WSN). So a lightweight detection mechanism based on LEACH-RSSI-ID (LRD) is proposed in this paper. Due to the characteristic of Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, none of nodes can be the cluster head forever.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.801-807
• /
• 2013

WSN consists of hundreds to thousands of sensor nodes. In order to solve the problem of energy consumption imbalance cluster head is reelected in every round, while node authentication scheme is utilized for secure communication. However, re-clustering increases the overhead of sensor nodes and during the node authentication phase the frequent AREQ/AREP message exchange also increases the overhead. Therefore, a secure and energy efficient protocol, by which overhead of sensor nodes is reduced and long time communication is achieved, is required for wireless sensor network. In this paper, an energy efficient and reliable IDE-LEACH protocol for WSN is proposed. The proposed protocol is prolongs networks lifetime about average 20% compared to the LEACH-based protocols and all attending nodes in communication form BS authentication consisted of trusted nodes.

• Journal of Internet Computing and Services
• /
• v.14 no.6
• /
• pp.107-115
• /
• 2013

Various networks can be observed in the world. Knowledge networks which are closely related with technology and research are especially important because these networks help us understand how knowledge is produced. Therefore, many studies regarding knowledge networks have been conducted. The assortativity coefficient represents the tendency of connections between nodes having a similar property as figures. The relevant characteristics of the assortativity coefficient help us understand how corresponding technologies have evolved in the keyword-based patent network which is considered to be a knowledge network. The relationships of keywords in a knowledge network where a node is depicted as a keyword show the structure of the technology development process. In this paper, we suggest two hypotheses basedon the previous research indicating that there exist core nodes in the keyword network and we conduct assortativity analysis to verify the hypotheses. First, the patents network based on the keyword represents disassortativity over time. Through our assortativity analysis, it is confirmed that the knowledge network shows disassortativity as the network evolves. Second, as the keyword-based patents network becomes disassortavie, clustering coefficients become lower. As the result of this hypothesis, weconfirm the clustering coefficient also becomes lower as the assortative coefficient of the network gets lower. Another interesting result concerning the second hypothesis is that, when the knowledge network is disassorativie, the tendency of decreasing of the clustering coefficient is much higher than when the network is assortative.