This is the Mtech thesis/dissertation on Efficient clustering scheme in cognitive radio wireless sensor network. This work is done by Mohammad Aziz roll no. 14mi544, CSE department of NIT Hamirpur.
An energy-efficient cluster head selection in wireless sensor network using g...TELKOMNIKA JOURNAL
Clustering is considered as one of the most prominent solutions to preserve theenergy in the wireless sensor networks. However, for optimal clustering, anenergy efficient cluster head selection is quite important. Improper selectionofcluster heads(CHs) consumes high energy compared to other sensor nodesdue to the transmission of data packets between the cluster members and thesink node. Thereby, it reduces the network lifetime and performance of thenetwork. In order to overcome the issues, we propose a novelcluster headselection approach usinggrey wolf optimization algorithm(GWO) namelyGWO-CH which considers the residual energy, intra-cluster and sink distance.In addition to that, we formulated an objective function and weight parametersfor anefficient cluster head selection and cluster formation. The proposedalgorithm is tested in different wireless sensor network scenarios by varyingthe number of sensor nodes and cluster heads. The observed results conveythat the proposed algorithm outperforms in terms of achieving better networkperformance compare to other algorithms.
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.
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.
This document summarizes a research paper that proposes a hybrid evolutionary clustering approach for optimized routing in mobile ad hoc networks. It uses particle swarm optimization (PSO) and ant colony optimization (ACO) to perform spatial clustering of nodes. Greedy routing is then used to find routes, and when dead ends are encountered, genetic algorithms are applied to find alternative routes. The approach aims to improve greedy routing performance and recovery from dead ends by avoiding the use of floating nodes. Simulation results showed improved greedy routing and fewer concave nodes compared to other methods.
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.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
Online opportunistic routing using Reinforcement learningHarshal Solao
This presentation discusses online opportunistic routing for cognitive radio ad-hoc networks using reinforcement learning. The objectives are to design and implement a distributed opportunistic routing algorithm, compute channel availability using Hidden Markov Model prediction, model strategic interaction among nodes to select the best forwarder, and maximize the average per packet reward. The literature survey covers previous work on reinforcement learning based routing schemes and machine learning techniques for cognitive radios. The implementation will use Java libraries for simulation and reinforcement learning to achieve the objectives.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
An energy-efficient cluster head selection in wireless sensor network using g...TELKOMNIKA JOURNAL
Clustering is considered as one of the most prominent solutions to preserve theenergy in the wireless sensor networks. However, for optimal clustering, anenergy efficient cluster head selection is quite important. Improper selectionofcluster heads(CHs) consumes high energy compared to other sensor nodesdue to the transmission of data packets between the cluster members and thesink node. Thereby, it reduces the network lifetime and performance of thenetwork. In order to overcome the issues, we propose a novelcluster headselection approach usinggrey wolf optimization algorithm(GWO) namelyGWO-CH which considers the residual energy, intra-cluster and sink distance.In addition to that, we formulated an objective function and weight parametersfor anefficient cluster head selection and cluster formation. The proposedalgorithm is tested in different wireless sensor network scenarios by varyingthe number of sensor nodes and cluster heads. The observed results conveythat the proposed algorithm outperforms in terms of achieving better networkperformance compare to other algorithms.
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.
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.
This document summarizes a research paper that proposes a hybrid evolutionary clustering approach for optimized routing in mobile ad hoc networks. It uses particle swarm optimization (PSO) and ant colony optimization (ACO) to perform spatial clustering of nodes. Greedy routing is then used to find routes, and when dead ends are encountered, genetic algorithms are applied to find alternative routes. The approach aims to improve greedy routing performance and recovery from dead ends by avoiding the use of floating nodes. Simulation results showed improved greedy routing and fewer concave nodes compared to other methods.
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.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
Online opportunistic routing using Reinforcement learningHarshal Solao
This presentation discusses online opportunistic routing for cognitive radio ad-hoc networks using reinforcement learning. The objectives are to design and implement a distributed opportunistic routing algorithm, compute channel availability using Hidden Markov Model prediction, model strategic interaction among nodes to select the best forwarder, and maximize the average per packet reward. The literature survey covers previous work on reinforcement learning based routing schemes and machine learning techniques for cognitive radios. The implementation will use Java libraries for simulation and reinforcement learning to achieve the objectives.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
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.
There are number of cluster based routing algorithms in mobile ad hoc networks. Since ad hoc networks are not accompanied by fixed access points, efficient routing is a must for such networks. Clustering approach is applied in mobile ad hoc network because clusters are more easily manageable and are more viable. It consists of segregating the given network into several reasonable clusters by using a clustering algorithm. By performing clustering we elect a worthy node from the cluster as the cluster head in such a way that we strive to reduce the management overheads and thus increasing the efficiency of routing. As for the fact that nodes in mobile ad hoc network have frequent host change and frequent topology change routing plays an important role for maintenance and backup mechanism to stabilize network performance. This paper aims to review the previous research papers and provide a survey on the various cluster based routing protocols in mobile ad hoc network. This paper presents analytical study of cluster based routing algorithms from literature. Index Terms— Ad- hoc networks, Cluster head, Clustering, Protocol, Route selection.
An Efficient Parallel Algorithm for Secured Data Communication Using RSA Publ...Harshal Solao
Public key infrastructure based cryptographic algorithms are usually considered as
slower than their corresponding symmetric key based algorithms due to their root in modular
arithmetic. In the RSA public-key security algorithm, the encryption and decryption
is entirely based on modular exponentiation and modular reduction which are performed on
very large integers, typically 1024 bits. Due to this reason the sequential implementation of
RSA becomes compute-intensive and takes lot of time and energy to execute. Moreover, it
is very difficult to perform intense modular computations on very large integers because of
the limitation in size of basic data types available with GCC infrastructure. In this topic,
we are looking into the possibility of improving the performance of proposed parallel RSA
algorithm by using two different techniques simultaneously, first implementing modular calculation
on larger integers using OpenMP on the GCC infrastructure. I have also analyzed
the performance gained by computing the sequential version with the parallel version of RSA running on the GCC infrastructure.
Sector based multicast routing algorithm for mobile ad hoc networksijwmn
Multicast routing algorithms for mobile ad-hoc networks have been extensively researched in the recent
past. In this paper, we present two algorithms for dealing with multicast routing problem using the notion
of virtual forces. We look at the effective force exerted on a packet and determine whether a node could be
considered as a Steiner node. The nodes' location information is used to generate virtual circuits
corresponding to the multicast route. QoS parameters are taken into consideration in the form of virtual
dampening force. The first algorithm produces relatively minimal multicast trees under the set of
constraints. We improve upon the first algorithm and present a second algorithm that provides
improvement in average residual energy in the network as well as effective cost per data packet
transmitted. In this paper, the virtual-force technique has been applied for multicast routing for the first
time in mobile ad-hoc networks.
Evaluate the performance of K-Means and the fuzzy C-Means algorithms to forma...IJECEIAES
The clustering approach is considered as a vital method for wireless sensor networks (WSNs) by organizing the sensor nodes into specific clusters. Consequently, saving the energy and prolonging network lifetime which is totally dependent on the sensors battery, that is considered as a major challenge in the WSNs. Classification algorithms such as K-means (KM) and Fuzzy C-means (FCM), which are two of the most used algorithms in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces these algorithms to produce unbalanced clusters, which adversely affects the lifetime of the network. Based for our knowledge, there is no study has analyzed the performance of these algorithms in terms clusters construction in WSNs. In this study, we investigate in KM and FCM performance and which of them has better ability to construct balanced clusters, in order to enable the researchers to choose the appropriate algorithm for the purpose of improving network lifespan. In this study, we utilize new parameters to evaluate the performance of clusters formation in multi-scenarios. Simulation result shows that our FCM is more superior than KM by producing balanced clusters with the random distribution manner for sensor nodes.
This document discusses using a learning automata approach to predict target locations in wireless sensor networks to reduce energy consumption and improve tracking accuracy. It proposes a learning automata based method that uses a target's movement history to predict its next location. Related works on target tracking techniques like tree-based, cluster-based, and prediction-based methods are summarized. Learning automata concepts are introduced. Simulation results are said to show the proposed method improves energy efficiency, reduces missed targets, and decreases transmitted packets compared to other methods.
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.
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
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
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.
Collaborative Re-Localization Method in Mobile Wireless Sensor Network Based ...CSCJournals
Localization in Mobile Wireless Sensor Networks (WSNs), particularly in areas like surveillance applications, necessitates triggering re-localization in different time periods in order to maintain accurate positioning. Further, the re-localization process should be designed for time and energy efficiency in these resource constrained networks. In this paper, an energy and time efficient algorithm is proposed to determine the optimum number of localized nodes that collaborate in the re-localization process. Four different movement methods (Random Waypoint Pattern, Modified Random Waypoint pattern, Brownian motion and Levy walk) are applied to model node movement. In order to perform re-localization, a server/head/anchor node activates the optimal number of localized nodes in each island/cluster. A Markov Decision Process (MDP) based algorithm is proposed to find the optimal policy to select those nodes in better condition to cooperate in the re-localization process. The simulation shows that the proposed MDP algorithm decreases the energy consumption in the WSN between 0.6% and 32%.
An Integrated Distributed Clustering Algorithm for Large Scale WSN...................................................1
S. R. Boselin Prabhu, S. Sophia, S. Arthi and K. Vetriselvi
An Efficient Connection between Statistical Software and Database Management System ................... 1
Sunghae Jun
Pragmatic Approach to Component Based Software Metrics Based on Static Methods ......................... 1
S. Sagayaraj and M. Poovizhi
SDI System with Scalable Filtering of XML Documents for Mobile Clients ............................................... 1
Yi Yi Myint and Hninn Aye Thant
An Easy yet Effective Method for Detecting Spatial Domain LSB Steganography .................................... 1
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
Minimizing the Time of Detection of Large (Probably) Prime Numbers ................................................... 1
Dragan Vidakovic, Dusko Parezanovic and Zoran Vucetic
Design of ATL Rules for TransformingUML 2 Sequence Diagrams into Petri Nets..................................... 1
Elkamel Merah, Nabil Messaoudi, Dalal Bardou and Allaoua Chaoui
Mitigation of sink hole attack in manet using acoIJARIIT
MANET (Mobile ad hoc network) is the emerging and most demanding technology of wireless network. Because of
self-deliberate property, the network points behave as router or source and the nodes keep moving freely in the network area.
MANET plays a significant role in connection less infrastructure. Securing a network is the fundamental issue in MANET for
securing the susceptible information from hackers. MANET has different attacks that are routing protocol attacks. The sink
hole is known as the severe one from all the attacks in MANET. It generally attracts the neighbour’s nodes towards itself and
transmits the bogus or fake routing path. This attack decreases the network lifetime and increases the network overhead by
boosting energy consumption and later destroys the network. In the proposed work, the routing protocol is being optimized by
utilizing ACO (Ant Colony Optimization) with NN (Neural Network) for achieving enhanced performance as compared to
existing work. Different parameters, namely, Bit error rate, throughput, an end to end delay and energy consumption are used
for calculating the performance of the proposed wok in MANET or to check the effect of Sinkhole attack. The environment
created by simulating the work has 50 to 100 nodes. The width and height of the network is 1000 nodes
This document summarizes a research paper on clustering schemes for mobile ad hoc networks (MANETs). It discusses some of the key challenges in managing MANETs, including bandwidth and power constraints and dynamic topology. It then reviews several existing clustering algorithms, including those based on connectivity, power awareness, bandwidth adaptation, and minimizing cluster numbers. It proposes a new performance metric and algorithm that uses this metric to ensure all nodes receive optimum performance while maintaining an optimal number of clusters. The performance metric considers both bandwidth available and distance to the cluster head. The algorithm aims to adapt clustering as new nodes join or leave the network.
Distance Based Cluster Formation for Enhancing the Network Life Time in ManetsIRJET Journal
This document proposes a distance-based clustering algorithm to improve network lifetime in mobile ad hoc networks (MANETs). The algorithm randomly selects initial cluster heads, then assigns nodes to the closest cluster head based on distance. Simulations in NS-2 and MATLAB analyze energy consumption and residual energy over time. Results show energy use is directly proportional to distance from the cluster head. Nodes near cluster heads conserve more energy, extending network lifetime through load balancing.
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios IJECEIAES
Increase in data traffic, number of users and their requirements laid to a necessity of more bandwidth. Cognitive radio is one of the emerging technology which addresses the spectrum scarcity issue. In this work we study the advantage of having collaboration between cognitive enabled small cell network and primary macrocell. Different from the existing works at spectrum sensing stage we are applying enhanced spectrum sensing to avoid probability of false alarms and missed detections which has impact on spec tral efficiency. Later power control optimization for secondary users known as Hybrid spectrum sharing is used for further improvement of spectral efficiency. Furthermore, the failed packets of Primary users are taken care by high ranked relays which in turn decreases the average Primary user packet delay by 20% when compared between assisted Secondary user method and non-assisted Secondary user method.
Comparative study between metaheuristic algorithms for internet of things wir...IJECEIAES
Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
A HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
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.
This document discusses clustering algorithms for wireless sensor networks. It begins with an introduction to wireless sensor networks and clustering. It then discusses various clustering algorithms such as LEACH, ACW, CIPRA, ERA, LEACH-C, EECHSSDA, HEED, and HEF. Many of the early algorithms like LEACH, ACW and CIPRA do not consider energy levels of nodes when selecting cluster heads. Later algorithms such as ERA, LEACH-C, EECHSSDA, HEED, and HEF aim to maximize network lifetime by selecting cluster heads based on remaining energy levels or probability related to energy. HEF is presented as an algorithm that can provide optimal cluster head selection as well
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.
There are number of cluster based routing algorithms in mobile ad hoc networks. Since ad hoc networks are not accompanied by fixed access points, efficient routing is a must for such networks. Clustering approach is applied in mobile ad hoc network because clusters are more easily manageable and are more viable. It consists of segregating the given network into several reasonable clusters by using a clustering algorithm. By performing clustering we elect a worthy node from the cluster as the cluster head in such a way that we strive to reduce the management overheads and thus increasing the efficiency of routing. As for the fact that nodes in mobile ad hoc network have frequent host change and frequent topology change routing plays an important role for maintenance and backup mechanism to stabilize network performance. This paper aims to review the previous research papers and provide a survey on the various cluster based routing protocols in mobile ad hoc network. This paper presents analytical study of cluster based routing algorithms from literature. Index Terms— Ad- hoc networks, Cluster head, Clustering, Protocol, Route selection.
An Efficient Parallel Algorithm for Secured Data Communication Using RSA Publ...Harshal Solao
Public key infrastructure based cryptographic algorithms are usually considered as
slower than their corresponding symmetric key based algorithms due to their root in modular
arithmetic. In the RSA public-key security algorithm, the encryption and decryption
is entirely based on modular exponentiation and modular reduction which are performed on
very large integers, typically 1024 bits. Due to this reason the sequential implementation of
RSA becomes compute-intensive and takes lot of time and energy to execute. Moreover, it
is very difficult to perform intense modular computations on very large integers because of
the limitation in size of basic data types available with GCC infrastructure. In this topic,
we are looking into the possibility of improving the performance of proposed parallel RSA
algorithm by using two different techniques simultaneously, first implementing modular calculation
on larger integers using OpenMP on the GCC infrastructure. I have also analyzed
the performance gained by computing the sequential version with the parallel version of RSA running on the GCC infrastructure.
Sector based multicast routing algorithm for mobile ad hoc networksijwmn
Multicast routing algorithms for mobile ad-hoc networks have been extensively researched in the recent
past. In this paper, we present two algorithms for dealing with multicast routing problem using the notion
of virtual forces. We look at the effective force exerted on a packet and determine whether a node could be
considered as a Steiner node. The nodes' location information is used to generate virtual circuits
corresponding to the multicast route. QoS parameters are taken into consideration in the form of virtual
dampening force. The first algorithm produces relatively minimal multicast trees under the set of
constraints. We improve upon the first algorithm and present a second algorithm that provides
improvement in average residual energy in the network as well as effective cost per data packet
transmitted. In this paper, the virtual-force technique has been applied for multicast routing for the first
time in mobile ad-hoc networks.
Evaluate the performance of K-Means and the fuzzy C-Means algorithms to forma...IJECEIAES
The clustering approach is considered as a vital method for wireless sensor networks (WSNs) by organizing the sensor nodes into specific clusters. Consequently, saving the energy and prolonging network lifetime which is totally dependent on the sensors battery, that is considered as a major challenge in the WSNs. Classification algorithms such as K-means (KM) and Fuzzy C-means (FCM), which are two of the most used algorithms in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces these algorithms to produce unbalanced clusters, which adversely affects the lifetime of the network. Based for our knowledge, there is no study has analyzed the performance of these algorithms in terms clusters construction in WSNs. In this study, we investigate in KM and FCM performance and which of them has better ability to construct balanced clusters, in order to enable the researchers to choose the appropriate algorithm for the purpose of improving network lifespan. In this study, we utilize new parameters to evaluate the performance of clusters formation in multi-scenarios. Simulation result shows that our FCM is more superior than KM by producing balanced clusters with the random distribution manner for sensor nodes.
This document discusses using a learning automata approach to predict target locations in wireless sensor networks to reduce energy consumption and improve tracking accuracy. It proposes a learning automata based method that uses a target's movement history to predict its next location. Related works on target tracking techniques like tree-based, cluster-based, and prediction-based methods are summarized. Learning automata concepts are introduced. Simulation results are said to show the proposed method improves energy efficiency, reduces missed targets, and decreases transmitted packets compared to other methods.
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.
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
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
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.
Collaborative Re-Localization Method in Mobile Wireless Sensor Network Based ...CSCJournals
Localization in Mobile Wireless Sensor Networks (WSNs), particularly in areas like surveillance applications, necessitates triggering re-localization in different time periods in order to maintain accurate positioning. Further, the re-localization process should be designed for time and energy efficiency in these resource constrained networks. In this paper, an energy and time efficient algorithm is proposed to determine the optimum number of localized nodes that collaborate in the re-localization process. Four different movement methods (Random Waypoint Pattern, Modified Random Waypoint pattern, Brownian motion and Levy walk) are applied to model node movement. In order to perform re-localization, a server/head/anchor node activates the optimal number of localized nodes in each island/cluster. A Markov Decision Process (MDP) based algorithm is proposed to find the optimal policy to select those nodes in better condition to cooperate in the re-localization process. The simulation shows that the proposed MDP algorithm decreases the energy consumption in the WSN between 0.6% and 32%.
An Integrated Distributed Clustering Algorithm for Large Scale WSN...................................................1
S. R. Boselin Prabhu, S. Sophia, S. Arthi and K. Vetriselvi
An Efficient Connection between Statistical Software and Database Management System ................... 1
Sunghae Jun
Pragmatic Approach to Component Based Software Metrics Based on Static Methods ......................... 1
S. Sagayaraj and M. Poovizhi
SDI System with Scalable Filtering of XML Documents for Mobile Clients ............................................... 1
Yi Yi Myint and Hninn Aye Thant
An Easy yet Effective Method for Detecting Spatial Domain LSB Steganography .................................... 1
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
Minimizing the Time of Detection of Large (Probably) Prime Numbers ................................................... 1
Dragan Vidakovic, Dusko Parezanovic and Zoran Vucetic
Design of ATL Rules for TransformingUML 2 Sequence Diagrams into Petri Nets..................................... 1
Elkamel Merah, Nabil Messaoudi, Dalal Bardou and Allaoua Chaoui
Mitigation of sink hole attack in manet using acoIJARIIT
MANET (Mobile ad hoc network) is the emerging and most demanding technology of wireless network. Because of
self-deliberate property, the network points behave as router or source and the nodes keep moving freely in the network area.
MANET plays a significant role in connection less infrastructure. Securing a network is the fundamental issue in MANET for
securing the susceptible information from hackers. MANET has different attacks that are routing protocol attacks. The sink
hole is known as the severe one from all the attacks in MANET. It generally attracts the neighbour’s nodes towards itself and
transmits the bogus or fake routing path. This attack decreases the network lifetime and increases the network overhead by
boosting energy consumption and later destroys the network. In the proposed work, the routing protocol is being optimized by
utilizing ACO (Ant Colony Optimization) with NN (Neural Network) for achieving enhanced performance as compared to
existing work. Different parameters, namely, Bit error rate, throughput, an end to end delay and energy consumption are used
for calculating the performance of the proposed wok in MANET or to check the effect of Sinkhole attack. The environment
created by simulating the work has 50 to 100 nodes. The width and height of the network is 1000 nodes
This document summarizes a research paper on clustering schemes for mobile ad hoc networks (MANETs). It discusses some of the key challenges in managing MANETs, including bandwidth and power constraints and dynamic topology. It then reviews several existing clustering algorithms, including those based on connectivity, power awareness, bandwidth adaptation, and minimizing cluster numbers. It proposes a new performance metric and algorithm that uses this metric to ensure all nodes receive optimum performance while maintaining an optimal number of clusters. The performance metric considers both bandwidth available and distance to the cluster head. The algorithm aims to adapt clustering as new nodes join or leave the network.
Distance Based Cluster Formation for Enhancing the Network Life Time in ManetsIRJET Journal
This document proposes a distance-based clustering algorithm to improve network lifetime in mobile ad hoc networks (MANETs). The algorithm randomly selects initial cluster heads, then assigns nodes to the closest cluster head based on distance. Simulations in NS-2 and MATLAB analyze energy consumption and residual energy over time. Results show energy use is directly proportional to distance from the cluster head. Nodes near cluster heads conserve more energy, extending network lifetime through load balancing.
Sensing and Sharing Schemes for Spectral Efficiency of Cognitive Radios IJECEIAES
Increase in data traffic, number of users and their requirements laid to a necessity of more bandwidth. Cognitive radio is one of the emerging technology which addresses the spectrum scarcity issue. In this work we study the advantage of having collaboration between cognitive enabled small cell network and primary macrocell. Different from the existing works at spectrum sensing stage we are applying enhanced spectrum sensing to avoid probability of false alarms and missed detections which has impact on spec tral efficiency. Later power control optimization for secondary users known as Hybrid spectrum sharing is used for further improvement of spectral efficiency. Furthermore, the failed packets of Primary users are taken care by high ranked relays which in turn decreases the average Primary user packet delay by 20% when compared between assisted Secondary user method and non-assisted Secondary user method.
Comparative study between metaheuristic algorithms for internet of things wir...IJECEIAES
Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
A HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
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.
This document discusses clustering algorithms for wireless sensor networks. It begins with an introduction to wireless sensor networks and clustering. It then discusses various clustering algorithms such as LEACH, ACW, CIPRA, ERA, LEACH-C, EECHSSDA, HEED, and HEF. Many of the early algorithms like LEACH, ACW and CIPRA do not consider energy levels of nodes when selecting cluster heads. Later algorithms such as ERA, LEACH-C, EECHSSDA, HEED, and HEF aim to maximize network lifetime by selecting cluster heads based on remaining energy levels or probability related to energy. HEF is presented as an algorithm that can provide optimal cluster head selection as well
This document discusses clustering algorithms for wireless sensor networks. It begins with an introduction to wireless sensor networks and clustering. It then discusses various clustering algorithms such as LEACH, ACW, CIPRA, ERA, LEACH-C, EECHSSDA, HEED, and HEF. Many of the early algorithms like LEACH, ACW and CIPRA do not consider energy levels of nodes when selecting cluster heads. Later algorithms such as ERA, LEACH-C, EECHSSDA, HEED, and HEF aim to maximize network lifetime by selecting cluster heads based on remaining energy levels or probability related to energy. HEF is presented as an algorithm that can provide optimal cluster head selection as well
This document summarizes an introductory seminar presentation on evaluating different machine learning algorithms in wireless sensor networks. The presentation discusses the problem statement, objectives, introduction, literature review, block diagram, expected outputs, future applications, and plan of work. The literature review summarizes past research evaluating neural networks, genetic algorithms, and other machine learning methods for optimizing data transmission and increasing sensor node lifetime in wireless sensor networks. The block diagram shows the overall framework. The objectives are to optimize data transmission using machine learning and increase sensor node lifetime.
This document summarizes an introductory seminar presentation on evaluating different machine learning algorithms in wireless sensor networks. The presentation discusses the problem statement, objectives, introduction, literature review, block diagram, expected outputs, future applications, and plan of work. The literature review summarizes past research evaluating neural networks, genetic algorithms, and machine learning methods for tasks like energy-efficient routing, localization, and reducing data transmission in wireless sensor networks. The objectives are to optimize information transmission using machine learning, detect redundancies, increase sensor lifetime, and extend application lifetime.
Ameliorate the performance using soft computing approaches in wireless networksIJECEIAES
Wireless sensor networks are an innovative and rapidly advanced network occupying the broad spectrum of wireless networks. It works on the principle of “use with less expense, effort and with more comfort.” In these networks, routing provides efficient and effective data transmission between different sources to access points using the clustering technique. This work addresses the low-energy adaptive clustering hierarchy (LEACH) protocol’s main backdrop of choosing head nodes based on a random value. In this, the soft computing methods are used, namely the fuzzy approach, to overcome this barrier in LEACH. Our approach’s primary goal is to extend the network lifetime with efficient energy consumption and by choosing the appropriate head node in each cluster based on the fuzzy parameters. The proposed clustering algorithm focused on two fuzzy inference structures, namely Mamdani and Sugeno fuzzy logic models in two scenarios, respectively. We compared our approach with four existing works, the conventional LEACH, LEACH using the fuzzy method, multicriteria cluster head delegation, and fuzzy-based energy efficient clustering approach (FEECA) in wireless sensor network. The proposed scenario based fuzzy LEACH protocol approaches are better than the four existing methods regarding stability, network survivability, and energy consumption.
IMPROVEMENTS IN ROUTING ALGORITHMS TO ENHANCE LIFETIME OF WIRELESS SENSOR NET...IJCNCJournal
Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited
computation, communication, memory, and energy resources that are being used fora huge range of
applications. Clustering in WSNs is an effective way to minimize the energy consumption of sensor nodes.
In this paper improvements in various parameters are compared for three different routing algorithms.
First, it is started with Low Energy Adaptive Cluster Hierarchy (LEACH)which is a famed clustering
mechanism that elects a CH based on the probability model. Then, work describes a Fuzzy logic system
initiated CH selection algorithm for LEACH. Then Artificial Bee Colony (ABC)which is an optimisation
protocol owes its inspiration to the exploration behaviour of honey bees. In this study ABC optimization
algorithm is proposed for fuzzy rule selection. Then, the results of the three routing algorithms are
compared with respect to various parameters
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
1) The document proposes an NSGA-III based energy efficient clustering and tree-based routing protocol for wireless sensor networks.
2) It forms clusters based on remaining energy of nodes initially, then uses NSGA-III to improve inter-cluster data aggregation and select the shortest path between cluster heads and the sink.
3) Simulation results show the proposed protocol significantly improves network lifetime, throughput, and residual energy over other techniques.
The document summarizes a student's M. Tech thesis project on improving routing protocols in wireless sensor networks. It begins with an objective to develop a hybrid routing protocol combining features of PEGASIS and LEACH to increase network lifetime. It then reviews related work on routing protocols and energy efficiency. The proposed methodology describes a hybrid protocol that selects cluster heads probabilistically like LEACH while forming chains to route data like PEGASIS. Simulation results show the hybrid protocol increases network lifetime to over 2000 rounds compared to 2000 rounds for previous work. The conclusion is that lower cluster head election probabilities in the hybrid protocol extend network lifetime. Future work could analyze different network parameters.
Spatial correlation based clustering algorithm for random and uniform topolog...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Ca mwsn clustering algorithm for mobile wireless senor network [graphhoc
This paper proposes a centralized algorithm for cluster-head-selection in a mobile wireless sensor network.
Before execution of algorithm in each round, Base station runs centralized localization algorithm whereby
sensors update their locations to base station and accordingly Base station performs dynamic clustering.
Afterwards Base station runs CA-MWSN for cluster-head-selection. The proposed algorithm uses three
fuzzy inputs Residual energy, Expected Residual Energy and Mobility to find Chance of nodes to be elected
as Cluster-head. The node with highest Chance is declared as a Cluster-head for that particular cluster.
Dynamic clustering provides uniform and significant distribution of energy in a non-uniform distribution of
sensors. CA-MWSN guarantees completion of the round.
CA-MWSN: CLUSTERING ALGORITHM FOR MOBILE WIRELESS SENOR NETWORKFransiskeran
This paper proposes a centralized clustering algorithm (CA-MWSN) for selecting cluster heads in mobile wireless sensor networks. The base station first performs dynamic clustering based on sensor location updates. It then runs CA-MWSN, which uses fuzzy logic to calculate each node's "chance" of being elected cluster head based on residual energy, expected residual energy, and mobility. The node with the highest chance is selected as the cluster head for that round. Dynamic clustering and CA-MWSN aim to provide uniform energy distribution in mobile sensor networks where nodes may become densely or sparsely distributed.
This document summarizes a survey of intelligent approaches for efficient energy consumption in wireless sensor networks. Artificial intelligence techniques have been applied to optimize routing protocols and aggregate sensor data more efficiently to conserve limited battery power. Some key approaches discussed are directed diffusion for data dissemination, low-energy adaptive clustering hierarchy (LEACH) for randomized clustering, and energy aware distributed aggregation trees for in-network data aggregation. The goal is to extend the lifetime of battery-powered sensor networks through intelligent energy management strategies.
Smart parking is common in contemporary cities. These smart parking lots are outfitted mostly with wireless sensor networks (WSNs), which are used to detect, monitor, and collect data on the availability status of all existing parking spaces in a given area. Sensors make up WSN, which may gather, process, and transmit informations to the sink. However, the power and
communication limitations of the sensors have an effect on the performance and quality of the WSNs. The decrease in the battery and the energy of the
nodes causes a decrease in the life of the nodes and also of the entire WSN network. In this article, we present a routing protocol that implements an
efficient and robust algorithm allowing the creation of clusters so that the base station can receive data from the entire WSN network. This protocol
adopts a reliable and efficient algorithm allowing to minimize the energy dissipation of the sensors and to increase the lifetime of the WSN. In
comparison to alternative parking lot management protocols already in use,
the simulation results of the proposed protocol are effective and robust in terms of power consumption, data transmission reliability, and WSN network longevity.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
An Energy Aware Routing to Optimize Route Selection in Cluster Based Wireless...ijtsrd
A Wireless Sensor Network WSN is an autonomous, self organizing, and self configuring network with the capability of speedy deployment anywhere. Internet of Things IoT nodes are use cloud storage to collect information from sensors and transfer it to other IoT nodes or networks via cloud services. Energy efficient communication is likely one of the main conversation factors in WSN, so efficient routing is critical to make use of full power consumption and enhance the network performance. This research proposes an Energy Aware Cluster based Wireless Sensor EACW routing protocol that optimizes route selection by clustering of nodes in a Wireless Sensor IoT network. However, one of the biggest problems to be handled is the energy wastage in transport. Limited energy is one of the prime concerns in WSN IoT and efficient routing is the primary focus to improve energy utilization, which increases the network performance. LEACH is an energy based protocol that works on a cluster based mechanism to make use of the energy efficiently. In this research, we compare the performance of the LEACH protocol with that of the reactive on demand protocol in order to make the most of the networks energy constraints. The proposed scheme shows that nodes have at most imprecise state information, mainly under strong link establishment. EACW routing selects optimizes routes higher energy base route resolution , generates clusters, and has power measurement of each cluster member and cluster head. LEACH chooses that specific node for data transmission so that work raises the reliability of communication. The efficiency of the proposed EACW protocol is compared with CBRW and the performance matrices like live nodes, throughput, overhead and CH and CB information. Apurva Anand | Dr. Sadhna K. Mishra "An Energy Aware Routing to Optimize Route Selection in Cluster Based Wireless Sensor-IoT Network (EACW)" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-7 , December 2022, URL: https://www.ijtsrd.com/papers/ijtsrd52292.pdf Paper URL: https://www.ijtsrd.com/computer-science/computer-network/52292/an-energy-aware-routing-to-optimize-route-selection-in-cluster-based-wireless-sensoriot-network-eacw/apurva-anand
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.
AN OPTIMIZED WEIGHT BASED CLUSTERING ALGORITHM IN HETEROGENEOUS WIRELESS SENS...cscpconf
The last few years have seen an increased interest in the potential use of wireless sensor networks (WSNs) in various fields like disastermanagementbattle field surveillance, and border security surveillance. In such applications, a large number of sensor nodes are deployed, which are often unattended and work autonomously. The process of dividing the network into interconnected substructures is called clustering and the interconnected substructures are called clusters. The cluster head (CH) of each cluster act as a coordinator within the substructure. Each CH acts as a temporary base station within its zone or cluster. It also communicates with other CHs. Clustering is a key technique used to extend the lifetime of a sensor network by reducing energy consumption. It can also increase network scalability. Researchers in all fields of wireless sensor network believe that nodes are homogeneous, but
some nodes may be of different characteristics to prolong the lifetime of a WSN and its reliability. We have proposed an algorithm for better cluster head selection based on weights for different parameter that influence on energy consumption which includes distance from base station as a new parameter to reduce number of transmissions and reduce energy consumption by sensor nodes. Finally proposed algorithm compared with the WCA, IWCA algorithm in terms of number of clusters and energy consumption.
Similar to Efficient Clustering scheme in Cognitive Radio Wireless sensor network (20)
Dissertation or Thesis on Efficient Clustering Scheme in Cognitive Radio Wire...aziznitham
Dissertation or thesis is the long essay based on own research on a new particular subject. This is my own research on Efficient clustering Scheme in CRWSN. You can read and can get idea how to write thesis or can make your own thesis or dissertation.
SOP or Personal Statement De Montfort Universityaziznitham
Personal statement or SOP is the statement of own individuals stuff. This is the only for your understanding how to write SOP or personal statement and what should be mentioned in it. On the basis of this general SOP, you can make your own.
One who belongs to "Computer Science and Engineering" or "Software Engineering" background can write similar but with own words.
SOP / Personal Statement for Teesside Universityaziznitham
Personal statement or SOP is the statement of own individuals stuff. This is the only for your understanding how to write SOP or personal statement and what should be mentioned in it. On the basis of this general SOP, you can make your own.
One who belongs to "Computer Science and Engineering" or "Software Engineering" background can write similar but with own words.
SOP or Personal Statement for University of Hertfordshireaziznitham
Personal statement or SOP is the statement of own individuals stuff. This is the only for your understanding how to write SOP or personal statement and what should be mentioned in it. On the basis of this general SOP, you can make your own.
One who belongs to "Computer Science and Engineering" or "Software Engineering" background can write similar but with own words.
SOP or Personal Statement for London South Bank Universityaziznitham
Personal statement or SOP is the statement of own individuals stuff. This is the only for your understanding how to write SOP or personal statement and what should be mentioned in it. On the basis of this general SOP, you can make your own.
One who belongs to "Computer Science and Engineering" or "Software Engineering" background can write similar but with own words.
Personal statement or SOP is the statement of own individuals stuff. This is the only for your understanding how to write SOP or personal statement and what should be mentioned in it. On the basis of this general SOP, you can make your own.
One who belongs to "Computer Science and Engineering" or "Software Engineering" background can write similar but with own words.
SOP/Personal Statement for Birmingham City Universityaziznitham
Personal statement or SOP is the statement of own individuals stuff. This is the only for your understanding how to write SOP or personal statement and what should be mentioned in it. On the basis of this general SOP, you can make your own.
One who belongs to "Computer Science and Engineering" or "Software Engineering" background can write similar but with own words.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
International Conference on NLP, Artificial Intelligence, Machine Learning an...
Efficient Clustering scheme in Cognitive Radio Wireless sensor network
1. Efficient Clustering Scheme in Cognitive Radio Wireless
Sensor Network
Under the Guidance of
Mr. Nitin Gupta
Assistant Professor,
CSE Department
Presented By:
Mohammad Aziz
14MI544
Dual Degree in CSE
MTech Dissertation on
Department of Computer Science & Engineering
National Institute of Technology Hamirpur
June, 2019
3. Introduction
●
Cognitive Radio Network
Cognitive radio network is intelligent and dynamically adapts the
transmission parameter through the environment accordingly.
●
Cognitive radio wireless sensor network
CR-wireless sensor networks (CR-WSNs) are a specialized ad hoc
network of distributed wireless sensors that are equipped with cognitive
radio capabilities.
●
Clustering Scheme
K-mean clustering -It is an algorithm of unsupervised machine learning
which is utilized to generate a normal cluster in unlabelled information.
4. Continue...
●
AP clustering - It based on the concept of
"message passing" between data points.
●
Sleep and wake up - Sleep-wake strategy is the
process of a node to get into sleep and wake mode.
5. Motivation
●
Cognitive radios offer the guarantee of being a innovation
technology that will empower the futurejwireless world.
●
Cognitive radios are completely programmable remote gadgets that
can detect theirkenvironment and dynamicallysadjust their
transmission waveform, spectrum use,channeliaccess method, and
networking protocol as required for a good system and application
execution.
●
The main motivation is to design efficient and less power
consumption clustering scheme in a cognitive radio networks.
6. Problem Statement
Inefficient clustering in CRN may lead to high
power consumption and reduction of the lifetime of
nodes in the cognitive radio network. The objective
of the proposed work is to design a clustering
algorithm such that a lesser number of the cluster
are created while the number of nodes are
increased.
7. Literature review
[6] A novel clustering-based spectrum sensing (CBSS) in CR-WSNs was
proposed by Qu et al. [6]. In this method, sensor nodes are grouped into
different sets based on their similarity in sensing results. An objective
function is proposed to identify the optimal cluster number. Details for
cluster formation and CH selection were not given, and the performance
was not compared with existent algorithms.
[8] A spectrum-aware cluster-based energy-efficient multimedia
(SCEEM) routing protocol was proposed by Shah et al. In this protocol,
SU nodes form a cluster with a higher number of commonly available
idle channels. The CHs are selected based on energy and relative
spectrum awareness, such that noncontiguous available spectrum bands
are clustered and scheduled to provide continuous transmission
opportunities.
8. Continue...
●
Rauniyar and Shin [7] proposed a clustering scheme for
cooperative spectrum sensing based on other
approaches. In the scheme, a pair of nodes in a group
can alternate between sleep and wake modes during the
sensing process.
●
Manoor and Shahid [9] proposed a clustering scheme
called BECHR for CR-WSNs. This scheme selects a
CH based on residual energy in an iterative manner. It
works like conventional WSN clustering methods but
with some variations.
9. Continue...
●
Ozger et al. [10] and Ozger and Akan [5] proposed event-
driven spectrum-aware clustering (ESAC) and mobility-aware
Event-to-sink Spectrum-Aware Clustering (mESAC) protocols
that form temporal clusters for each event in CR-WSNs. These
protocols determine eligible nodes for clustering based on the
local position of nodes between the event and the sink. CHs
are selected from among the candidate nodes based on node
degree, channel availability, and distance to the sink. Because
this is event-driven clustering, the clusters are immediately
dismissed after finishing data transmission. Hence, it is not
suitable for other scenarios.
●
●
10. Objectives
●
Devising an approach for making formation of
cluster efficient in such a way that lesser number of
clusters are created while number of nodes are
increased.
●
To analyze and understand the current approaches
designed for the Clustering in CRWSNs
13. Explanation
●
First start with checking whether a certain node is in
the active(wake-up) mode or in the sleep mode in the
network.
●
The capacity of the battery node should be greater
than or equal to threshold value.
●
Cluster head or centroid are chosen by using affinity
propagation method.
●
finding out the node distance from the centroid using
Euclidean distance formula.
14. Continue...
●
Checks if two nodes having its distances are equal.
●
Higher degree node is selected otherwise minimum
distance is selected for the cluster.
17. Simulation
●
The proposed approach of the Efficient Clustering in
cognitive radio wireless sensor network is simulated using
the MATLAB version R2018a.
Comparison of the number of Clusters against
number of nodes
●
The simulation are shown in the below table.
no.of
nodes
Cogmesh
Cluste
based
approach
Proposed
approach
SOC
approach
50 10 12 12 12
100 11 17 16 22
150 16 18 15 32
200 19 20 15 37
250 21 23 17 39
300 26 24 19 42
19. Continue...
●
Increase in the number of node also lead to
increase in the number of clusters for all the three
approaches along with the proposed model.
●
It is seen that less number of cluster are
constructed by proposed approach while
comparing with other three approaches.
●
Thus, this proposed model approach is efficient
clustering method for cognitive radio network.
20. Future Scope
The scope of future work can be considered in
energy utilization in mobile cognitive radio
network using a cluster-based algorithm to deduce
the jamming in the network and for the lifetime of
the cognitiv network.
21. References
[1] Ozgur B Akan, Osman B Karli, and Ozgur Ergul. Cognitive
radio sensor networks. IEEE network, 23(4):34–40, 2009.
[2] Jong-Hong Park, Yeonghun Nam, and Jong-Moon Chung.
Sustainability enhancement multihop clustering in cognitive
radio sensor networks. International Journal of Distributed
Sensor Networks, 11(10):574340, 2015.
[3] Huazi Zhang, Zhaoyang Zhang, Huaiyu Dai, Rui Yin, and
Xiaoming Chen. Distributed spectrum-aware clustering in
cognitive radio sensor networks. In 2011 IEEE Global
Telecommunications Conference-GLOBECOM 2011, pages 1–
6. IEEE, 2011.
22. Continue...
[4] Ibrahim Mustapha, Borhanuddin M Ali, A Sali, Mohd FA Rasid,
and H Mohamad. Energy-aware cluster based cooperative spectrum
sensing for cognitive radio sensor networks. In 2014 IEEE 2nd
international symposium on telecommunication technologies (ISTT),
pages 45–50. IEEE, 2014.
[5] Chunhung Richard Lin and Mario Gerla. A distributed
architecture for multimedia in dynamic wireless networks. In
Proceedings of GLOBECOM’95, volume 2, pages 1468– 1472.
IEEE, 1995.
●
[6] Y Tawk, J Costantine, and CG Christodoulou. Cognitive-radio and
antenna functionali ties: A tutorial [wireless corner]. IEEE Antennas
and Propagation Magazine, 56(1):231243, 2014.
23. Continue...
●
[7] Rauniyar A., Shin S.Y. A novel energy-efficient clustering
based cooperative spectrum sensing for cognitive radio sensor
networks. Int. J. Distrib. Sens. Netw. 2015;2015 doi:
10.1155/2015/198456.
●
[8] Shah G.A., Alagoz F., Fadel E.A., Akan O.B. A spectrum-
aware clustering for efficient multimedia routing in cognitive
radio sensor networks. IEEE Trans. Veh. Technol. 2014;63:3369–
3380. doi: 10.1109/TVT.2014.2300141.
●
[9] Mansoor U., Shahid M.K. Cluster based Energy Efficient
Sensing for Cognitive Radio Sensor Networks. Int. J. Comput.
Appl. 2014;88:14–19. doi: 10.5120/15363-3849.
●
24. Continue...
●
[10] Ozger M., Fadel E., Akan O. Event-to-sink
Spectrum-Aware Clustering in Mobile Cognitive
Radio Sensor Networks. IEEE Trans. Mob.
Comput. 2015;15:2221–2233. doi:
10.1109/TMC.2015.2493526.