The document describes a proposed battery power scheduling policy using dynamic programming for mobile devices. It aims to optimize battery lifetime by maximizing the probability of battery cell recovery between transmissions. The policy determines the optimal allocation of power requests across battery cells to satisfy traffic bursts while allowing other cells to recover charge. Simulation results show the dynamic programming policy improves lifetime over existing round robin scheduling, especially for devices with high internal resistance where recovery effects are minimal. It also maintains low packet delays for devices with low resistance where recovery is significant.
IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM I...IJCNCJournal
One of the most important issues discussed in Wireless Sensor Networks (WSNs) is how to transfer information from nodes within the network to the base station and select the best possible route for transmission of this information, taking into account energy consumption for the network lifetime with
maximum reliability and security. Hence, it would be useful to provide a suitable method that would have the features mentioned. This paper uses an Ad-hoc On-demand Multipath Distance Vector (AOMDV) as a routing protocol. This protocol has high energy consumption due to its multipath. However, it is a big challenge if it can reduce AOMDV energy consumption. Therefore, clustering operations for nodes are of high priority to determine the head of clusters which LEACH protocol and fuzzy logic and Particle Swarm Optimization (PSO) algorithm are used for this purpose. Simulation results represent 5% improvement in energy consumption in a WSN compared to AOMDV method.
2.a survey on energy balanced clustering approach for homogenous sensor networkk srikanth
Energy consumption is one of the significant characteristic should be considered within designing of routing protocol. A one of major challenge is to improve the lifespan of network within designing of the homogenous sensor network. This paper deal with a new approach for homogenous sensor network. This method intended to balance the consumption of energy at member node as well as head node of cluster during the data transmission stage. The aim of the intended method to improve energy efficiency and lifespan of network.
Performance Evaluation of Consumed Energy-Type-Aware Routing (CETAR) For Wire...ijwmn
This work evaluates the performance of Consumed-Energy-Type-Aware Routing (CETAR) which incorporates the amount of energy consumed per type of operation for routing decision to extend the lifetime of the Wireless Sensor Networks (WSNs). CETAR makes routing decision using statistics of the energy consumed for each type of node activities including sensing, data processing, data transmission as a source node, and routing operations. In particular, CETAR encourages a node which seldom plays a role of source node as a routing node to preserve the energy of active source nodes to prolong the functionality of the WSNs. Extensive simulation study demonstrates that the lifetime of the Geographic and Energy Aware Routing (GEAR) can be significantly extended with CETAR. With its adaptability to deployed sensor node behaviors, the significance of CETAR to extend the lifetime of WSNs is clear.
International Journal of Engineering and Science Invention (IJESI)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.
Genetic-fuzzy based load balanced protocol for WSNsIJECEIAES
Recent advancement in wireless sensor networks primarily depends upon energy constraint. Clustering is the most effective energy-efficient technique to provide robust, fault-tolerant and also enhance network lifetime and coverage. Selection of optimal number of cluster heads and balancing the load of cluster heads are most challenging issues. Evolutionary based approach and soft computing approach are best suitable for counter the above problems rather than mathematical approach. In this paper we propose hybrid technique where Genetic algorithm is used for the selection of optimal number of cluster heads and their fitness value of chromosome to give optimal number of cluster head and minimizing the energy consumption is provided with the help of fuzzy logic approach. Finally cluster heads uses multi-hop routing based on A*(A-star) algorithm to send aggregated data to base station which additionally balance the load. Comparative study among LEACH, CHEF, LEACH-ERE, GAEEP shows that our proposed algorithm outperform in the area of total energy consumption with various rounds and network lifetime, number of node alive versus rounds and packet delivery or packet drop ratio over the rounds, also able to balances the load at cluster head.
Improvement of voltage profile for large scale power system using soft comput...TELKOMNIKA JOURNAL
In modern power system operation, control, and planning, reactive power as part of power system component is very important in order to supply electrical load such as an electric motor. However, the reactive current that flows from the generator to load demand can cause voltage drop and active power loss. Hence, it is essential to install a compensating device such as a shunt capacitor close to the load bus to improve the voltage profile and decrease the total power loss of transmission line system. This paper presents the application of a genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC)) to obtain the optimal size of the shunt capacitor where those capacitors are located on the critical bus. The effectiveness of the proposed technique is examined by utilizing Java-Madura-Bali (JAMALI) 500 kV power system grid as the test system. From the simulation results, the PSO and ABC algorithms are providing satisfactory results in obtaining the capacitor size and can reduce the total power loss of around 15.873 MW. Moreover, a different result is showed by the GA approach where the power loss in the JAMALI 500kV power grid can be compressed only up to 15.54 MW or 11.38% from the power system operation without a shunt capacitor. The three soft computing techniques could also maintain the voltage profile within 1.05 p.u and 0.95 p.u.
IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM I...IJCNCJournal
One of the most important issues discussed in Wireless Sensor Networks (WSNs) is how to transfer information from nodes within the network to the base station and select the best possible route for transmission of this information, taking into account energy consumption for the network lifetime with
maximum reliability and security. Hence, it would be useful to provide a suitable method that would have the features mentioned. This paper uses an Ad-hoc On-demand Multipath Distance Vector (AOMDV) as a routing protocol. This protocol has high energy consumption due to its multipath. However, it is a big challenge if it can reduce AOMDV energy consumption. Therefore, clustering operations for nodes are of high priority to determine the head of clusters which LEACH protocol and fuzzy logic and Particle Swarm Optimization (PSO) algorithm are used for this purpose. Simulation results represent 5% improvement in energy consumption in a WSN compared to AOMDV method.
2.a survey on energy balanced clustering approach for homogenous sensor networkk srikanth
Energy consumption is one of the significant characteristic should be considered within designing of routing protocol. A one of major challenge is to improve the lifespan of network within designing of the homogenous sensor network. This paper deal with a new approach for homogenous sensor network. This method intended to balance the consumption of energy at member node as well as head node of cluster during the data transmission stage. The aim of the intended method to improve energy efficiency and lifespan of network.
Performance Evaluation of Consumed Energy-Type-Aware Routing (CETAR) For Wire...ijwmn
This work evaluates the performance of Consumed-Energy-Type-Aware Routing (CETAR) which incorporates the amount of energy consumed per type of operation for routing decision to extend the lifetime of the Wireless Sensor Networks (WSNs). CETAR makes routing decision using statistics of the energy consumed for each type of node activities including sensing, data processing, data transmission as a source node, and routing operations. In particular, CETAR encourages a node which seldom plays a role of source node as a routing node to preserve the energy of active source nodes to prolong the functionality of the WSNs. Extensive simulation study demonstrates that the lifetime of the Geographic and Energy Aware Routing (GEAR) can be significantly extended with CETAR. With its adaptability to deployed sensor node behaviors, the significance of CETAR to extend the lifetime of WSNs is clear.
International Journal of Engineering and Science Invention (IJESI)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.
Genetic-fuzzy based load balanced protocol for WSNsIJECEIAES
Recent advancement in wireless sensor networks primarily depends upon energy constraint. Clustering is the most effective energy-efficient technique to provide robust, fault-tolerant and also enhance network lifetime and coverage. Selection of optimal number of cluster heads and balancing the load of cluster heads are most challenging issues. Evolutionary based approach and soft computing approach are best suitable for counter the above problems rather than mathematical approach. In this paper we propose hybrid technique where Genetic algorithm is used for the selection of optimal number of cluster heads and their fitness value of chromosome to give optimal number of cluster head and minimizing the energy consumption is provided with the help of fuzzy logic approach. Finally cluster heads uses multi-hop routing based on A*(A-star) algorithm to send aggregated data to base station which additionally balance the load. Comparative study among LEACH, CHEF, LEACH-ERE, GAEEP shows that our proposed algorithm outperform in the area of total energy consumption with various rounds and network lifetime, number of node alive versus rounds and packet delivery or packet drop ratio over the rounds, also able to balances the load at cluster head.
Improvement of voltage profile for large scale power system using soft comput...TELKOMNIKA JOURNAL
In modern power system operation, control, and planning, reactive power as part of power system component is very important in order to supply electrical load such as an electric motor. However, the reactive current that flows from the generator to load demand can cause voltage drop and active power loss. Hence, it is essential to install a compensating device such as a shunt capacitor close to the load bus to improve the voltage profile and decrease the total power loss of transmission line system. This paper presents the application of a genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC)) to obtain the optimal size of the shunt capacitor where those capacitors are located on the critical bus. The effectiveness of the proposed technique is examined by utilizing Java-Madura-Bali (JAMALI) 500 kV power system grid as the test system. From the simulation results, the PSO and ABC algorithms are providing satisfactory results in obtaining the capacitor size and can reduce the total power loss of around 15.873 MW. Moreover, a different result is showed by the GA approach where the power loss in the JAMALI 500kV power grid can be compressed only up to 15.54 MW or 11.38% from the power system operation without a shunt capacitor. The three soft computing techniques could also maintain the voltage profile within 1.05 p.u and 0.95 p.u.
ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOLijwmn
In Wireless Sensor Network, a large number of sensor nodes are deployed and they mainly consume energy
in transmitting data over long distances. Sensor nodes are battery powered and their energy is restricted.
Since the location of the sink is remote, considerable energy would be consumed if each node directly
transmits data to the base station. Aggregating data at the intermediate nodes and transmitting using multihops
aids in reducing energy consumption to a great extent. This paper proposes a hybrid protocol
“Energy efficient Grid and Tree based routing protocol” (EGT) in which the sensing area is divided into
grids. The nodes in the grid relay data to the cell leader which aggregates the data and transmits to the
sink using the constructed hop tree. Simulation results show that EGT performs better than LEACH.
G-DEEC: GATEWAY BASED MULTI-HOP DISTRIBUTED ENERGY EFFICIENT CLUSTERING PROTO...IJCI JOURNAL
Wireless sensor network is composed of hundreds and thousands of small wireless sensor nodes which
collect information by sensing the physical environment. The sensed data is processed and communicated
to other sensor nodes and finally to Base Station. So energy efficient routing to final destination called base
station is ongoing current requirement in wireless sensor networks. Here in this research paper we propose
a multi-hop DEEC routing scheme i.e. G-DEEC for heterogeneous networks where we deploy rechargeable
intermediate nodes called gateways in-between cluster head and base station for minimizing energy
consumption by sensor nodes in each processing round thereby increasing the network lifetime and
stability of wireless sensor networks unlike DEEC.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Evaluate the performance of K-Means and the fuzzy C-Means algorithms to forma...IJECEIAES
The clustering approach is considered as a vital method for wireless sensor networks (WSNs) by organizing the sensor nodes into specific clusters. Consequently, saving the energy and prolonging network lifetime which is totally dependent on the sensors battery, that is considered as a major challenge in the WSNs. Classification algorithms such as K-means (KM) and Fuzzy C-means (FCM), which are two of the most used algorithms in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces these algorithms to produce unbalanced clusters, which adversely affects the lifetime of the network. Based for our knowledge, there is no study has analyzed the performance of these algorithms in terms clusters construction in WSNs. In this study, we investigate in KM and FCM performance and which of them has better ability to construct balanced clusters, in order to enable the researchers to choose the appropriate algorithm for the purpose of improving network lifespan. In this study, we utilize new parameters to evaluate the performance of clusters formation in multi-scenarios. Simulation result shows that our FCM is more superior than KM by producing balanced clusters with the random distribution manner for sensor nodes.
Recent Developments in Routing Algorithms for Achieving Elongated Life in WSNijsrd.com
Battery life is a key issue for an elongated life in WSN. Clustering of nodes is done to achieve the energy conservation in LEACH algorithm. The main objectives of clustering are equal distribution of energy and equal distribution of nodes in space so that less energy is consumed and early deaths of nodes can be delayed. In LEACH both of these objectives can’t be achieved. Further Max-Energy LEACH is able to achieve energy equi-distribution but not the space equi-distribution because CH can be selected from one region only leading to large energy consumption by nodes to send data to CHs. The clustering algorithm while doing its work should pay attention toward the number of nodes a cluster is having. If we can equi-distribute all nodes to cluster then we assume that it may lead to better energy efficiency. This paper discusses the recent developments in WSN in this direction.
Transforming an Existing Distribution Network Into Autonomous MICRO-GRID usin...IJERA Editor
A distribution network with renewable and fossil-based resources can be operated as a micro-grid, in autonomous or nonautonomous modes. Autonomous operation of a distribution network requires cautious planning. In this context, a detailed methodology to develop a sustainable autonomous micro-grid is presented in this paper. The proposed methodology suggests novel sizing and siting strategies for distributed generators and structural modifications for autonomous micro-grids. This paper introduces the Particle Swarm Optimization (PSO) algorithm to solve the optimal network reconfiguration problem for power loss reduction. The PSO is a relatively new and powerful intelligence evolution method for solving optimization problems. It is a population-based approach. The PSO was inspired from natural behavior of the bees on how they find the location of most flowers. The proposed PSO algorithm is introduced with some modifications such as using an inertia weight that decreases linearly during the simulation. This setting allows the PSO to explore a large area at the start of the simulation.
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.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Small Signal Stability Improvement and Congestion Management Using PSO Based ...IDES Editor
In this paper an attempt has been made to study the
application of Thyristor Controlled Series Capacitor (TCSC)
to mitigate small signal stability problem in addition to
congestion management of a heavily loaded line in a
multimachine power system. The Flexible AC Transmission
System (FACTS) devices such as TCSC can be used to control
the power flows in the network and can help in improvement
of small signal stability aspect. It can also provide relief to
congestion in the heavily loaded line. However, the
performance of any FACTS device highly depends upon its
parameters and placement at suitable locations in the power
network. In this paper, Particle Swarm Optimization (PSO)
method has been used for determining the optimal locations
and parameters of the TCSC controller in order to damp small
signal oscillations. Transmission Line Flow (TLF) Sensitivity
method has been used for curtailment of non-firm load to
limit power flow congestion. The results of simulation reveals
that TCSC controllers, placed optimally, not only mitigate
small signal oscillations but they can also alleviate line flow
congestion effectively.
Maximum Loadability Enhancement with a Hybrid Optimization MethodjournalBEEI
Nowadays, a power system is operating in a stressed condition due to the increase in demand in addition to constraint in building new power plants. The economics and environmental constraints to build new power plants and transmission lines have led the system to operate very close to its stability limits. Hence, more researches are required to study the important requirements to maintain stable voltage condition and hence develop new techniques in order to address the voltage stability problem. As an action, most Reactive Power Planning (RPP) objective is to minimize the cost of new reactive resources while satisfying the voltage stability constraints and labeled as Secured Reactive Power Planning (SCRPP). The new alternative optimization technique called Adaptive Tumbling Bacterial Foraging (ATBFO) was introduced to solve the RPP problems in the IEEE 57 bus system. The comparison common optimization Meta-Heuristic Evolutionary Programming and original Bacterial Foraging techniques were chosen to verify the performance using the proposed ATBFO method. As a result, the ATBFO method is confirmed as the best suitable solution in solving the identified RPP objective functions.
Cost Allocation of Reactive Power Using Matrix Methodology in Transmission Ne...IJAAS Team
In the deregulated market environment as generation, transmission and distribution are separate entities; reactive power flow in transmission lines is a question of great importance. Due to inductive load characteristic, reactive power is inherently flowing in transmission line. Hence under restructured market this reactive power allocation is necessary. In this work authors presents a power flow tracing based allocation method for reactive power to loads. MVAr-mile method is used for allocation of reactive power cost. A sample 6 bus and IEEE 14 bus system is used for showing the feasibility of developed method.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOLijwmn
In Wireless Sensor Network, a large number of sensor nodes are deployed and they mainly consume energy
in transmitting data over long distances. Sensor nodes are battery powered and their energy is restricted.
Since the location of the sink is remote, considerable energy would be consumed if each node directly
transmits data to the base station. Aggregating data at the intermediate nodes and transmitting using multihops
aids in reducing energy consumption to a great extent. This paper proposes a hybrid protocol
“Energy efficient Grid and Tree based routing protocol” (EGT) in which the sensing area is divided into
grids. The nodes in the grid relay data to the cell leader which aggregates the data and transmits to the
sink using the constructed hop tree. Simulation results show that EGT performs better than LEACH.
G-DEEC: GATEWAY BASED MULTI-HOP DISTRIBUTED ENERGY EFFICIENT CLUSTERING PROTO...IJCI JOURNAL
Wireless sensor network is composed of hundreds and thousands of small wireless sensor nodes which
collect information by sensing the physical environment. The sensed data is processed and communicated
to other sensor nodes and finally to Base Station. So energy efficient routing to final destination called base
station is ongoing current requirement in wireless sensor networks. Here in this research paper we propose
a multi-hop DEEC routing scheme i.e. G-DEEC for heterogeneous networks where we deploy rechargeable
intermediate nodes called gateways in-between cluster head and base station for minimizing energy
consumption by sensor nodes in each processing round thereby increasing the network lifetime and
stability of wireless sensor networks unlike DEEC.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Evaluate the performance of K-Means and the fuzzy C-Means algorithms to forma...IJECEIAES
The clustering approach is considered as a vital method for wireless sensor networks (WSNs) by organizing the sensor nodes into specific clusters. Consequently, saving the energy and prolonging network lifetime which is totally dependent on the sensors battery, that is considered as a major challenge in the WSNs. Classification algorithms such as K-means (KM) and Fuzzy C-means (FCM), which are two of the most used algorithms in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces these algorithms to produce unbalanced clusters, which adversely affects the lifetime of the network. Based for our knowledge, there is no study has analyzed the performance of these algorithms in terms clusters construction in WSNs. In this study, we investigate in KM and FCM performance and which of them has better ability to construct balanced clusters, in order to enable the researchers to choose the appropriate algorithm for the purpose of improving network lifespan. In this study, we utilize new parameters to evaluate the performance of clusters formation in multi-scenarios. Simulation result shows that our FCM is more superior than KM by producing balanced clusters with the random distribution manner for sensor nodes.
Recent Developments in Routing Algorithms for Achieving Elongated Life in WSNijsrd.com
Battery life is a key issue for an elongated life in WSN. Clustering of nodes is done to achieve the energy conservation in LEACH algorithm. The main objectives of clustering are equal distribution of energy and equal distribution of nodes in space so that less energy is consumed and early deaths of nodes can be delayed. In LEACH both of these objectives can’t be achieved. Further Max-Energy LEACH is able to achieve energy equi-distribution but not the space equi-distribution because CH can be selected from one region only leading to large energy consumption by nodes to send data to CHs. The clustering algorithm while doing its work should pay attention toward the number of nodes a cluster is having. If we can equi-distribute all nodes to cluster then we assume that it may lead to better energy efficiency. This paper discusses the recent developments in WSN in this direction.
Transforming an Existing Distribution Network Into Autonomous MICRO-GRID usin...IJERA Editor
A distribution network with renewable and fossil-based resources can be operated as a micro-grid, in autonomous or nonautonomous modes. Autonomous operation of a distribution network requires cautious planning. In this context, a detailed methodology to develop a sustainable autonomous micro-grid is presented in this paper. The proposed methodology suggests novel sizing and siting strategies for distributed generators and structural modifications for autonomous micro-grids. This paper introduces the Particle Swarm Optimization (PSO) algorithm to solve the optimal network reconfiguration problem for power loss reduction. The PSO is a relatively new and powerful intelligence evolution method for solving optimization problems. It is a population-based approach. The PSO was inspired from natural behavior of the bees on how they find the location of most flowers. The proposed PSO algorithm is introduced with some modifications such as using an inertia weight that decreases linearly during the simulation. This setting allows the PSO to explore a large area at the start of the simulation.
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.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Small Signal Stability Improvement and Congestion Management Using PSO Based ...IDES Editor
In this paper an attempt has been made to study the
application of Thyristor Controlled Series Capacitor (TCSC)
to mitigate small signal stability problem in addition to
congestion management of a heavily loaded line in a
multimachine power system. The Flexible AC Transmission
System (FACTS) devices such as TCSC can be used to control
the power flows in the network and can help in improvement
of small signal stability aspect. It can also provide relief to
congestion in the heavily loaded line. However, the
performance of any FACTS device highly depends upon its
parameters and placement at suitable locations in the power
network. In this paper, Particle Swarm Optimization (PSO)
method has been used for determining the optimal locations
and parameters of the TCSC controller in order to damp small
signal oscillations. Transmission Line Flow (TLF) Sensitivity
method has been used for curtailment of non-firm load to
limit power flow congestion. The results of simulation reveals
that TCSC controllers, placed optimally, not only mitigate
small signal oscillations but they can also alleviate line flow
congestion effectively.
Maximum Loadability Enhancement with a Hybrid Optimization MethodjournalBEEI
Nowadays, a power system is operating in a stressed condition due to the increase in demand in addition to constraint in building new power plants. The economics and environmental constraints to build new power plants and transmission lines have led the system to operate very close to its stability limits. Hence, more researches are required to study the important requirements to maintain stable voltage condition and hence develop new techniques in order to address the voltage stability problem. As an action, most Reactive Power Planning (RPP) objective is to minimize the cost of new reactive resources while satisfying the voltage stability constraints and labeled as Secured Reactive Power Planning (SCRPP). The new alternative optimization technique called Adaptive Tumbling Bacterial Foraging (ATBFO) was introduced to solve the RPP problems in the IEEE 57 bus system. The comparison common optimization Meta-Heuristic Evolutionary Programming and original Bacterial Foraging techniques were chosen to verify the performance using the proposed ATBFO method. As a result, the ATBFO method is confirmed as the best suitable solution in solving the identified RPP objective functions.
Cost Allocation of Reactive Power Using Matrix Methodology in Transmission Ne...IJAAS Team
In the deregulated market environment as generation, transmission and distribution are separate entities; reactive power flow in transmission lines is a question of great importance. Due to inductive load characteristic, reactive power is inherently flowing in transmission line. Hence under restructured market this reactive power allocation is necessary. In this work authors presents a power flow tracing based allocation method for reactive power to loads. MVAr-mile method is used for allocation of reactive power cost. A sample 6 bus and IEEE 14 bus system is used for showing the feasibility of developed method.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
An in-depth study of the electrical characterization of supercapacitors for r...VIT-AP University
The Energy Storage System (ESS) is geared toward sophisticated systems with increased operating time for a variety of real-time applications such as an electric vehicle, a WSN (Wireless Sensor Network), a Capa bus, and so
on. Its primary focus is on supplying these kinds of systems with additional capacity in recent development, and
this will continue to be its primary focus. Because of their exceptionally high specific power, rapid charging, and
low ESR (Effective Series Resistance), electric double-layer (EDLC) capacitors or supercapacitors are encouraged
for use because they can be integrated more easily with battery technology that can be used in electric vehicles
and other electronic devices. The supercapacitor calls for a precise and accurate characterization in order to
facilitate the development of improved applications and more effective energy storage devices and technologies.
In this article, we studied various supercapacitor electrode components, electrolytic solutions, analogous circuit
models, electrical energy storage properties, and some real-time supercapacitor applications in the automotive,
manufacturing, construction, and consumer electronics industries. In addition, we have discussed on hybrid
material that was just recently developed with the goal of enhancing the conductivity and effectiveness of supercapacitors. Aside from this, we have discussed about the behaviour of supercapacitors in terms of how their behaviour is dependent on current and voltage with detailed analysis.
A battery charging system & appended zcs (pwm) resonant converter dc dc buck ...hunypink
This paper presents technique for battery charger to achieve efficient performance in charging shaping,
minimum low switching losses and reduction in circuit volume .The operation of circuit charger is switched
with the technique of zero-current-switching, resonant components and append the topology of dc-dc buck.
The proposed novel dc-dc battery charger has advantages with the simplicity, low cost, high efficiency and
with the behaviour of easy control under the ZCS condition accordingly reducing the switching losses. The
detailed study of operating principle and design consideration is performed. A short survey of battery
charging system, capacity demand & its topologies is also presented. In order to compute LC resonant pair
values in conventional converter, the method of characteristic curve is used and electric function equations
are derived from the prototype configuration. The efficient performance of charging shaping is confirmed
through the practical examines and verification of the results is revealed by the MATLAB simulation. The
efficiency is ensured about 89% which is substantially considered being satisfactory performance as
achieved in this paper.
Machine Learning Systems Based on xgBoost and MLP Neural Network Applied in S...aciijournal
In this work, the internal impedance of the lithium-ion battery pack (important measure
of the degradation level of the batteries) is estimated by means of machine learning systems
based on supervised learning techniques MLP - Multi Layer Perceptron - neural network and xgBoost
- Gradient Tree Boosting. Therefore, characteristics of the electric power system, in which
the battery pack is inserted, are extracted and used in the construction of supervised models
through the application of two different techniques based on Gradient Tree Boosting and Multi
Layer Perceptron neural network. Finally, with the application of statistical validation techniques,
the accuracy of both models are calculated and used for the comparison between them and the
feasibility analysis regarding the use of such models in real systems.
Machine learning systems based on xgBoost and MLP neural network applied in s...aciijournal
In this work, the internal impedance of the lithium-ion battery pack (important measure of the degradation level of the batteries) is estimated by means of machine learning systems based on supervised learning techniques MLP - Multi Layer Perceptron - neural network and xgBoost - Gradient Tree Boosting. Therefore, characteristics of the electric power system, in which the battery pack is inserted, are extracted and used in the construction of supervised models through the application of two different techniques based on Gradient Tree Boosting and Multi Layer Perceptron neural network. Finally, with the application of statistical validation techniques, the accuracy of both models are calculated and used for the comparison between them and the feasibility analysis regarding the use of such models in real systems.
Machine Learning Systems Based on xgBoost and MLP Neural Network Applied in S...aciijournal
In this work, the internal impedance of the lithium-ion battery pack (important measure of the degradation level of the batteries) is estimated by means of machine learning systems based on supervised learning techniques MLP - Multi Layer Perceptron - neural network and xgBoost - Gradient Tree Boosting. Therefore, characteristics of the electric power system, in which the battery pack is inserted, are extracted and used in the construction of supervised models through the application of two different techniques based on Gradient Tree Boosting and Multi Layer Perceptron neural network. Finally, with the application of statistical validation techniques, the accuracy of both models are calculated and used for the comparison between them and the feasibility analysis regarding the use of such models in real systems
Integration of Supercapacitor in Photovoltaic Energy Storage: Modelling and C...Asoka Technologies
Due to the variable characteristics of photovoltaic energy production or the variation of the load, batteries used in storage systems renewable power can undergo many irregular cycles of charge 1 discharge. In turn, this can also have a detrimental effect on the life of the battery and can increase project costs. This paper presents an embedded energy share method between the energy storage system (battery) and the auxiliary energy storage system such as supercapacitors (SC). Supercapacitors are used to improve batteries life and reduce their stresses by providing or absorbing peaks currents as demanded by the load. The photovoltaic cells are connected to DC bus with boost converter and controlled with MPPT algorithm, Supercapacitors and batteries are linked to the DC bus through the buck-boost converter. The inductive load is connected to the DC bus by a DC-AC converter. The static converters associated with batteries and supercapacitors are controlled by current. The components of the systems are supervised through a block of energy management. The complete model of the system is implemented in MATLAB/Simulink environment. Simulation results are given to show the performance of the proposed control strategy, for the overall system.
A robust state of charge estimation for multiple models of lead acid battery ...journalBEEI
An accurate estimation technique of the state of charge (SOC) of batteries is an essential task of the battery management system. The adaptive Kalman filter (AEKF) has been used as an obsever to investigate the SOC estimation effectiveness. Therefore, The SOC is a reflexion of the chemistry of the cell which it is the key parameter for the battery management system. It is very complex to monitor the SOC and control the internal states of the cell. Three battery models are proposed and their state space models have been established, their parameters were identified by applying the least square method. However, the SOC estimation accuracy of the battery depends on the model and the efficiency of the algorithm. In this paper, AEKF technique is presented to estimate the SOC of Lead acid battery. The experimental data is used to identify the parameters of the three models and used to build different open circuit voltage–state of charge (OCV-SOC) functions relationship. The results shows that the SOC estimation based-model which has been built by hight order RC model can effectively limit the error, hence guaranty the accuracy and robustness.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
Machine learning systems based on xgBoost and MLP neural network applied in s...aciijournal
. In this work, the internal impedance of the lithium-ion battery pack (important measure of the degradation level of the batteries) is estimated by means of machine learning systems
based on supervised learning techniques MLP - Multi Layer Perceptron - neural network and xgBoost - Gradient Tree Boosting. Therefore, characteristics of the electric power system, in which
the battery pack is inserted, are extracted and used in the construction of supervised models
through the application of two different techniques based on Gradient Tree Boosting and Multi
Layer Perceptron neural network. Finally, with the application of statistical validation techniques,
the accuracy of both models are calculated and used for the comparison between them and the feasibility analysis regarding the use of such models in real systems.
Machine Learning Systems Based on xgBoost and MLP Neural Network Applied in S...aciijournal
In this work, the internal impedance of the lithium-ion battery pack (important measure of the degradation level of the batteries) is estimated by means of machine learning systems
based on supervised learning techniques MLP - Multi Layer Perceptron - neural network and xgBoost - Gradient Tree Boosting. Therefore, characteristics of the electric power system, in which
the battery pack is inserted, are extracted and used in the construction of supervised models
through the application of two different techniques based on Gradient Tree Boosting and Multi
Layer Perceptron neural network. Finally, with the application of statistical validation techniques,
the accuracy of both models are calculated and used for the comparison between them and the
feasibility analysis regarding the use of such models in real systems.
Optimized Power Flows in Microgrid with and without Distributed Energy Storag...Power System Operation
This study presents a combined algebraic and power flow model of a microgrid. The aim of this study is to introduce a strong tool which is capable to compare physical parameters of a microgrid which are hardly possible to calculate only by common algebraic optimization methods. Especially interesting is comparison between microgrids without energy storage, with a single bigger battery plant and with distributed batteries. This study focuses mainly on high voltage (HV) part of a transformer, inductive power and power losses in microgrids. Modelled microgrid consists of five robust nodes (which can represent living quarters with renewable energy production and energy storage) connected into a single transformer node, which later leads to the transmission system.
ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFER...graphhoc
We compare the probability of k-Connectivity of an ad hoc network under Random Way Point (RWP),City Section and Manhattan mobility models. A Network is said to be k Connected if there exists at least k edge disjoint paths between any pair of nodes in that network at any given time and velocity. Initially, for each of the three mobility models, the movement of the each node in the ad hoc network at a given velocity and time are captured and stored in the Node Movement Database (NMDB). Using the movements in the NMDB, the location of the node at a given time is computed and stored in the Node
Location Database (NLDB).
The Impact of Data Replication on Job Scheduling Performance in Hierarchical ...graphhoc
In data-intensive applications data transfer is a primary cause of job execution delay. Data access time depends on bandwidth. The major bottleneck to supporting fast data access in Grids is the high latencies of Wide Area Networks and Internet. Effective scheduling can reduce the amount of data transferred across the internet by dispatching a job to where the needed data are present. Another solution is to use a data replication mechanism. Objective of dynamic replica strategies is reducing file access time which leads to reducing job runtime. In this paper we develop a job scheduling policy and a dynamic data replication strategy, called HRS (Hierarchical Replication Strategy), to improve the data access efficiencies. We study our approach and evaluate it through simulation. The results show that our algorithm has improved 12% over the current strategies
DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHSgraphhoc
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with
max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple
graph are discussed.
Impact of Mobility for Qos Based Secure Manet graphhoc
Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.
A Transmission Range Based Clustering Algorithm for Topology Control Manetgraphhoc
This paper presents a novel algorithm for clustering of nodes by transmission range based clustering (TRBC).This algorithm does topology management by the usage of coverage area of each node and power management based on mean transmission power within the context of wireless ad-hoc networks. By reducing the transmission range of the nodes, energy consumed by each node is decreased and topology is formed. A new algorithm is formulated that helps in reducing the system power consumption and prolonging the battery life of mobile nodes. Formation of cluster and selection of optimal cluster head and thus forming the optimal cluster taking weighted metrics like battery life, distance, position and mobility is done based on the factors such as node density, coverage area, contention index, required and current node degree of the nodes in the clusters
A Review of the Energy Efficient and Secure Multicast Routing Protocols for ...graphhoc
This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanisms.
Case Study On Social Engineering Techniques for Persuasion Full Text graphhoc
There are plenty of security software in market; each claiming the best, still we daily face problem of viruses and other malicious activities. If we know the basic working principal of such malware then we can very easily prevent most of them even without security software. Hackers and crackers are experts in psychology to manipulate people into giving them access or the information necessary to get access. This paper discusses the inner working of such attacks. Case study of Spyware is provided. In this case study, we got 100% success using social engineering techniques for deception on Linux operating system, which is considered as the most secure operating system. Few basic principal of defend, for the individual as well as for the organization, are discussed here, which will prevent most of such attack if followed.
Breaking the Legend: Maxmin Fairness notion is no longer effective graphhoc
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
Fault tolerant wireless sensor mac protocol for efficient collision avoidancegraphhoc
In sensor networks communication by broadcast methods involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collision namely ARBP, where the best achieved success rate is 90%. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage of delivered packets at the source reaching the destination successfully) by reducing the number of collisions, but by trading off the average propagation delay of transmission. Our proposed protocols are also shown to be more energy efficient in terms of energy dissipation per message delivery, compared to the currently existing protocol.
Enhancing qo s and qoe in ims enabled next generation networksgraphhoc
Managing network complexity, accommodating greater numbers of subscribers, improving coverage to support data services (e.g. email, video, and music downloads), keeping up to speed with fast-changing technology, and driving maximum value from existing networks – all while reducing CapEX and OpEX and ensuring Quality of Service (QoS) for the network and Quality of Experience (QoE) for the user. These are just some of the pressing business issues faced by mobileservice providers, summarized by the demand to “achieve more, for less.” The ultimate goal of optimization techniques at the network and application layer is to ensure End-user perceived QoS. The next generation networks (NGN), a composite environment of proven telecommunications and Internet-oriented mechanisms have become generally recognized as the telecommunications environment of the future. However, the nature of the NGN environment presents several complex issues regarding quality assurance that have not existed in the legacy environments (e.g., multi-network, multi-vendor, and multi-operator IP-based telecommunications environment, distributed intelligence, third-party provisioning, fixed-wireless and mobile access, etc.). In this Research Paper, a service aware policy-based approach to NGN quality assurance is presented, taking into account both perceptual quality of experience and technologydependant quality of service issues. The respective procedures, entities, mechanisms, and profiles are discussed. The purpose of the presented approach is in research, development, and discussion of pursuing the end-to-end controllability of the quality of the multimedia NGN-based communications in an environment that is best effort in its nature and promotes end user’s access agnosticism, service agility, and global mobility
Simulated annealing for location area planning in cellular networksgraphhoc
LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time
Secure key exchange and encryption mechanism for group communication in wirel...graphhoc
Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.
Simulation to track 3 d location in gsm through ns2 and real lifegraphhoc
In recent times the cost of mobile communication has dropped significantly leading to a dramatic increase in mobile phone usage. The widespread usage has led mobiles to emerge as a strong alternative for other applications one of which is tracking. This has enabled law-enforcing agencies to detect overspeeding vehicles and organizations to keep track its employees. The 3 major ways of tracking being employed presently are (a) via GPS [1] (b) signal attenuation property of a packet [3] and (c) using GSM Network [2]. The initial cost of GPS is very high resulting in low usage whereas (b) needs a very high precision measuring device. The paper presents a GSM-based tracking technique which eliminates the above mentioned overheads, implements it in NS2 and shows the limitations of the real life simulation. An accuracy of 97% was achieved during NS2 simulation which is comparable to the above mentioned alternate methods of tracking.
Performance Analysis of Ultra Wideband Receivers for High Data Rate Wireless ...graphhoc
For high data rate ultra wideband communication system, performance comparison of Rake, MMSE and Rake-MMSE receivers is attempted in this paper. Further a detail study on Rake-MMSE time domain equalizers is carried out taking into account all the important parameters such as the effect of the number of Rake fingers and equalizer taps on the error rate performance. This receiver combats inter-symbol interference by taking advantages of both the Rake and equalizer structure. The bit error rate performances are investigated using MATLAB simulation on IEEE 802.15.3a defined UWB channel models. Simulation results show that the bit error rate probability of Rake-MMSE receiver is much better than Rake receiver and MMSE equalizer. Study on non-line of sight indoor channel models illustrates that bit error rate performance of Rake-MMSE (both LE and DFE) improves for CM3 model with smaller spread compared to CM4 channel model. It is indicated that for a MMSE equalizer operating at low to medium SNR values, the number of Rake fingers is the dominant factor to improve system performance, while at high SNR values the number of equalizer taps plays a more significant role in reducing the error rate.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applicat...graphhoc
Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with
wireless communications and networking capability that communicate with each other without the aid of
any centralized administrator also the wireless nodes that can dynamically form a network to exchange
information without using any existing fixed network infrastructure. And it’s an autonomous system in
which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at
the same time, and we discuss in this paper the distinct characteristics of traditional wired networks,
including network configuration may change at any time , there is no direction or limit the movement and
so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these
actions communicate with each other path, An ideal choice way the agreement should not only be able to
find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any
time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the
History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and
then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this
paper, the more representative of routing protocols, analysis of individual characteristics and advantages
and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad
Hoc Networks
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles graphhoc
In 1991, Gnanajothi [4] proved that the path graph n
P with n vertex and n −1edge is odd graceful, and
the cycle graph Cm with m vertex and m edges is odd graceful if and only if m even, she proved the
cycle graph is not graceful if m odd. In this paper, firstly, we studied the graphCm∪Pn when m = 4, 6,8,10
and then we proved that the graphCm∪Pn
is odd graceful if m is even. Finally, we described an
algorithm to label the vertices and the edges of the vertex set ( ) m n
V C ∪P and the edge set ( ) m n
E C ∪P .
ACTOR GARBAGE COLLECTION IN DISTRIBUTED SYSTEMS USING GRAPH TRANSFORMATIONgraphhoc
A lot of research work has been done in the area of Garbage collection for both uniprocessor and
distributed systems. Actors are associated with activity (thread) and hence usual garbage collection
algorithms cannot be applied for them. Hence a separate algorithm should be used to collect them. If we
transform the active reference graph into a graph which captures all the features of actors and looks like
passive reference graph then any passive reference graph algorithm can be applied for it. But the cost of
transformation and optimization are the core issues. An attempt has been made to walk through these
issues.
A Proposal Analytical Model and Simulation of the Attacks in Routing Protocol...graphhoc
In this work we have devoted to some proposed analytical methods to simulate these attacks, and node mobility in MANET. The model used to simulate the malicious nodes mobility attacks is based on graphical theory, which is a tool for analyzing the behavior of nodes. The model used to simulate the Blackhole cooperative, Blackmail, Bandwidth Saturation and Overflow attacks is based on malicious nodes and the number of hops. We conducted a simulation of the attacks with a C implementation of the proposed mathematical models.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 6
A Battery Power Scheduling Policy with Hardware Support In Mobile Devices
1. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
DOI :10.5121/jgraphoc.2010.2307 78
A BATTERY POWER SCHEDULING
POLICY WITH HARDWARE SUPPORT IN
MOBILE DEVICES
B.Malarkodi, B.Prasana and B.Venkataramani
Department of ECE
National Institute of Technology
Tiruchirappalli,India
Email id: malark@nitt.edu, bvenki@nitt.edu
ABSTRACT
. A major issue in the ad hoc networks with energy constraints is to find ways that increase their
lifetime. The use of multihop radio relaying requires a sufficient number of relaying nodes to
maintainnetwork connectivity. Hence, battery power is a precious resource that must be used
efficiently in order to avoid early termination of any node. In this paper, a new battery power
scheduling policy based on dynamic programming is proposed for mobile devices.This policy
makes use of the state information of each cell provided by the smart battery package and uses
the strategy of dynamic programming to optimally satisfy a request for power. Using extensive
simulation it is proved that dynamic programming based schedulingpolicyimproves the lifetime
of the mobile nodes.Also a hardware support is proposed to succeeds in distinguishing between
real-time and non-real-time traffic and provides the appropriate grade of service, to meet the
time constraints associated with real time traffic.
Keywords
lifetime; battery; dynamic programming;mobile nodes; Scheduling;hardware unit
1.INTRODUCTION
The nodes of an ad hoc wireless network, a group of uncoordinated heterogeneous nodes that
self organise themselves to form a network have constrained battery resources. Advaces in
battery technologies have been negligible as compared to the recent advances in the field of
mobile computing and communication. The increasing gap between power consumption
requirements and energy density(energy stored per unit weight of a battery) tends to increase the
size of the batteries and hence increases the need for energy management. The lifetime of the ad
hoc networks can be defined as the time between the start of the network to the death of the first
node. The death of even a single node may lead to partitioning of the network and hence may
terminate many of the on going transmissions. In view of this, the strategies to increase the
lifetime of ad hoc networks become important. Towards this purpose, a new battery power
scheduling policy based on dynamic programming is proposed in this paper.
The rest of the paper is organised as follows. Section 2 provides an overview of battery
characteristics. Section 3 describes the existing work in this area.In section 4, the description of
the proposed scheduling policy is described and Section 5 presents the implementation
andsection 6 explains the simulation results. Section 7 describes the hardware support proposed
and section 8 ends with the conclusions.
2. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
79
2. OVERVIEW OF BATTERY CHARACTERISTICS
A battery consists of an array of one or more electro chemical cells. It can be characterised
either by its voltages or by its initial and remaining capacities. The behaviour of the batteries is
governed by the following major chemical effects:
Rate and recovery capacity effects: As the intensity of the discharge current increases, an
insoluble component develops between the inner and outer surfaces of the cathode of the
batteries. The inner surface becomes inaccessible as a result of this phenomenon, rendering the
cell unusable even while a sizable amount of active materials still exists. This effect termed as
rate capacity effect depends on the actual capacity of the cell and the discharge current.
Recovery capacity effect is concerned with the recovery of charges under idle conditions. Due
to this effect, on increasing the idle time of the batteries, one may be able to completely utilize
the theoretical capacity of the batteries.
Battery capacities: The amount of active materials (the materials that react chemically to
produce electrical energy when battery is discharged and restored when battery is charged)
contained in the battery refers to its theoretical capacity ( T ) and hence total number of such
discharges cannot exceed the battery’s theoretical capacity. Whenever the battery discharges,
the theoretical capacity of the battery decreases. Nominal capacity ( N ) corresponds to the
capacity actually available when the battery is discharged at a specific constant current.
Whenever the battery discharges, nominal capacity decreases, and increases probabilistically as
the battery remains idle and also called as recovery state of the battery. This is due to the
recovery capacity effect. The energy delivered under a given load is said to be the actual
capacity of the battery. A battery may exceed the actual capacity but not the theoretical
capacity. This is due to the rate capacity effect. By increasing the idle time, one may be able to
utilize the maximum capacity of the battery. The lifetime of a node is the same as the actual
capacity of the battery.
3.RELATED WORK
Battery models depict the characteristics of the batteries used in real life. The following models
are discussed in [1]. It summarizes the pros and cons of each of the models, namely analytical
model, stochastic models, electric current models and electro-chemical models. The authors of
[2] have shown that the pulsed dicharged current applied for bursty stochastic transmissions
improves the battery life time better than that using constant discharge. In [3], different battery
mangement techniques are presented and compared analytically. It is also shown by simulation
that the lifetime of the battery can be maximized under simple traffic management schemes.
When energy needs to be drained from the battery, one of the several cells of the battery is
chosen to provide the energy, while the rest of the cells may potentially recover part of their
charge.Thus efficient battery discharge strategies can increase the battery lifetime, if they take
advantage of this recovery mechanism. The authors of [3] have assumed each node to contain a
battery package with L cells and have proposed three battery scheduling policies for scheduling
them. Further, the battery behaviour under two different modes of pulse discharge are studied.
In a battery of L cells, a subset of cells can be scheduled for transmitting a given packet leaving
other cells to recover their charge. The following approaches are applied to select the subset of
cells namely delay free approaches and no delay free approaches [3].
No delay free approaches consider a battery management technique that involves coordination
among the cells of the array and drains current from the cells according to their state of charge.
Because of the availability of smart battery packages it is possible to track the discharged
capacity of the cells. The goal is to monitor the cell’s status and make them recover as much as
they need to obtain the maximum available capacity from the discharge process [3].
3. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
80
In [4], a framework has been developed to compute the optimal dicharge policy that maximizes
the battery lifetime. But this strategy requires significant time and memory for computation.
Hence, a strategy known as Maximum Charge scheduling policy which aims to efficiently
choose the cell to be discharged, so as to approximate the optimal is proposed in [4]. Here, the
total energy delivered is computed using the theory of stochastic Dynamic programming. In
[5], a number of suboptimal policies are proposed and the performance using them is evaluated
through simulation and the results are compared. The performance ratio of various policies for
different values of cell , nominal and theoretical capacities are plotted as a function of average
packet size.
The size of the packet is specified in terms of number of charge units to be discharged from a
battery[4]. In [4], the size of the packets corresponding to each traffic burst is assumed to be
poisson distributed. The poisson process is the oldest process that has been used to model
interarrival times of traffic streams. With poisson traffic, clustering occur in short term but
smoothes out over the long term. A queue may build up in the short run but over a long period,
the buffers are cleared out. Hence, only modest sized buffers are needed. This model can
describe short length dependence traffic accurately. But it is not adequate to describe the
phenomenon of real traffic because of long range dependence in network traffic [6].
In view of this, alternate traffic models such as self similar model has been proposed in the
literature[6]. In this paper, the burst size is assumed to be uniformly distributed in the interval
(0,N] where N is a variable. Using dynamic programming (DP), the battery recovery capacity is
optimized and lifetimes obtained are compared with two scheduling policies both using Round
Robin scheme one using delay free approach with high internal resistance of the cell and
another using no delay approach with low internal resistance .
4. PROPOSED SCHEME
With the advent of Smart Battery Packages (such as Linuxsbs), it is possible to find the state of
each cell (i.e) the nominal and theoritical capacities of each cell. In round robin delay free
approach, for scheduling the state information is ignored. In round robin no delay free
approach the state of the battery package is compared against a threshold for scheduling. as. In
any case the search for optimality must also be balanced against the need to accurately model
the batteries and to keep the overall system as simple as possible. Every discharge policy tries to
take advantage of recovery capacity effect which can be stated as the ability of a cell to recover
probabilistically one charge unit in one time slot when it is idle. Our scheduling policy tries to
take advantage of the inherent mathematical pattern that is present in cells that are recovering a
unit of charge i.e, the recovery of one charge unit in that time slot by each cell is mutually
independent of charge recovery by any other cell.
Assume there are L cells each numbered from 0.....L-1, the probability of recovery of cell i
whose state is defined by the two tuple set (Ni,Ti) is given by [7]
P(ri) = exp(-gc * (N-Ni)-φ(Ti)) if 0< Ni < N && 0< Ti < T
P(ri) = 0 otherwise (1)
Where
gc – device dependent parameter which gives the internal resistance or conductance of the cell.
N – the rated nominal capacity of the cell under fully charged condition.
Ni - the available nominal capacity of the cell
T – the maximum capacity of the cell (a direct function of the amount of active materials
initially present)
Ti – the available maximum capacity (a direct function of the amount of active materials present
at that instant)
The sum of the probability of recoveries is given by
4. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
81
P(R) = ∑
−
=
1
0
)(
L
i
irP
(2)
Assuming each cell has a pulsed discharged profile and a generalized pulsed discharge model
for the battery, we propose that each request can be optimally satisfied if P(R) is maximized.
Expressing the result mathematically, we assume a request of size K arrives(i.e the next burst to
be transmitted has K packets). For a cell i, its state is given by the 2-tuple set (Ni , Ti),
Let ai be the amount of charge units supplied by the ith
cell.
P(R) must be maximized subject to the constraint
Ka
L
i
i =∑
−
=
1
0 (3)
and P(ri) = exp(-gc*(N-(Ni-ai)-φ(Ti-ai)) for all i=0,1,…..L-1
Since we assume a pulse discharge profile, each cell discharges the required amount of charge
units for a fraction of the time slot.
5. IMPLEMENTATION USING DYNAMIC PROGRAMMING
There are O(2L
) ways by which a request of size K can be satisfied. Hence implementing the
above mentioned idea in an efficient and optimized manner presents a big challenge.
Fortunately the problem of satisfying optimally the request of size K contains an optimal
substructure and hence is solvable by the strategy of dynamic programming(DP) as proposed in
[4] and [5].
Dynamic Programming is typically applied to optimization problems. In such problems there
can be many possible solutions. Each solution has a value and we wish to find a solution with
the optimum value [8] and [9]. The development of a DP algorithm can be broken into a
sequence of 4 steps
1. Characterize the structure of the optimal solution
2. Recursively define the value of an optimal solution
3. Compute the value of the optimal solution in a bottom-up fashion.
4. Construct an optimal solution from computed information.
Basically the DP protocol works as follows. It computes in a bottom up manner, the optimal
power requirements for each burst size up to the maximum burst. So in that sense the protocol is
burst size independent.
We know that for any random access MAC protocol, for transmitting any burst, the transmitter
has to wait for a duration of time equal to at least the minimum contention window (the wait
could be longer as the size of the contention window increases due to collisions). So if we could
pipeline the execution of the DP protocol with the contention window period of the previous
burst, we could effectively absorb the overhead in executing the algorithm. So we neglect the
delay caused by it in our simulation. This is a valid assumption because the size of the
contention window is similar to the running time of the DP algorithm.
Following step 1, the sub problems are nothing but the optimal ways to satisfy the request of
size j (0≤ j< K).
Now the recurrence relation connecting the various sub problems can be given as follows
P[i] = max{P[i-k] – exp(-gc*(N-Ni +set[i-k][j])- φ(Ti – set[i-k][j])) + exp(-gc*(N-Ni +set[i-k][j]+
k)- φ(Ti – set[i-k][j] - k) }
if i>0 (4)
For j=0….L-1
5. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
82
k=1….min(Nj,Tj)
set[i-k][j] defines the amount of charge units taken from the cell j for satisfying the request of
size (i-k).
6.SIMULATION RESULTS
First we assume a device which has very high internal resistance (high value of gc parameter)
and then we show that DP protocol gives a much better performance measured in terms of
battery lifetime than the existing ROUND ROBIN protocol by way of extensive simulations
through ‘C’ language in Windows XP environment and present our results through tabulations
and graphs.
Next we assume that the device has very low internal resistance and so we have assumed the
existing protocol to be NO-DELAY FREE protocol. Since the round-robin protocol is no-delay
free our performance metric also includes the average packet delay, apart from the usual
lifetime of the battery, again we present our extensive simulation results through tabulations and
graphs.
Assumptions made during the simulation:
N=10 (nominal capacity is assumed to be10 charge units)
T=15 (theoritical capacity is assumed to be 15 charge units)
gc=2 (device dependent parameter which gives the internal resistance of the cell)
.
Traffic bursts assumed:
1)variable traffic burst(with maximum burst size fixed).
2)constant traffic burst size,assuming that in each time slot the burst of constant size is
transmitted.
the results of these two simulations are presented in a tabular form.
Table 1.Probabilistic distribution of traffic bursts with maximum burst size fixed.
Maximum size of the burst Lifetime Lifetime
(DP) (round-robin)
8 30 17
6 34 23
5 38 30
4 51 32
2 93 64
Table 2. constant size burst mode traffic
Burst size Lifetime Lifetime
(DP) (round-robin)
8 13 10
6 18 10
5 22 19
4 29 20
2 69 52
Since gc = 2, the device has very high internal resistance. Hence the recovery capacity effect is
considered to be negligible. So we assume the lifetime of the battery to be defined as the
6. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
83
number of requests successfully satisfied (number of traffic bursts transmitted successfully).
With this assumption we calculate and tabulate the lifetimes of the battery assuming various
bursts as in tables 1 and 2.
Thus we find that our DP protocol performs significantly better under highly constrained
circumstances (such as devices with very high internal resistance) as indicated by tables 1 and 2.
Now the second case involves the device with very low resistance, that is low gc . Hence the
recovery capacity of the device is very high. In such cases the existing protocols use a NO-
DELAY FREE approach. That is traffic shaping techniques are employed wherein a burst is not
transmitted immediately if the cell does not have sufficient power to transmit it. Rather it is
forced to wait till the cell recovers sufficient charge to transmit it. Thus a new concept of packet
delay is introduced .
Assumptions made during the simulation:
N=10 (nominal capacity is assumed to be 10 charge units)
T=50 (theoritical capacity is assumed to be 15 charge units)
gc=0.5 (device dependent parameter which gives the internal resistance of the cell)
FRAME SIZE = 10 ms.
Here variable traffic burst(with maximum burst size fixed) is assumed.
Now we present a table 3 comparing the lifetimes of our DP protocol with no-delay free round-
robin protocol for probabilistic distribution of traffic bursts with maximum burst size fixed..
Let Ti be the fraction time for which the cell supplies charge. Since in our DP protocol , the
probability that the cell supplies charge or not for the current request depends on the state of the
cell which in turn depends on the distribution of the traffic burst, it is fair to assume that on an
average L/2 cells are used to satisfy a request. Thus the time taken in case of our DP protocol is
(L/2 )* Ti.
Typical values of Ti are 500 microseconds[2] . So in this case, the average packet delay is 2.5
ms.
Now we present a table 4 showing the average packet delay for the various traffic bursts
Table 3. lifetimes with low internal resistances
Maximum size Lifetime Lifetime
of the burst (DP) (round robin with
no-delay free)
7 128 45
6 141 58
5 178 81
4 202 144
Table 4. average packet delay for the various traffic burst
Maximum size Average packet delay(s)
of the burst
7 0.131556
6 0.126379
5 0.038395
4 0.117153
Thus we find that our protocol offers a significantly better performance as compared to round
robin with no-delay free in case of a device with very low internal resistance.
7. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
84
In most of the communication protocols the maximum burst size is known apriori and so we fix
the maximum value of ‘k’ and since ‘L’ is a device parameter it is a constant and so is N.
This algorithm need not deal with variablevariable sized objects and so the need for recompiling
and relinking doesn’t exist. So for faster execution we may use an on-chip programming cache
containing the binaries of this algorithm along with the on-chip data cache containing the states
of the various cells (which is maintained by the smart battery package).
So this algorithm is further optimized and its execution takes typically negligible overhead. If an
ARM core is used this algorithm can be used as a fast interrupt.
7.HARDWARE SUPPORT
The dynamic programming algorithm splits the request to be distributed among ‘L’ cells (some
cells may satisfy trivial requests for 0 charge units meaning that they are in recovery state).So
any efficient mechanism is requires the pulses drawn from each of the ‘L’ cells into a single cell
so that it may be used to power the burst to be transmitted.
Also this dynamic programming algorithm and hardware mechanism is typically an overkill for
non-burst mode transmission, i.e., those transmissions which require acknowledgements for
every packet, so we have a mechanism to bypass this hardware unit for burstmode transmission
(typically a two way switch)
Two way Switch:
The CPU is able to detect that what follows is a burst mode or non-burst mode traffic and it
sends a signal S2 to the switch depending on S2 ; level switch is positioned
If S2 = 1 (means real time traffic) the switch connects C to B
Else (means non real time traffic) the switch connects C to A
Current summing circuit:
This is used in case of real time traffic; since the pulse comes out discrete instants of time, we
need a mechanism to sum the pulses up with as little overhead as possible. So we use the
hardware block of current summing circuit. Typical implementations use a capacitor (with very
large time constant) for charging up on occurrence of the pulse.In order to protect against its
discharge between successivecharging instants we use a capacitor with very large time constant.
At the end of the Lth
charging instant a signal is sent which switches on the transistor through
which the capacitor discharges.
Figure.1Two way Switch
8. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.3, September 2010
85
8.CONCLUSIONS
A new battery power scheduling policy based on dynamic programming is proposed for mobile
devices. Through extensive simulations, it is shown that the proposed DP protocol increases the
lifetime of nodes compared to two of the existing protocols using round robin scheme. The
average packet delay obtained using the proposed DP approach is found to be smaller than that
obtained using round robin protocol with no delay free approach.In addition to the simulation,on
chip programming cache is proposed for faster execution so as to have a negligible overhead. A
hardware mechanism with two way switch is proposed for bursty and non bursty transmission.
REFERENCES
[1] K.Lahiri , A. Raghunathan, S.Dey and D. panigrahi, “Battery driven system design: A new frontier in
low power design”, Proceedings of IEEE ASP-DAC/VLSI DESIGN 2002, pp. 261-267 January 2002.
[2] C.F. Chiasserini and R.R. Rao, “Pulsed Battery Discharge in communication devices”, Proceedings of
ACM MOBICOM 1999, pp. 88-95 November 1995.
[3] C.F. Chiasserini and R.R. Rao, “Energy efficient battery management”, Proceedings of IEEE
INFOCOM 2000, Volume 2, pp. 396-403, March 2000
[4]Saswati Sarkar and Maria Adamou,”A framework for Optimal Battery management For Wireless
Nodes,”IEEE Journal on selected Areas in Communications,Vol.21,NO.2,February 2003
[5]Maria Adamou and Saswati Sarkar,’Computationally Simple Battery Management Techniques for
Wireless Nodes,”in Proc.European Wireless,Florence,Italy,2002,pp.218-223.
[6] Michela Becchi,”From Poisson process to Self similar: A survey of Network traffic
models”,www.cse.wustl.edu/cse 567-06.
[7] S. Jayashree, B.S.Manoj, and C.Siva Ram Murthy, “A novel battery aware MAC protocol for ad hoc
wireless networks”, HiPC 2004, LNCS 3296, pp. 19-29, 2004.
[8] http://en.wikipedia.org/wiki/Dynamic_programming
[9]Richard Ernest Bellman, ”Dynamic Programming,”Courier Dover Publications 2003.
Authors: B. Malarkodi joined as lecturer in the department of Electronics and Communication
Engineering ,National Institute of Technology, Tiruchirappalli in the year 1990. Now she is working as
an Associate Professor in the same department. She is having twenty years of teaching experience and her
research interests are in the field of mobile ad hoc networks and wireless communication.
Dr.B.Venkataramani is working as a Professor in the department of Electronics and Communication
Engineering , National Institute of Technology, Tiruchirappalli and he is having twenty three years of
teaching experience and his research interests are in the field of VLSI design, DSP application in
Communication and Networking.