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

• ETRI Journal
• /
• v.37 no.3
• /
• pp.480-490
• /
• 2015

The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum-Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum-based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake-up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.615-620
• /
• 2005

Sensor networks are usually composed of tens or thousands of tiny devices with limited resources. Because of their limited resources, there will often be some faulty nodes within the network. As nodes in some certain regions rely on each other to route the information gathered by different sensors to a base station (sink), the network should be able to detect a non-operational node in order to determine new paths for routing the information. Failure detection, which identifies the faulty nodes, is rather necessary in sensor networks and a very important research issue. The detection of a non-operational node can be performed using Consensus Algorithm with the purpose of achieving agreement about a node which is supposed to be faulty (non-operational). In this work, we discuss the application of a Consensus Algorithm to sensor node called 'mote'. Our experimental results show that it works efficiently for identifying faulty nodes in sensor networks.

• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.13-20
• /
• 2022

Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.225-234
• /
• 2012

In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.505-510
• /
• 2009

Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hard to recharge, it is very important.However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efficientdata delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of the existing research focuses on even energy consumption while the mobility of sinks and sources is rarely consider. In this paper, we propose an efficient routing protocol with multiple virtual grids to reduce energy consumption and improve packets delivery efficiency. Then this paper considers the mobility. Simulation results show that our algorithm can guarantee high data delivery ratio and lower average delivery delay, while consuming lower energy than existing routing protocols in sensor networks.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.6
• /
• pp.125-132
• /
• 2015

This paper presents an event data delivery scheme for wireless sensor networks that use a GTS-based channel allocation scheme. Many sensor nodes can share a GTS channel for sending their normal data to the sink node. When there is an event at a node, the node makes a temporal route to the sink node and the nodes of the route can use the GTS channel in a privileged access. This scheme controls the backoff number effectively so the data delivery priority is given to the nodes of that route. Simulation results show that the event data delivery of the proposed scheme outperforms at the end-to-end transfer delay and jitter characteristics. The proposed scheme can effectively gather the event data using the guaranteed GTS channel of the route in proposed scheme.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.50-56
• /
• 2010

This paper proposes a data gathering method by adapting the mobile sink to prolong the whole operation time of large WSNs. After partitioning a network into several clusters, a mobile sink visits each cluster and collects data from it. An efficient protocol improves the energy efficiency by delivering messages from the mobile sink to the cluster head as well as reduces the data gathering delay, which is the disadvantage of the mobile sink. For the scalability of sensor network, the network architecture should support the multihop transmission in the duster rather than the single hop transmission. The process for the data aggregation linked to the travelling path is proposed to improve the energy consumption of intermediate nodes. The experiment results show that the proposed model is more efficient than legacy methods in the energy consumption and the data gathering time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.316-320
• /
• 2008

Data dissemination schemes for wireless sensor networks, where sinks and event targets might be mobile, has been one of the active research fields. For doing that, stationary nodes gathered data on behalf of mobile sinks and the relayed data in previous studies. their schemes, however, lead to frequent query flooding and report congestion problems over sink moving. We propose a data dissemination protocol to solve both the query flooding and the report congestion problem. Our scheme improves the two shortcomings through sink location management. Finally, we prove effectiveness of our protocol through computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1068-1077
• /
• 2014

In this paper, we propose a novel method for path setup that optimizes energy consumptions for wireless sensor network. Existing studies usually generate paths according to Random way point approach so that it requires unnecessary energy consumptions for estimating location of the mobile sink node and transmission paths of packets. To address this problem, we propose a method that creates paths for mobile sink node using the Hilbert curve. Moreover, our method adjusts the path of the mobile sink node according to the density of sensor nodes to minimize data transmission delay. In our experiments, the proposed method outperforms existing work such as TTDD and CBPER by up to 50 times in terms of energy efficiency.