scholarly journals Performance enhancement of sensor network architecture for monitoring underwater oil pipeline

2021 ◽  
Vol 11 (2) ◽  
pp. 1414
Author(s):  
Waseem M. Jassim ◽  
Ammar E. Abdelkareem
Keyword(s):  
Network Architecture ◽  
Performance Enhancement ◽  
Base Station ◽  
Network Control ◽  
Sensor Nodes ◽  
Transmission Range ◽  
Network Delay ◽  
Relay Nodes ◽  
Oil Pipeline ◽  
Network Hierarchy

In this paper, a deployment mechanism is designed to distribute heterogeneous nodes to optimally cover the pipeline where the mechanism helps locate each node on the wall of the oil pipeline where the number of nodes can be increased depending on this mechanism. The six-layer network hierarchy includes basic sensor nodes (BSN), aggregation relay node (ARN) that added to the network hierarchy, data relay nodes (DRN), data dissemination node (DDN), base station (sinks), and network control center (NCC). This network relies on the improved smart redirect or jump algorithm (SRJ) by sending packets depend on the active relay nodes in both directions that are within the transmission range of the ARNs instead of relying on the number of hops adopted by the SRJ algorithm to reduce the network delay, the energy consumed in relay nodes, and the number of times the DRNs increased transmission range. The OMNeT++ and MATLAB programs were used to implement the simulation scenario. The results showed superiority in terms of the average overhead communication, energy consumption, and end to the end delay with network delay in some cases rely on the number of active relay nodes.

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

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.

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

2020 ◽  
pp. 372-399
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.

CONFLICT-AWARE DATA AGGREGATION SCHEDULING IN WIRELESS SENSOR NETWORKS WITH ADJUSTABLE TRANSMISSION RANGE

2012 ◽  
Vol 04 (03) ◽  
pp. 1250013 ◽  
Author(s):  
YI HONG ◽  
HONGWEI DU ◽  
DEYING LI ◽  
WENPING CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Base Station ◽  
Sensor Nodes ◽  
Performance Ratio ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Minimum Latency ◽  
Data Aggregation Scheduling

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.

scholarly journals Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Asis Kumar Tripathy ◽  
Suchismita Chinara
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Architecture ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Awareness

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.

scholarly journals Efficient Interference Estimation with Accuracy Control for Data-Driven Resource Allocation in Cloud-RAN

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3000 ◽  
Author(s):  
Yanchao Zhao ◽  
Jie Wu ◽  
Wenzhong Li ◽  
Sanglu Lu
Keyword(s):  
Resource Allocation ◽  
Network Architecture ◽  
Measurement Data ◽  
Network Size ◽  
Base Station ◽  
Edge Computing ◽  
Sensor Nodes ◽  
Data Driven ◽  
Accuracy Control ◽  
Computing Paradigm

The emerging edge computing paradigm has given rise to a new promising mobile network architecture, which can address a number of challenges that the operators are facing while trying to support growing end user’s needs by shifting the computation from the base station to the edge cloud computing facilities. With such powerfully computational power, traditional unpractical resource allocation algorithms could be feasible. However, even with near optimal algorithms, the allocation result could still be far from optimal due to the inaccurate modeling of interference among sensor nodes. Such a dilemma calls for a measurement data-driven resource allocation to improve the total capacity. Meanwhile, the measurement process of inter-nodes’ interference could be tedious, time-consuming and have low accuracy, which further compromise the benefits brought by the edge computing paradigm. To this end, we propose a measurement-based estimation solution to obtain the interference efficiently and intelligently by dynamically controlling the measurement and estimation through an accuracy-driven model. Basically, the measurement cost is reduced through the link similarity model and the channel derivation model. Compared to the exhausting measurement method, it can significantly reduce the time cost to the linear order of the network size with guaranteed accuracy through measurement scheduling and the accuracy control process, which could also balance the tradeoff between accuracy and measurement overhead. Extensive experiments based on real data traces are conducted to show the efficiency of the proposed solutions.

scholarly journals Performance Enhancement of Oil pipeline Monitoring for a Simulated Underwater Wireless Sensor Network

2020 ◽  
Vol 23 (3) ◽  
pp. 260-266
Author(s):  
Waseem M. Jassim ◽  
Ammar E. Abdelkareem
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Performance Enhancement ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Limited Bandwidth ◽  
Oil Pipeline

In the last two decades, underwater acoustic sensor networks have begun to be used for commercial and non-commercial purposes. In this paper, the focus will be on improving the monitoring performance system of oil pipelines. Linear wireless sensor networks are a model of underwater applications for which many solutions have been developed through several research studies in previous years for data collection research. In underwater environments, there are certain inherent limitations, like large propagation delays, high error rate, limited bandwidth capacity, and communication with short-range. Many deployment algorithms and routing algorithms have been used in this field. In this work a new hierarchical network model proposed with improvement to Smart Redirect or Jump algorithm (SRJ). This improved algorithm is used in an underwater linear wireless sensor network for data transfer to reduce the complexity in routing algorithm for relay nodes which boost delay in communication.  This work is implemented using OMNeT++ and MATLAB based on their integration. The results obtained based on throughput, energy consumption, and end to the end delay.

scholarly journals An Efficent Coverage and Maximization of Network Lifetime in WSN Through Metaheuristics

2021 ◽  
Vol 10 (3) ◽  
pp. 159
Author(s):  
A. Nageswar Rao ◽  
B. Rajendra Naik ◽  
L. Nirmala Devi
Keyword(s):  
Network Lifetime ◽  
Sensor Node ◽  
Relay Node ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Relay Node Placement ◽  
Data Forwarding ◽  
Relay Nodes ◽  
Node Placement

<span>In wireless sensor networks (WSNs), energy, connectivity, and coverage are the three most important constraints for guaranteed data forwarding from every sensor node to the base station. Due to continuous sensing and transmission tasks, the sensor nodes deplete more quickly and hence they seek the help of data forwarding nodes, called relay nodes. However, for a given set of sensor nodes, finding optimal locations to place relay nodes is a very challenging problem. Moreover, from the earlier studies, the relay node placement is defined as a non-deterministic polynomial tree hard (NP-Hard) problem. To solve this problem, we propose a multi-objective firefly algorithm-based relay node placement (MOFF-RNP) to deploy an optimal number of relay nodes while considering connectivity, coverage, and energy constraints. To achieve network lifetime, this work adopted energy harvesting capabilities to the sensor nodes and backup relay strategy such that every sensor node is always connected to at least one relay to forward the data. The optimal relay placement is formulated as an objective function and MOFF is applied to achieve a better solution. Extensive Simulations are carried out over the proposed model to validate the performance and the obtained results are compared with state-of-art methods)</span>

scholarly journals Developing Energy Aware Distributed Aggregation Tree Technique for Wireless Sensor Networks

2017 ◽  
Vol 43 (2) ◽  
pp. 1-8
Author(s):  
Intisar Al-Mejibli
Keyword(s):  
Mobile Networks ◽  
Network Architecture ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Power Resources ◽  
Aggregation Tree ◽  
Aggregation Technique ◽  
Parent Node

Wireless sensor network WSN consists of small sensor nodes with limited resources, which are sensing, gathering and transmitting data to base station. Sensors of various types are deployed ubiquitously and widely in varied environments for instance, wildlife reserves, battlefields, mobile networks and office building. Sensor nodes are having restricted and non replenishable power resources and this is regarded as one of the main of their critical limits. All applied techniques and protocols on sensor nodes must take into consideration their power limitation. Data aggregation techniques are used by sensor nodes in order to minimize the power consumption by organizing the communication among sensor nodes and eliminating the redundant of sensed data. This paper proposed lightweight modification on data aggregation technique named Energy Aware Distributed Aggregation Tree EADAT. The main principle of this development is using the available information in sensor nodes to pass the role of parent node among sensor nodes in each cluster. The process of passing parent node role is based on nominating the sensor nodes which have higher power on regular bases. A model based on tree network architecture is designed for validation purpose and is used with NS2 simulator to test the proposed development. EADAT and EADAT with proposed development are applied on the designed model and the results were promising

Reconnection of Wireless Sensor Network Partitions on Multi-Agent Platform

2019 ◽  
Vol 6 (1) ◽  
pp. 43-54 ◽  
Author(s):  
E. Anna Devi ◽  
J. Martin Leo Manickam
Keyword(s):  
Detection System ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transmission Range ◽  
Mobile Nodes ◽  
Agent Platform ◽  
Multi Agent ◽  
Network Partitions ◽  
Message Ferry

In wireless sensor networks, repairing partitions is of high priority. Various methods have been proposed for detecting partitions in the networks. One approach for reconnecting a partitioned network is to repair partitions using mobile nodes. For reconnecting the partitions approaches like transmission range adjustment and message ferry methods have been proposed but these are based on the degree of connectivity with neighbors. In the proposed method, we consider a partition detection system where the base station knows the position of the sensor nodes and the base station communicates with the nodes at regular intervals. The failure of the base station to communicate with a group of sensor nodes located together is the proof that some partitions have occurred. There could be two or more partitions occurring at a time and so multiple mobile nodes are to be employed. The aim of the algorithm is to coordinate among the mobile nodes and the partitioned network and to reconnect the partition. Here the safety of nodes, security of the network and scalability are considered.

GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS

2010 ◽  
Vol 11 (01n02) ◽  
pp. 1-33 ◽  
Author(s):  
JEAN–CLAUDE BERMOND ◽  
LUISA GARGANO ◽  
ADELE A. RESCIGNO
Keyword(s):  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Transmission Range ◽  
Intermediate Node ◽  
Tree Networks ◽  
Data Packets ◽  
Half Duplex ◽  
Interference Range ◽  
Minimum Completion Time

Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half–duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with omnidirectional antennas allowing the transmission over distance R. The network is a multi-hop wireless network and the time is slotted so that one–hop transmission of one data item consumes one time slot. We model the network with a graph where the vertices represent the nodes and two nodes are connected if they are in the transmission range of each other. We suppose that the interference range is the same as the transmission range; therefore due to interferences a collision happens at a node if two or more of its neighbors try to transmit at the same time. Furthermore we suppose that an intermediate node should forward a message as soon as it receives it. We give an optimal collision free gathering schedule for tree networks whenever each node has exactly.

Sign in / Sign up

Export Citation Format

Share Document