Design Optimization of Energy and Delay Efficient Wireless Sensor Network with the help of Particle Swarm Optimization and Cluster based Least Spanning Tree Algorithm
This document describes a proposed approach to optimize energy efficiency and delay in wireless sensor networks using a combination of particle swarm optimization and cluster-based least spanning tree algorithms. It begins with background on challenges in wireless sensor networks related to limited energy resources. It then presents the system model, including the network and radio power models. The document goes on to describe particle swarm optimization and how it can be applied to set up energy-efficient clusters in each round. The goal is to select cluster heads that minimize a cost function balancing energy usage and delay.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...IJEEE
In Wireless Sensor Network, due to the
energy restriction of each nodes, efficient routing is very
important in order to save the energy of the hybrid
optimization technique. The results of new protocol i.e.
hybrid have been compared with EEPB and IEEPB.
Simulation results show that the lifetime of Hybrid is better
as compared to EEPB and IEEPB.
Performance Analysis of Distributed Spatial Multiplexing with Multi-hop Ampli...IJCSEA Journal
This paper describes a frame work investigating the performance of distributed spatial multiplexing (DSM) in cooperative multi-hop cellular networks. The cooperative communication in cellular networks gives us leverage to get the inherent advantages of its random relay locations and the direction of the data flow. However, traditional centralized relay selection needs considerable overhead and signaling. In our proposed work, threshold based relay selection is adopted based on the received signal strength (RSS) and Signal to Noise Ratio (SNR). The best relay chosen will transmit jointly with source using Amplify and forward (AF) protocol. The evaluation is performed with bit error rate (BER) and energy per bit for distributed spatial multiplexing scheme with multi-hop networking.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...IJEEE
In Wireless Sensor Network, due to the
energy restriction of each nodes, efficient routing is very
important in order to save the energy of the hybrid
optimization technique. The results of new protocol i.e.
hybrid have been compared with EEPB and IEEPB.
Simulation results show that the lifetime of Hybrid is better
as compared to EEPB and IEEPB.
Performance Analysis of Distributed Spatial Multiplexing with Multi-hop Ampli...IJCSEA Journal
This paper describes a frame work investigating the performance of distributed spatial multiplexing (DSM) in cooperative multi-hop cellular networks. The cooperative communication in cellular networks gives us leverage to get the inherent advantages of its random relay locations and the direction of the data flow. However, traditional centralized relay selection needs considerable overhead and signaling. In our proposed work, threshold based relay selection is adopted based on the received signal strength (RSS) and Signal to Noise Ratio (SNR). The best relay chosen will transmit jointly with source using Amplify and forward (AF) protocol. The evaluation is performed with bit error rate (BER) and energy per bit for distributed spatial multiplexing scheme with multi-hop networking.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Energy-Efficient Hybrid K-Means Algorithm for Clustered Wireless Sensor Netw...IJECEIAES
Energy efficiency is the most critical challenge in wireless sensor network. The transmission energy is the most consuming task in sensor nodes, specifically in large distances. Clustered routing techniques are efficient approaches used to lower the transmission energy and maximize the network’s lifetime. In this paper, a hybrid clustered routing approach is proposed for energy optimization in WSN. This approach is based on KMeans clustering algorithm and LEACH protocol. The simulation results using MATLAB tool have shown that the proposed hybrid approach outperforms LEACH protocol and optimizes the nodes energy and the network lifetime.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
Energy Performance of LDPC Scheme in Multi-Hop Wireless Sensor Network with T...IJECEIAES
Conservation of the energy is one of the main design issues in wireless sensor networks. The limited battery power of each sensor node is a challenging task in deploying this type of network. The challenge is crucial in reliable wireless network when implementing efficient error correcting scheme with energy consuming routing protocol. In this work, we investigated the energy performance of LDPC code in multi-hop wireless sensor network. We proposed a model of two base stations to prolong the lifetime and build a reliable and energy-efficient network. Through performed MATLAB simulations, we examine the energy effectiveness of multiple base stations model on reliable wireless sensor network performance in different network dimensions.
A review of Wireless Information and Power Transfer in Multiuser OFDM SystemsIJERA Editor
We study the resource allocation algorithm design for multiuser orthogonal frequency division multiplexing
(OFDM) downlink systems with simultaneous wireless information and power transfer. The algorithm design is
formulated as a non-convex optimization problem for maximizing the energy efficiency of data transmission
(bit/Joule delivered to the users). In particular, the problem formulation takes into account the minimum
required system data rate, heterogeneous minimum required power transfers to the users, and the circuit power
consumption. Subsequently, by exploiting the method of timesharing and the properties of nonlinear fractional
programming, the considered non-convex optimization problem is solved using an efficient iterative resource
allocation algorithm. Recently, simultaneous wireless information and power transfer (SWIPT) becomes
appealing by essentially providing a perpetual energy source for the wireless networks. For the TDMA-based
information transmission, we employ TS at the receivers; for the OFDMA-based information transmission, we
employ PS at the receivers. Under the above two scenarios, we address the problem of maximizing the weighted
sum-rate over all users by varying the time/frequency power allocation and either TS or PS ratio, subject to a
minimum harvested energy constraint on each user as well as a peak and/or total transmission power constraint.
COMPARISON OF ENERGY OPTIMIZATION CLUSTERING ALGORITHMS IN WIRELESS SENSOR NE...IJCSIT Journal
In recent years, Wireless Sensor Networks have gained growing attention from both the research community and actual users. As sensor nodes are generally battery-energized devices, so the network lifetime can be widespread to sensible times.
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
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.
In this paper, we consider one-way relay with energy harvesting system based on power beacon
(PB), in which the relay node harvests transmitted power from the PB station to forward signals to destination.
We also analyse the relay network model with amplify-and-forward (AF) protocol for information cooperation
and Power Splitting-based Relaying (PSR) protocol for power transfer. In particular, the outage probability
and optimal energy harvesting (EH) power splitting fraction of novel scheme in are presented. We obtain
analytical closed-form expression of optimal energy harvesting (EH) power splitting fraction to minimize the
outage probability of system. Using numerical and analytical simulations, the performances of different cases
are presented and discussed.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Throughput maximization in multiuser wireless powered communication network b...paperpublications3
Abstract: WPCN (wireless powered communication network) is the newly emerging network in which an access point called hybrid access point (HP) broadcast energy in the downlink and in the upper link wireless information transfer take place from sensors to hybrid access point. A protocol called “harvest-thentransmit” protocol is proposed where all users first harvest the wireless energy from the H-AP, in the downlink (DL) and then send their independent information to the HAP in the uplink (UL) by time-division-multiple-access (TDMA). A set of relay nodes used in the network enhances the over all throughput than sum throughput and common through hput. More energy efficient network can be got by using relay nodes. Simulation result showing the priority of the network that using relay nodes than other ordinary wireless sensor networks.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Energy-Efficient Hybrid K-Means Algorithm for Clustered Wireless Sensor Netw...IJECEIAES
Energy efficiency is the most critical challenge in wireless sensor network. The transmission energy is the most consuming task in sensor nodes, specifically in large distances. Clustered routing techniques are efficient approaches used to lower the transmission energy and maximize the network’s lifetime. In this paper, a hybrid clustered routing approach is proposed for energy optimization in WSN. This approach is based on KMeans clustering algorithm and LEACH protocol. The simulation results using MATLAB tool have shown that the proposed hybrid approach outperforms LEACH protocol and optimizes the nodes energy and the network lifetime.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
Energy Performance of LDPC Scheme in Multi-Hop Wireless Sensor Network with T...IJECEIAES
Conservation of the energy is one of the main design issues in wireless sensor networks. The limited battery power of each sensor node is a challenging task in deploying this type of network. The challenge is crucial in reliable wireless network when implementing efficient error correcting scheme with energy consuming routing protocol. In this work, we investigated the energy performance of LDPC code in multi-hop wireless sensor network. We proposed a model of two base stations to prolong the lifetime and build a reliable and energy-efficient network. Through performed MATLAB simulations, we examine the energy effectiveness of multiple base stations model on reliable wireless sensor network performance in different network dimensions.
A review of Wireless Information and Power Transfer in Multiuser OFDM SystemsIJERA Editor
We study the resource allocation algorithm design for multiuser orthogonal frequency division multiplexing
(OFDM) downlink systems with simultaneous wireless information and power transfer. The algorithm design is
formulated as a non-convex optimization problem for maximizing the energy efficiency of data transmission
(bit/Joule delivered to the users). In particular, the problem formulation takes into account the minimum
required system data rate, heterogeneous minimum required power transfers to the users, and the circuit power
consumption. Subsequently, by exploiting the method of timesharing and the properties of nonlinear fractional
programming, the considered non-convex optimization problem is solved using an efficient iterative resource
allocation algorithm. Recently, simultaneous wireless information and power transfer (SWIPT) becomes
appealing by essentially providing a perpetual energy source for the wireless networks. For the TDMA-based
information transmission, we employ TS at the receivers; for the OFDMA-based information transmission, we
employ PS at the receivers. Under the above two scenarios, we address the problem of maximizing the weighted
sum-rate over all users by varying the time/frequency power allocation and either TS or PS ratio, subject to a
minimum harvested energy constraint on each user as well as a peak and/or total transmission power constraint.
COMPARISON OF ENERGY OPTIMIZATION CLUSTERING ALGORITHMS IN WIRELESS SENSOR NE...IJCSIT Journal
In recent years, Wireless Sensor Networks have gained growing attention from both the research community and actual users. As sensor nodes are generally battery-energized devices, so the network lifetime can be widespread to sensible times.
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
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.
In this paper, we consider one-way relay with energy harvesting system based on power beacon
(PB), in which the relay node harvests transmitted power from the PB station to forward signals to destination.
We also analyse the relay network model with amplify-and-forward (AF) protocol for information cooperation
and Power Splitting-based Relaying (PSR) protocol for power transfer. In particular, the outage probability
and optimal energy harvesting (EH) power splitting fraction of novel scheme in are presented. We obtain
analytical closed-form expression of optimal energy harvesting (EH) power splitting fraction to minimize the
outage probability of system. Using numerical and analytical simulations, the performances of different cases
are presented and discussed.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Throughput maximization in multiuser wireless powered communication network b...paperpublications3
Abstract: WPCN (wireless powered communication network) is the newly emerging network in which an access point called hybrid access point (HP) broadcast energy in the downlink and in the upper link wireless information transfer take place from sensors to hybrid access point. A protocol called “harvest-thentransmit” protocol is proposed where all users first harvest the wireless energy from the H-AP, in the downlink (DL) and then send their independent information to the HAP in the uplink (UL) by time-division-multiple-access (TDMA). A set of relay nodes used in the network enhances the over all throughput than sum throughput and common through hput. More energy efficient network can be got by using relay nodes. Simulation result showing the priority of the network that using relay nodes than other ordinary wireless sensor networks.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Blow Mould Tool Design and Manufacturing Process for 1litre Pet BottleIOSR Journals
the concepts of Blow molding is a process used to produce hollow objects from thermoplastic. The
basic blow molding process has two fundamental phases. First, a parson (or a perform) of hot plastic resin in a
somewhat tubular shape is created. Second, compressed air is used to expand the hot perform and press it
against mould cavities. The pressure is held until the plastic cools. Blow molding process is used for which has
thin wall sections.In this thesis, blow mould design is to be done for a bottle having 0.5mm thickness. This
thickness cannot be filled in pressure injection molding. So blow molding is considered for pet bottle design.
The mould is prepared by first modeling the part, extracting core & cavity and generating CNC program. Blow
mould tool design is done in Pro/Engineer according to HASCO standards. A prototype of the pet bottle using
blow mould design is also included.
Implementation of XOR Based Pad Generation Mutual Authentication Protocol for...IOSR Journals
In RF link, without security the messages exchange between the two devices are monitoring by an
eavesdropper. So the exclusive-OR (XOR) based pad generation protocol is used to safely transfer the data to
the other point with necessary security and it maintaining confidentiality. This protocol produce the cover
coding pad to mask the access password before the datas are transmitted. A specially designed pad generation
will be implemented in digital domain to solve the insecurity problem in data communication RF link. This
protocol developed under regulation of ISO 18000 – 6 type C protocol also known as EPC C1G2 RFID
protocol. The linear feed back shift register (LFSR) generate the pseudo random binary sequence (PRBS) and it
is used as data source to the pad generation function. The Xilinx 13.x software is used for synthesize and
modelsim SE6.0 is used for simulating the result. The pad generation algorithm has been implemented in FPGA
Spartan 3 PQ208-4 board to verify the result
Comparative Study and Analysis of Image Inpainting TechniquesIOSR Journals
Abstract: Image inpainting is a technique to fill missing region or reconstruct damage area from an image.It
removes an undesirable object from an image in visually plausible way.For filling the part of image, it use
information from the neighboring area. In this dissertation work, we present a Examplar based method for
filling in the missing information in an image, which takes structure synthesis and texture sysnthesis together.
In exemplar based approach it used local information from an image to patch propagation.We have also
implement Nonlocal Mean approach for exemplar based image inpainting.In Nonlocal mean approach it find
multiple samples of best exemplar patches for patch propagation and weight their contribution according to
their similarity to the neighborhood under evaluation. We have further extended this algorithm by considering
collaborative filtering method to synthesize and propagate with multiple samples of best exemplar patches. We
have to preformed experiment on many images and found that our algorithm successfully inpaint the target
region.We have tested the accuracy of our algorithm by finding parameter like PSNR and compared PSNR
value for all three different approaches.
Keywords: Texture Synthesis, Structure Synthesis, Patch Propagation ,imageinpainting ,nonlocal approach,
collabrative filtering.
The Effects of Industrial Environment, Innovation, and Government Policy on B...IOSR Journals
This research aims to provide information about the effects of industrial environment on business performance, industrial environment on business performance with innovation as moderating variable, innovation on business performance and innovation on business performance with government policy as moderating variable. The population of this research is all small industries especially Tenun Songket Riau in Pekanbaru City, Bengkalis Sub District, and Siak Sub District, as many as 330 business units. Sampling method used is proportional sampling with total sample of 110 business units. Structural Equation Modeling (SEM) is used as data analysis and to be processed with AMOS 16 software. The findings of this study are as follows: (1) the more dynamic industrial environment results better business performance of small industry of Riau Songket Weaving; (2) the more dynamic industrial environment supports innovation capability and impacts better business performance of small industry of Riau Songket Weaving; (3) the higher innovation capability of the business results better business performance of small industry of Riau Songket Weaving, and (4) the higher innovation capability and to be supported by conducive government policy impacts better business performance of small industry of Riau Songket Weaving.
Development Of Public Administration Program Development System in Rural Serv...IOSR Journals
This study aims to, knowing what aspects can be developed to increase the service capacity of village government, knowing the role of village and community in carrying out the functions and enhanced customer service and public administration, the factors that affect the improvement of rural public administration system to improve service capacity of village government, get a picture of the service capacity building and development of public administration system at the level of village government. The target to be achieved is to increase public administration system in the country so as to improve the capacity of government services to the rural community.From the study of theory, analysis and discussion on the findings of the field, it was found that the embodiment of the village administration, particularly on the object of research is still not optimal. Not optimal realization of the village administration, mainly reflected in: Still unclear performance standards that can be measured to determine the quality of the resulting output.
Study On Traffic Conlict At Unsignalized Intersection In Malaysia IOSR Journals
The research conducted is traffic conflict at unsignalized intersections . The purpose of this research
is to study accident data used as an identification of hazardous location leads to less accurate countermeasures.
It is because accidents are not always reported especially accident involving damage only and this situation can
reduce good comparative analysis. To overcome these lacks of accident data, many ways of employing nonaccident
data have been suggested. One of the ways using non-accident data is traffic conflicts, which is defined
as critical incidents not necessarily involving collisions. The traffic conflict technique was originally set up to
provide more reliable data and information of traffic problems at intersections which actually would replace the
unclear and incomplete recorded data accident. The conflict study was done at the selected unsignalized
intersection where types of traffic conflict can be identified and classified. Various road users involved in the
conflict at the unsignalized intersection were also observed. Then conflicts data captured were analyzed using
the computer program to observe for any conflicts at the intersections. The linear regression graph was used to
show the relationship between conflict and accident data where two different equations were derived from the
graph. This equation may be used to make a prediction for the relationship that might exist between those two
variables at another location.
Parametric Optimization of Single Cylinder Diesel Engine for Pyrolysis Oil an...IOSR Journals
Abstract: An experimental study has been carried out for pyrolysis oil blended with diesel used in single
cylinder diesel engine. Pyrolysis oil is obtained from tire waste by pyrolysis process. Pyrolysis process is a
thermo-chemical decomposition of organic matter in absence of oxygen. Blending of pyrolysis oil with diesel in
maximum possible proportion helps to reduce the consumption of diesel fuel. In this study, the effects of
parameters i.e. injection timing, injection pressure, compression ratio, and load are taken as variable for
optimization. As the experiment required simultaneously optimization of four parameters with five levels,
taguchi method of optimization is used in this experiment. The results of the taguchi experiment identifies that
220 injection timing, injection pressure 200 bar, compression ratio 16 and engine load 20kg are optimum
parameter setting for lowest break specific fuel consumption. Engine performance is mostly influenced by
engine load and is least influenced by Compression ratio.
Keyword: Pyrolysis oil, SFC, Taguchi Analysis, CI engine, Diesel
The Effect Service Quality to Customer Satisfaction and Customer Loyalty of A...IOSR Journals
Customer Loyalty is important for cultivated by the company, therefore the aim of this study to prove
how the effect of Service Quality and Customer Satisfaction in enhancing Customer Loyalty. Samples were
service users Railway Transport Argo Bromo Anggrek Jakarta Surabaya by using purposive side. Sample size of
300 respondents. Data analysis using Structural Equation Model (SEM). The results showed that Services
Quality significantly influence to customer satisfaction. Customer Satisfaction significant effect on Customer
Loyalty. Service Quality is not yet significant effect on Customer Loyalty, so that Customer Satisfaction is a
mediator of the relationship Service Quality on Customer Loyalty to PT Argo Bromo Anggrek Train Jakarta-
Surabaya. The implications that Customer Satisfaction is capable of mediating the quality of care in improving
Customer Loyalty.
Experimental Evaluation of the Effect of Thread Angle on the Fatigue Life of ...IOSR Journals
Abstract : The present work is concerned with fatigue strength, obtained by plotting the S-N Curves for
determining the fatigue life of various thread geometries of bolts under cyclic loading. The stress equations
obtained from Majzoobi are being used for calculations of core stress produced due to cyclic loading,
which is being carried usually by the first thread of the bolt. The higher stress concentration occurs in the root
of first threads.The experimental work has been carried out for five different thread profiles of varying flank
angles, having six samples of each profile. The fatigue testing on each profile has been performed under cyclic
loading, in order to obtain the number of cycles to failure of a particular specimen. The results obtained
experimentally have been compared with the work of Gane . Finally the work is used to obtain the failure life of
bolts, which means which thread profile has higher fatigue life or simply higher strength to failure. As strength
is of direct use to the designer regarding the safety of structures.
Similar to Design Optimization of Energy and Delay Efficient Wireless Sensor Network with the help of Particle Swarm Optimization and Cluster based Least Spanning Tree Algorithm
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
Energy efficient load balanced routing protocol for wireless sensor networkscsandit
Telecommunications is increasingly vital to the society at large, and has become essential to
business, academic, as well as social activities. Due to the necessity to have access to
telecommunications, the deployment requires regulations and policy. Otherwise, the deployment
of the infrastructures would contribute to environment, and human complexities rather than
ease of use.
However, the formulation of telecommunication infrastructure deployment regulation and
policy involve agents such as people and processes. The roles of the agents are critical, and are
not as easy as it meant to belief. This could be attributed to different factors, as they produce
and reproduce themselves overtime.
This paper presents the result of a study which focused on the roles of agents in the formulation
of telecommunication infrastructures deployment regulation and policy. In the study, the
interactions that take place amongst human and non-human agents were investigated. The study
employed the duality of structure, of Structuration theory as lens to understand the effectiveness
of interactions in the formulation of regulations, and how policy is used to facilitate the
deployment of telecommunications infrastructure in the South African environment.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Mimo and cooperative mimo comparison in energy constrained wireless sensor ne...eSAT Journals
Abstract In Wireless Sensor Network commonly referred as WSN, the hubs or nodes are operated by batteries so that the energy utilization should be diminished, while fulfilling the given throughput and given requirement. The paper studies about the performance and energy consumption of cooperative MIMO and MIMO (multi input multi output) based communication. The average energy usage comprises circuit energy and transmission energy consumption. The comparison between the multi-input- multi-output (MIMO) and cooperative MIMO techniques help us to choose the best scheme for energy constrained wireless sensor network application. The simulation result shows that energy efficiency of MIMO (multi-input-multi-output) and SISO (single-input-single-output) is better for longer distances and thud increase the system life time. Keywords: Cooperative MIMO, MISO, SISO, SIMO, wireless sensor network, energy efficiency, BER performance
Prolong Lifetime Analysis and Efficient Utilization of Energy in Heterogeneou...IJTET Journal
Abstract - The clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs). The evaluation is based on two new clustering-based protocols, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP) [1]. In S-EECP, the cluster heads (CHs) are elected by a weighted probability [2] based on the ratio between average energy of the network and residual energy of each node. The nodes having more initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy. In M-EECP, the election of CHs is same as S-EECP, but the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyze the network lifetime three types of sensor nodes equipped with different battery energy are assumed. By analyzing these parameters, M-EECP achieves load balance among the CHs better than the existing clustering protocols and gives prolong network lifetime. Here the simulation is based on ns-2 simulator.
Energy Efficient Clustering and Routing in Mobile Wireless Sensor Networkijwmn
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing
as the sensor nodes have scarce energy resource. The nodes’ mobility in MWSN poses a challenge to
design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the
organization complexity overhead of the network which is proportional to the number of nodes in the
network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering
technique. A node is selected as cluster head if it has high surplus energy, better transmission range and
least mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy
estimation technique incorporated in this algorithm improves the energy performance during routing.
Simulation results can show that the proposed clustering and routing algorithm can scale well in dynamic
and energy deficient mobile sensor network.
Scalability Aware Energy Consumption and Dissipation Models for Wireless Sens...IJECEIAES
Most of Wireless Sensor Networks researches focus on reducing the amount of energy consumed by nodes and network to increase the network lifetime. Thus, several papers have been presented and published to optimize energy consumption in each area of WSNs, such as routing, localization, coverage, security, etc. To test and evaluate their propositions, authors apply an energy dissipation model; this model must be more realistic and suitable to give good results. In this paper we present a general preview on different sources of energy consumption in wireless sensor networks, and provide a comparative study between two energy models used in WSNs that offer an effective and an adequate tool for researchers.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And
from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period.
Similar to Design Optimization of Energy and Delay Efficient Wireless Sensor Network with the help of Particle Swarm Optimization and Cluster based Least Spanning Tree Algorithm (20)
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Water Industry Process Automation and Control Monthly - May 2024.pdf
Design Optimization of Energy and Delay Efficient Wireless Sensor Network with the help of Particle Swarm Optimization and Cluster based Least Spanning Tree Algorithm
1. IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 6, Issue 6 (Jul. - Aug. 2013), PP 29-36
www.iosrjournals.org
www.iosrjournals.org 29 | Page
Design Optimization of Energy and Delay Efficient Wireless
Sensor Network with the help of Particle Swarm Optimization
and Cluster based Least Spanning Tree Algorithm
Satyesh Sharan Singh1
, Mukesh Kumar2
, A.K. Jaiswal3
, Rohini Saxena4
, Priya5
1,5
PG Student ECE, SHIATS (Deemed-to-be-university), U.P., India
3
Professor & HOD, ECE, SHIATS (Deemed-to-be-university), U.P., India
2,4
Assistant professor, ECE, SHIATS (Deemed-to-be-university), U.P., India
Abstract: In WSN sensors are randomly deployed in the sensor field which brings the coverage problem and
limited energy resources. Hence energy and coverage problem are very scarce resources for such sensor
systems and has to be managed wisely in order to extend the life of the sensors and maximizing coverage for the
duration of a particular mission. In past a lot of cluster based algorithm and techniques were used. In this
paper we propose combination of PSO based algorithm and cluster based Least Spanning Tree algorithm,
which are very effective alone for WSN, and we also obtain life of sensor node and data transmission by LST
based PSO algorithm. These techniques effectively overcome the problems of low energy and coverage of
sensor range.
Keywords: Energy efficient clustering, Least Spanning Tree algorithm, PSO algorithm, Wireless Sensor
Networks.
I. Introduction
Advances in sensor technology, low-power electronics, and low-power radio frequency (RF) design
have enabled the development of small, relatively inexpensive and low-power sensors, called micro sensors [4]
which can be connected via a wireless network. These wireless micro sensor networks represent a new
paradigm for extracting data from the environment and enable the reliable monitoring of a variety of
environments for applications that include surveillance, machine failure diagnosis, and chemical/biological
detection. An important challenge in the design of these networks is that two key resources (communication
bandwidth and energy) are significantly more limited than in a tethered network environment. These constraints
require innovative design techniques to use the available bandwidth and energy efficiently. Energy usage is an
important issue in the design of WSNs which typically depends on portable energy sources like batteries for
power .WSNs is large scale networks of small embedded devices, each with sensing, computation and
communication capabilities. They have been widely discussed in recent years. Micro-Electro-Mechanical
System [MEMS][3] sensor technology has facilitated the development of smart sensors, these smart sensors
nodes are small devices with limited power, processing and computation resources. Smart sensors are power
constrained devices that have one or more sensors, memory unit, processor, power supply and actuator. In
WSNs, sensor nodes have constrained in term of processing power, communication bandwidth, and storage
space which required very efficient resource utilization. In WSNs the sensor nodes are often grouped into
individual disjoint sets called a cluster, clustering is used in WSNs, as it provides network scalability, resource
sharing and efficient use of constrained resources that gives network topology stability and energy saving
attributes. Clustering schemes offer reduced communication overheads, and efficient resource allocations thus
decreasing the overall energy consumption and reducing the interferences among sensor nodes. A large number
of clusters will congest the area with small size clusters and a very small number of clusters will exhaust the
cluster head with large amount of messages transmitted from cluster members.
II. Background
There are various algorithms which are used for the energy efficiency of wireless sensor network
which are improved time to time by different authors; some important and useful algorithms are shown in figure
1.1.
2. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 30 | Page
Figure.1.1 Different types of algorithm
III. The System Model
For making of an effective system we make a model which contains all prospects of the system and
also it executable. So the system model of an energy and delay efficient wireless sensor network is given
bellow:
A. Network Model
We adopt a wireless sensor architecture or model which is similar to use in the LEACH protocol with
the following properties:
Each node performs sensing tasks periodically and always has tendency to send data to the base
station.
A fixed base station can be located inside or outside the network sensor fields.
All nodes are stationary and energy constrained.
The nodes have power control capabilities to vary their transmitted power.
All nodes are capable of operating in cluster head mode and sensing mode.
Data fusion is used to reduce the total data message sent.
B. Radio Power Model and Characteristic Distance
For a simplified power model of radio communication, the energy consumed per second in
Transmission is[6]:
𝐸𝑡 = 𝑒𝑡 + 𝑒 𝑑 𝑟 𝑛
𝐵 … … … … … … … … … … . . … … . (1)
Where et is the energy/bit consumed by the transmitter electronics (including energy costs of imperfect
duty cycling due to finite startup time), and ed accounts for energy dissipated in the transmit op-amp (including
op-amp inefficiencies). Both et and ed are properties of the transceiver used by the nodes, r is the transmission
range used. The parameter n is the power index for the channel path loss of the antenna. This factor depends on
the RF environment and is generally between 2 and 4. B is the bit rate of the radio and is a fixed parameter in
our study.
On the receiving side, a fixed amount of power is required to capture the incoming radio signal[6]:
𝐸𝑟 = 𝑒𝑟 𝐵 … … … … … … … … … … … … … … … … … . . (2)
For currently available radio transceivers are et =50x10-9 J/bit, 𝑒𝑟 =50x10-9 J/bit, ed =100x10-12
J/bit/m2 (for n=2) and B=1Mbit/s. Since the path loss of radio transmission scales with distance in a greater-
than-linear fashion, the transmission energy can be reduced by dividing a long path into several shorter ones.
However, if the number of intermediate nodes is very large then the energy consumption per node is dominated
by the term et in equation (1) and the receiving energy consumption hence an optimum exists. Intermediate
nodes between a data source and destination can serve as relays that receive and rebroadcast data. Let us
consider multi-hop communication in a finite one dimensional network from the source to the base station
Clustering
Algorithm
Grid-schemes
PDCH
GROUP
PEGASIS
PSO based
PSO-C
PSO
CLUSTERIN
G
Least
Spanning
tree based
Miscellaneous
PEZCA
CACC
BARC
Housedroff
Clustering
Hierarchical
based
LEACH & Its
Descendant
EECS
HEED
EEUC
3. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 31 | Page
across a distance d using k hops. The source at x=d will generate traffic of A Erlang, so that each intermediate
node receives and transmits the same traffic, A. The routing nodes are assumed to be regularly spaced and to
consume no energy while idle. The power consumed by this communication is then simply the sum of the
transmit and receive energies multiplied by the effective bit rate, BA, and is given by
𝑃 = (𝑒𝑡 + 𝑒 𝑑 𝑟𝑖
𝑛
+ 𝑒𝑟)𝐵𝐴
𝑘
𝑖=1
… … … … … … … … … … (3)
𝑑 = 𝑟𝑖
𝑘
𝑖=1
… … … … … … … … … … … … … … … … … … . . (4)
In order to minimize P we note that it is strictly convex and use Jensen‟s inequality. Given d and k then
P is minimized when all the hop distances 𝑟𝑖 are made equal to d/k. The minimum energy consumption for a
given distance d has either no intervening hops or 𝑘 𝑜𝑝𝑡 equidistant hops where 𝑘 𝑜𝑝𝑡 is always of,
𝑘 𝑜𝑝𝑡 =
𝑑
𝑑 𝑐 𝑎𝑟
.............................................................(5)
The distance𝑑 𝑐𝑎𝑟 , called the characteristic distance, is independent of d and is given by,
𝑑 𝑐𝑎𝑟 =
𝑒 𝑡+𝑒 𝑟
𝑒 𝑑(𝑛−1)
𝑛
..........................................................(6)
The characteristic distance depends only on the energy consumption of the hardware and the path loss
coefficient (i.e. it is independent of the traffic); dchar alone determines the optimal number of hops. For typical
COTS (commercial, off-the-shelf)-based sensor nodes, dchar is about 35 meters. The introductions of relay nodes
are clearly a balancing act between reduced transmission energy and increased receive energy. Hops that are too
short lead to excessive receive energy. Hops that are too long lead to excessive path loss. In between these
extremes is an optimum transmission distance that is the characteristic distance.
In the above section I have introduced a simple energy model in which no energy was consumed while
the node was idle. This led to a characteristic distance that was independent of traffic. We now include the idle
state energy and show how the characteristic distance is modified. On one hand a short range is preferred for
energy efficient data transmission as a result of the nonlinear path loss ratio. On the other hand more redundant
nodes can be put into the sleep state to prolong the network lifetime if a long range is used in the topology
management of sensor networks. If the transmission route is divided into k grids and only one node wakes up in
each grid as relay node, as in the GAF protocol, the total energy consumption per second by k hops is[7]
𝑃 = 𝑘(𝑒𝑟 𝐵𝐴 + 𝑒𝑡 𝐵𝐴 + 𝑒 𝑑 2
𝑑
𝑘
𝑛
𝐵𝐴 + 𝑐𝑒𝑟 1 − 2𝐴 𝐵. … … . (7)
The last term 𝑐𝑒𝑟 1 − 2𝐴 B in the equation (7) represents the energy consumption when the radio
neither receives nor transmits, i.e. it is in the idle state. The energy consumption in the idle state is
approximately equal to that in the receiving state, so that the parameter c is close to 1. Note that we are
currently assuming that nodes in the sleep state consume no energy. Also, we assume that the routing node in
each grid can be located anywhere within that section and so the radio range is now twice the grid size. The
energy efficient optimum size of the virtual grid can now be derived from equation (1.7) and is given by
𝑅 𝑜𝑝𝑡 =
𝑟𝑜𝑝𝑡
2 =
𝑒𝑡 + 𝑒𝑟 𝐴 + 𝑐𝑒𝑟 1 − 2𝐴
2 𝑛 𝐴(𝑛 − 1)𝑒 𝑑
𝑛
… … … (8)
We know the energy consumed at the cluster head is much larger than that at individual sensing node.
The reason is as follows: (1) the cluster-head needs to relay all the traffic of the cluster; (2) for each data unit,
the cluster-head needs to transmit longer distance due to transmission between clusters, while the sensing nodes
just transmit data inside the cluster. In view of this, let Ep and Ec be, respectively, the current energy and
clustering energy (Ec is fixed), after a period of time, the ith
cluster-head has transmits information n1 times and
has receives information n2 times before T1(suppose the energy of the ith
cluster-head is not lower than the
threshold and the information unit is A Erlang ) .the remainder energy of the ith
cluster-head at T1 is then simply
as the equation (9).
𝐸𝑝 𝑖 = 𝐸𝑝 𝑖 − 𝐸𝑟 𝑖, 𝑘 − 𝐸𝑟 𝑖, 𝑙 − 𝐸𝑐 × 𝑛𝑖
𝑛2
𝑖=1
𝑛1
𝑘=1
. . (9)
Where i, j, k respectively denote cluster-head, ni is the clustering time in cluster i before T1.
4. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 32 | Page
IV. Methodology
A. Particle Swarm Optimization[PSO]
PSO is originally attributed to Kennedy, Eberhart and Shi[1] and was first intended for simulating
social behavior, as a stylized representation of the movement of organisms in a bird flock or fish school. The
algorithm was simplified and it was observed to be performing optimization. The book by Kennedy and
Eberhart describes many philosophical aspects of PSO and swarm intelligence. An extensive survey of PSO
applications is made by Poli. In computer science, particle swarm optimization (PSO)[6] is a computational
method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given
measure of quality. PSO optimizes a problem by having a population of candidate solutions, here
dubbed particles, and moving these particles around in the search-space according to simple mathematical
formulae over the particle's position and velocity. Each particle's movement is influenced by its local best
known position and is also guided toward the best known positions in the search-space, which are updated as
better positions are found by other particles. This is expected to move the swarm toward the best solutions.
The PSO [6] algorithm is an evolutionary computing technique, modeled after the social behaviour of a
flock of birds. In the context of PSO, a swarm refers to a number of potential solutions to the optimization
problem, where each potential solution is referred to as a particle. The aim of the PSO is to find the particle
position that results in the best evaluation of a given fitness function. In the initialization process of PSO, each
particle is given initial parameters randomly and is „flown‟ through the multi-dimensional search space. During
each generation, each particle uses the information about its previous best individual position and global best
position to maximize the probability of moving towards a better solution space that will result in a better fitness.
When a fitness better than the individual best fitness is found, it will be used to replace the individual best
fitness and update its candidate solution according to the following equations [1]:
𝑣𝑖𝑑 𝑡 = 𝑤 × 𝑣𝑖𝑑 𝑡 − 1 + 𝑐1 ∅1 𝑝𝑖𝑑 − 𝑥𝑖𝑑 𝑡 − 1 + 𝑐2 ∅2(𝑝 𝑔𝑑 − 𝑥 𝑔𝑑 𝑡 − 1 ) ………... (10)
Table 1 summarizes the variables in (1).
Table 1: List of variables used in PSO equations:-
v The particle velocity
x The particle position
t Time
C1,C2 Learning factor
Φ1,Φ2 Random numbers between 0 and 1
pid Particle‟s best position
pgd Global best position
w Inertia weight
B. Particle Swarm Optimization Algorithm for Cluster Setup
The operation of our protocol is based on a centralized control algorithm that is implemented at the
base station, which is a node with a large amount of energy supply. The proposed protocol operates in rounds,
where each round begins with a setup phase at which clusters are formed. This is followed by a steady state
phase in which we used a similar approach as in. At the starting of each setup phase, all nodes send information
about their current energy status and locations to the base station. Based on this information, the base station
computes the average energy level of all nodes. To ensure that only nodes with a sufficient energy are selected
as cluster heads, the nodes with an energy level above the average are eligible to be a cluster head candidate for
this round. Next, the base station runs the PSO algorithm to determine the best K cluster heads that can
minimize the cost function, as defined by:
cos 𝑡 = 𝛽 × 𝑓1 + (1 − 𝛽) × 𝑓2…………………... (11)
𝑓1 = 𝑚𝑎𝑥 𝑘=1,2,..,𝐾 𝑑∀𝑛 𝑖∈𝐶 𝑝,𝑘
(𝑛𝑖, 𝐶𝐻𝑝,𝑘 )/ 𝐶𝑝,𝑘 . ……………………..(12)
5. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 33 | Page
Figure 1.2 Flowchart of the PSO algorithm for cluster
setup
𝑓2 = 𝐸(𝑛𝑖)𝑁
𝑖=1 / (𝐶𝐻 𝑝,𝑘 )𝐾
𝑘=1 ………................ (13)
Where f1 is the maximum average Euclidean distance of nodes to their associated cluster heads and
Cp,k is the number of nodes that belong to cluster Ck of particle p. Function f2 is the ratio of total initial energy
of all nodes ni, i=1,2,…,N in the network with the total current energy of the cluster heads candidates in the
current round. The constant β is a user defined constant used to weigh the contribution of each of the sub-
objectives. The fitness function defined above has the objective of simultaneously minimizing the intra-cluster
distance between nodes and their cluster heads, as quantified by f1; and also of optimizing the energy efficiency
of the network as quantified by f2. According to the cost function defined above, a small value of f1and f2
suggests compact clusters with the optimum set of nodes that have sufficient energy to perform the cluster head
tasks. Fig. 1.2[1] shows the flowchart of PSO algorithm applied during the cluster setup phase. For a sensor
network with N nodes and K predetermined number of clusters, the network can be clustered as follows:
1. Initialize S particles to contain K randomly selected cluster heads among the eligible cluster head
candidates.
2. Evaluate the cost function of each particle:
i. For each node ni, i = 1,2,…,N
-Calculate distance d(ni,CHp,k) between node ni and all cluster heads CHp,k.
- Assign node ni to cluster head CHp,k where;
ii. Calculate the cost function using equations (2)to(3).
3. Find the personal and global best for each particle.
4. Update the particle‟s velocity and position using (1).
5. Limit the change in the particle‟s position value.
6. Map the new updated position with the closest (x,y) coordinates.
7. Repeat steps 2 to 6 until the maximum number of iterations is reached.
C. Least spanning tree[2]
The minimum spanning tree is a tree of a planar graph. Each edge is labelled with its weight, which
here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a
sub graph that is a tree and connects all the vertices together. A single graph can have many different spanning
6. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 34 | Page
trees. We can also assign a weight to each edge, which is a number representing how unfavourable it is, and use
this to assign a weight to a spanning tree by computing the sum of the weights of the edges in that spanning
tree. A least spanning tree (LST) or minimum weight spanning tree is then a spanning tree with weight less than
or equal to the weight of every other spanning tree. More generally, any undirected graph (not necessarily
connected) has a minimum spanning forest, which is a union of minimum spanning trees for its connected
components. A spanning tree for that graph would be a subset of those paths that has no cycles but still connects
to every house. There might be several spanning trees possible. A minimum spanning tree would be one with
the lowest total cost
D. Constructing least spanning tree[2]
By Eq(9),we can compute the remainder energy, if Ep(i) is lower than Ev, then modify the information
table of the ith
cluster-head: set flag=0; broadcast information to its children, also inform the neighbour jth
cluster-head doesn‟t transmits information to it, and let ith
cluster-head i is in the sleeping state; else the ith
cluster-head may go along the next clustering or transmitting or receiving. According to Prim algorithm,
suppose undirected graph G (V, E, D), where V is the set of cluster-heads and the number is N, E is the set of
connections of cluster-head, and D is the distance of cluster-heads, the process of constructing least spanning
tree as illustrated below:
• Initialization: V1=Sink, E′=null, and V2=V-V1.
• Select a edge: which has minimum distance from Sink to one cluster-head (suppose is Vi), where Vi is directly
connected with Sink, then set, V1= {Sink, Vi}, E ′= {(Sink, Vi)}, V2=V2-V1.
• For each cluster-head Vk in V1 do :select a minimum distance d(k,j),which Vk ЄV1,Vj Є V2 and E′=(Vk, Vj) Є
E , but Vk is not Є E′, then V1=V1 Є Vj, E′={(Vk, Vj)} Є E′, V2=V2-Vj.
• If V2 is empty then end, else go to above.
The deployment of node by least spanning tree is shown in the figure 1.3(a & b).In this deployment we take one
cluster which is nearer to the sink. Now by MAC protocol we find out the weightege of different edge(path
distance). And make an incident matrix which shows the direction of data flow from node to node.
Figure 1.3(a) deployment of sensor node Figure 1.3 (b). Least spanning tree graph.
Now we apply least spanning tree algorithm and we get shortest path from each node to the node „A‟,
which is the nearest cluster head of the network from the sink. The least spanning tree graph is shown in the
figure 1.3 (b).
7. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 35 | Page
V. Results
The performance of the proposed protocol is evaluated using Matlab. We ran the simulations for 100
Figure1.4: Power consume by per node per hop over range parameter
nodes in a 100m x 100m network area with unequal initial energy of nodes to show the effect of the different
nodes‟ energy in the network. In figure 1.4 shows the calculated value of energy consumed by per node per hop
over the distance from the node. So we find out that with PSO clustering the power consumption is very less. In
figure 1.5 the lifetime of the node over high traffic is high in the PSO algorithm. in our proposed model it gives
approximately 4000 seconds per node over full traffic
Figure 1.5 Lifetime of node over traffic parameter
When we apply PSO algorithm for clustering and least spanning tree for data transmission then we get
many nodes live for long time when full traffic apply as shown in the figure 1.6.
0
0.02
0.04
0.06
0.08
0.1
0.12
0.14
0.16
0 25 100 225 400 625 900 1225160020252500
Powerconsumebypernodeperhop(J)
ri(meter square)
Power Vs Range Parameter(ri)
NC
WC
WLST
WPSO
0
1000
2000
3000
4000
5000
6000
7000
8000
0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
LifeTime(seconds)
Traffic Parameter α
Lifetime Vs Traffic Parameter
NC
WC
WLST
WPSO
8. Optimization and Design of Energy and Delay Efficient Wireless Sensor Network with the help of
www.iosrjournals.org 36 | Page
Figure 1.6 Number of node over time
VI. Conclusion
In this paper we have presented energy and delay-aware cluster based protocol for wireless sensor networks
using particle swarm optimization (PSO) algorithm and least spanning tree. Results from the simulations and
calculation indicate that the proposed protocol using PSO and least spanning tree algorithm give a higher
network lifetime and delivers more data to the base station compared to other protocol. Furthermore, the
proposed protocol produces better clustering by evenly allocating the cluster heads and the shortest path to the
communication throughout the sensor network area. Our future work includes the implementation of secure data
transmission by distributed manner in ad- hock WSN network with the help of PSO. Comparison with other
evolutionary optimization algorithm, such as Genetic Algorithm will also be made.
References
[1]. Priya, Satyesh Sharan Singh, Mukesh Kumar, Rohini Saxena “Energy And Time Delay Efficient Wireless Sensor Network By Least
Spanning Tree Algorithm: A Survey International Journal Of Engineering Research And Applications (IJERA) ISSN: 2248-9622
Www.Ijera.Com Vol. 3, Issue 1, January -February 2013, Pp.712-719.
[2]. SATYESH SHARAN SINGH* Et Al. "Application Of Particle Swarm Optimization For Energy Efficient Wireless Sensor
Network: A Survey".[IJESAT] International Journal Of Engineering Science & Advanced Technology ISSN: 2250–3676 Volume-
2, Issue-5, 1246 – 1250
[3]. J. Kennedy And R. C. Eberhart, “Particle Swarm Optimization, (1995),” IEEE International Conference On Neural Networks,
Vol.4, Pp. 1942-1948, Perth, Australia.
[4]. W. R Heinzelman, A. P Chandrakasan, And H. Balakrishnan,(2000), “Energyefficient Communication Protocol For Wireless
Microsensor Networks,” In Proceedings Of The 33rd Hawaii International Conference On System Sciences.
[5]. I. F. Akyilldiz, W. Su, Y. Sankarasubramaniam And E. Cayirci, (2002), “A Survey On Sensor Networks,” IEEE Communications
Magazine, Pp. 102−114.
[6]. W. B Heinzelman, A. P Chandrakasan, And H. Balakrishnan,(2002), “An Application-Specific Protocol Architecture For Wireless
Microsensor Networks,” IEEE Transactions On Wireless Communications, Vol. 1, No. 4, Pp. 660-70.
[7]. S. Lindsey, C. Raghavendra, And K. M Sivalingam,(2002), “Data Gathering Algorithms In Sensor Networks Using Energy
Metrics,” IEEE Transactions On Parallel And Distributed System, Vol. 13, No. 9, Pp. 924-935.
[8]. J. Tillet, R. Rao, And F. Sahin,(2002) “Cluster-Head Identification In Ad Hoc Sensor Networks Using Particle Swarm
Optimization,” IEEE International Conference On Personal Wireless Communications, Pp. 201-205.
[9]. S. D. Muruganathan, D. C. F. Ma, R. I. Bhasin, And A. O. Fapojuwo,(2005), “A Centralized Energy-Efficient Routing Protocol For
Wireless Sensor Networks,” IEEE Radio Communications, Pp. S8-S13.
[10]. S. Guru, S. Halgamuge And S. Fernando “Particle Swarm Optimizers For Cluster Formation In Wireless Sensor Networks”. In
IEEE International Conference On Sensor, 319–324.
[11]. N.M.A. Latiff, C.C. Tsimenidis, And B.S Sheriff(2008) “Energy-Aware Clustering For Wireless Sensor Networks Using Particle
Swarm Optimization”. In IEEE International Conference On Mobile Radio Communication, 1–5.
[12]. X. Co, H. Zhang, J. Shi, And G.Cui “Cluster Heads Election Analysis For Multi-Hop Wireless Sensor Networks Based On
Weighted Graph And Particle Swarm Optimization”. In IEEE Fourth International Conference On Computing, 7, 599–603.
[13]. Jason Tillett, Shanchieh Jay Yang, Raghuveer Rao And Ferat” Optimal Topologies For Wireless Sensor Networks”IEEE
International Conference On Personal Wireless Communication.
0
20
40
60
80
100
120
0 50 100 150 200 250 300 350 400 450 500 550 600
NomberofnodeLive
Time(Hour)
Node live over Time
NC
WC
WLST
WPSO