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

In wireless sensor networks, the importance of transporting data correctly with reliability is increasing gradually along with the need to support communications between the nodes and sink. Data flow from the sink to the nodes requires reliability for control or management that is very sensitive and intolerant of error; however, data flow from the nodes to the sink is relatively tolerant. In this paper, with emphasis on the data flow from the sink to the nodes, we propose a mechanism that considers accurate transport with reliability hop-by-hop. During the process of sending the data, if errors occur or data is missing, the proposed mechanism supports error recovery using a fixed window with selective acknowledgment. In addition, this mechanism supports congestion control depending on the buffer condition. Through the simulation, we show that this mechanism is accurate, reliable, and proper for transport in wireless sensor networks.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.177-186
• /
• 2019

In wireless sensor networks, the transmission success ratio would be decreased when the scale of the WSNs increased. To defeat this problem, we propose a multipath routing based on opportunistic routing for improving end-to-end reliability in large-scale wireless sensor networks. The proposed scheme exploits the advantages of existing opportunistic routing and achieves high end-to-end success ratio by branching like a multipath routing through local decision without information of the whole network. As a result of the simulation result, the proposed scheme shows a similar or higher end-to-end transmission success ratio and less energy consumption rather than the existing scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.153-158
• /
• 2016

Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• 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.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.51-58
• /
• 2008

Wireless sensor networks are used by various application areas to implement smart data processing and ubiquitous system. In the recent research of parking management system based on wireless sensor networks, adaptive sensing and efficient data processing are not considered. The effectiveness of implementing these distributed computing devices affects the performance of the applications in parking management. This paper proposes an adaptive sensing using fuzzy wireless sensor for the ubiquitous networks of parking management system. The fuzzy inference system is encoded in the sensor for efficient car presence detection. Moreover, a rule base adaptive module is proposed which wirelessly transmit the new values to each sensor for adapting the environment of car park area. The result of experiments shows that the fuzzy wireless sensor provides more throughputs and less time delays compared to a normal method of data gathering by wireless sensors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.68-77
• /
• 2010

Wireless sensor networks are installed in various environments and collect sensing data through wireless links. The quality of a wireless link may be unstable due to environment causes and hardware performance in wireless sensor networks. Since the change of the link quality may cause data loss, sensor nodes need to adaptively estimate the change of the link quality. Also, the routing protocol should deal with this situation. In this paper, the adaptive link quality estimation and routing scheme in the large-scale wireless sensor networks are proposed. When the quality of a link is unstable, sensor nodes agilely estimate the quality of links, and the new route is selected. When quality of a link is stable, the link quality is occasionally estimated so that the energy consumption is reduced. Moreover, sensor nodes exchange less beacons in order to reduce an overhead in dense networks. In the case of sparse network, the sensor nodes exchange more beacons for finding a better route. We prove that the proposed scheme can improve the energy efficiency and reliability.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.169-178
• /
• 2012

In this paper, we study the advantages of using range extension cooperative transmission (CT) in multi-hop energy harvesting wireless sensor networks (EH-WSNs) from the network layer perspective. EH-WSNs rely on harvested energy, and therefore, if a required service is energy-intensive, the network may not be able to support the service successfully. We show that CT networks that utilize both range extension CT and non-CT routing can successfully support services that cannot be supported by non-CT networks. For a two-hop toy network, we show that range extension CT can provide better services than non-CT. Then, we provide a method of determining the supportable services that can be achieved by using optimal non-CT and CT routing protocols for EH-WSNs. Using our method and network simulations, we justify our claim that CT networks can provide better services than nonCT networks in EH-WSNs.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.203-216
• /
• 2019

The nature of wireless transmission has made wireless sensor networks defenseless against various attacks. This paper presents warning message counter method (WMC) to detect blackhole attack, grayhole attack and sinkhole attack in wireless sensor networks. The objective of these attackers are, to draw the nearby network traffic by false routing information and disrupt the network operation through dropping all the received packets (blackhole attack), selectively dropping the received packets (grayhole and sinkhole attack) and modifying the content of the packet (sinkhole attack). We have also attempted light weighted symmetric key cryptography to find data modification by the sinkhole node. Simulation results shows that, WMC detects sinkhole attack, blackhole attack and grayhole attack with less false positive 8% and less false negative 6%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.870-872
• /
• 2007

Sensor networks have been widely applied for data collection. Due to the energy limitation of the sensor nodes and the most energy consuming data transmission, we should allocate as much work as possible to the sensors, such as data compression and aggregation, to reduce data transmission and save energy. Querying extreme values is a general query type in wireless sensor networks. In this paper, we propose a novel querying method called Two-Level Filter (TLF) for querying extreme values in wireless sensor networks. We first divide the whole sensor network into domains using the Distributed Data Aggregation Model (DDAM). The sensor nodes report their data to the cluster heads using push method. The advantages of two-level filter lie in two aspects. When querying extreme values, the number of pull operations has the lower boundary. And the query results are less affected by the topology changes of the wireless sensor network. Through this method, the sensors preprocess the data to share the burden of the base station and it combines push and pull to be more energy efficient.