Higher Packet Delivery Ratio Research Articles

A reliable, delay bounded and less complex communication protocol for multicluster FANETs

Recently, Flying Ad-hoc Networks (FANETs), enabling ad-hoc networking between Unmanned Aerial Vehicles (UAVs) is gaining importance in several military and civilian applications. The sensitivity of the applications requires adaptive; efficient; delay bounded and scalable communication network among UAVs for data transmission. Due to communication protocol complexity; rigidity; cost of commercial-off-the-shelf (COT) components; limited radio bandwidth; high mobility and computational resources; maintaining the desired level of Quality of Service (QoS) becomes a daunting task. For the first time in this research we propose multicluster FANETs for efficient network management; the proposed scheme considerably reduces communication cost and optimizes network performance as well as exploit low power; less complex and low cost IEEE 802.15.4 (MAC) protocol for intercluster and intracluster communication. In this research both beacon enabled mode and beaconless modes have been investigated with Guaranteed Time Slots (GTS) and virtual Time Division Multiple Access (TDMA) respectively. The methodology plays a key role towards reserving bandwidth for latency critical applications; eliminate collisions and medium access delays. Moreover analysis ad-hoc routing protocols including two proactive (OLSR, DSDV) and one reactive (AODV) is also presented. The results shows that the proposed scheme guarantees high packet delivery ratios while maintaining acceptable levels of latency requirements comparable with more complex and dedicatedly designed protocols in literature.

Improving Multipath Routing Protocols Performance in Mobile Ad Hoc Networks based on QoS Cross-Layer Routing

Background/Objectives: Improving performances of routing protocols which use the multipath scheme and the hop count routing metric in ad hoc networks in order to satisfy quality of service requirements of different application traffics. Methods/Statistical Analysis: This paper proposes a technique to estimate the values of delay and packet loss ratio of MAC layer’s links by using the ETX technique and the service time calculation of DCF in CSMA/CA principle, respectively. After that, these values are combined with the weights which are obtained from application traffic classification using cross-layer approach to establish new routing metrics. These metrics are suitable for Quality of Service (QoS) requirements of applications. Findings: Traditional multipath routing protocols operate only in Network layer and utilize a static routing metric which leads them to be unable to give route priority to different traffic classes from Application layer. After applying the suitable dynamic routing metrics of delay and packet loss ratio for application traffic classes when implementing new multipath routing protocol named QCLR in NS2 simulator, the results of performance evaluations show that the performance of proposed protocol higher than AOMDV protocol regarding to higher throughput, lower overhead traffic, higher packet delivery ratio and smaller end-to-end delay for both of Class 1 and Class 2 traffics. Applications/Improvements: Improving quality of routing service for applications which have different traffic classes, especially for multimedia applications.

An Intelligent Authentication Based Vehicle Initiated Broadcast-Dynamic Path Data Collection Scheme in VANET

Objectives: The major focus of this research paper is to propose an Intelligent Authentication based Vehicle Initiated Broadcast-Dynamic Path (IAVIB-DP) data collection scheme with the aim of increasing the effectiveness of existing Vehicle Initiated Broadcast-Complete Path (VIB-CP) data collection scheme which is considered to be the best and most commonly used way that is opted for data collection in VANET and is evaluated in terms of packet delivery ratio, average latency and communication overhead. Methods/Analysis: Simulation is conducted by using OMNet++ to compare the performance of IAVIB-DP with one of the best data collection scheme working on single RSU, VIB-CP. Performance Index (PI) is measured by evaluating the Packet Delivery Ratio (PDR), average latency and Communication Overhead (CO) for proposed and existing scheme of collecting data. Best scheme will be decided on the basis of calculated PI. Other parameters for simulation such as the minimum speed, space dimensions and the maximum speed of moving vehicles remain fixed. Findings: VIB-CP and IAVIB-DP Data Collection Schemes (DCSs) are compared and analysis is done on the calculated value of Performance Index. PI decides whether a data collection scheme is effective or not. PI is calculated on different factors like PDR, Latency and CO. The simulation results show that PI of proposed IAVIB-DP data collection scheme is more as compared to PI of VIBCP, as it has high PDR, low latency and less CO. Application/Improvements: VIB-CP and IAVIB-DP are compared on same factors and are used for PI calculation. On the basis of the simulation results it is evaluated that IAVIB-DP performs better.

DS-MMAC: A delay-sensitive multi-channel MAC protocol for Ambient Assistant Living systems

In Ambient Assistant Living (AAL) systems, it is a fundamental problem to ensure prompt delivery of detected events, such as irregular heart rate or fall of elderly, to a central processing device (e.g. gateway node). Most of recently proposed MAC protocols for low-power embedded sensing systems (e.g. wireless sensor networks) are designed with energy efficiency as the first goal, so they are not suitable for AAL systems. Although some multi-channel MAC protocols have been proposed to address the problem, most of those protocols ignore the cost of channel switching, which can have reverse effect on network performance, especially latency of data delivery. In this paper, we propose a Delay-Sensitive Multi-channel MAC protocol (DS-MMAC) for AAL systems, which can provide high packet delivery ratio and bound low latency for data delivered to the gateway node. The novelty of the protocol is that an efficient distributed time slot scheduling and channel assignment algorithm is combined with the process of route establishment, which takes the channel switching cost into account and reduces end-to-end delay to meet the required delay bound of each data flow. The performance of the proposed protocol is evaluated through extensive simulations. Results show that DS-MMAC can bound low latency for delivering detected events in AAL system to the gateway, while providing high delivery reliability and low energy consumption.

The Impact of Node Misbehavior on the Performance of Routing Protocols in MANET

MANET is a cooperative wireless network in which mobile nodes are responsible for routing and forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but decline to share its own resources with them. These selfish nodes may severely affect the performance of routing protocols in MANET. In this paper, we compare the performance of four routing protocols under security attack of node misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data dropped and the Load. The experimental results show that AODV routing protocol performs better than the other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the other routing protocols with minimum End-to-End delay.

Network Coding-Based Reliable IPv6 Packet Delivery Over IEEE 802.15.4 Wireless Personal Area Networks

Wireless personal area networks (WPANs) based on the IEEE 802.15.4 standard have been increasingly applied in vehicular and transportation-related applications. The 6LoWPAN protocol is used in delivering Internet Protocol version 6 (IPv6) packets over WPANs using the mesh-under routing (MUR) or route-over routing (ROR) mechanisms. When delivering an IPv6 packet over a multihop route consisting of unreliable links in a WPAN, the probability that the packet is successfully delivered at the destination, i.e., the packet delivery ratio (PDR), via MUR or ROR can be very small. This paper proposes the Reliable IPv6 Packet Delivery Scheme (RIPDS), which overcomes the aforementioned problem and considerably improves the PDR. RIPDS achieves a high PDR by use of network coding to encode the fragments of an IPv6 packet into multiple encoded packets, such that, regardless of the loss of some encoded packets, the original fragments and the original IPv6 packet can be still recovered by the node that receives some other encoded packets. The PDR and end-to-end packet latency under RIPDS, MUR, the controlled MUR (CtrMUR), and ROR are derived. Simulation results show that the proposed RIPDS outperforms the existing routing schemes such as ROR, MUR, and the CtrMUR, both in PDR and packet latency.

An Efficient Privacy Preserving Genetic Approach based Routing Protocol for Video Streaming in MANET

A Mobile Ad-hoc Network is a self configuring wireless network that operates without centralized administration. The active nodes are movable since arrangement of network is very vibrant and they have restricted energy which becomes one of the constraints for designing multicast routing protocol. Multicast based routing methods are challenging tasks in a wireless sensor network, due to various factors such as energy efficiency, Quality of Service, control overheads etc. Mobile Ad-hoc Network utilizes anonymous routing protocols in order to offer anonymity protection, which hides the node identities and/or routes from external observers. However current anonymous routing protocols such as hop-by-hop encryption or redundant traffic may either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. Therefore, the methodology in this work have always considered several techniques such as battery life time, size of control overhead, efficient route reconfiguration by using Genetic Algorithm (GA) based Efficient Geographic Multicast Routing protocol (EGMP). The EGMP protocol allocates the location information which is used to construct zone structure, multicast packet forwarding and construction of multicast tree which efficiently reduces the tree structure maintenance and also the overhead for route searching. Furthermore, the shortest-path multicast tree is built to minimize delay time and design a source-tree-based routing algorithm, by using a small population size in the genetic algorithm. In order to overcome problems such as network partition, data loss, or performance degradation, data can be replicated in movable nodes. The replicas make certain that the performance is not degraded; rather some nodes may not cooperate or behave selfishly. The selfishness of some of the nodes leads to the performance degradation in terms of accessing data. In this work the impact of selfish nodes in a Mobile Ad Hoc Network from the viewpoint of replica allocation is examined. In precise a selfish node detection algorithm has been developed, that considers inequitable selfishness and competent replica allocation techniques to properly surplice with selfish replica allocation. Apart from all these features Dynamic Pseudonym has been used which helps to achieve better route anonymity protection and lower cost compared to other anonymous routing protocols. The simulation result shows that EGMP has less loss, high packet delivery ratio, low cost, low control overhead, and delay under all test scenarios when compared with Genetic Algorithm based Multicast Routing.

On-Demand Hybrid Routing for Cognitive Radio Ad-Hoc Network

A novel on-demand cluster-based hybrid routing protocol for cognitive radio ad hoc network with non-uniform node distribution is proposed in this paper. At first, a novel spectrum-aware clustering mechanism is introduced. The proposed clustering mechanism divides node into clusters based on three values: spectrum availability, power level of node, and node stability. Therefore, clusters are formed with the highest stability to avoid frequent reclustering. Later, a routing algorithm is introduced to minimize the delay while achieving acceptable delivery ratio. In this paper, routing is defined as a multi-objective optimization problem to combine different individual routing metrics to form a global metric. Simulation results show that our proposed routing algorithm can guarantee a lower delay and a higher packet delivery ratio than conventional routing protocols for cognitive radio ad hoc networks. Due to our routing design specification, such as power consideration and low delay, it can be suitable to be adopted for Internet of Things applications.

Optimal Scheduling using Multi-Objective Artificial Bee Colony based Intuitionistic Fuzzy Possibilistic C Means Clustering over Mobile Ad Hoc Networks

Mobile Adhoc networks are defined as the group of mobiles nodes that distributed in various locations which can connect with each other through multi-hop wireless path with the ability of dynamic path changing during node movement. This dynamic mobility behavior and its small size need to be provided with required resources, so that MANET growth can be assured. In the existing work, efficient resource allocation is guaranteed using the mechanism namely a lightweight dynamic channel allocation mechanism which can tolerate the non-uniform load distribution issues effectively. With this, dynamic requirement of users are satisfied using Centralized Dynamic Channel Allocation (CDCA) for Fuzzy Covariance Possibilistic C-Means (FCPCM) clustering algorithm. The existing work cannot achieve the local optimal result and it cannot satisfy the multi objective parameter values that are cannot satisfy the parameter values of energy, bandwidth, delay and optimal scheduling. This is resolved in the proposed research work by introducing the novel mechanism namely, lightweight Centralized Dynamic Channel Allocation (CDCA) mechanism for Intuitionistic Fuzzy Possibilistic C Means (IFPCM) Clustering Based MANETs and a cooperative load balancing strategy. The optimal scheduling is done by using the Multi-Objective Artificial Bee Colony (MOABC) approach. IFPCM is used to select the efficient cluster head node by generating the membership values. It is more useful for load balancing through calculating the multi objective parameters using MOABC algorithm. MOABC is focused to increase the local and global optimization by selecting the best channel condition. Thus, it is used to improve the service levels in the scheduling process in terms of higher packet delivery ratio, throughput, bandwidth and lower energy consumption. Combine both algorithms such as Cluster Heads Multi hop time (CMH)-TRACE to provide support for non-uniform load distributions and propose CDCA-TRACE. The proposed research is achieved optimal load balancing in the given network using CDCA with MOABC TRACE (CDCMOABC-TRACE) method.

Direction Density-Based Secure Routing Protocol for Healthcare Data in Incompletely Predictable Networks

Healthcare data are becoming increasingly important in the life of people. By utilizing healthcare data in a proper and secure manner, the elderly may avoid some sudden diseases, whereas young people can monitor their health condition. In the hospital, for certain sizes of detection objects, an effective method of data transmission becomes very significant. In view of the movement of patients in the hospital, we introduce a type of network called incompletely predictable networks to describe such scenarios. The patients move in a certain trend or are only active in a certain limited range. To achieve high performance when transmitting healthcare data in such networks, a novel protocol called the direction density-based secure routing protocol is proposed in this paper. Both the moving direction and the influence of node group movement are considered. The novel protocol innovatively takes the density of the node moving direction into consideration, which makes full use of the relationships among the moving individuals. Moreover, the design of the secure routing with authenticated message transmission ensures secure healthcare data communication. The simulation shows that our protocol achieves a high packet delivery ratio with low overhead and end-to-end delay.

Quality of forwarding-based data disseminating strategy in urban VANET

As for safety applications of vehicular Ad-hoc network (VANET), many valuable broadcast protocols have been proposed nowadays, most of which are based on either senders or receivers. In fact, sender-based protocols would fall into invalidation due to high mobility of network, while receiver-based ones would generate extra delay. Combining both the advantages of the two schemes, this paper proposes an efficient and reliable broadcast protocol based on quality of forwarding (ERBPQF) of candidate nodes. In ERBPQF, a double-phase relay scheme is presented to reach fast message dissemination in the first phase and to ensure high packet delivery ratio (PDR) in the second phase. Then, considering signal fading, channel contention, queuing delay, broadcast interference and high mobility of vehicles, a new metric called quality of forwarding (QoF) for relay selection is further proposed. The simulation results show that the delay and dissemination efficiency (DE) of ERBPQF outperforms slotted-1 protocol, accompanying with the achievement of more than 95% PDR.

Multi-Parameter Based Scheduling for Multi-user MIMO Systems

Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4 th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks

In this paper, we evaluate available bandwidth as a routing metric for IEEE 802.15.4-based ad-hoc networks. The available bandwidth on a data forwarding path is an approximation of the forwarding path’s residual data relaying capacity. High available bandwidth on a data forwarding path implies low data traffic load on the path, therefore data flows may experience low delay and high packet delivery ratio (PDR). Our aim is to evaluate available bandwidth as a routing metric. We present different available-bandwidth-based routing protocols for IEEE 802.15.40-based networks, namely: end-to-end available-bandwidth-based routing protocol (ABR), available bandwidth and contention-aware routing protocol (ABCR), and shortest hop-count and available-bandwidth-based opportunistic routing protocol (ABOR). Moreover, we also present variants of ABR and ABCR capable of distributing a flow’s data packets on multiple paths by maintaining the top K downstream nodes (the downstream nodes that advertised best data forwarding paths towards a sink node) corresponding to each sink node in a routing table. We focus on both single-sink and multi-sink networks. We performed extensive simulations, and the simulation results demonstrate that the available bandwidth routing metric shows better results when combined with a routing metric that helps to limit a data forwarding path’s length, i.e., shortest hop-count or intra-flow contention count. For multi-path data forwarding towards the same sink node, and at high traffic volumes, the available bandwidth metric demonstrates best performance when combined with the shortest hop-count routing metric.

Enhance Internet Access Ability for Ad Hoc Network with On-Demand Gateway Broadcast Strategy

Gateway discovery is a fundamental process in interconnecting mobile ad hoc network with the Internet. Traditional gateway discovery algorithms adopt the method of periodically broadcast advertisements with a time interval. However, this method does not fulfill the actual requirements from the source nodes and produces some unnecessary overhead. To solve this problem, this paper adopts a novel adaptive scheme, in which every gateway broadcasts advertisements only on demand instead of simultaneous periodic emissions of all gateway nodes. To support the on-demand gateway broadcast strategy, the network’s actual demands for advertisements are obtained by monitoring the status of routes to the gateway. In particular, if a route is going to break, the corresponding gateway will be triggered to broadcast in order to help the source nodes update routes. Furthermore, we propose another strategy of deferring each gateway broadcast operation, comprising a route stability evaluation model. Stable routes can defer route breakage and consequently further reduce the frequency of gateway broadcast. This paper also designs a new gateway selection method to cope with the problems caused by asynchronous on-demand broadcast strategy. The performance of the proposed scheme is studied by a comparison approach. The results show that the proposed scheme significantly outperforms the conventional solutions: it is capable of achieving higher packet delivery ratio and lower end-to-end delay, while minimizing the routing overhead.

An Investigation on the Impact of Weather Modelling on Various MANET Routing Protocols

The objective of the work is to analyze the impact of weather conditions on different types of MANET routing protocols. The influence of weather on the performances of MANET protocols such as AODV, STAR, RIP and ZRP are compared with and without considering weather conditions. Most of the works are not considering the effect of weather, when analysing the performances of MANET protocols. The simulations are carried out using Qualnet 5.0 with 100 nodes. The mobility model used for simulation is the Random waypoint model, where each node is moving independently to reach the destination with a random velocity. The velocity of each mobile node varies from 10 m/s to 50 m/s with the weather intensity of 1000 deg/m2. The performance metrics such as end to end delay, jitter, through put and packet delivery ratio are analysed and compared. The simulation results reveals that AODV provides better throughput and high packet delivery ratio compared to other protocols under with and without considering weather. STAR protocol yields good performance with respect to end to end delay and jitter under both conditions.

Robust geocast routing protocols for safety and comfort applications in VANETs

AbstractRouting in cooperative vehicular networks is a challenging task because of high mobility of vehicles and difficulty of localization. In this paper, we study the geocast routing problem in Vehicular Ad‐hoc NETworks (VANETs), which aims at delivering data to a specific group of mobile vehicles identified by their geographical location. Although many geocast routing protocols have been proposed, only partial inherent constraints of VANETs (such as mobility, internal network fragmentation problem, external network fragmentation problem, and overload) are taken into account. Therefore, we propose two novel and robust geocast routing protocols: the first one, called Robust Geocast Routing Protocol for Safety Applications (RGRP‐SA), is dedicated to road safety applications, while the second, namely, Robust Geocast Routing Protocol for Comfort Applications (RGRP‐CA), is designed for comfort applications. Simulations conducted in NS‐2 demonstrate that our safety‐oriented RGRP‐SA protocol outperforms Inter‐Vehicle Geocast protocol and Mobicast Routing Protocol in VANETs by sending up to 25% more packets, cutting the end‐to‐end delay in half, and solving the internal network fragmentation problem. Besides, it is also shown that our comfort‐oriented RGRP‐CA protocol serves well comfort applications with only light overhead by solving internal and external network fragmentation problems and providing more reliable data delivery (with a 25% higher packet delivery ratio) and higher network throughput utilization in comparison with Mobicast with Carry‐and‐Forward protocol. Copyright © 2015 John Wiley & Sons, Ltd.

Performance Analysis of Various Data Collection Schemes used in VANET

Objectives: The main objective of this paper is to find the best method for collecting the data for VANET in terms of communication overhead, average latency and packet delivery ratio. Methods/Analysis: OMNet++ is used to compare the existing techniques for data collection in VANET at single RSU. Performance Index is calculated by finding the Communication Overhead (CO), average latency and Packet Delivery Ratio (PDR) for each scheme of data collection. The scheme with higher value of performance index will outperform others. Simulation parameters like dimension of space, minimum velocity and maximum velocity of vehicles are kept constant. Findings: Comparison of different Data Collection Schemes is done on the basis of performance index. Performance Index shows the effectiveness of data collection schemes. PI is based on various parameters like CO, Latency, and PDR. PI of a data collection scheme decreases when CO increases and vice-versa. So, if number of messages will increase CO will increase and hence will decrease the PI. PI of a data collection scheme decreases when latency increases and vice-versa. So, if time delay is more latency will increase and hence will decrease the PI. PI of a Data Collection Schemes increases when PDR increases and vice-versa. So, if number of packets received by a destination will be more PDR will increase and hence will increase the PI. Analysis of results show that PI of VIB-CP is the best among all DCSs, as it has less CO, low latency, and high PDR. Novelty/Improvement: Comparison of heterogeneous Data Collection Schemes is made on same parameters and their performance index is measured. Out of all existing schemes it is analyzed that VIB-CP outperforms.

Energy-efficient broadcast in multihop cognitive radio networks

Broadcast is an important operation in Cognitive Radio Networks (CRNs). How to achieve broadcast in an energy-efficient way is important since users in CRNs are usually battery-powered. Existing single-channel broadcast mechanisms are not suitable for CRNs because multiple channels can be used in a CRN. Most existing multi-channel broadcast schemes rely on a common control channel (CCC) to support broadcast. However, finding such a CCC in a CRN is difficult because an unlicensed user’s available channels are changed over time and space. In this paper, we focus on an environment where no broadcast structure or CCC is established in advance while a node is equipped with one CR transceiver and does not aware of the locations and distances to other nodes. We have defined the one-hop Minimum Multichannel Set Cover (MMSC) problem and the multi-hop Minimum Cost Broadcast (MCB) problem in such an environment. Both problems are NP-hard and we have proposed a heuristic solution, the Energy-Efficient Broadcast (EEB) protocol, to solve them. Considering the uncertain primary user occupancy issue, the EEB protocol features a distributed solution that uses only local information. Simulation results verify that EEB effectively reduces energy consumption and achieves high packet delivery ratio.

Ant Colony Optimization Based Orthogonal Directional Proactive–Reactive Routing Protocol for Wireless Sensor Networks

Routing protocols for wireless sensor networks are important in addressing the various quality-of-service (QoS) issues pertaining to different applications. The most important QoS issues while designing routing protocols for WSN are energy awareness, scalability and network lifetime. However to deal with these issues the solutions provided in related literature have certain inherent disadvantages like high control overhead, low packet delivery ratio and requirement of global location information. In order to resolve these issues, we propose an orthogonal transmission based scalable, lightweight and energy aware routing protocol named as OD-PPRP which does not require global location information and has low control overhead. The proposed protocol OD-PRRP has the characteristics of both reactive and proactive routing protocols and utilizes fuzzy logic and Ant Colony Optimization to identify energy efficient and optimal paths. The simulation results show in both static and dynamic environment, OD-PRRP has better network lifetime, low end to end transmission delay, less overhead and high packet delivery ratio than other state of art QoS aware routing protocol viz. EARQ, EAODV and EEABR.

Clone Detection Using Enhanced EDD (EEDD) with Danger Theory in Mobile Wireless Sensor Network

In the recent years, Wireless Sensor Networks (WSN) are widely used to reap the benefits of sensing capacity of mobile nodes and its wireless mode of communication. Sensor network architectures can be used for various applications that include intrusion detection, military patrols, border monitoring, etc. The security of nodes in a sensor network is a challenging issue as they are easy targets for attacks. The node replication attack is one among those attacks. The adversary can capture security credentials from a node by compromising the node. The adversary can replicate the node using the same ID. To rectify this problem in a sensor network, various replica node detection techniques have been proposed. These techniques do not work well when multiple replicas are introduced in the network against genuine nodes. Subsequently, the detection capability of the network is degraded. To overcome these problems, this paper proposes Enhanced Efficient Distributed Detection (EEDD) algorithm. It combines the best features of EDD and danger theory of artificial immune system. This hybrid approach EEDD detects the clones. This method prevents multiple replicas in the WSN. The advantages of the proposed method include (i) increased detection rate, (ii) decreased overheads, (iii) high Packet Delivery Ratio (PDR) and (iv) low energy consumption. The proposed method is tested in a simulated environment.