This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Fuzzy based clustering and energy efficientIJCNCJournal
Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is
characterized by using acoustic channels for communication. UWSN is challenged by great issues specially
the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed
routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing
protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based
on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the
closeness to the center of the cluster, then the node having the higher residual energy elects itself as a
cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data
aggregation and transmits the data directly to the base station. The second algorithm uses the same
principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data
from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested
for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed
algorithms resulting in an extension of the network lifetime.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Fuzzy based clustering and energy efficientIJCNCJournal
Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is
characterized by using acoustic channels for communication. UWSN is challenged by great issues specially
the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed
routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing
protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based
on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the
closeness to the center of the cluster, then the node having the higher residual energy elects itself as a
cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data
aggregation and transmits the data directly to the base station. The second algorithm uses the same
principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data
from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested
for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed
algorithms resulting in an extension of the network lifetime.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
IMPACTS OF STRUCTURAL FACTORS ON ENERGY CONSUMPTION IN CLUSTER-BASED WIRELESS...ijasuc
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Optimal Coverage Path Planningin a Wireless Sensor Network for Intelligent Tr...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
Optimal Coverage Path Planning in a Wireless Sensor Network for Intelligent T...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage using Unmanned Vehicles
1. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 27
Routing in Wireless Sensor Networks: Improved Energy
Efficiency and Coverage using Unmanned Vehicles
Long Kim Le lle3@islander.tamucc.edu
Computer Science Department
Texas A&M University – Corpus Christi
Corpus Christi, 78412, U.S.A
Ahmed M.Mahdy ahmed.mahdy@tamucc.edu
Computer Science Department
Texas A&M University – Corpus Christi
Corpus Christi, 78412, U.S.A
Abstract
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks
(WSNs) that can improve the energy efficiency and network coverage; especially in remote areas.
In multi-hop communication, sink nodes are responsible for collecting and forwarding data to
base stations. The nodes that are located near a sink node usually deplete their battery faster
than other nodes because they are responsible for aggregating the data from other sensor nodes.
Several studies have proved the advantages of using mobile sink nodes to reduce energy
consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be
understated. Accordingly, a hybrid routing algorithm based on the Dijkstra’s and Rendezvous
algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid
Unmanned Vehicle Based Routing Algorithm (E
2
HUV) is proposed to create a routing path for
Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance
results show that the E
2
HUV algorithm offers better efficiency as compared to currently existing
algorithms.
Keywords: Unmanned Systems, Wireless Sensor Networks, Mobile Sinks, Scheduling, Routing,
Coverage.
1. INTRODUCTION
A WSN can be defined as a network of sensor nodes that are small devices with limited battery
capacity which may be difficult and impractical to replace. In addition, they are typically limited in
computation, communication and memory capabilities. These characteristics present challenging
constraints in designing energy efficient protocols. Much research has focused on the energy
efficiency of WSNs emphasizing the energy hole issue [1]. The closer a sensor node is to a sink
node, the faster its battery runs out [1]. As a result, the sink node depletes its energy and
becomes disconnected from the network. This adversely affects the coverage of the sensor field.
Hence, controlling the energy consumption of sensor nodes is critical for the performance and
efficiency of WSNs.
Unmanned Aerial Vehicles (UAVs) have been witnessing a rapid growth in applications and
capabilities in the last few years. These unmanned systems come in various types, sizes and
features. This opens the door for a wide range of applications. A relevant example is the use of
UAVs as sink nodes to aggregate data in WSNs in an energy efficient way [2].
2. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 28
FIGURE 1: WSN infrastructure [9].
2. LITERATURE REVIEW
A. UAVs for WSN
UAVs have recently been used for data collection purposes in WSN. In such contexts, the data is
typically forwarded to the base station for analysis purposes. UAVs have been shown to improve
the WSN energy consumption issue. They act as mobile sink nodes that can directly impact the
overall network energy consumption. The network lifetime and throughput can be increased by
implementing an effective data gathering routing scheme in air-to-ground communication network
[2]. In addition, there are also factors that can affect the network lifetime such as the
communication (cooperative or non-cooperative) between sensor nodes [3].
In adhoc networks, especially WSNs, much research has been done on energy efficient
protocols, algorithms, and frameworks. The objectives of such research are to effectively relay
the data among sensor nodes, to minimize the energy cost, and to maximize the network lifetime.
Existing protocols using a mobile sink in WSNs can be classified into two categories: 1) direct,
where a mobile sink visits each sensor node in an ultimate path and collects data via a single-
hop; and 2) rendezvous, where a mobile sink only visits nodes defined as Rendezvous Points
(RPs). The main goal of protocols in the first category is to minimize data collection delays by
using single hop communication, whereas those in the second category aim to find a subset of
RPs that minimize energy consumption but the heavy multi-hop communication issue still exists.
In the following, the advantages and disadvantages of these protocols will be discussed.
FIGURE 2: Example of a UAS [9].
B. Direct:
Quality of service (QoS) is a major requirement in many applications. In this context, much focus
has been dedicated to improve energy consumption. Energy-inefficient algorithms reduce the
network lifetime and impact its performance. The energy hole problem is still not solved because
3. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 29
the sensors forward the data to a single sink node that reduces its battery faster [2]. Mobile sink
nodes play an important role in efficiently forwarding data to base stations [4].
The three benchmarks of direct routing schemes in WSNs are Dijkstra’s algorithm, Low Energy
Adaptive Clustering Hierarchy algorithm (LEACH), and Floyd-Warshall’s algorithm. Firstly,
Dijkstra’s algorithm plays an important role in practical applications of data monitoring; it
considers the energy and time constraint while sending the message from source node to
destination node. In WSNs, this algorithm is used to find the shortest path between pairs of
source and destination nodes for data aggregation through all reachable nodes in a sensing field.
Dijkstra’s algorithm can reduce the network energy consumption significantly [5]. However, this
algorithm can be inefficient because of the cost of computations. By applying this algorithm to the
mobile sink scenario, the mobile sink will visit each and every node to collect data with single-hop
communication. Thus, it can reduce the network energy significantly. In networks with a large
number of sensor nodes, this algorithm seems inefficient because of the high data delivery delay.
Secondly, the LEACH algorithm randomly selects some nodes as cluster heads (CHs) for
forwarding data and balancing the energy of the network by rotating this role. In this algorithm,
sensor nodes will find and only communicate with their closest neighbors (closest nodes) and
forward data to base station. By using this algorithm, the energy of the nodes is distributed and
the chances of depleting the energy of nodes is less and the power required to transfer data per
round is balanced uniformly. As a result, the network lifetime can be increased [6].
Thirdly, Floyd-Warshall’s algorithm is a combination of Floyd’s algorithm and Warshall’s algorithm
in order to find the transitive closure of a graph. Floyd’s algorithm finds the shortest path but it is
not suitable for applying to WSNs. This algorithm finds all the minimum distance between pairs of
nodes.
C. Rendezvous:
Instead of letting a mobile sink travel along all the nodes in the network, the use of Rendezvous
Nodes (RNs) can reduce the network energy consumption significantly [7]. RNs not only can
perform the cluster head role, but also can reduce the network energy cost. The RNs selection
algorithm [5] shows that by only visiting the set of RNs, the mobile sink can minimize the travel
tour length and avoid the density of the heavy multi-hop communication. As the result, the energy
consumption decreases and accordingly the network lifetime increases.
Mobile-sink path selection using weighted rendezvous planning algorithm (WRP) is one of the
most common algorithms based on the concept of RNs. This algorithm is utilizing a hybrid moving
pattern where the mobile sink node will only visit RNs. Reflecting a set of factors, weights can be
assigned to sensor nodes. Based on these weight values, the algorithm chooses a path for the
mobile sink. WRP can increase the network lifetime by 44% on average [1]. It also decreases
energy consumption by 22% on average [1]. Despite these improvement, the amount of data
handled by RNs, especially in large networks, can be overwhelming leading to buffer overflow or
high delivery delays when communicating with the mobile sink. Much research has been
dedicated to RN-based algorithms aiming to improve the overall performance of the algorithm.
One addition is to find the closest RNs among all nodes to create a more efficient travelling path
for mobile sinks [8]. By applying this protocol, the mobile sink tour length is significantly
decreased compared to traditional RN algorithms.
3. PROPOSED ALGORITHM
3.1.WSN Challenges
WSNs have been studied and researched for many years. Although, a lot of improvements have
been proposed and applied over the years, there are still some outstanding challenges that may
limit the use of WSNs for certain applications. The two major challenges impacting the WSNs in
terms of lifetime, coverage and performance are: power consumption and redundant node
requirements. These issues have been a research focus in recent years, yet, the need for better
4. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 30
solutions cannot be understated.
In real-life scenarios and for specific applications, a WSN can be deployed with a large number of
sensor nodes. It may be designed to operate for months or years in hard to access areas. Thus,
changing or replacing battery for such a large number of sensor nodes may not be practical or
feasible. Thus, it is critical that WSNs operate as efficient as possible. The design of the network
topology, protocols, routing algorithms, and even each individual sensor node is key to an
efficient operation.
In single-hop based WSNs where sensor nodes are directly communicating with the controller or
base station, the sleeping time mostly depends on the application. In multi-hop based WSNs, sink
nodes act as the most active nodes in the network, so their batteries may drain out more quickly
than other nodes.
3.2. E
2
HUV Algorithm
A. Assumptions
Before describing the proposed algorithm, the following are the assumptions for the E
2
HUV
algorithm. These assumptions are based on the DEETP algorithm [9] for performance evaluation
and comparison purposes:
• The time of multi-hop communication delay is negligible.
• Every sensor node including Rendezvous Points (RPs) has enough memory to store all
data.
• The deployment of sensor nodes is uniform, so the UAVs know the location of nodes and
RPs.
• In this scenario, the ad hoc WSN is in stable condition. The connections between nodes
are stable and there is no redundant or isolated node.
• Every node has the same and fixed data communication range.
• Each sensor node will transmit one data packet; b bits in t time.
B. Notations
In this paper, a WSN is considered with a complete graph and modeled as G(V,E) where V is the
set of sensor nodes, E is the set of edges between 2 nodes in V. When a sensor node i transmits
b bits to node j, it will consume the amount of energy as follow [3][9]:
ET (i, j) = bij . Cij
Cij is the required energy when node i transmits one unit of data to node j. It is calculated by
following formula:
Cij = ij
Then: ET (i, j) = bij ( ij)
Where di,j is the Euclidean distance between 2 nodes i and j; is the energy consumption factor
caused by the transmission; is the energy consumption factor of the amplifier; e is the path loss
which has range from 2 to 6 depending on the environment.
Similarly, the power consumption when node i receives b bits from node j is:
ER (i, j) = bij .
Where is a given constant presenting the energy consumption per received bit.
So the total energy consumption per time unit at node i is:
ES = + = +
5. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 31
The maximum length of the path that a UAV can cover, d, assuming a constant speed v:
dmax = P . v
Where P is the maximum packet delay allowed in the network. ND(i) is the number of data
packets that a sensor node i transmits to the closest RN:
ND(i) = G(i, Tj) + 1
Where G(i, Tj) is the number of sub nodes that node i has in the tree T. Based on the weight of a
sensor node, the algorithm declares which node will become a RN. The weight of a sensor node i
is calculated by the following formula:
Wi = ND(i).H(i, M)
Where Wi is the weight at node i; H(i, M) is the closest RN which is defined as:
H(i, M) = {hi,mj | k hi,mj hi,mk}
Where hi,j is the distance between node i and node j.
Standard Deviation (SD) is calculated to measure the imbalance of energy consumption among
the different nodes. If SD is high, it indicates that some parts of the network tend to exhaust their
energy quite rapidly compared to other parts [9].
SD =
Where ES[i] is the energy consumption by node i, V is the number of nodes, u is the average
energy consumption.
The communication range of each sensor node is same over the whole simulation period, the
flying altitude of a UAV needs to be carefully considered. If UAVs are acting as mobile sink nodes
to collect the data from the sensor field and their altitude is properly calculated and adjusted, the
network performance can be improved by reducing the connection range.
Notation Description
G(V, E) The network complete graph
V The set of sensor nodes
E The set of edges between 2 nodes
n The total number of sensor nodes, n = |V|
v The UAV’s speed
dmax Maximum tour length
ET (i, j) The energy consumption when node i send
data packet to node j
ER (i, j) The energy consumption for receiving data
packet
ES The total energy consumption on a node.
(ES(i, j) = ET (i, j) + ER (i, j))
The energy consumption factor caused
by the transmission
The energy consumption factor of the
amplifier
i,j The Euclidean distance between 2 nodes i
and j
6. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 32
e The path-loss exponent (range from 2 to 6
depends on the environment)
SD The standard deviation of the network
The sensor nodes average energy
consumption
TABLE 1: Summary of notations.
The flying height of the UAV is a function of the communication range of a sensor node. Figure 7
shows that the height h is the actual height of a UAV that will be maintained during the flight and
while collecting data from the sensor field. R is the communication range of a node. The flying
height of a UAV can be calculated as follows:
h =
Where v is the UAV speed; T’ is the connection time.
FIGURE 3: Height of a UAV.
v = 1m/s
R = 20m < 19.995m
R = 100m < 99.861m
TABLE 2: UAV flying height under different speed.
7. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 33
C. E
2
HUV Algorithm Description
FIGURE 4: E
2
HUV Flow Chart.
In this paper, the main objective of E
2
HUV is to improve energy consumption and coverage in
WSNs. The problem of limited-energy sink nodes is solved by using multiple UAVs. The UAVs
offer better battery capacity that can be recharged and can cover larger areas. E
2
HUV algorithm
is based on Dijkstra’s and Weight Rendezvous Planning (WRP). Figure 4 presents a flow chart of
how the algorithm works. Depending on the UAV battery, the E
2
HUV will accordingly operate and
calculate the most appropriate path for the UAV to travel the sensor field. When the battery of a
UAV is full or nearly full, the UAV will follow Dijkstra’s algorithm. It will travel the shortest path.
When the battery approaches a specified threshold, the proposed algorithm will function as a
WRP-based algorithm. By selecting the RPs of the remaining unvisited sensor nodes, the UAV
can collect data from RPs and forward to the base station. The ability to switch from Dijkstra’s-
based to WRP-based allows the mobile sink node (i.e. UAV) to achieve a balanced performance
between coverage and lifetime.
8. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 34
The complexity of the E
2
HUV algorithm can be calculated as: nlog(n
2
). The complexity of
Dijkstra’s is O(ElgV) where there are V vertices in the graph; E is the total number of edges. The
complexity of WRP is O(n
5
). Based on the complexity estimation, the E
2
HUV algorithm has better
performance compared to WRP.
Figure 5 shows an example of finding a travel path for a UAV using E
2
HUV. The E
2
HUV starts
from the starting position near node 2. Consider node 2 as the first node that UAV will visit.
Assume that the UAV battery is fully charged. The maximum tour length is dmax = 90m. A shortest
9. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 35
Path Tree (SPT) is created in Figure 5(a). When the algorithm starts, the UAV will visit node 2
first. From node 2, it finds the shortest edge from node 2 to its neighbors (12, 1, 8). In this case, it
is node 12. As the operation continues, a path through nodes 2, 12, 11, 1 is created; as shown in
Figure 5(b). When the battery reaches 40% (i.e. the set threshold in this case), the algorithm
switches to WRP to find the closet set of RNs from its current position. Assume that the UAV is at
node 1 when the battery level hits the threshold value. In its first iteration, node 10 is added to the
path since it has the highest weight value among unvisited nodes. So M = [1, 10]. M is smaller
than dmax, so node 10 is added to the tour. In the second iteration, node 7 becomes the closest
RN and has the highest weight among the rest of nodes. M = [1, 10, 7] is smaller than dmax. So
node 7 is added to the tour. The algorithm continues until the UAV has power enough to return to
its base station.
FIGURE 5: Example of E
2
HUV with 13 nodes and one UAV.
3.3. Performance Analysis
3.3.1 Simulation Setup
The purpose of this simulation is to compare the E
2
HUV algorithm with the two most commonly
used algorithms; Dijkstra’s and Weight Rendezvous Planning algorithms. Network Simulator 3
(NS3) is the simulator of choice with C++ programing language. The WSN consists of multiple
sensor nodes deployed in a field of size 200 square meters; Figure 7. The simulation is run on
64-bit Ubuntu version 15.04.
FIGURE 6: Example of a UAV device - Parrot Bebop Drone. [10].
10. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 36
FIGURE 7: The E
2
HUV Algorithm simulation.
The performance of the Dijkstra’s, WRP, and E
2
HUV algorithms are evaluated in this paper. All
algorithms have been simulated under the same network and parameters conditions. In all the
simulations, nodes 0, 2 and highest ID node are designated as mobile sinks (i.e. UAVs in this
scenario). The results were averaged over 15 runs for each metric.
Parameter Value
Number of sensor nodes 100
Number of UAVs 5
Maximum allowed packet delay 100 to 300 seconds
Sensor node transmission range 20m to 100m
UAV speed 1m/s
Packet length 210 bytes
Communication rate 448Kb/s
Energy consumption at transmitter 40mW
Energy consumption at receiver 20mW
Sensor node’s battery 100J
TABLE 3: Simulation parameters.
3.3.2 Evaluation
In this implementation, the network size can vary between 2-200 sensor nodes. These sensor
nodes are deployed in different clusters in the simulated area. There is a minimum of two UAVs,
by default, to collect data from the sensing field. The number of UAVs is increased depending on
the experiment scenario. For the purpose of implementation, it is assumed that all sensor nodes
are fully charged and the speed of UAVs is constant at 1m/s. The simulation also follows the
aforementioned assumptions.
11. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 37
FIGURE 8: Algorithm running time for E
2
HUV, Dijkstra’s and WRP algorithms.
Figure 8 shows that E
2
HUV algorithm outperforms WRP on running time. The Dijkstra’s based
algorithm seems to have the best running time among all algorithms. Dijkstra’s based algorithm
appears to take less time compared to WRP especially for large number of sensor nodes.
FIGURE 9: Network energy consumption for E
2
HUV, Dijkstra’s and WRP algorithms.
Figure 9 shows energy consumption performance for the three algorithms. The E
2
HUV algorithm
uses less energy approximately by 30% and 43% compared to WRP and Dijkstra’s, respectively.
It is worth noting that the proposed hybrid algorithm has greater running time than Dijkstra’s but it
costs less energy. The reason is that E
2
HUV spends more time on computing and processing
and less time on communications as compared to Dijkstra’s. It is typical for such networks that
communications would cost more energy than computing and processing.
12. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 38
FIGURE 10: Network lifetime for E
2
HUV, Dijkstra’s and WRP algorithms.
As shown in Figure 10, the E
2
HUV algorithm improves network lifetime by 11% and 20% as
compared to WRP and Dijkstra’s, respectively.
FIGURE 11: Standard deviation of sensor nodes’ energy consumption.
Figure 11 shows energy consumption standard deviation (SD). The smaller the SD value is the
longer the network lifetime is and the more uniform energy consumption is. E
2
HUV tends to have
a smaller SD compared to WRP allowing for better energy consumption balance among the
sensor nodes. This can lead to a long network lifetime even with large number of sensor nodes.
For SD, Dijkstra’s serves as the lower bound with a value of 0.
13. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 39
FIGURE 12: Network energy consumption for E
2
HUV, Dijkstra’s and WRP algorithms under different
required delivery times for data packets.
Figure 12 shows energy consumption and network lifetime as a function of packet delivery time.
The energy consumption for E
2
HUV is reduced by 55% when the required packet delivery time is
changed from 5 to 30 s. WRP and Dijkstra’s observed a reduction of 20% and 12%, respectively.
FIGURE 13: Network energy consumption with different UAV battery thresholds.
Figure 13 shows the performance of the proposed algorithm under different UAV battery
thresholds from 0% to 100%. This is to observe the change in network energy consumption.
When the battery threshold is very small, the proposed algorithm will operate as a WRP. When
the threshold is nearly 100%, it will act as a Dijkstra’s based algorithm. According to the results,
the optimum energy consumption, for this scenario, is achieved when the threshold is at 40%.
4. ACKNOWLEDGMENTS
This work has been supported, in part, by National Science Foundation grant CNS-1042341.
14. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 40
5. REFERENCES
1. Salarian, Hamidreza, Kwan-Wu Chin, and Fazel Naghdy. An energy-efficient mobile-sink
path selection strategy for wireless sensor networks. Vehicular Technology; IEEE
Transactions 63.5 2014, 2407-2419.
2. Li, Jian, and Prasant Mohapatra. An analytical model for the energy hole problem in many-
to-one sensor networks. IEEE Vehicular Technology Conference. Vol. 62. No. 4. IEEE
2005.
3. Sathyaraj, B. Moses, et al. Multiple UAVs path planning algorithms: a comparative study.
Fuzzy Optimization and Decision Making 7.3 2008, 257-267.
4. Luo, Jun, and Jean-Pierre Hubaux. Joint mobility and routing for lifetime elongation in
wireless sensor networks. INFOCOM 2005; 24th annual joint conference of the IEEE
computer and communications societies; Proceedings IEEE. Vol. 3. IEEE 2005.
5. Sanchez, Erwing R., et al. An adaptive power-aware multi-hop routing algorithm for wireless
sensor networks. Information Technology: New Generations (ITNG) 2011; Eighth
International Conference on. IEEE 2011.
6. Gou, Haosong, and Younghwan Yoo. An energy balancing LEACH algorithm for wireless
sensor networks. Information Technology: New Generations (ITNG) 2010; Seventh
International Conference on. IEEE 2010.
7. Leng, Jinfu. Using a uav to effectively prolong wireless sensor network lifetime with wireless
power transfer. Diss. University of Nebraska 2014.
8. Konstantopoulos, Charalampos, et al. A rendezvous-based approach enabling energy-
efficient sensory data collection with mobile sinks. Parallel and Distributed Systems; IEEE
Transactions on 23.5 2012, 809-817.
9. Alomari, Abdullah, et al. A scheme for using closest rendezvous points and Mobile Elements
for data gathering in wireless sensor networks. Wireless Days (WD) IFIP. IEEE 2014.
10. http://store.storeimages.cdn-apple.com/4839/as-images.apple.com/is/image
11. http://www.tkt.cs.tut.fi/kurssit/2456/wsnmotivation2.png
12. Cobano, Jose A.; Martinez-De Dios, J. R.; Conde, R.; Sánchez-Matamoros, J.M.; Aníbal,
Ollero. Data retrieving from heterogeneous wireless sensor network nodes using UAVs.
Journal of Intelligent And Robotic Systems 2010, 133-151.
13. Ho, Dac-Tu, Esten Ingar Grotli, and Tor Arne Johansen. Heuristic algorithm and cooperative
relay for energy efficient data collection with a UAV and WSN. Computing, Management and
Telecommunications (ComManTel) 2013; International Conference on. IEEE 2013.
14. Lawrence, Elaine, et al. Data collection, correlation and dissemination of medical sensor
information in a WSN. Networking and Services 2009; ICNS 2009; Fifth International
Conference on IEEE 2009.
15. Matin, Mohammad. Wireless sensor networks-technology and applications. Charalambos
Sergiou, Vasos Vassiliou, Publisher: InTech 2012. ISBN-13 1304639176
16. Sotheara, Say, et al. Effective data gathering protocol in WSN-UAV employing priority-based
contention window adjustment scheme. Globecom Workshops (GC Wkshps) 2014; IEEE
2014
15. Long Kim Le & Ahmed M.Mahdy
International Journal of Computer Networks (IJCN), Volume (8) : Issue (2) : 2016 41
17. Wang, Z. Maria, et al. Exploiting sink mobility for maximizing sensor networks lifetime.
System Sciences 2005; HICSS 2005; 38th Annual Hawaii International Conference on. IEEE
2005.
18. Wei, Peng, Quanquan Gu, and Dengfeng Sun. Wireless sensor network data collection by
connected cooperative UAVs. American Control Conference (ACC) 2013; IEEE 2013.
19. Xing, Guoliang, et al. Rendezvous design algorithms for wireless sensor networks with a
mobile base station. Proceedings of the 9th ACM international symposium on Mobile ad hoc
networking and computing. ACM 2008.
20. Zuo, Yun, Zhihao Ling, and Yifeng Yuan. A hybrid multi-path routing algorithm for industrial
wireless mesh networks. EURASIP Journal on Wireless Communications and Networking
2013, 1-12.