Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...paperpublications3
Abstract: Data gathering in wireless sensor network (WSN) is a crucial field of study and it can be optimized various algorithms like clustering, aggregation, and cryptographic technique in order to reliably transfer data between sensor and sink. But these techniques do not provide an optimized data gathering wireless sensor network because of the fact that they do not leverage the advantages of various techniques. Our problem definition is to create a reliable data gathering wireless sensor network which ensures good energy efficiency and lower delay as compared to existing techniques.
Keywords: Aggregation, Clustering, Data Gathering, Cryptography, Data Compression, Run Length Encoding.
Title: Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency and Delay
Author: Neelam Ashok Meshram
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Analysis of Genetic Algorithm for Effective power Delivery and with Best Upsurgeijeei-iaes
Wireless network is ready for hundreds or thousands of nodes, where each node is connected to one or sometimes more sensors. WSN sensor integrated circuits, embedded systems, networks, modems, wireless communication and dissemination of information. The sensor may be an obligation to technology and science. Recent developments underway to miniaturization and low power consumption. They act as a gateway, and prospective clients, I usually have the data on the server WSN. Other components separate routing network routers, called calculating and distributing routing tables. Discussed the routing of wireless energy balance. Optimization solutions, we have created a genetic algorithm. Before selecting an algorithm proposed for the construction of the center console. In this study, the algorithms proposed model simulated results based on "parameters depending dead nodes, the number of bits transmitted to a base station, where the number of units sent to the heads of fuel consumption compared to replay and show that the proposed algorithm has a network of a relative.
Device Discovery Schemes for Energy-Efficient Cluster Head Rotation in D2DTELKOMNIKA JOURNAL
In this paper, novel device discovery approaches for the cluster head rotation, which is a state-ofthe-
art method for the Device-to-Device communication, are proposed. The device discovery is the
process to detect and to include new devices in the Device-to-Device communication. The proposed
device discovery is aimed to attain energy efficiency for the communication devices. We propose two
schemes for the device discovery: eNB-assisted and independent device discovery. Compared to previous
work, the proposed device discovery is utilizing the cluster head rotation method, to achieve better energy
efficiency. In this work, several simulations were performed and discussed for both schemes. In the first
simulation, the device energy consumption is examined. After that, the number of devices that get rejected
is studied. The device discovery processes in multi cluster head scenario, which is cluster head rotation,
are examined in this paper. The result of the simulation shows that eNB-assisted device discovery can
provide better energy efficiency. Also, the number of rejected devices of the eNB-assisted device
discovery is slightly lower than independent device discovery.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...paperpublications3
Abstract: Data gathering in wireless sensor network (WSN) is a crucial field of study and it can be optimized various algorithms like clustering, aggregation, and cryptographic technique in order to reliably transfer data between sensor and sink. But these techniques do not provide an optimized data gathering wireless sensor network because of the fact that they do not leverage the advantages of various techniques. Our problem definition is to create a reliable data gathering wireless sensor network which ensures good energy efficiency and lower delay as compared to existing techniques.
Keywords: Aggregation, Clustering, Data Gathering, Cryptography, Data Compression, Run Length Encoding.
Title: Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency and Delay
Author: Neelam Ashok Meshram
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Analysis of Genetic Algorithm for Effective power Delivery and with Best Upsurgeijeei-iaes
Wireless network is ready for hundreds or thousands of nodes, where each node is connected to one or sometimes more sensors. WSN sensor integrated circuits, embedded systems, networks, modems, wireless communication and dissemination of information. The sensor may be an obligation to technology and science. Recent developments underway to miniaturization and low power consumption. They act as a gateway, and prospective clients, I usually have the data on the server WSN. Other components separate routing network routers, called calculating and distributing routing tables. Discussed the routing of wireless energy balance. Optimization solutions, we have created a genetic algorithm. Before selecting an algorithm proposed for the construction of the center console. In this study, the algorithms proposed model simulated results based on "parameters depending dead nodes, the number of bits transmitted to a base station, where the number of units sent to the heads of fuel consumption compared to replay and show that the proposed algorithm has a network of a relative.
Device Discovery Schemes for Energy-Efficient Cluster Head Rotation in D2DTELKOMNIKA JOURNAL
In this paper, novel device discovery approaches for the cluster head rotation, which is a state-ofthe-
art method for the Device-to-Device communication, are proposed. The device discovery is the
process to detect and to include new devices in the Device-to-Device communication. The proposed
device discovery is aimed to attain energy efficiency for the communication devices. We propose two
schemes for the device discovery: eNB-assisted and independent device discovery. Compared to previous
work, the proposed device discovery is utilizing the cluster head rotation method, to achieve better energy
efficiency. In this work, several simulations were performed and discussed for both schemes. In the first
simulation, the device energy consumption is examined. After that, the number of devices that get rejected
is studied. The device discovery processes in multi cluster head scenario, which is cluster head rotation,
are examined in this paper. The result of the simulation shows that eNB-assisted device discovery can
provide better energy efficiency. Also, the number of rejected devices of the eNB-assisted device
discovery is slightly lower than independent device discovery.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
QUAD TREE BASED STATIC MULTI HOP LEACH ENERGY EFFICIENT ROUTING PROTOCOL: A N...IJCNCJournal
This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator.This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless,sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKSIJCNCJournal
Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more
number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,
processing power. They have wireless capabilities to monitor physical or environmental conditions. This
paper compared the performance analysis of some existing routing protocols for target tracking
application with proposed hierarchical binary tree structure to store the routing information. The sensed
information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent
node) which deployed using complete binary tree data structure. This reduces traffic implosion and
geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection
probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing
efficiency. We have evaluated our proposed algorithm using NS2.
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...ijwmn
The deployment of network nodes is essential to ensure the wireless sensor network's regular operation and affects the multiple network performance metrics, such as connectivity, coverage, lifetime, and cost. This paper focuses on the problem of minimizing network costs while meeting network requirements, and proposes a corona-based deployment method by using the variable transmission distance sensor. Based on the analysis of node energy consumption and network cost, an optimization model to minimize Cost Per Unit Area is given. The transmission distances and initial energy of the sensors are obtained by solving the model. The optimization model is improved to ensure the energy consumption balance of nodes in the same corona. Based on these parameters, the process of network node deployment is given. Deploying the
network through this method will greatly reduce network costs.
DISTRIBUTED COVERAGE AND CONNECTIVITY PRESERVING ALGORITHM WITH SUPPORT OF DI...IJCSEIT Journal
Given a 3D space where should be supervised and a group of mobile sensor actor nodes with limited
sensing and communicating capabilities, this paper aims at proposing a distributed self-deployment
algorithm for agents to cover the space as much as possible by considering non-uniform sensing coverage
degree constraint of environment while preserving connectivity. The problem is formulated as coverage
maximization subject to connectivity and sensing coverage degree constraint. Considering a desired
distance between neighbouring nodes, an error function which depends on pairwise distance between
nodes is described. The maximization is encoded to an error minimization problem that is solved using
gradient descent algorithm and will yield in moving sensors into appropriate positions. Simulation results
are presented in two different conditions that importance of sensing coverage degree support of
environment is very high and is low.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
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.
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
A New Method for Reducing Energy Consumption in Wireless Sensor Networks usin...Editor IJCATR
Nowadays, wireless sensor networks, clustering protocol based on the neighboring nodes into separate clusters and fault
tolerance for each cluster exists for sensors to send information to the base station, to gain the best performance in terms of increased
longevity and maintain tolerance than with other routing methods. However, most clustering protocols proposed so far, only
geographical proximity (neighboring) cluster formation is considered as a parameter. In this study, a new clustering protocol and fault
tolerance based on the fuzzy algorithms are able to clustering nodes in sensor networks based on fuzzy logic and fault tolerance. This
protocol uses clustering sensor nodes and fault tolerance exist in the network to reduce energy consumption, so that faulty sensors
from neighboring nodes are used to cover the errors, work based on the most criteria overlay neighbor sensors with defective sensors,
distance neighbor sensors from fault sensor and distance neighbor sensors from central station is done. Superior performance of the
protocol can be seen in terms of increasing the network lifetime and maintain the best network tolerance in comparison with previous
protocols such as LEACH in the simulation results.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Analytical Modelling of Power Efficient Reliable Operation of Data Fusion in ...IJECEIAES
Irrespective of inclusion of Wireless Sensor Network (WSN) in majority of the research proposition for smart city planning, it is still shrouded with some significant issues. A closer look into problems in WSN shows that energy parameter is the origination point of majority of the other problems in resource-constrained sensors as well as it significant minimizes the reliability in standard sensory operation in adverse environment. Therefore, this manuscript presents a novel analytical model that is meant for establishing a well balance between energy efficiency over multi-path data forwarding and reliable operation with improved network performance. The complete process is emphasized during data fusion stage to ensure data quality too. A simulation study has been carried out using benchmarked test-bed of MEMSIC nodes to find that proposed system offers good energy conservation process during data fusion operation as well as it also ensure good reliable operation in comparison to existing system.
The volume of the data is directly proportional to the model's accuracy in data analytics for any particular domain. Once a developing field or discipline becomes apparent, the scarcity of the data volume becomes a challenging proponent for the correctness of a model and prediction. In the proposed state-of-the-art, a transitive empirical method has been used within the same contextual domain to extract features from a low-resource part via a heterogeneous field with factual data. Even though an example of text processing has been used for brevity, it is not limited. The success rate of the proposed model is 78.37%, considering model performance. But when considering human subject matter experts, the accuracy is 81.2%.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
QUAD TREE BASED STATIC MULTI HOP LEACH ENERGY EFFICIENT ROUTING PROTOCOL: A N...IJCNCJournal
This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator.This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless,sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKSIJCNCJournal
Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more
number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,
processing power. They have wireless capabilities to monitor physical or environmental conditions. This
paper compared the performance analysis of some existing routing protocols for target tracking
application with proposed hierarchical binary tree structure to store the routing information. The sensed
information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent
node) which deployed using complete binary tree data structure. This reduces traffic implosion and
geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection
probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing
efficiency. We have evaluated our proposed algorithm using NS2.
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...ijwmn
The deployment of network nodes is essential to ensure the wireless sensor network's regular operation and affects the multiple network performance metrics, such as connectivity, coverage, lifetime, and cost. This paper focuses on the problem of minimizing network costs while meeting network requirements, and proposes a corona-based deployment method by using the variable transmission distance sensor. Based on the analysis of node energy consumption and network cost, an optimization model to minimize Cost Per Unit Area is given. The transmission distances and initial energy of the sensors are obtained by solving the model. The optimization model is improved to ensure the energy consumption balance of nodes in the same corona. Based on these parameters, the process of network node deployment is given. Deploying the
network through this method will greatly reduce network costs.
DISTRIBUTED COVERAGE AND CONNECTIVITY PRESERVING ALGORITHM WITH SUPPORT OF DI...IJCSEIT Journal
Given a 3D space where should be supervised and a group of mobile sensor actor nodes with limited
sensing and communicating capabilities, this paper aims at proposing a distributed self-deployment
algorithm for agents to cover the space as much as possible by considering non-uniform sensing coverage
degree constraint of environment while preserving connectivity. The problem is formulated as coverage
maximization subject to connectivity and sensing coverage degree constraint. Considering a desired
distance between neighbouring nodes, an error function which depends on pairwise distance between
nodes is described. The maximization is encoded to an error minimization problem that is solved using
gradient descent algorithm and will yield in moving sensors into appropriate positions. Simulation results
are presented in two different conditions that importance of sensing coverage degree support of
environment is very high and is low.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
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.
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
A New Method for Reducing Energy Consumption in Wireless Sensor Networks usin...Editor IJCATR
Nowadays, wireless sensor networks, clustering protocol based on the neighboring nodes into separate clusters and fault
tolerance for each cluster exists for sensors to send information to the base station, to gain the best performance in terms of increased
longevity and maintain tolerance than with other routing methods. However, most clustering protocols proposed so far, only
geographical proximity (neighboring) cluster formation is considered as a parameter. In this study, a new clustering protocol and fault
tolerance based on the fuzzy algorithms are able to clustering nodes in sensor networks based on fuzzy logic and fault tolerance. This
protocol uses clustering sensor nodes and fault tolerance exist in the network to reduce energy consumption, so that faulty sensors
from neighboring nodes are used to cover the errors, work based on the most criteria overlay neighbor sensors with defective sensors,
distance neighbor sensors from fault sensor and distance neighbor sensors from central station is done. Superior performance of the
protocol can be seen in terms of increasing the network lifetime and maintain the best network tolerance in comparison with previous
protocols such as LEACH in the simulation results.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Analytical Modelling of Power Efficient Reliable Operation of Data Fusion in ...IJECEIAES
Irrespective of inclusion of Wireless Sensor Network (WSN) in majority of the research proposition for smart city planning, it is still shrouded with some significant issues. A closer look into problems in WSN shows that energy parameter is the origination point of majority of the other problems in resource-constrained sensors as well as it significant minimizes the reliability in standard sensory operation in adverse environment. Therefore, this manuscript presents a novel analytical model that is meant for establishing a well balance between energy efficiency over multi-path data forwarding and reliable operation with improved network performance. The complete process is emphasized during data fusion stage to ensure data quality too. A simulation study has been carried out using benchmarked test-bed of MEMSIC nodes to find that proposed system offers good energy conservation process during data fusion operation as well as it also ensure good reliable operation in comparison to existing system.
The volume of the data is directly proportional to the model's accuracy in data analytics for any particular domain. Once a developing field or discipline becomes apparent, the scarcity of the data volume becomes a challenging proponent for the correctness of a model and prediction. In the proposed state-of-the-art, a transitive empirical method has been used within the same contextual domain to extract features from a low-resource part via a heterogeneous field with factual data. Even though an example of text processing has been used for brevity, it is not limited. The success rate of the proposed model is 78.37%, considering model performance. But when considering human subject matter experts, the accuracy is 81.2%.
Novel framework of retaining maximum data quality and energy efficiency in re...IJECEIAES
There are various unseen and unpredictable networking states in Wireless Sensor Network (WSN) that adversely affect the aggregated data quality. After reviewing the existing approaches of data quality in WSN, it was found that the solutions are quite symptomatic and they are applicable only in a static environment; however their successful applicability on dynamic and upcoming reconfigurable network is still a big question. Moreover, data quality directly affects energy conservation among the nodes. Therefore, the proposed system introduces a simple and novel framework that jointly addresses the data quality and energy efficiency using probability-based design approach. Using a simplified analytical methodology, the proposed system offers solution in the form of selection transmission of an aggergated data on the basis of message priority in order to offer higher data utilization factor. The study outcome shows proposed system offers a good balance between data quality and energy efficiency in contrast to existing system.
Novel Optimization to Reduce Power Drainage in Mobile Devices for Multicarrie...IJECEIAES
With increasing adoption of multicarrier-based communications e.g. 3G and 4G, the users are significantly benefited with impressive data rate but at the cost of battery life of their mobile devices. We reviewed the existing techniques to find an open research gap in this regard. This paper presents a novel framework where an optimization is carried out with the objective function to maintain higher level of equilibrium between maximized data delivery and minimized transmit power. An analytical model considering multiple radio antennae in the mobile device is presented with constraint formulations of data quality and threshold power factor. The model outcome is evaluated with respect to amount of power being conserved as performance factor. The study was found to offer maximum energy conservation and the framework also suits well with existing communication system of mobile networks.
Novel Optimization to Reduce Power Drainage in Mobile Devices for Multicarrie...IJECEIAES
With increasing adoption of multicarrier-based communications e.g. 3G and 4G, the users are significantly benefited with impressive data rate but at the cost of battery life of their mobile devices. We reviewed the existing techniques to find an open research gap in this regard. This paper presents a novel framework where an optimization is carried out with the objective function to maintain higher level of equilibrium between maximized data delivery and minimized transmit power. An analytical model considering multiple radio antennae in the mobile device is presented with constraint formulations of data quality and threshold power factor. The model outcome is evaluated with respect to amount of power being conserved as performance factor. The study was found to offer maximum energy conservation and the framework also suits well with existing communication system of mobile networks.
A Novel Weighted Clustering Based Approach for Improving the Wireless Sensor ...IJERA Editor
Great lifetime and reliability is the key aim of Wireless Sensor Network (WSN) design. As for prolonging
lifetime of this type of network, energy is the most important resource; all recent researches are focused on more
and more energy efficient techniques. Proposed work is Weighted Clustering Approach based on Weighted
Cluster Head Selection, which is highly energy efficient and reliable in mobile network scenario. Weight
calculation using different attributes of the nodes like SNR (Signal to Noise Ratio), Remaining Energy, Node
Degree, Mobility, and Buffer Length gives efficient Cluster Head (CH) on regular interval of time. CH rotation
helps in optimum utilization of energy available with all nodes; results in prolonged network lifetime.
Implementation is done using the NS2 network simulator and performance evaluation is carried out in terms of
PDR (Packet Delivery Ratio), End to End Delay, Throughput, and Energy Consumption. Demonstration of the
obtained results shows that proposed work is adaptable for improving the performance. In order to justify the
solution, the performance of proposed technique is compared with the performance of traditional approach. The
performance of proposed technique is found optimum as compared to the traditional techniques.
The cognitive radio prototype performance is to alleviate the scarcity of spectral resources for wireless communication through intelligent sensing and quick resource allocation techniques. Secondary users (SU’s) actively obtain the spectrum access opportunity by supporting primary users (PU’s) in cognitive radio networks (CRNs). In present generation, spectrum access is endowed through cooperative communication-based link-level frame-based cooperative (LLC) principle. In this SUs independently act as conveyors for PUs to achieve spectrum access opportunities. Unfortunately, this LLC approach cannot fully exploit spectrum access opportunities to enhance the throughput of CRNs and fails to motivate PUs to join the spectrum sharing processes. Therefore, to overcome this con, network level cooperative (NLC) principle was used, where SUs are integrated mutually to collaborate with PUs session by session, instead of frame based cooperation for spectrum access opportunities. NLC approach has justified the challenges facing in LLC approach. In this paper we make a survey of some models that have been proposed to tackle the problem of LLC. We show the relevant aspects of each model, in order to characterize the parameters that we should take in account to achieve a spectrum access opportunity.
P LACEMENT O F E NERGY A WARE W IRELESS M ESH N ODES F OR E-L EARNING...IJCI JOURNAL
Energy efficiency solutions are more vital for Gree
n Mesh Network (GMN) campuses. Today students are
benefited using these e-learning methodologies. Ren
ewable energies such as solar, wind, hydro has
tremendous applications on energy efficient wireles
s networks for sustaining the ever growing traffic
demands. One of the major issues in designing a GMN
is minimizing the number of deployed mesh routers
and gateways and satisfying the sustainable QOS bas
ed energy constraints. During low traffic periods t
he
mesh routers are switched to power save or sleep mo
de. In this paper we have mathematically formulated
a
single objective function with multi constraints to
optimize the energy. The objective is to place min
imum
number of Mesh routers and gateways in a set of can
didate location. The mesh nodes are powered using
the solar energy to meet the traffic demands. Two g
lobal optimisation algorithms are compared in this
paper to optimize the energy sustainability, to gua
rantee seamless connectivity
A novel predictive optimization scheme for energy-efficient reliable operatio...IJECEIAES
Wireless Sensor Network (WSN) has been studied for more than a decades that resulted in evolution of the significant applications towards assisting in sensing physical information from human inaccesible area. It was also observed from existing sysem that energy attribute is the root cause of majority of the problems associated with WSN that also gives rise to various operational reliability issue. Therefore, the prime goal of the proposed study is to present a novel predictive optimization approach of data fusion in order to jointly address the problems associated with energy efficiency and reliable operation of sensor nodes in WSN. An analytical research approach is carried out in order to ensure that a time-based synchronization scheme contributes to offer an evolutionary approach towards significant energy optimization. A simulation-based benchmarking analysis is carried out to find that proposed system offers good energy-efficient performance in comparison to existing approaches.
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKJournal For Research
Wireless sensor networks have attracted much attention in the research community over the last few years, driven by a wealth of theoretical and practical challenges and an increasing number of practical civilian application. ‘one deployment, multiple applications’ is an emerging trend in the development of WSN, due to the high cost of deploying hundreds and thousands of sensors nodes over a wide geographical area and the application-specific nature of tasking a WSN. A wireless sensor network is a collection of nodes organized into a cooperative network. To reduce the energy consumption, the transmission of data between sensor nodes must be reduced in order to preserve the remaining energy in cluster node. We propose a new energy balancing architecture based on cluster with hexagonal geometry with radius R.select the base station and after select the cluster head with maximum energy of the node and after select mobile agent in minimum distance to cluster head and second highest maximum energy. And then send the data mobile agent to cluster head and cluster head to base station.and we have energy management must be followed to balance the energy in the whole network and improving network lifetime.
A reinforcement learning based routing protocol with qo s support for biomedi...Iffat Anjum
Contribution.
Problem Definition.
Related works.
Biomedical Sensor Networks
Reinforcement Learning
Q-learning
Design of RL-QRP
Local Information Exchange
Q-learning Implementation
Learning-Based Routing Algorithm
Performance Evaluation.
Limitation.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Approach to minimizing consumption of energy in wireless sensor networks IJECEIAES
The Wireless Sensor Networks (WSN) technology has benefited from a central position in the research space of future emerging networks by its diversity of applications fields and also by its optimization techniques of its various constraints, more essentially, the minimization of nodal energy consumption to increase the global network lifetime. To answer this saving energy problem, several solutions have been proposed at the protocol stack level of the WSN. In this paper, after presenting a state of the art of this technology and its conservation energy techniques at the protocol stack level, we were interested in the network layer to propose a routing solution based on a localization aspect that allows the creation of a virtual grid on the coverage area and introduces it to the two most well-known energy efficiency hierarchical routing protocols, LEACH and PEGASIS. This allowed us to minimize the energy consumption and to select the clusters heads in a deterministic way unlike LEACH which is done in a probabilistic way and also to minimize the latency in PEGASIS, by decomposing its chain into several independent chains. The simulation results, under "MATLABR2015b", have shown the efficiency of our approach in terms of overall residual energy and network lifetime.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Similar to Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN (20)
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
1. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 38
Paper Publications
Using Neighbor’s State Cross-correlation to
Accelerate Adaptation in Docitive WSN
Dr. Charbel Nicolas
Computer department, AUL University, AUL University Campus, Dekwaneh, Lebanon
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by
using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio.
Although it improves the infrastructure based networks it has a weakness in case of ad-hoc mobile networks. The
energy constraints and the total mobility of the network complicate the selection of the appropriate teacher for a
student. By selecting the wrong teacher, there is a high probability that the taught information may be faulty, and
thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most
important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for
teacher selection based on the auto-correlation degree of the teacher’s candidate environment and the cross-
correlation degree between the teacher candidate and the student environments. We validate our approach in the
context of coexistence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the
electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of
dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the
low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
I. INTRODUCTION
Now a days the radio spectrum congestion is the major problem that wireless sensor networks are facing [12][11].
Recently, in the domain of cooperative and distributed networks, to mitigate congestion and radio problems, a new
paradigm has emerged called docitive networks [1]. Docitive network is a wireless network, where the docitive radio is an
upgrade of cognitive radio [2]. Cognitive radio uses artificial intelligence and machine learning algorithms to process
local channel observations. In addition to local observations, docitive radio includes information from the neighboring
nodes to this process. The purpose of this information exchange is to accelerate and improve the decision process.
Docition from the Latin docere is to teach, which relate to radios that teach other radios [1]. From this view docition is the
teacher-student paradigm. It is generally known that intelligence is impacted by the degree of observation. Still as
cognition and learning have received a significant attention from various communities in the past, the process of
knowledge transfer, the teaching, over wireless medium has received fairly little attention to date. Similarly to distributed
cognitive radio, docitive radio needs to cooperate with neighboring radios to have docition. The difference from regular
distributed cognitive networks is that in docition the student teacher paradigm does not impose the use of the exchanged
information: the teacher does not teach end results but proposes elements of the methods for getting there.
In the concept of docitive network, there was no indication about the circumstances to use docition, implying that it is
always useful to use docition. Specifically when the authors in [1] defined the degree of docition they just cited the
degrees as static choices, hence the node do not have dynamic behavior as to choose its own degree of docition. The
degrees of docition ranged from no docition to perfect docition.
During docition, exchanging the Q-learning [3] table is essential as it contains the information of docition. As this table
contains the information related to the observed state of the teacher it is crucial that a student node have the similar
environment state as the teacher node. We claim that although docition provides fast convergence to the learning node,
2. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 39
Paper Publications
the assumptions taken by the paradigm impose coherence between the states of the teacher and the student. The reason is
there are no measures taken in the docitive paradigm to insure that the teacher and student nodes have coherent states. In
our study we are interested in mobile networks with no infrastructure such as MANET and WSN. We note that in such
networks, nodes may not have coherent states, moreover the same weakness appear in the case of an unlicensed densely
populated frequency band as the ISM band. For the rest of the paper we refer to the previously presented docition as
classic docition (CD).
As a solution, in this paper, we present dynamic docition (DD) that enables the teacher and the student nodes, in case of
mobility or incoherent channel state between them, to specify the level of docition dynamically based on the level of
environment predictability. We add the environment predictability probe (EPP) as a new element to classic docition. This
element estimates the level of coherence between the teacher and student nodes, and, based on the result, if the
environment state is stable enough and there is a certain level of coherence, it is acceptable to apply docition otherwise no
docition is applied.
To evaluate the DD performance, we apply it on the case of a coexistence situation between IEEE802.15.4 (wireless
sensor) and IEEE802.11b/g (WiFi) technologies, where sensor nodes are mobile. To escape the WiFi interference, the
sensors adopt the White Space (WS) modeling technique and the Pareto model proposed in [4]. The behavior of the nodes
in this use case scenario is similar to the cognitive radio that adapt an unlicensed user (known as secondary user) to
coexist with a licensed user (known as primary user) [5]. The use of such scenario in our case is to provide to weak
technologies as the technologies using IEEE802.15.4 standard (limited power supply, low power, low processing and
transmission rate) the adaptation means to coexist with dominant technologies like IEEE802.11 (unlimited power supply,
high transmission power and rate, and high traffic generation). Applying DD in this scenario improves the efficiency of
the power consumption and provides faster convergence time.
Intuitively, we expect that as the system becomes more uncorrelated and more dynamic, the use of CD becomes
disadvantageous. In this paper, we quantify this claim by simulations, we propose DD, and we chose to apply it in the
case of startup docition on WSN as it has the least energy cost relatively to other degrees of docition and validate its
performance by the simulations.
II. DYNAMIC DOCITION
CD is composed of four elements: acquisition, intelligent decision, action, docition. The main contribution of DD on
mobile networks is that it provides to the student an efficient manner to select a teacher and to know dynamically when to
apply docition or not. In mobile networks, the teacher is the most important actor as it should give credible teachings. To
determine the teacher existence DD is used. The DD adds a new element on CD which is the EPP to be applied before the
docition element. Some models characterizing the spectrum activity can always be assumed (cf. [6], [7]). These models
predict the spectrum occupation, and the duration of each recurring event, therefore based on these assumptions the EPP is
used to construct a local channel model and estimate the level of similarity between teachers and students for present and
future states.
The predictability of the environment is detected using correlation functions and stochastic modeling. Due to the mobility
in ad-hoc networks there are some conditions related to the model integrity that are assured by the EPP. If the model
validation test executed by a node is done before it changed its location then no teaching can be made by the node (GPS or
the method in [10] can detect a location change). On the other hand if the node did not change its location after validating
the model then the node is accepted as a teacher candidate. Although in [8] it was stated that if two nodes are able to
communicate implies a minimum level of cross correlation between their environments, the EPP must assure the existence
of such minimum level of cross correlation between the teacher and the student environments.
III. DYNAMIC DOCITION FOR WHITE SPACE DETECTION
To illustrate the application of dynamic docition, we use the white space detection in a coexistence environment between
a wireless sensor network (WSN) and a WiFi network. In this case of coexistence, a white space is the inter-arrival time
between two consecutive WiFi bursts. The problem in such coexistence scenarios is that the WiFi nodes do not detect the
WSN nodes transmissions. Therefore the WiFi APs do not backoff when there are transmissions from the WSN. The aim
is that each sensor node (SN) tries to model the white spaces that are not used by WiFi and based on the model the packet
3. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 40
Paper Publications
length or the number of packets to be sent is determined. The goal of applying DD is to optimize the convergence time
which impacts the energy cost for a newly arriving SN to the WSN. Each of the existing nodes will send the white space
model parameters to the new node along with the gain (the duration of applying the same model parameters) that was
provoked by using the model. The new node chooses from all the neighboring teacher candidates the best suited model to
use as its own startup model.
To construct the model, the teacher candidate will estimate the gain using the online prediction problem. In the evaluation
of our proposal we use the modeling mechanism proposed in [4] as a use-case to illustrate the improvements made by DD.
As our aim is mobile network with no infrastructure, in this type of networks with limited energy supply, the mission of
DD is to swap between startup docition and no docition. We adopt startup docition for white space detection. In startup
docition, the initial concept, docitive radios teach their policies to any newcomers at the beginning when the nodes are
going ON. We must emphasize that for the initial concept, the aim was static networks, and a newcomer is a base station
that is going from OFF state to ON state. Based on this assumption Gains are expected due to the highly correlated
environment and due to the fact that teaching nodes have an updated environment model where they have applied their
cognitive actions. In the case of ad-hoc networks none of the above assumptions exists, therefore DD should be applied.
The Pareto model is declared by [4] as an acceptable model for WiFi white space modeling. Therefore each node
will try to construct such model to be able to communicate with other nodes in the WSN.
A. Mecanism of the Teaching Node:
The teaching node must apply these steps:
1- Sampling the channel, and calculating white spaces durations ( ) (inter-channel occupation time).
2- Modeling for future prediction by detecting P( , ) using maximum likelihood estimation (MLE) [9]:
∑ ; is the minimum[ ]; is the number of WS samples.
3- Saving the time (duration) of the application of P ( , ).
4- Applying online learning problem (on the model) to estimate the model efficiency. A newly calculated Pareto
exponent β’ is adopted only if it does not belong to this interval . If β’ is adopted then the time is
reset (duration of the model application), go to step 2. If the level of resemblance between the old and the new model
(gain) is high, the time (duration) is not reset. k is the acceptable percentage of deviation between .
5- Setting itself as teaching candidate if it did not change its location after validating the model and the gain is high.
6- Sending its teaching credentials (model parameter, application & testing duration) if it is a candidate teaching node
and it detects a new node.
Remarks: 1- The Gain in (4) is the goodness of fit between the model and the new samples. This method for determining
the efficiency of the chosen model is better than comparing the throughput level before and after a model change, because
a sender does not need to cooperate with the receiver to know the throughput. 2- EPP covers from step 3 to 6 at the
teaching node and all the steps at the learning node mechanism.
B. Mecanism of the Learning Node:
1- If the node detects a location change, it sends a beacon.
2- The node receives the credentials of the candidate teaching neighbors.
3- A minimum level of consensus between the teaching candidates should exist. If the correlation among them is low no
docition is applied, else the node goes to step 4; the Average of the received E( ) is calculated and the deviation
percentage from this average is analyzed. If the deviation is higher than K (ex: K=10%) then there is no correlation. The
acceptable teacher candidates are the nodes that have the existing in the interval [ ] where
; N is the number of teacher candidates, is the received Pareto shape, K is the ratio that restricts the accepted
correlation level between the neighboring teacher candidates. Moreover, it is used to filter the teacher candidate nodes.
4. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 41
Paper Publications
4- The node selects as teacher the one with the highest gain and that has a β that falls in the accepted deviation. If there is
no acceptable candidate, no docition is applied.
5- After a time of stability, the node changes its state from learning node to teacher node.
Step 3 explanation: the main idea is to prove that CD is unsuitable for Ad-hoc networks. If the neighborhood has diverse
states or has high deviation from an average β there is no docition. Otherwise, if there is a quasi-total agreement to one
choice of β then apply docition. In case of DD the deviation percentage determines the restriction on applying docition. If
there is a loose interval for β deviation the docition may be applied most of the time with a consequence on the Packet
Loss Rate (PLR) (cf. Fig 2, Fig 3).
IV. SIMULATION
We used Matlab simulator to compare our proposed DD protocol against CD performance. On a surface we set a grid of
overlapping WiFi access points (APs) and wireless sensors nodes. Each AP has a coverage area (πR2
) and a permissive
overlap area π (R2
-R12
). The permissive area usually exists to allow an overlap between multiple APs and a certain level
of interference. This is to enable the hand over between mobile nodes and APs. The sensor nodes are distributed using the
Poisson point process (PPP) distribution and submitted to the interference of the WiFi APs.
Each AP is assigned a WiFi traffic generator. The sensor nodes sample the durations of the channel vacancies between
WiFi transmissions (the White spaces “WS”) and use the MLE to reconstruct their model. From [4], the sensors adopt the
Pareto model construction methods and steps. The Pareto model used has two parameters; α and β. α is determined as the
minimum acceptable WS length “1ms” and β is found using the MLE and the WS samples. To sample the WS samples
we adopted the same parameter values used in [4] as they were optimized using empirical results: 100ms windows are
used for sampling the channel state. As a consequence the maximum white space length can reach 100ms. The sampling
rate used is 200Hz.
For the teaching node, we fixed at 10% the acceptable deviation from the old beta. Henceforth, by the acceptable
deviation we refer to the K value at the learning node mechanism.
The simulation is divided into two parts. The first part deals with the energy cost of the signaling stage of docition. The
second part compares the performance of implementing DD and CD on a WSN.
Energy Cost of The Signaling Stage Of Docition:
The sensors can construct the WS Pareto model using two methods: the direct one based on the clear channel assessment
(CCA) samples and the indirect one based on docition information received in the packets header. A comparison between
the energy cost of both is done in fig 1. First we calculate the energy cost for a CCA sample and the energy cost for
adding the docition information in the header, then for the case of the CCA sampling we multiply this cost with a number
of samples and for the case of docition information we multiply it by the number of teacher candidates. The energy cost in
the case of docition information exchange is related to the transmission and reception duration of the number of bits.
Therefore for docition the added cost is equal to the cost of the extra bits sent, we have in total 16 bits sent:
-2 bits are used to indicate the duration of the model usage (the gain) (cf. Table 1):
Table 1: duration mapping
00 01 10 11
t(ms)< 100 t>=100 & t<200 t>=200 & t<500 t>= 500
-14 bits are used as the float value of beta:
* 4 bits are used for the integer part (max value =15)
* 10 bits are used for the decimal part (max value =1024)
Due to the addition of the docition information to the beacons and to insure that the cost will not exist during all the
beacon exchange but just when there are docition, the packet length indicates if the 16bits are added or not so the nodes
do not always execute the additional 16 bit listening.
5. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 42
Paper Publications
The energy cost is E=U*I*t.
T:duration(Seconds) U: voltage(Volt) I: current(Amp)
The CCA is performed by sampling 8 symbols the duration is128microseconds.
The duration for transmitting or receiving one bit is 64 microseconds and it needs 0.0174Amp for transmission and
0,0197Amp for reception, the voltage used is 3V.
Figure 1: the energy cost in function of the number of the 16bits exchanged in case of docition and the number of CCA samples
in case of sampling.
In fig 1 the docition signaling (middle curve) is less costly than the sampling (highest curve) and at the same time it
distributes the energy between the sender and receiver. The cost on the receiver side is represented by the lowest curve.
System Simulation:
In what follows we simulate the total system of mobile sensors and fixed WiFi AP. A grid of 36 WiFi APs with a
transmission radius of 100m is covering a surface of 106
m2
. The sensor nodes coexist with these APs on the same surface
and have a transmission radius of 50m.
The rate of selecting valid information from the neighbors is monitored at section a), since docition based methods main
objective is to obtain information on the environment faster than self-acquiring of such information. We compare three
methods of selecting the beta value: CD that is based on choosing the β value randomly from the neighbors, DD that is
based on EPP and choosing the β value that occurs most often among the neighbors due to cross-correlated wireless
spectrum state. The use of docition to obtain information is precisely to use them to improve the network performance.
Therefore, in section b), we examine the PLR and the percentage of overhead introduced by docition.
Since we are interested in “startup docition”, the simulation consists of bringing outside nodes and placing them evenly in
a plane which already contain distributed sensors based on PPP and WiFi APs. This simulation is repeated enough times
to get good confidence intervals. As we study the “startup docition”, the worst case scenario is chosen for the mobile
nodes where they are imported from an environment where there is very little WiFi traffic, therefore, they have big WiFi
white spaces compared to the network nodes.
We performed four types of simulations. The first two observe the effect of the parameter K used by the student to filter
the received values of β. During these two, 30 nodes are imported and the results are observed depending on the number
of nodes in the network. In the third simulation, the nodes density is increased but the proportion of new neighbors for a
node coming from outside (student) remain unchanged. Finally, in the fourth simulation, the total number of nodes in the
network remains constant while the percentage of new neighbors increases.
While the first two scenarios correspond to the case where the existing sensor nodes are fixed and the only movement is
the arrival of new nodes, the latter two allow observing the behavior of the sensor network in a mobile situation. In fact,
the mobility has the effect that new nodes arriving from outside find in their new neighborhood, nodes that have a good
estimate of beta as they have had time to get it, and other nodes newly arriving from elsewhere in the network without
6. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 43
Paper Publications
having consistent information about the environment. Therefore, by increasing the number of nodes arriving from outside,
we can observe the mobility effect of sensors already in the network on the percentage of correct selection of information
by docition. We call the first two scenarios "quasi-static scenario" and the last two "mobile scenario."
a) Testing the efficiency of the methods used in docition:
Quasi static scenario:
For each node is assigned the β of the traffic generated by the AP that covers it. The probability of choosing the right β
from the neighbors is tested. In the static scenario all the neighbor nodes are supposed static. Therefore they are all
teacher candidates because by construction of the scenario, they all have a good estimation of beta. The acceptable
deviation percentage is set to 20% and R1=75% of R. In fig 2 the results show that for the CD, the probability of selecting
the correct neighbor is relatively unchanging (~67%) in function of the number of nodes covering the region. In case the
selection of β is based on the maximum number of neighbors that have adopted its value, the percentage of correct
selection increments in function of the number of existing nodes. It presents a better estimation than the CD. Although,
the latter performed better than the CD, the DD based on the deviation percentage from the average (middle column in Fig
2 and Fig 3) shows the best performance between the 3 methods.
Figure 2: percentage of the correct selection of the true beta value in function of the number of nodes that existed before the
arrival of the student nodes.
We restrict to 10% the acceptable deviation percentage for DD. A better performance is shown in Fig 3. The drawback of
additional restriction on the β selection results in more restrictions on the use of docition.
Figure 3: percentage of the correct selection of the true beta value in function of the number of nodes that existed before the
arrival of the student nodes.
7. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 44
Paper Publications
Mobile scenario:
In the mobile scenario, the mobility of the neighbors eliminates their candidature to become teacher nodes in the case of
DD. For the CD there is no distinction between selecting such nodes or selecting a teacher candidate node. Fig 4 shows
the degradation of the classic docition. By contrast the results of DD are improving. Specifically, the mobile non teacher
candidates cause a high diversity in the β values. Therefore, in the CD there is a high probability to select the wrong β
value. The results shown in Fig 4 are influenced by forcing 70% of the new nodes neighbors to be imported from random
locations.
For the experiment of Fig 5, 300 sensor nodes are set as existing nodes. The non expert neighbors’ percentage is adjusted
at the same time the percentage of the correct β selection is monitored. It is shown that the non expert nodes do not
influence the nodes that are using DD, but they affect the CD because there are no distinction between the expert teachers
and the non expert ones.
Figure 4: percentage of the correct selection of the true beta value in function of the number of nodes that existed before the
arrival of the student nodes.
Figure 5: percentage of the correct selection of the true beta value in function of the percentage of inexperienced neighbors.
b) Using channel sampling and MLE to determine the suitable WiFi WS model for traffic generation
Previously, in subsection a) quasi static scenario, the student algorithm used in DD has proven to be highly efficient rela-
tively to classic docition. For this part, a noise is indirectly introduced through the fact that the β values are not assigned
directly to the nodes, but rather the nodes use channel sampling and the MLE to determine the APs WS model. In the
subsection b) quasi static scenario, the DD and CD should have similar performance due to the correlated neighbors’
environment, in contrast to what is going to happen in the mobile scenario where the performance of the teacher algorithm
is highlighted. In this part, we compare the efficiency of 3 methods used to construct the Pareto distribution that models
8. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 45
Paper Publications
the WiFi WSs. The methods are: direct channel sampling with the use of MLE, CD and DD. The effect of the deviation
from the WiFi WS model is determined. The deviation has an effect on the PLR and on the link overhead percentage.
Quasi static scenario:
Henceforth, the WSN nodes transmit packets with a length of 2ms. The WSN nodes predict WiFi WS lengths by finding
the best β value as the appropriate Pareto shape. For the rest of the experiments we set the acceptable deviation percentage
for DD to 10%.
The PLR and the link overhead ratio are monitored, in Fig 6 the traffic performance is shown. CD uses random β selection
from the neighbors. The same performance tests are done for the DD. The traffic performance when using the β found by
channel sampling and using the MLE represents the best performance that can be reached, because by executing the WS
sampling the WSN nodes have the exact WiFi WS model that governs the wireless channel. R1 is set to 50% of R. In the
case of static neighborhood, all the types of docitions along to the model construction using sampling and MLE have
approximately the same performance level. The compared results show convergence to the best link characteristics. The
overhead percentage reaches 38 % and the packet loss is 22% as shown in Fig 6. Although, we have similar performance
outcome for the 3 methods, the DD showed a slightly better performance than CD.
In Fig 7 the same experiment as in Fig 6 is executed but more surface intersection is allowed between the WiFi APs (R1
equal 70% of R) to add more diversity for the neighboring β values. We suppose that by doing so, there will be a higher
probability for a false β selection.
Figure 6: the upper graph represents the overhead % and the lower graph represents the PLR both graphs are in function of
the number of nodes that existed before the arrival of the student nodes.
The higher PLR in Fig 7 relatively to the PLR in Fig 6 is caused by the small WS length that remains from the incre-
mented percentage of superposed WiFi APs coverage area. All the docition methods have similar high performance, due
9. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 46
Paper Publications
to the stationary environment. The only cause to have a wrong β selection is by selecting a neighbor that exists in a
different region of coverage. Although it has a low probability, its effect is shown by the weaker performance of classic
docition.
Figure 7: the upper graph represents the overhead % and the lower graph represents the PLR both graphs are in function of
the number of nodes that existed before the arrival of the student nodes.
Mobile scenario:
In the following, R1 is set to 70% of R. By introducing the mobility aspect (50% of the neighbors are not teacher
candidate), Fig 8 shows a high deterioration in the CD performance. In contrast, the resilience and stability of DD main-
tained a low PLR while keeping a minimum overhead percentage. Using the MLE as reference to estimate the
performance of DD and CD, DD maintained a PLR of 20% the same as MLE. On the other hand, CD’s PLR diverges and
reaches 45%. During the simulation, the overhead percentage did not vary for CD and DD maintaining the value of 20%
for CD and 30% for DD. Similar to fig 8, in Fig 9 the overhead percentage stabilizes on 17% for CD and 30% for DD.
Due to space limitation we only show the overhead percentage for the case of fig 10 as it shows a deviations in the
overhead percentage ranging between 14% and 28%.
Figure 8: the PLR in function of the number of nodes that existed before the arrival of the student nodes.
10. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 47
Paper Publications
In Fig 9, the percentage of the neighbors that are none teacher candidate is raised to 70 %. More degradation of the CD
performance is observed. The PLR increases in function of the number of existing nodes, till it reaches 50%. In contrast
the DD performance is not influenced by the added inexperienced neighbors.
Next, 500 existing nodes are used. Fig 10 is the result of varying the percentage of the inexperienced neighbors. The CD
has an incrementing PLR with the percentage of inexperienced nodes. The DD proved to be the best suited for mobility,
as it prevents the inexperienced nodes from poisoning the learning nodes.
Figure 9: the PLR in function of the number of nodes that existed before the arrival of the student nodes.
What is presented is an added intelligence on when to apply docition. At the same time the selectivity when choosing a
teacher provoke an improvement on the decision process even though a simple method for the teacher selection is used.
More intelligent methods can be proposed, but the main idea in this approach is not to apply randomly the docition in case
of a mobile network. The results show that the CD and DD achieve more or less the same performance in a static
environment. In contrast, it is clearly seen the destructive effect of mobility on CD as the number of mobile inexperienced
nodes increases. There is practically no effect on the DD as it filters the non expert mobile nodes.
Figure 10: the upper graph represents the overhead % and the lower graph represents the PLR both graphs are in function of
the number of nodes that existed before the arrival of the student nodes
11. ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Vol. 4, Issue 1, pp: (38-48), Month: January - March 2017, Available at: www.paperpublications.org
Page | 48
Paper Publications
V. CONCLUSION
Based on cognitive radio, docition provides a mean to improve the methods of processing and reaction to link variations. In
our work, we added the environment predictability aspects for docition, to improve the learning, optimize the energy
consumption and to catalyze fast convergence of the wireless sensor nodes. By proving there is environment stability for
the teaching node EPP proves that there is some state information that is worth teaching. Otherwise, if the environment
state is chaotic, it is difficult to find useful information to teach. The EPP test the cross correlation between the student and
the teacher to indicate the existence of useful information for the student among the taught data. Compared to CD, the
simulation showed that DD provides an improvement of more than 50% of correct beta value’s selection. An improvement
is also shown on the PLR. Moreover the added energy cost on the signaling is estimated and it shows that exchanging the
docition information has a lower energy cost than allowing a node to do its own channel sampling.
ACKNOWLEDGEMENT
The authors want to thank Dr. Michel Marot for his help useful comments on this paper.
REFERENCES
[1] L. Giupponi, A. G-Serrano, P. Blasco, M.Dohler, “Docitive Networks – An Emerging Paradigm for Dynamic
Spectrum Management”, IEEE Wireless Communications, 2010.
[2] S. Haykin "Cognitive Radio: Brain-Empowered Wireless Commun-ications"in IEEE J. Select. Areas Commun,
2005.
[3] M. E. Harmon and S. S. Harmon, “Reinforcement Learning: A Tutorial,” 2000.
[4] J.Huang, G.Xing, G. Zhou, R. Zhou, “Beyond Co-existence: Exploiting WiFi white space for zigbee performance
assurance”, 18th IEEE International on Network Protocols ICNP, 2010.
[5] J. Mitola, “Cognitive Radio,” Licentiate proposal, KTH, Stockh-olm,Sweden, December 1998.
[6] Y. Xu, W.Lee, “Exploring Special Correlation for Link Quality Estimation in Wireless Sensor Networks” in PerCom
2006.
[7] R. K. Guha, S. Sarka, “Characterizing Temporal SNR Variation in 802.11 Networks” in IEEE transaction on
vehicular technology 2008.
[8] S.A. Jafar, S. Srinivasa, “Capacity Limits of Cognitive Radio With Distributed and Dynamic Spectral Activity” ICC
2006.
[9] J. L. Petersen, “Estimating the Parameters of a Pareto Distribution Introducing a Quantile Regression Method”.
Technical report 2000.
[10] C.Nicolas, M.Marot, M.Becker, "A Self-Organization Mechanism for a Cold Chain Monitoring System", VTC
Spring, 2011.
[11] Y. Wu, K. S. Liu, J. A. Stankovic, T. He, S. Lin, " Efficient Multichannel Communications in Wireless Sensor
Networks", ACM Transactions on Sensor Networks (TOSN) Volume 12 Issue 1, March 2016.
[12] M. R. Mundada, P. B. Desai, “A survey of congestion in Wireless Sensor Networks”, 2016 International Conference
on Advances in Human Machine Interaction