This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighboring nodes. An algorithm has been described in which the power failure diagnosis is
made and solved. This paper also involves proper selection of the ideal networks by the
concepts of Random Graph theory. The paper involves the mathematics of complete fault
diagnosis including solving the problem and continuing the process flow.
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theoryidescitation
This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighbouring nodes. An algorithm has been described in which the power failure diagnosis
is made and solved. The concepts of Electromagnetics, Wave Duality, Energy model of an
atom is linked with wireless networks. A model is prepared in which the positioning of
nodes of sensors are decided. Also the model is made more efficient regarding the energy
consumption, power delivery etc. using the concepts of graph theory concepts, probability
distribution.
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.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
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 Efficient Modeling of Wireless Sensor Networks using Random Graph Theoryidescitation
This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighbouring nodes. An algorithm has been described in which the power failure diagnosis
is made and solved. The concepts of Electromagnetics, Wave Duality, Energy model of an
atom is linked with wireless networks. A model is prepared in which the positioning of
nodes of sensors are decided. Also the model is made more efficient regarding the energy
consumption, power delivery etc. using the concepts of graph theory concepts, probability
distribution.
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.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
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
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.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
ENERGY-EFFICIENT DATA COLLECTION IN CLUSTERED WIRELESS SENSOR NETWORKS EMPLOY...ijwmn
In this paper, a energy-efficient data collection method is proposed in which an integration between
Discrete Cosine Transform (DCT) matrix and clustering in wireless sensor networks (WSNs) is
exploited.Based on the fact that sensory data in WSNs is often highly correlated and is suitable to be
transformed in DCT domain, we propose that each cluster from the networks only sends a small number of
large DCT transformed coefficients to the base-station (BS) for data collection in two common ways, either
directly or in multi-hop routing. All sensory data from the sensor network can be recovered based on the
large coefficients received at the BS. We further analyze and formulate the communication cost as the
power consumption for transmitting data in such networks based on stochastic problems. Some common
clustering algorithms are applied and compared to verify the analysis and simulation results. Both noise
and noiseless environments for the proposed method are considered.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
Energy efficient cooperative transmission for simultaneous wireless informati...LogicMindtech Nologies
NS2 Projects for M. Tech, NS2 Projects in Vijayanagar, NS2 Projects in Bangalore, M. Tech Projects in Vijayanagar, M. Tech Projects in Bangalore, NS2 IEEE projects in Bangalore, IEEE 2015 NS2 Projects, WSN and MANET Projects, WSN and MANET Projects in Bangalore, WSN and MANET Projects in Vijayangar
Selection of Energy Efficient Clustering Algorithm upon Cluster Head Failure ...ijsrd.com
Wireless Sensor Network (WSN) applications have increased in recent times in fields such as environmental sensing, area monitoring, air pollution monitoring, forest res detection, machine health monitoring, and landslide detection. In such applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism is the most preferred one. Hence, to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering. In most of the WSN designs based on clustering, Base Station (BS) is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. Critical applications like these cannot afford to have BS failure as it is a gateway from sensor networks to the outside world. In order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Therefore, there is a need to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets established with minimum computation and less energy consumption.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route planning of WSN exists a big localization error in wireless communication. WSN communication system is researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route planning of WSN is proposed. The performance of the node density and localization error is simulated and analyzed. The simulation results show that the performance of proposed WSN localization algorithm and route planning method are better than the traditional algorithms.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional
algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route
planning of WSN exists a big localization error in wireless communication. WSN communication system is
researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route
planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route
planning of WSN is proposed. The performance of the node density and localization error is simulated and
analyzed. The simulation results show that the performance of proposed WSN localization algorithm and
route planning method are better than the traditional algorithms.
Congestion control based on sliding mode control and scheduling with prioriti...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.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
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.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
ENERGY-EFFICIENT DATA COLLECTION IN CLUSTERED WIRELESS SENSOR NETWORKS EMPLOY...ijwmn
In this paper, a energy-efficient data collection method is proposed in which an integration between
Discrete Cosine Transform (DCT) matrix and clustering in wireless sensor networks (WSNs) is
exploited.Based on the fact that sensory data in WSNs is often highly correlated and is suitable to be
transformed in DCT domain, we propose that each cluster from the networks only sends a small number of
large DCT transformed coefficients to the base-station (BS) for data collection in two common ways, either
directly or in multi-hop routing. All sensory data from the sensor network can be recovered based on the
large coefficients received at the BS. We further analyze and formulate the communication cost as the
power consumption for transmitting data in such networks based on stochastic problems. Some common
clustering algorithms are applied and compared to verify the analysis and simulation results. Both noise
and noiseless environments for the proposed method are considered.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
Energy efficient cooperative transmission for simultaneous wireless informati...LogicMindtech Nologies
NS2 Projects for M. Tech, NS2 Projects in Vijayanagar, NS2 Projects in Bangalore, M. Tech Projects in Vijayanagar, M. Tech Projects in Bangalore, NS2 IEEE projects in Bangalore, IEEE 2015 NS2 Projects, WSN and MANET Projects, WSN and MANET Projects in Bangalore, WSN and MANET Projects in Vijayangar
Selection of Energy Efficient Clustering Algorithm upon Cluster Head Failure ...ijsrd.com
Wireless Sensor Network (WSN) applications have increased in recent times in fields such as environmental sensing, area monitoring, air pollution monitoring, forest res detection, machine health monitoring, and landslide detection. In such applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism is the most preferred one. Hence, to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering. In most of the WSN designs based on clustering, Base Station (BS) is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. Critical applications like these cannot afford to have BS failure as it is a gateway from sensor networks to the outside world. In order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Therefore, there is a need to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets established with minimum computation and less energy consumption.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route planning of WSN exists a big localization error in wireless communication. WSN communication system is researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route planning of WSN is proposed. The performance of the node density and localization error is simulated and analyzed. The simulation results show that the performance of proposed WSN localization algorithm and route planning method are better than the traditional algorithms.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional
algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route
planning of WSN exists a big localization error in wireless communication. WSN communication system is
researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route
planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route
planning of WSN is proposed. The performance of the node density and localization error is simulated and
analyzed. The simulation results show that the performance of proposed WSN localization algorithm and
route planning method are better than the traditional algorithms.
Congestion control based on sliding mode control and scheduling with prioriti...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.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachjake henry
In Manet’s Dynamics and Robustness are the key feat
ures of the nodes and are governed by several routi
ng
protocols such as AODV, DSR and so on. However in t
he network the growing resource demand leads to
resource scarcity. The Node Mobility often leads to
the link breakages and high routing overhead
decreasing the stability and reliability of the net
work connectivity. In this context, the paper propo
ses a
novel opportunistic AODV routing scheme which imple
ments a cognitive agent based intelligent technique
to set up a stable connectivity over the Manet. The
Scheme computes the routing metric (rf) based on t
he
collaboration sensitivity levels of the nodes obtai
ned based through the knowledge-based decision. Thi
s
Routing Metric is subsequently used to set up the s
table path for network connectivity. Thus minimizes
the
route overhead and increases the stability of the p
ath. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing pro
tocol and validated
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network Connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
AN OPPORTUNISTIC AODV ROUTING SCHEME: A COGNITIVE MOBILE AGENTS APPROACHijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing
protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to
resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a
novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique
to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the
collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This
Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the
route overhead and increases the stability of the path. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing protocol and validated.
k fault tolerance Mobile Adhoc Network under Cost Constraintsugandhasinghhooda
A network topology is a K-FT topology if it can endure K number of link failures, however to find a reliable hardware topology for a set of nodes keeping the total cost of the links within a predefined budget, is a challenging task, especially when the topology is subjective to constraints that the topological network can tolerate K link failures keeping total cost of network within budget. This problem has been addressed in this paper where in a novel algorithm is proposed that uses N X N matrix to represent the cost between the participating nodes, and uses K-FT topology to tackle the fault tolerant problem of Mobile Adhoc Networks. Intention is to achieve optimal resource utilization and fairness among competing end to end flows. A network topology is said to be K-FT if and only if every pair of node is reachable from all other nodes for K link failures. The algorithm has been tested for wide range of node sets and the result obtained there of suggest that the proposed algorithm finds better solutions in comparison to Genetic Algorithm.
An appropriate fault detection and classification of power system transmission line using discrete wavelet transform and artificial neural networks is performed in this paper. The analysis is carried out by applying discrete wavelet transform for obtained fault phase currents. The work represented in this paper are mainly concentrated on classification of fault and this classification is done based on the obtained energy values after applying discrete wavelet transform by taking this values as an input for the neural network. The proposed system and analysis is carried out in Matlab Simulink.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
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.
Similar to Energy Efficient Power Failure Diagonisis For Wireless Network Using Random Graph Theory (20)
Now-a-days, Internet has become an important part of human’s life, a person
can shop, invest, and perform all the banking task online. Almost, all the organizations have
their own website, where customer can perform all the task like shopping, they only have to
provide their credit card details. Online banking and e-commerce organizations have been
experiencing the increase in credit card transaction and other modes of on-line transaction.
Due to this credit card fraud becomes a very popular issue for credit card industry, it causes
many financial losses for customer and also for the organization. Many techniques like
Decision Tree, Neural Networks, Genetic Algorithm based on modern techniques like
Artificial Intelligence, Machine Learning, and Fuzzy Logic have been already developed for
credit card fraud detection. In this paper, an evolutionary Simulated Annealing algorithm is
used to train the Neural Networks for Credit Card fraud detection in real-time scenario.
This paper shows how this technique can be used for credit card fraud detection and
present all the detailed experimental results found when using this technique on real world
financial data (data are taken from UCI repository) to show the effectiveness of this
technique. The algorithm used in this paper are likely beneficial for the organizations and
for individual users in terms of cost and time efficiency. Still there are many cases which are
misclassified i.e. A genuine customer is classified as fraud customer or vise-versa.
Wireless sensor networks (WSN) have been widely used in various applications.
In these networks nodes collect data from the attached sensors and send their data to a base
station. However, nodes in WSN have limited power supply in form of battery so the nodes
are expected to minimize energy consumption in order to maximize the lifetime of WSN. A
number of techniques have been proposed in the literature to reduce the energy
consumption significantly. In this paper, we propose a new clustering based technique
which is a modification of the popular LEACH algorithm. In this technique, first cluster
heads are elected using the improved LEACH algorithm as usual, and then a cluster of
nodes is formed based on the distance between node and cluster head. Finally, data from
node is transferred to cluster head. Cluster heads forward data, after applying aggregation,
to the cluster head that is closer to it than sink in forward direction or directly to the sink.
This reduction in distance travelled improves the performance over LEACH algorithm
significantly.
The next generation wireless networks comprises of mobile users moving
between heterogeneous networks, using terminals with multiple access interfaces and
services. The most important issue in such environment is ABC (Always Best Connected) i.e.
allowing the best connectivity to applications anywhere at any time. For always best
connectivity requirement various vertical handover strategies for decision making have
been proposed. This paper provides an overview of the most interesting and recent
strategies.
This paper presents the design and performance comparison of a two stage
operational amplifier topology using CMOS and BiCMOS technology. This conventional op
amp circuit was designed by using RF model of BSIM3V3 in 0.6 μm CMOS technology and
0.35 μm BiCMOS technology. Both the op amp circuits were designed and simulated,
analyzed and performance parameters are compared. The performance parameters such as
gain, phase margin, CMRR, PSRR, power consumption etc achieved are compared. Finally,
we conclude the suitability of CMOS technology over BiCMOS technology for low power
RF design.
In Cognitive Radio Networks (CRN), Cooperative Spectrum Sensing (CSS) is
used to improve performance of spectrum sensing techniques used for detection of licensed
(Primary) user’s signal. In CSS, the spectrum sensing information from multiple unlicensed
(Secondary) users are combined to take final decision about presence of primary signal. The
mixing techniques used to generate final decision about presence of PU’s signal are also
called as Fusion techniques / rules. The fusion techniques are further classified as data
fusion and decision fusion techniques. In data fusion technique all the secondary users
(SUs) share their raw information of spectrum detection like detected energy or other
statistical information, while in decision fusion technique all the SUs take their local
decisions and share the decision by sending ‘0’ or ‘1’ corresponding to absence and presence
of PU’s signal respectively. The rules used in decision fusion techniques are OR rule, AND
rule and K-out-of-N rule. The CSS is further classified as distributed CSS and centralized
CSS. In distributed CSS all the SUs share the spectrum detection information with each
other and by mixing the shared information; all the SUs take final decision individually. In
centralized CSS all the SUs send their detected information to a secondary base station /
central unit which combines the shared information and takes final decision. The secondary
base station shares the final decision with all the SUs in the CRN. This paper covers
overview of information fusion methods used for CSS and analysis of decision fusion rules
with simulation results.
ZigBee has been developed to support lower data rates and low power consuming
applications. This paper targets to analyze various parameters of ZigBee physical (PHY).
Performance of ZigBee PHY is evaluated on the basis of energy consumption in
transmitting and receiving mode and throughput. Effect of variation in network size is
studied on these performance attributes. Some modulation schemes are also compared and
the best modulation scheme is suggested with tradeoffs between different performance
metrics.
This paper gives a brief idea of the moving objects tracking and its application.
In sport it is challenging to track and detect motion of players in video frames. Task
represents optical flow analysis to do motion detection and particle filter to track players
and taking consideration of regions with movement of players in sports video. Optical flow
vector calculation gives motion of players in video frame. This paper presents improved
Luacs Kanade algorithm explained for optical flow computation for large displacement and
more accuracy in motion estimation.
A rapid progress is seen in the field of robotics both in educational and industrial
automation sectors. The Robotics education in particular is gaining technological advances
and providing more learning opportunities. In automotive sector, there is a necessity and
demand to automate daily human activities by robot. With such an advancement and
demand for robotics, the realization of a popular computer game will help students to learn
and acquire skills in the field of robotics. The computer game such as Pacman offers
challenges on both software and hardware fronts. In software, it provides challenges in
developing algorithms for a robot to escape from the pool of attacking robots and to develop
algorithms for multiple ghost robots to attack the Pacman. On the hardware front, it
provides a challenge to integrate various systems to realize the game. This project aims to
demonstrate the pacman game in real world as well as in simulation. For simulation
purpose Player/Stage is used to develop single-client and multi-client architectures. The
multi- client architecture in player/stage uses one global simulation proxy to which all the
robot models are connected. This reduces the overhead to manage multiple robots proxy.
The single-client architecture enables only two robot models to connect to the simulation
proxy. Multi-client approach offers flexibility to add sensors to each port which will be used
distinctly by the client attached to the respective robot. The robots are named as Pacman
and Ghosts, which try to escape and attack respectively. Use of Network Camera has been
done to detect the global positions of the robots and data is shared through inter-process
communication.
In Content-Based Image Retrieval (CBIR) systems, the visual contents of the
images in the database are took out and represented by multi-dimensional characteristic
vectors. A well known CBIR system that retrieves images by unsupervised method known
as cluster based image retrieval system. For enhancing the performance and retrieval rate
of CBIR system, we fuse the visual contents of an image. Recently, we developed two
cluster-based CBIR systems by fusing the scores of two visual contents of an image. In this
paper, we analyzed the performance of the two recommended CBIR systems at different
levels of precision using images of varying sizes and resolutions. We also compared the
performance of the recommended systems with that of the other two existing CBIR systems
namely UFM and CLUE. Experimentally, we find that the recommended systems
outperform the other two existing systems and one recommended system also comparatively
performed better in every resolution of image.
Information Systems and Networks are subjected to electronic attacks. When
network attacks hit, organizations are thrown into crisis mode. From the IT department to
call centers, to the board room and beyond, all are fraught with danger until the situation is
under control. Traditional methods which are used to overcome these threats (e.g. firewall,
antivirus software, password protection etc.) do not provide complete security to the system.
This encourages the researchers to develop an Intrusion Detection System which is capable
of detecting and responding to such events. This review paper presents a comprehensive
study of Genetic Algorithm (GA) based Intrusion Detection System (IDS). It provides a
brief overview of rule-based IDS, elaborates the implementation issues of Genetic Algorithm
and also presents a comparative analysis of existing studies.
Step by step operations by which we make a group of objects in which attributes
of all the objects are nearly similar, known as clustering. So, a cluster is a collection of
objects that acquire nearly same attribute values. The property of an object in a cluster is
similar to other objects in same cluster but different with objects of other clusters.
Clustering is used in wide range of applications like pattern recognition, image processing,
data analysis, machine learning etc. Nowadays, more attention has been put on categorical
data rather than numerical data. Where, the range of numerical attributes organizes in a
class like small, medium, high, and so on. There is wide range of algorithm that used to
make clusters of given categorical data. Our approach is to enhance the working on well-
known clustering algorithm k-modes to improve accuracy of algorithm. We proposed a new
approach named “High Accuracy Clustering Algorithm for Categorical datasets”.
Brain tumor is a malformed growth of cells within brain which may be
cancerous or non-cancerous. The term ‘malformed’ indicates the existence of tumor. The
tumor may be benign or malignant and it needs medical support for further classification.
Brain tumor must be detected, diagnosed and evaluated in earliest stage. The medical
problems become grave if tumor is detected at the later stage. Out of various technologies
available for diagnosis of brain tumor, MRI is the preferred technology which enables the
diagnosis and evaluation of brain tumor. The current work presents various clustering
techniques that are employed to detect brain tumor. The classification involves classification
of images into normal and malformed (if detected the tumor). The algorithm deals with
steps such as preprocessing, segmentation, feature extraction and classification of MR brain
images. Finally, the confirmatory step is specifying the tumor area by technique called
region of interest.
A Proxy signature scheme enables a proxy signer to sign a message on behalf of
the original signer. In this paper, we propose ECDLP based solution for chen et. al [1]
scheme. We describe efficient and secure Proxy multi signature scheme that satisfy all the
proxy requirements and require only elliptic curve multiplication and elliptic curve addition
which needs less computation overhead compared to modular exponentiations also our
scheme is withstand against original signer forgery and public key substitution attack.
Water marking has been proposed as a method to enhance data security. Text
water marking requires extreme care when embedding additional data within the images
because the additional information must not affect the image quality. Digital water marking
is a method through which we can authenticate images, videos and even texts. Add text
water mark and image water mark to your photos or animated image, protect your
copyright avoid unauthorized use. Water marking functions are not only authentication, but
also protection for such documents against malicious intentions to change such documents
or even claim the rights of such documents. Water marking scheme that hides water
marking in method, not affect the image quality. In this paper method of hiding a data using
LSB replacement technique is proposed.
Today among various medium of data transmission or storage our sensitive data
are not secured with a third-party, that we used to take help of. Cryptography plays an
important role in securing our data from malicious attack. This paper present a partial
image encryption based on bit-planes permutation using Peter De Jong chaotic map for
secure image transmission and storage. The proposed partial image encryption is a raw data
encryption method where bits of some bit-planes are shuffled among other bit-planes based
on chaotic maps proposed by Peter De Jong. By using the chaotic behavior of the Peter De
Jong map the position of all the bit-planes are permuted. The result of the several
experimental, correlation analysis and sensitivity test shows that the proposed image
encryption scheme provides an efficient and secure way for real-time image encryption and
decryption.
This paper presents a survey of Dependency Analysis of Service Oriented
Architecture (SOA) based systems. SOA presents newer aspects of dependency analysis due
to its different architectural style and programming paradigm. This paper surveys the
previous work taken on dependency analysis of service oriented systems. This study shows
the strengths and weaknesses of current approaches and tools available for dependency
analysis task in context of SOA. The main motivation of this work is to summarize the
recent approaches in this field of research, identify major issue and challenges in
dependency analysis of SOA based systems and motivate further research on this topic.
In this paper, proposed a novel implementation of a Soft-Core system using
micro-blaze processor with virtex-5 FPGA. Till now Hard-Core processors are used in
FPGA processor cores. Hard cores are a fixed gate-level IP functions within the FPGA
fabrics. Now the proposed processor is Soft-Core Processor, this is a microprocessor fully
described in software, usually in an HDL. This can be implemented by using EDK tool. In
this paper, developed a system which is having a micro-blaze processor is the combination
of both hardware & Software. By using this system, user can control and communicate all
the peripherals which are in the supported board by using Xilinx platform to develop an
embedded system. Implementing of Soft-Core process system with different peripherals like
UART interface, SPA flash interface, SRAM interface has to be designed using Xilinx
Embedded Development Kit (EDK) tools.
The article presents a simple algorithm to construct minimum spanning tree and
to find shortest path between pair of vertices in a graph. Our illustration includes the proof
of termination. The complexity analysis and simulation results have also been included.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Radio Frequency identification (RFID) technology has become emerging
technique for tracking and items identification. Depend upon the function; various RFID
technologies could be used. Drawback of passive RFID technology, associated to the range
of reading tags and assurance in difficult environmental condition, puts boundaries on
performance in the real life situation [1]. To improve the range of reading tags and
assurance, we consider implementing active backscattering tag technology. For making
mobiles of multiple radio standards in 4G network; the Software Defined Radio (SDR)
technology is used. Restrictions in Existing RFID technologies and SDR technology, can be
eliminated by the development and implementation of the Software Defined Radio (SDR)
active backscattering tag compatible with the EPC global UHF Class 1 Generation 2 (Gen2)
RFID standard. Such technology can be used for many of applications and services.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
2. thus increasing the complexity. The probability to have errors in this type of dense system is too high. So a
power failure diagnosis model is made to solve the problem in the complex networks. Generally when the
nodes are high deterministic modeling is difficult and some stochastic arguments are required. Suppose a
sensor network with n nodes and links between the nodes are randomly arranged [11]-[14]. Some sought of
probability conditions are studied in the [1]. Ref. [20] explains about the future research and challenges in the
field of wireless networking. The network is modeled with a graph with n vertices fixed in advance and
adding edges between random pairs with probability p. In the case we have n nodes so total there are
2=
(
1)/2 cases of nodes pairs having the equal probability as p to be connected to each other.
Fig. 1 shows a case in which 100 nodes are selected at random and distributed in the area of 10*10. The
probability of connection between the nodes is 0.01, if seen independently then the probability is p. As there
is increase in the value of p the connectedness of network goes on increasing. It has been seen through the
graph below that the area where there is less connectivity is having less probability and the area where there
the probability density is high the occurrence of nodes is high. A term critical probability is defined in
describing the sudden change in the network selection as the probability goes above the critical probability
then there is a change in the network to highly connected network. A technique is involved in which the
amount of nodes over an area where the signal is to be transmitted will be given with the power and the
remaining nodes will be in the off stages. This will save a lot of power as a path will be selected.
The remainder of the paper is described in the following ways: Section II gives the brief introduction
regarding the related work. In section III probability concepts regarding the selection of nodes are studied.
Also the concepts of Random Processes are included with time variations. In the section IV, an algorithm is
described regarding the , , , probability required for the selection of path and network, also an algorithm for
the power failure diagnosis is mentioned and solution for this problem is mentioned. Timing methods and
delay conditions are used for detection of error. An improvement is provided regarding the power
management is also given in the same section. Also some further research, problems and Matlab Simulations
are provided in section V. Finally conclusion is in section VI.
Fig. 1. (Graph representing selection of nodes for an 1000*1000 area)
II. RELATED W ORK:
A. Geographical Adaptive Fidelity Algorithm:
GAF algorithm includes the selection of certain nodes based upon the geographical location of the nodes.
The area which is to be monitored is divided into several small lattices forming a cluster. The size of the
cluster also matters as it should meet the needs
of the communication in which the signal must flow between two farthest possible nodes.
Assume a virtual lattice square with r units on a side and denote the radio range of the sensor by R.
Therefore, we get
+ (2 )
eq. 1.
28
3. Here the nodes are active and inactive periodically. The node has the tendency to exchange the information
from its side node after becoming active and new cluster selection occurs. Cluster head is kept active all the
times but the cluster members sleep in case there is no sensing task.
B. Site Percolation:
It is a kind of random graph in which the edges are formed between two neighboring nodes. In site
percolation either node is considered as an open port with a probability p or a closed port with a probability
of (1-p) as described in [15-17]. Statistical analysis of probability is done in [18]. An edge exists only when
there is a connection between two open ports of nodes. Site Percolations can be understood as a sudden
change from the finite number of clusters to infinite number of clusters where p increases to pc.
C. Random Graph:
A random graph consists of vertices and edges. Any two vertices share an edge with the probability of p. In
Ref. [19] it has described that the probability of a random graph being connected tends to be one if the
number of the edges taking part in the connection is higher than Pc= (N/2*log N). Due to this there is large
change in the system performance this is phase transition in the random graph theory. The value of PC is like
a threshold value for the probability distribution as if a certain network has this sought of probability
distribution then that random graph is connected. This kind of mapping technique is quite unrealistic because
we have wireless edges as connection. So fair pairs of vertices need to be created, sensor has limited
communication radius.
D. Random Process:
Generally in the conditions we have the case of probability distribution in which there are cases having more
than one varying entity. In those cases there is a random process where variable functions are defined. These
functions are called as sample functions, also when there is a single random variable as there is only one
varying quantity (let s) then that it will lead to only one sample functions, but in the case if there are more
than one random variable taking the case of random process then the number of functions depends on the
varying quantity as it will vary for the change of both variables. Hence it will provide many sample
functions. Collections of all this functions is included in a set called Ensemble, the set consists of all the
functions which occurred when there is a change in the random graph.
A random variable which is a function of time is called a random process. Suppose (A,
variable then we can define a random process as
( ) = ( ) [ (s). t +
eq. 2.
In this A(s) is the function describing the changing the random variable changing, in signal flow system we
he phase
due to the flow of the signal, (s) is the frequency function describing the change in the frequency with the
change in the node and time.
When a signal is varied with respect to time then sample function of this case will be x(t) but if there is
change in only node and for a constant time we have the tendency to study the nodes then sample function
will be x(s). In the same way if the case is the variation of all the two variables then sample function will be
x(s, t).
III. PROBABILITY DISCUSSION:
Considering the case of a network where the nodes are randomly arranged in the form of random lattice.
Possible nodes are taken to be on the integer lattice points for simplicity. The plane vertex set is
= {( , )| ,
}
The actual nodes are not so aligned regularly but in order to have a simple understanding we have the case of
quantized nodes. Let there be a set of n nodes, in order to send the signal from one node to another there are
many ways to align a very connected network. Therefore the point is to select the way for the transferring the
signal. For this case we use Bayes theorem.
Generally there are n nodes and links available for the networking will be
referred to the diagram. Our
goal is to find out the probability of the selection of the path from one node to other. Starting from one edge
node there are two paths to select therefore the probability is 0.5, then as the nodes increase the probability
of the selection of network decreases. From the figure it is cleared that when the signal moves to node two
the ways to select other networks is 1/3 (0.5 if the node is corner node) each which get multiplied when the
29
4. signal moves to internal nodes. Studying the complete probability concept we have the corner nodes (nodes
at corner) and mid nodes (nodes inside the lattice).
Firstly the node pair must be selected from which the signal should be transferred. For the selection of the
node pair let the probability function be (
), which for an n*n square matrix will be
2
= (
1)/2. Let the two nodes nth and mth be selected for signal flow.
There are total two cases,
1. In the first case we select the pair of nodes which are at the corners. On selecting the nodes at the
corners we have total 2 cases to select (total two nodes to select). Then the process continues with
the selection of either nodes or two nodes as shown in the diagram fig. 2. We come up with the
probability of selecting two nodes (corner) and continuing steps.
Probability of selection of the nodes from corner a matrix and process it further for node selection
(0.5) (2 2 )
= {
}/n2C2
eq.3.
In the second case we select the pair of nodes which are inside the matrix. On selecting the nodes we
have total 2 cases to select (total two nodes to select). Then the process continues with the selection
of either nodes or nodes three as shown in the diagram fig. 3. We come up with the probability of
selecting two nodes (corner) and continuing steps.
Probability of selection of the nodes from inside a matrix and process it further for node selection (here n(2)
means square of n)
= [n (2)-2*nC2 *
(1/3)] / n2C2] eq.4.
Considering the random variable as in the form of s and t
Where s = node selection.
T = time
2.
Diagram shows the technique for selection of nodes)Fig. 2
Figure shows the conditions for the corner nodes and inside nodes.
Taking the case if we have selected two nodes as a sample space and the contents of information in the form
of signal is continuously changing with respect to time.
We have three cases:
1. In the first case the nodes selected are seen for a differential time interval and the time is taken as a
constant value. In this case the random variable let s be changing over the selected nodes.
2. Second case takes the condition if there are nodes which are kept constant and the time is being
continued to change. In all here the nodes are kept constant but the time is allowed to change. We
can say that a pair of nodes are selected and study of data transmission is done for a longer period of
time.
3. Third case involves the change of node as well as the time. Here there is a change in the value of the
nodes (change in the random variable) also there is a change in the time. A group of nodes are
30
5. selected first and then studied for a longer period of time. Mathematically as in this case both s and t
are kept varying therefore this is the case of a random process.
We involve the mathematical relations involved for all the three cases.
Case 1: Taking the case as if 2 pairs of nodes are selected at random and both the pairs are allotted with the
function of time as the signal keep varying with respect to node as x1 (s) and x2(s).
The two functions mentioned above are the sample functions which are the part of the ensemble. Ensemble
defines the collection of all the curves that can be formed by the cases of random variables. The matlab
simulation in the fig. 4 shows describes the change in the node as if the node is taken as constant.
Case 2: Taking the case as if two pairs of nodes are selected at random and both pairs are allotted with the
functions of time as the signal keep varying with respect to time as x1 (t) and x2(t). The two functions
mentioned above are the sample functions which are the part of the ensemble. Ensemble defines the
collection of all the curves that can be formed by the cases of random variables. The matlab simulation in the
fig. 5 shows describes the change in the node as if the time is taken as constant.
Case 3: Taking the case as if two pairs of nodes are selected at random and both pairs are allotted with the
functions of time as the signal keep varying with respect to time and node as x1 (s, t) and x2(s, t). The two
functions mentioned above are the sample functions which are the part of the ensemble. Ensemble defines the
collection of all the curves that can be formed by the cases of random variables. The Matlab simulation in the
fig. 6 shows describes the change in the node as if the time is taken as constant.
IV. ALGORITHM :
Now the algorithm for the detection of the power failure for the signal flow in the square lattice. In the
previous n*n square lattice we have total
2 way to select the signal flow. The major problem occurs when
there is power failure then there will be loss of signal which may lead problem in order to solve this problem
an algorithm is made to detect the problem and solve it automatically. Let there is a problem in the
connection between the (xi, yi) and (xi, yi+1) node as instant power failure occurred in the region consisting
these nodes then the signal can’t travel through these nodes.
There are various cases defining the probability conditions. Such as
1. Selection of the nodes which are at the corners, probability of selecting those nodes are
2. Selection of selection of nodes from inside the n*n matrix. The probability of selecting the nodes
will be given as
There are two major aspect of the algorithm:
1. According to our algorithm each time a node receive a signal it provides a back copy to the previous
node as matter of reference that it had received the copy. This copy of received can be used at the
time of power failure or node connection failure for further connection.
2. Generally there are many ways through which the signal can be transferred form one node to
another but most efficient node is chosen for the transmission. Due to this there are many nodes left
empty which has the less power efficiency but can be used in the case of power failure. Our
algorithm describes the change in the signal flow from the failed node to the sub-node which can
lead the signal to the same destination.
Algorithm:
1. Selection Of Nodes.
2. If (Very Connected)
3. Energy On.
4. Signal Starts To Flow.
5. Storge Of Signal For Small Time.
6. Else (Not Very Connected) – Node Change.
7. Repeat Step 1 (Select Node).
8. Delay
9. Accessing The Stored Signal From Previous Node.
10. Energy Off.
11. End If.
One of the major specialties of this algorithm is it will automatically dialogize the problem and tries to solve
it. Also it gives the status of the problem at the destination by the mean of a delay at the destination as shown
in fig. 3
31
6. (Block Diagram of algorithm described) Fig. 3
As if there is no problem there won’t be any kind of delay introduced by the system and there will be a
normal process flow. But if there is a problem in the node failure or power failure then there will be delay in
the signal flow which leads to the delay in the streaming at the destination. By the means of this delay one
can easily find out that there is a problem in the nodes or power failure in that region.
But the major problem how to know the power failure diagnosis is through probability distribution functions.
We take a small model is taken into consideration and then this case is made to apply for large scale network.
We take the case of a random graph containing orign, then considering the expected value of this network
system when it will be large consisting infinite number of links. Let D0 be the connected component
containing the orign and denote the links by modulus of D0. Now taking this network to a large network we
take the mathematical Expectation value E (modulus of D0).
E( 0 )=
(
0 = n) eq.5.
The expected value is in the form of increasing function of probability p, and will be available as equal to
infinite when the value of probability goes to p = 1. Actually the value of P is a kind of threshold which is
used to decide whether there could be a condition of well-connected network. One more condition which
could be used for deciding the connection of network is the taking the set of infinite network and studying the
expectations of the different cases. Roughly speaking, there is a value of P T (T stands for Temperley) which
is a threshold value beyond which there is well-connected network. No doubt there is network connection
before achieving P T, but it is less and could let the signal to a loss stage. Our probability of selecting the path
is also including this PT for the selection of an efficient path.
The other problem which is generally faced by an adhoc sensor network is the power failure in the mid of the
signal flow due to the fault in the power supply. But this is the natural cause as the failure due the power
source is not in the hand of humans to solve. While the system could be made more efficient and fault proof,
there is always some probability to have the problems in the power source. To tackle this problem the
concepts of wireless energy transfer is used. This procedure gives us the method to use the energy in the form
of the wireless medium in order to give power to an individual sensor network. The concept will not only
reduce the probability of any power failure but also reduces the power requirement required for any sensor
network.
However the range of wireless power transmission is very less as according to the laws of electromagnetics a
less range is available for the transmission of energy wirelessly. This concept of wireless transmission of
energy is used.
In this algorithm the concept of energy transfer is present but it includes the trigger circuit which will make a
particular sensor network on only when some sought of signal has the tendency to flow through the nodes or
the sensor networks.
32
7. V. SIMULATIONS:
The simulation given in fig. 4 deals about the change of nodes with the function x(s) with respect to node.
The simulation in fig. 5 deals with the variation of sample function x(t) with respect to time.
This simulation given in fig. 6 deals about the changes in the random process signal as x(s, t) with respect to
time as the function also varies with respect to nodes and time.
The function A(s) here is taken as sin(s). Therefore the function which is making the nodes to vary with
respect to nodes is A(s). The simulation of fig. 7 deals with the changes of the signal function x(s) where the
function is changing with respect to node. The function is X(s) = sin (a*s) and a is varying with respect to the
nodes
VI. FUTURE RESEARCH:
This paper includes a lot of concepts of random graph theory which could be used for a lot of future research.
Also the paper includes the concept through which the node selection can be made power efficient. An
efficient algorithm is defined in the paper which could be used for the further research for the development of
the models in the field of wireless network sensing.
Change of nodes with the function of x(s))Fig. 4
(Diagram representing the variation of x(t)with respect to time)Fig.5.
VII. CONCLUSION
We have referred the concept of random graph theory for making an algorithm on wireless sensor network.
The model uses percolation theory, a kind of random graph where edges are formed only between the nearby
nodes. Several conditions regarding the use of probability distribution is involved for finding out the efficient
33
8. ways for the selection of the nodes form the network. The paper has also included power saving techniques in
the algorithm through which the network can be used for particular time and not all times. A lot of research
work can be done in this field through which the network transmission can be more made energy efficient.
(Diagram representing change of random process with respect to time)Fig. 6
(Diagram representing change in X(s) with respect to the nodes)Fig. 7
VIII. AKNOWLEDGEMENT:
The author would like to thank all his teachers specially Prof. Rupali Patil, Prof. Hetal Doshi, and Mr. Vicky
Chedda, Mr. Vinayak Ambekar etc for their enthusiastic help. Special thanks to Mr. Gautam M., Mr. Shubam
Jayawant etc. for their sincere help.
REFERENCES:
[1] Haruku Kawahigashi, Yoshiaki Terashima, Naoto Miyauchi, Tetsuo Nakakawaji, Modeling Ad hoc Sensor Networks
using Random Graph Theory, IEEE Transactions on Wireless Networks 0-7803-8784-8/04 (2004).
[2] I.F. Akyildiz, W.L.Su, Y. Sankarasubrmaniam, E. Caiyirci, A Survey on Sensor Networks, Communication
Magazine40(2002)102-114.
[3] I.F. Akyildiz, W.L.Su, Y. Sankarasubrmaniam, E. Caiyirci, Wireless Sensor Networks: A Survey , Computer
Networks 38 (2004) 40-46.
[4] J. Carl, D. Simplot-ryl, Energy-efficient area monitoring for sensor networks, Computer 37(2004) 40-46.
[5] M.J. Miller, N.H. Vaidya, Jiangchaun Lui, A MAC protocol to reduce sensor networks energy consumption using
wakeup radio, IEEE Transactions on mobile Computing 4(2005)228-242.
34
9. [6] Y.P. Chen, A.L. Liestman, Jiangchaun Lui, A hierarchial energy-efficient framework for data a aggregation in
wireless sensor networks, IEEE Transaction on Vehicular Technology 55(2006) 789-796.
[7] Seung Jun Baek, Gustava de Veciana, Xun Su, Minimizing energy Consumption in large-scale networks through
distributed data compression and hierarchical aggregation, IEEE Journal on selected Areas in Communications 22
(2004) 1130-1140.
[8] Hongo Luo, Jun Luo, Yonghe Liu, S.K. Das, Adaptive data fusion for energy consumption in large scale sensor
networks, IEEE Transactions on Computers 55 (2006) 1286-1299.
[9] D. Makowiec, P. Gnacinski, W. Miklaszewski, Amplified imitation in percolation model of stock market, Physic A
331(2004) 269-278.
[10] D. Stauffer, “Scaling Theory of Percolation Clusters” Physics Report, Vol. 54, 1978 pp 1-74.
[11] Yiping Chen , G. Paul, R. Cohen, S.Havlin, S.P.Borgatti, F. Lilijeros, H.E. Stanley, Percolation theory and
Fragmentation measures in social networks, Physic A 378(2007) 11-19.
[12] I. Glauche, W. Krause, R. Sollacher, ,.Greiner, Continuum percolation of wireless and communication networks,
Physic A 325(2002) 577-600.
[13] O. Dousse , F. Baccelli, P. Thiran, Impact of interferences on connectivity in ad hoc networks, IEEE Trnsactions on
Networking 13 (2005) 425-436.
[14] M. Franceschetti, O. Dousse, D.N.C. Tse, P.Thiran, Impact of interferences on connectivity in ad hoc networks,
IEEE Transactions on Information Theory 53 (2007)1009-1018.
[15] B. Krishnam chari, S. B. Wicker, B. Bejar, Phase Transition phenomena in wireless ad hoc networks. Global
Telecommunication Conference 5(2001) 2921-2925.
[16] Chien- Chung Shen, Zhuochan Haung, Chaiporn Jaikaeo, Directional Broadcast for mobile ad hoc networks, Global
Telecommunication Coference 5 (2001)2921-292.
[17] A.M. Vidales, Different percolation on a square lattice, Physic A 285 (2000) 259-266.5.
[18] R. Balescu, Stastical Dynamics, Imperial College Press, 1997.
[19] Li Ding, Zhi-Hong Guan, Modeling wireless sensor networks using random graph theory, Physic A 378(2008).
[20] C.Y. Chong, S.P. Kimar,”Sensor networks, Evolution, Opportunies, Challenges.” Proc. IEEE vol.91, no. 8, pp-12471256, Aug 2003.
35