Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.

Download Full-text

Predictive Trajectory-Based Mobile Data Gathering Scheme for Wireless Sensor Networks

Complexity ◽

10.1155/2021/3941074 ◽

2021 ◽

Vol 2021 ◽

pp. 1-17

Author(s):

Fan Chao ◽

Zhiqin He ◽

Renkuan Feng ◽

Xiao Wang ◽

Xiangping Chen ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Gathering ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Cluster Center ◽

Mobile Data ◽

Tour Planning ◽

Mobile Data Gathering

Tradition wireless sensor networks (WSNs) transmit data by single or multiple hops. However, some sensor nodes (SNs) close to a static base station forward data more frequently than others, which results in the problem of energy holes and makes networks fragile. One promising solution is to use a mobile node as a mobile sink (MS), which is especially useful in energy-constrained networks. In these applications, the tour planning of MS is a key to guarantee the network performance. In this paper, a novel strategy is proposed to reduce the latency of mobile data gathering in a WSN while the routing strategies and tour planning of MS are jointly optimized. First, the issue of network coverage is discussed before the appropriate number of clusters being calculated. A dynamic clustering scheme is then developed where a virtual cluster center is defined as the MS sojourn for data collection. Afterwards, a tour planning of MS based on prediction is proposed subject to minimizing the traveling distance to collect data. The proposed method is simulated in a MATLAB platform to show the overall performance of the developed system. Furthermore, the physical tests on a test rig are also carried out where a small WSN based on an unmanned aerial vehicle (UAV) is developed in our laboratory. The test results validate the feasibility and effectiveness of the method proposed.

Download Full-text

A Novel Nature Instilled Moving Sink Architecture for Data Gathering in Wireless Sensor Networks

International Journal of Synthetic Emotions ◽

10.4018/ijse.2020010104 ◽

2020 ◽

Vol 11 (1) ◽

pp. 36-48

Author(s):

Amiya Bhusan Bagjadab ◽

Sushree Bibhuprada B. Priyadarshini

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Gathering ◽

Mobile Sink ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Packet Forwarding ◽

Battery Power ◽

Communication Distance

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.

Download Full-text

An energy minimizing score based optimal data gathering in wireless sensor networks

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i2.31.13431 ◽

2018 ◽

Vol 7 (2.31) ◽

pp. 161

Author(s):

P Balamurugan ◽

M Shyamala Devi ◽

V Sharmila

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Gathering ◽

Residual Energy ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Efficient Manner ◽

High Level ◽

The Impact

In wireless sensor networks, Sensor nodes are arranged randomly in unkind physical surroundings to collect data and distribute the data to the remote base station. However the sensor nodes have to preserve the power source that has restricted estimation competence. The sensed information is difficult to be transmitted over the sensor network for a long period of time in an energy efficient manner. In this paper, it finds the problem of communication data between sink nodes and remote data sources via intermediate nodes in sensor field. So this paper proposes a score based data gathering algorithm in wireless sensor networks. The high-level contribution of this study is the enhancement of a score- based data gathering algorithm and the impact of energy entity for Wireless Sensor Networks. Then the energy and delay of data gathering are evaluated. Unlike PEGASIS and LEACH, the delay for every process of data gathering is considerably lower when SBDG is employed. The energy consumed per round of data gathering for both SBDG and EE-SBDG is less than half of that incurred with PEGASIS and LEACH. Compared with LEACH and PEGASIS, SBDG and EE-SBDG are fair with node usage because of the scoring system and residual energy respectively. Overall, the Score-based data gathering algorithm provides a significant solution to maximize the network lifetime as well as minimum delay per round of data gathering.

Download Full-text

DATA GATHERING AND COMMUNICATION FOR WIRELESS SENSOR NETWORKS — A CENTRALIZED APPROACH

International Journal of Information Acquisition ◽

10.1142/s0219878905000647 ◽

2005 ◽

Vol 02 (04) ◽

pp. 267-278 ◽

Cited By ~ 1

Author(s):

PETER X. LIU ◽

NANCY DING

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Gathering ◽

Life Time ◽

Optimization Method ◽

Chain Structure ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

The Social

This paper introduces a centralized approach to data gathering and communication for wireless sensor networks. Inspired by the social behaviors of natural ants, we clearly partition the task for the base station and sensor nodes in a wireless sensor network according to their different functions and capabilities. An ant colony optimization method is employed at the base station to form a near-optimal chain for sensor nodes to transmit collected data. Sensor nodes in the network then form a bi-direction chain structure, which is self-adaptive to any minor changes of the network topology. The simulation results show that the developed algorithm, which we call AntChain algorithm, performs much better than many other protocols in terms of energy efficiency, data integrity and life time when the base station is near where the sensor nodes are deployed.

Download Full-text

Mobile Device Based Dynamic Key Management Protocols for Wireless Sensor Networks

Journal of Sensors ◽

10.1155/2015/827546 ◽

2015 ◽

Vol 2015 ◽

pp. 1-10

Author(s):

Chin-Ling Chen ◽

Chih-Cheng Chen ◽

De-Kui Li

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Key Management ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Direct Access ◽

Session Key ◽

Dynamic Key Management ◽

Dynamic Key

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.

Download Full-text

An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

10.21203/rs.3.rs-434634/v1 ◽

2021 ◽

Author(s):

Ramin Danehchin

Keyword(s):

Genetic Algorithm ◽

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Collection ◽

Sensor Nodes ◽

Wireless Sensor ◽

Energy Efficient Routing ◽

Hop Count ◽

Routing Problem ◽

Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

Download Full-text

Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.e1031.0785s319 ◽

2019 ◽

Vol 8 (5S3) ◽

pp. 128-132 ◽

Cited By ~ 17

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Cluster Head ◽

Base Station ◽

Low Energy ◽

Secure Routing ◽

Sensor Nodes ◽

Wireless Sensor ◽

Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

Download Full-text

Improving the Quality of Service and Privacy by Integrating Dijkstra‟s, SafeQ and Extended Watchdog Algorithm in Wireless Sensor Networks

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.a3077.109119 ◽

2019 ◽

Vol 9 (1) ◽

pp. 5409-5414

Keyword(s):

Wireless Sensor Networks ◽

Quality Of Service ◽

Sensor Networks ◽

Shortest Path ◽

Clustering Algorithm ◽

Sensor Nodes ◽

Wireless Sensor ◽

Destination Node ◽

Hop Count

The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.

Download Full-text

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

Emerging Innovations in Wireless Networks and Broadband Technologies - Advances in Wireless Technologies and Telecommunication ◽

10.4018/978-1-4666-9941-0.ch005 ◽

2016 ◽

pp. 79-114

Author(s):

Naveen Chilamkurti ◽

Sohail Jabbar ◽

Abid Ali Minhas

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Network Architecture ◽

Network Performance ◽

Data Dissemination ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Energy Aware ◽

Unbalanced Load

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.

Download Full-text