scholarly journals A Data Forwarding Approach for Fire-Rescue Scenario with Multi-Type Mobile Nodes

2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Linfeng Liu ◽  
Ping Zhou ◽  
Jiagao Wu ◽  
Ran Wang ◽  
Xiaojun Fan ◽  
...  
Keyword(s):  
Sensor Nodes ◽  
Delivery Ratio ◽  
Small Range ◽  
Mobile Nodes ◽  
Data Forwarding ◽  
Control Center ◽  
Structure Damage ◽  
Data Packets ◽  
Delivery Delay ◽  
Environmental Events

The opportunistic mobile sensor network has been extensively applied in various public safety applications such as the fire rescue and earthquake rescue, since it can provide a surveillance range with an inexpensive cost and avoid the dangers of humans staying in risk zones. However, due to some environmental events such as building structure damage, airflow push, and fire explosions, the sensor nodes sprinkled into the fire-rescue scenario may be kept moving. Thus, the contacts between nodes become momentary, and the data packets cannot be forwarded along stable communication paths. To this end, the opportunistic forwarding manner is adopted in the fire-rescue scenario to enable the data packets to be transferred to the rescue control center (RCC) through some discrete hops. The contributions of this paper are threefold. First, the nodes in the fire-rescue scenario are carefully investigated and classified into four types: small-range mobile nodes (SRNs), large-range mobile nodes (LRNs), firefighter nodes (FNs), and robot nodes (RNs). Second, we formulate the data forwarding problem, and the optimal proportions of SRNs, LRNs, and FNs in data holders are mathematically analyzed to obtain the maximum delivery ratio. Third, a data forwarding approach for fire-rescue scenario (DFAFR) is proposed. In DFAFR, the optimal proportions of SRNs, LRNs, and FNs in data holders are maintained as far as possible through selecting different types of data holder candidates, and then the new data holders are determined from these data holder candidates and the adjacent RNs on basis of their expected delivery delay. Finally, the performance of DFAFR is analyzed through simulations of the fire-rescue scenario, and the results indicate that DFAFR can enhance the delivery ratio and shorten the delivery delay while the forwarding overhead is restricted.

scholarly journals RMEER: Reliable Multi-path Energy Efficient Routing Protocol for Underwater Wireless Sensor Network

2018 ◽  
Vol 8 (6) ◽  
pp. 4366
Author(s):  
Mukhtiar Ahmed ◽  
Mazleena Salleh ◽  
M. Ibrahim Channa ◽  
Mohd Foad Rohani
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Data Forwarding ◽  
Energy Efficient Routing ◽  
Simulation Performance ◽  
Efficient Route

Underwater Wireless Sensor Networks (UWSNs) is interesting area for researchers.To extract the information from seabed to water surface the the majority numbers of routing protocols has been introduced. The design of routing protocols faces many challenges like deployment of sensor nodes, controlling of node mobility, development of efficient route for data forwarding, prolong the battery power of the sensor nodes, and removal of void nodes from active data forwarding paths. This research article focuses the design of the Reliable Multipath Energy Efficient Routing (RMEER) which develops the efficient route between sensor nodes, and prolongs the battery life of the nodes. RMEER is a scalable and robust protocol which utilizes the powerful fixed courier nodes in order to enhance the network throughput, data delivery ratio, network lifetime and reduces the end-to-end delay. RMEER is also an energy efficient routing protocol for saving the energy level of the nodes. We have used the NS2.30 simulator with AquaSim package for performance analysis of RMEER.We observed that the simulation performance of RMEER is better than D-DBR protocol.

scholarly journals Priority Based Congestion Control Dynamic Clustering Protocol in Mobile Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
R. Beulah Jayakumari ◽  
V. Jawahar Senthilkumar
Keyword(s):  
Wireless Sensor Network ◽  
Congestion Control ◽  
Sensor Network ◽  
Significant Loss ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Dynamic Clustering ◽  
Mobile Nodes ◽  
Control Dynamic

Wireless sensor network is widely used to monitor natural phenomena because natural disaster has globally increased which causes significant loss of life, economic setback, and social development. Saving energy in a wireless sensor network (WSN) is a critical factor to be considered. The sensor nodes are deployed to sense, compute, and communicate alerts in a WSN which are used to prevent natural hazards. Generally communication consumes more energy than sensing and computing; hence cluster based protocol is preferred. Even with clustering, multiclass traffic creates congested hotspots in the cluster, thereby causing packet loss and delay. In order to conserve energy and to avoid congestion during multiclass traffic a novel Priority Based Congestion Control Dynamic Clustering (PCCDC) protocol is developed. PCCDC is designed with mobile nodes which are organized dynamically into clusters to provide complete coverage and connectivity. PCCDC computes congestion at intra- and intercluster level using linear and binary feedback method. Each mobile node within the cluster has an appropriate queue model for scheduling prioritized packet during congestion without drop or delay. Simulation results have proven that packet drop, control overhead, and end-to-end delay are much lower in PCCDC which in turn significantly increases packet delivery ratio, network lifetime, and residual energy when compared with PASCC protocol.

scholarly journals Traffic Class Prioritization-Based Slotted-CSMA/CA for IEEE 802.15.4 MAC in Intra-WBANs

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 466 ◽  
Author(s):  
Farhan Masud ◽  
Abdul Abdullah ◽  
Ayman Altameem ◽  
Gaddafi Abdul-Salaam ◽  
Farkhana Muchtar
Keyword(s):  
Energy Consumption ◽  
Packet Loss ◽  
Ieee 802.15.4 ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Channel Access ◽  
Period Range ◽  
Packet Delivery ◽  
Delivery Delay ◽  
Traffic Class

This paper proposes an improved Traffic Class Prioritization based Carrier Sense Multiple Access/Collision Avoidance (TCP-CSMA/CA) scheme for prioritized channel access to heterogenous-natured Bio-Medical Sensor Nodes (BMSNs) for IEEE 802.15.4 Medium Access Control (MAC) in intra-Wireless Body Area Networks (WBANs). The main advantage of the scheme is to provide prioritized channel access to heterogeneous-natured BMSNs of different traffic classes with reduced packet delivery delay, packet loss, and energy consumption, and improved throughput and packet delivery ratio (PDR). The prioritized channel access is achieved by assigning a distinct, minimized and prioritized backoff period range to each traffic class in every backoff during contention. In TCP-CSMA/CA, the BMSNs are distributed among four traffic classes based on the existing patient’s data classification. The Backoff Exponent (BE) starts from 1 to remove the repetition of the backoff period range in the third, fourth, and fifth backoffs. Five moderately designed backoff period ranges are proposed to assign a distinct, minimized, and prioritized backoff period range to each traffic class in every backoff during contention. A comprehensive verification using NS-2 was carried out to determine the performance of the TCP-CSMA/CA in terms of packet delivery delay, throughput, PDR, packet loss ratio (PLR) and energy consumption. The results prove that the proposed TCP-CSMA/CA scheme performs better than the IEEE 802.15.4 based PLA-MAC, eMC-MAC, and PG-MAC as it achieves a 47% decrease in the packet delivery delay and a 63% increase in the PDR.

scholarly journals Congestion Detection and Alleviation in Multihop Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Omer Chughtai ◽  
Nasreen Badruddin ◽  
Maaz Rehan ◽  
Abid Khan
Keyword(s):  
Simulation Analysis ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Data Traffic ◽  
Carrier Sense Multiple Access ◽  
Multihop Wireless ◽  
Data Packets ◽  
Congestion Detection ◽  
Efficient Route

Multiple traffic flows in a dense environment of a mono-sink wireless sensor network (WSN) experience congestion that leads to excessive energy consumption and severe packet loss. To address this problem, a Congestion Detection and Alleviation (CDA) mechanism has been proposed. CDA exploits the features and the characteristics of the sensor nodes and the wireless links between them to detect and alleviate node- and link-level congestion. Node-level congestion is detected by examining the buffer utilisation and the interval between the consecutive data packets. However, link-level congestion is detected through a novel procedure by determining link utilisation using back-off stage of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). CDA alleviates congestion reactively by either rerouting the data traffic to a new less congested, more energy-efficient route or bypassing the affected node/link through ripple-based search. The simulation analysis performed in ns-2.35 evaluates CDA with Congestion Avoidance through Fairness (CAF) and with No Congestion Control (NOCC) protocols. The analysis shows that CDA improves packet delivery ratio by 33% as compared to CAF and 54% as compared to NOCC. CDA also shows an improvement in throughput by 16% as compared to CAF and 36% as compared to NOCC. Additionally, it reduces End-To-End delay by 17% as compared to CAF and 38% as compared to NOCC.

scholarly journals Energy Efficient Hierarchical Clustering using HACOPSO in Wireless Sensor Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 5219-5225
Keyword(s):  
Clustering Algorithm ◽  
Ad Hoc ◽  
Energy Savings ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Cluster Member ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Data Packets ◽  
Process Operation

The Wireless Sensor Network (WSN) is a collection of a various number of sensor node involved in a tremendous region for communicating data packets from one place to another in a productive way. The most significant techniques in the WSN are clustering, power consumption, lifetime and productive transmission of information in a secured manner with interconnected mobile nodes in networks. The clustering is the process of grouping the nodes for sharing the data packets to one cluster member to another cluster member through cluster heads present in the networks, which saves energy. Hence, K-Means clustering algorithm is used along with the Hybrid Ant Colony and Particle Swarm Optimization (HACOPSO) to produce a hierarchy of each CHs and observe that the energy savings increase with the number of levels present in the hierarchy. Ad hoc On-Demand Distance Vector Routing (AODV) uses two different operations to find and maintain routes: the route discovery process operation and route maintenance. Therefore, “K-Means-HACOPSO” methodology precisely transmit data from source to destination by evaluating better through-put, packet delivery ratio, packet loss, end-to-end delay and energy consumption in a secured environment.

scholarly journals Multivariate Weighted Isotonic Regressive Modest Adaptive Boosting Based Resource-Aware Routing In WSN

2021 ◽  
Author(s):  
N. Muruganandam ◽  
V. Venkatraman ◽  
R. Venkatesan
Keyword(s):  
Packet Loss ◽  
Data Transmission ◽  
Loss Rate ◽  
Packet Loss Rate ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Adaptive Boosting ◽  
Data Packets ◽  
Packet Delivery ◽  
Resource Aware

Abstract WSN includes a scenario where huge amount of sensor nodes are distributed to monitor environmental conditions with route collected data towards sinks via the internet. WSNs efficiently manage the wider network with available resources, such as residual energy and wireless channel bandwidth. Therefore, routing algorithm is important to enhance battery-constrained networks. Many existing techniques are developed for balancing consumption of energy but efficient routing was not achieved. Multivariate Weighted Isotonic Regressive Modest Adaptive Boosting based Resource Aware Routing (MWIRMAB-RAR) technique is introduced for enhancing routing. The MWIRMAB-RAR technique includes a different process namely resource-aware node selection, route path discovery, and data transmission. Initially, the MWIRMAB-RAR technique uses the Modest Adaptive Boosting technique uses the Multivariate Weighted Isotonic Regression function for detecting resource-efficient sensor nodes for effective data transmission. After that, multiple route paths are established based on the time of flight method. After establishes route path, source node sends data packets to sink node via resource-efficient nodes. The data delivery was enhanced and minimizes packet loss as well as delay. The simulation analysis is carried out on certain performance factors such as energy consumption, packet delivery ratio, packet loss rate, and delay with number of data packets and sensor nodes. The obtained evaluation indicates MWIRMAB-RAR outperforms well in terms of increasing data packet delivery and reduces consumption of energy, packet loss rate, and delay.

scholarly journals The importance of energy efficient in wireless sensor networks

2019 ◽  
Vol 6 (6) ◽  
pp. 207-219
Author(s):  
Ellon Mask ◽  
Surgey Brown ◽  
Wood Lucky ◽  
Lorry Peter
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
High Energy ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Level Energy ◽  
Mobile Nodes ◽  
Mobile Data ◽  
Mobile Data Collectors

Mobile Node-based routing is an efficient routing technique compared to traditional approaches. Due to this FERP majorly data isolation is provided for sensor nodes, and the network is more energy efficient. The Mobile data collector collects data from only Family heads and forwards to the cluster head. The Node level energy saving scheme is proposed in this work. The performance of this routing protocol is assessed based on Energy consumption, Throughput, Lifetime, Packet Delivery Ratio, Energy efficiency. Most of the Energy is saved due to the introducing of mobile nodes for data collection. Apart from this, we are reducing the load for mobile data collectors also. In general, mobile data collectors have high energy resources. But it is not possible in all terrains. This FERP gives better results in military and plateaus, and irregular terrains where multihop communication is complex. This work is further enhanced by Trust node based routing to improve the lifetime of the network.

scholarly journals Systematic Cluster Head (CH) Selection Through Node-Grade Based Clustering (NGBC) in WSN

2018 ◽  
Vol 7 (4.36) ◽  
pp. 562 ◽  
Author(s):  
J. K. Deepak Keynes ◽  
D. Shalini Punithavathani
Keyword(s):  
Network Performance ◽  
Cluster Head ◽  
Threshold Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Data Packets ◽  
Computational Ability ◽  
Performance Results ◽  
Ch Selection

As it is well known, in Wireless Sensor Networks, the sensor nodes will be either mobile or static. When mobility is concerned, on the whole network performance could be degraded, since the sensor nodes are furnished with restricted battery power, restricted memory, less computational ability and lower range of communication. So, a mechanism which is effective is needed there for forwarding the data packets with efficient energy management and coverage. With that note, the principle target of this work is to propose systematic method of CH selection based on the factors such as low mobility, density of the nodes and their remaining energy. Moreover, an innovative method called Node-Grade Based Clustering (NGBC) is proposed in this paper so as to select the CHs, studying the node’s energy and position regarding to their Base Station (BS), which will act as a sink for collected information. The CHs are replaced in every round based on its duty cycle on sensor nodes and Threshold Energy Rate (TER). Since the BS evaluates the quantity of every round a CH (Cluster Head) can sustain, it minimizes the quantity of energy consumed and increases the WSN’s lifetime. The results of the simulation demonstrate that the proposed algorithm attains higher coverage, efficiency in energy and network lifetime. Furthermore, the performance results in the work which is proposed, are distinguished with the algorithms proposed previously such as LEACH and HEED using some evaluation metrics like packet delivery ratio, throughput, energy consumption and end-to-end delay to prove the efficiency of energy efficient NGBC.  

scholarly journals Relay Selection for Capacity Increase in Underwater Acoustic Sensor Network

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6605
Author(s):  
Ramsha Narmeen ◽  
Jaehak Chung
Keyword(s):  
Energy Efficiency ◽  
Relay Node ◽  
Propagation Delay ◽  
Sensor Nodes ◽  
Destination Node ◽  
Delivery Ratio ◽  
Medium Access ◽  
Long Distance ◽  
Underwater Acoustic ◽  
Data Packets

In long distance sensor nodes, propagation delay is the most crucial factor for the successful transmission of data packets in underwater acoustic sensors networks (UWAs). Therefore, to cope with the problem of propagation delay, we propose examining and selecting the best relay node (EBRN) technique based on checking the eligibility and compatibility of RN and selecting the best RN for UWAs. In the EBRN technique, the source node (S) creates a list of the best RNs, based on the minimum propagation delay to the midpoint of a direct link between S and the destination node (D). After that, the S attaches the list of selected RNs and transmit to the D along with data packets. Finally, from the list of selected RNs, the process of retransmission is performed. To avoid collision among control packets, we use a backoff timer that is calculated from the received signal strength indicator (RSSI), propagation delay and transmission time, whereas the collision among data packets is avoided by involving single RN in a particular time. The performance of the proposed EBRN technique is analyzed and evaluated based on throughput, packet loss rate (LR), packet delivery ratio (PDR), energy efficiency, and latency. The simulation results validate the effectiveness of the proposed EBRN technique. Compared with the existing schemes such as underwater cooperative medium access control (UCMAC) and shortest path first (SPF), the proposed EBRN technique performs remarkably well by increasing the throughput, PDR, and energy efficiency while decreasing the latency and LR in UWAs.

scholarly journals An estimated Hungarian method for data forwarding problem in underwater wireless sensor networks

2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877253 ◽  
Author(s):  
Jing Wen ◽  
Dongwei Li ◽  
Linfeng Liu ◽  
Jiabin Yuan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Transmission Delay ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Underwater Wireless Sensor Networks ◽  
Data Forwarding ◽  
Control Center ◽  
Hungarian Method ◽  
Anchor Nodes

With the increasing concern over marine applications in recent years, the technology of underwater wireless sensor networks has received considerable attention. In underwater wireless sensor networks, the gathered data are sent to terrestrial control center through multi-hops for further processing. Underwater wireless sensor networks usually consist of three types of nodes: ordinary nodes, anchor nodes, and sink nodes. The data messages are transferred from an ordinary node or an anchored node to one of the sink nodes by discrete hops. Data forwarding algorithms are at the core position of underwater wireless sensor networks, which determines data in what way to forward. However, the existing data forwarding algorithms all have problems that transmission delay is too high and delivery ratio is low. Thus, we propose a data forwarding algorithm based on estimated Hungarian method to improve delivery ratio and reduce transmission delay. The estimated Hungarian method is applied to solve the assignment problem in data forwarding process, where the anchor nodes receive the forwarding requests from ordinary nodes and optimize the waiting queue. By applying this method in underwater wireless sensor networks, data forwarding has great advantages in success rate and transmission delay, which has been validated by both analysis and simulation results.

Sign in / Sign up

Export Citation Format

Share Document