• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.850-857
• /
• 2005

Sensor networks consist of sensor nodes with small size, low cost, lowpower consumption, and multi-functions to sense, to process and to communicate. The main issue in sensor networks has been focused on minimizing power consumption of sensors to maximize network life time. In some critical applications, however, the most important issue is to transmitsensing information to the end user (the sink node) with reliability. Reliable information forwarding using multiple paths in sensor networks (ReinForM) has been proposed to achieve desired reliability in the error-prone channel, but it needs increasing transmission riverhead as the channel error rate becomes high and the number of hops between the source node and the sink node increases. In this paper, we propose a reliable transmission rnechanissmusing intermediate source nodes in sensor networks (ReTrust) to reduce packet overhead while keeping the desired reliability. ReTrust has beenshown to provide desired reliability and reduced overhead via simulationsand analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.471-476
• /
• 2015

In this paper, we propose an energy efficient hybrid MAC protocol for multi-hop wireless sensor networks. The proposed MAC protocol used a hybrid mechanism, in which contention-based MAC protocol and contention free MAC protocol are combined. The sensor nodes located far from the sink node usually send few data packet since they try to send measured data by themselves. So contention-based MAC protocol is useful among them. But other nodes located near sink node usually have lots of data packets since they plays as a relay node. Contention-based MAC protocol among them is not suitable. Using contention-based MAC protocol in heavy data traffic environment, packet collisions and transmission delay may increase. In this paper, slot assignment between sender nodes by sink node is used. The proposed mechanism is efficient in energy and latency. Results showed that our MAC protocol outperformed other protocol in terms of data packet delivery delay and energy consumption.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1229-1233
• /
• 2010

In event-driven wireless sensor networks, network congestion occurs when event data, which have higher transmission rates than periodic sensing data, arc forwarded to bottleneck links. As the congestion continues, congestion collapse is triggered, so most of packets from source nodes are failed to transmit to a sink node. Rate control schemes can be a solution for preventing the congestion collapse problem. In this paper, a rate control scheme that each node controls child node's data rate based on congestion patterns is proposed. Experiments show that the proposed scheme effectively controls network congestion and successfully transmits more event data packets to a sink node than existing rate control schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.123-134
• /
• 2008

In this paper, a routing algorithm for wireless sensor networks is proposed to improve the efficiency of energy consumption in sensor nodes. Each sensor node has the value called ‘Flooding Level’ obtained through the initial flooding from a sink node instead of sending beacon messages in multi-hop sensor field. This value can be used for guaranteeing the sensor nodes to connect with a sink node and determining the roles of cluster-head and cluster-gateway node efficiently and simply during the clustering. If different algorithms are added to our protocol, it will work better in the side of energyefficiency. This algorithm is evaluated through analysis and extensive simulations.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.268-277
• /
• 2016

Load balancing is a significant technique to prolong a network's lifetime in sensor network. This paper introduces a hybrid approach named as Load Distributing Hybrid Routing Protocol (LDHRP) composed with a border node routing protocol (BDRP) and greedy forwarding (GF) strategy which will make the routing effective, especially in mobility scenarios. In an existing solution, because of the high network complexity, the data delivery latency increases. To overcome this limitation, a new approach is proposed in which the source node transmits the data to its respective destination via border nodes or greedily until the complete data is transmitted. In this way, the whole load of a network is evenly distributed among the participating nodes. However, border node is mainly responsible in aggregating data from the source and further forwards it to mobile sink; so there will be fewer chances of energy expenditure in the network. In addition to this, number of hop counts while transmitting the data will be reduced as compared to the existing solutions HRLBP and ZRP. From the simulation results, we conclude that proposed approach outperforms well than existing solutions in terms including end-to-end delay, packet loss rate and so on and thus guarantees enhancement in lifetime.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.158-159
• /
• 2011

Energy efficiency in wireless sensor networks (WSNs) is one significant factor that needs to be considered when making any designs or doing any enhancements on the communication protocol stack. In WSNs using traditional geographic routing, when a sensor node receives a data packet that needs to be transmitted to the sink, it will forward the packet to the neighbor node which is closest to the sink. The traditional geographic routing assumes that the link quality is always 100%. This may cause a bad result as per which we waste too many energy for retransmissions between the two nodes. Thus, the problem here is how to select such node as forwarder at most efficiently in the aspect of both energy consumption and the distance toward the destination. The better node we choose, the more energy we can conserve for the whole network. In this paper, we propose a next-hop forwarding selection metric, called Energy Consumption for Transmission (ECT), which can resolve the above problem in the best way.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.758-767
• /
• 2017

IoT paradigm which makes a information without direct intervention of a human and interworks with other objects, humans and systems is attracting attention. It will be expected the number of smart devices equipped with sensors and wireless communication capabilities is reached to about 260 billion by 2020. With the vast amount of sending data generated from rapidly increasing number of smart devices, it will bring up the traffic growth over internet and congestion in wireless networks. In this paper, we utilize the smart device as a sink node to collect and forward the sensing data periodically in IoT and propose a heuristic algorithm for a selection of sink nodes' set with each sink node satisfies the QoS its applications because a selection of optimal sink nodes' set is NP-hard problem. The complexity of proposed heuristic algorithm is $O(m^3)$ and faster than the optimal algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.5
• /
• pp.3421-3425
• /
• 2015

In sensor networks, sensor nodes are usually distributed to manage the networks in continuous unique area, however as by the network property nodes can be located in several areas. The data gathering of distributed nodes to several areas can be different with current continuous area. Hence, the distributed networks can be differently managed to the current continuous networks. In this paper, we describe the data gathering of sensor nodes in distributed sensor areas. It is possible that sensor nodes cannot instantly connect the mobile sink, and the node operation should be considered. The real time data sending to the instant connection scheme of mobile sink can be implemented, but the property of mobile sink should be considered for the sink connection of distributed areas. In this paper, we analyze the proposed scheme by the simulation results. The simulation results show that the overall lifetime to the periodic data gathering method is longer than the threshold method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.1-13
• /
• 2006

In this paper, we introduce a novel key management scheme that is based on the key pre-distribution but provides the key re-distribution method, in order to manage keys for message encryption and authentication of lower-layer sensor nodes on hierarchical mobile sensor networks. The characteristics of our key management are as follows: First, the role of key management is distributed to aggregator nodes as well as a sink node, to overcome the weakness of centralized management. Second, a sink node generates keys using regression model, thus it stores only the information for calculating the keys using the key information received from nodes, but does not store the relationship between a node and a key, and the keys themselves. As the disadvantage of existing key pre-distributions, they do not support the key re-distribution after the deployment of nodes, and it is hard to extend the key information in the case that sensor nodes in the network enlarge. Thirdly, our mechanism provides the resilience to node capture(${\lambda}$-security), also provided by the existing key pre-distributions, and fourth offers the key freshness through key re-distribution, key distribution to mobile nodes, and scalability to make up for the weak points in the existing key pre-distributions. Fifth, our mechanism does not fix the relationship between a node and a key, thus supports the anonymity and untraceability of mobile nodes. Lastly, we compare ours with existing mechanisms, and verify our performance through the overhead analysis of communication, computation, and memory.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.149-154
• /
• 2024

This paper proposes an algorithm that remedy Floyd's the tortoise and the hare algorithm (THA) shortcomings which is specialized in singly linked list (SLL), so this algorithm fails to detect the cycle in undirected graph, digraph, and tree with multiple inputs or outputs. The proposed algorithm simply pruning the source and sink with only one edge using cycle detection of single edge node pruning. As a result of the experimental of various list, undirected graph, digraph, and tree, the proposed algorithm can be successively detect the cycle all of them. Thus, the proposed algorithm has the simplest and fastest advantage in the field of cycle detection.