Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...Editor IJMTER
The main motive of this research is to study energy-efficient data-gathering mechanisms to
abnormal packet data for saving the energy. To detect the abnormal packet irregularities is useful for
saving energy, as well as for management of network, because the patterns found can be used for
both decision making in applications and system performance tuning. Node distribution in WSNs is
either deterministic or self-organizing and application dependant. The sensor nodes in WSNs have
minimum energy and they use their energy for communication and sensing.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORKcscpconf
A sensor network is composed of a large number of sensor nodes, which are densely
deployed either inside the phenomenon or very close to it. Sensor nodes have
sensing, processing and transmitting capability . They however have limited energy
and measures need to be taken to make op- timum usage of their energy and save
them from task of only receiving and transmitting data without processing. Various
techniques for energy utilization optimisation have been proposed Ma jor players are
however clustering and relay node placement. In the research related to relay node
placement, it has been proposed to deploy some relay nodes such that the sensors
can transmit the sensed data to a nearby relay node, which in turn delivers the data
to the base stations. In general, the relay node placement problems aim to meet
certain connectivity and/or survivabil- ity requirements of the network by deploying a
minimum number of relay nodes. The other approach is grouping sensor nodes into
clusters with each cluster having a cluster head (CH). The CH nodes aggregate the
data and transmit them to the base station (BS). These two approaches has been
widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Background: Septoplasty is one of the commonest nasal surgeries
performed by otolaryngologist. Silicone is the most common
material used for nasal splints. Trans-septal suturing technique
has been described to approximate the mucosal flaps after septal
procedures to reduce the complication rate; however there are
few studies proving the efficacy.
Objective: This study is to elucidate the efficacy of trans-septal
suture method in preventing complications, discomfort and pain
in comparison with intranasal splinting using silicone plates after
septoplasty.
Patients and methods: This is a prospective study of 59 adult
patients underwent Septoplasty, between August 2013-January
2014 in Rizgary Teaching Hospital - Erbil city. Patients were
divided into 2 groups; trans-septal suture and silicone, 29 and 30
patients respectively. Visual analogue scale was used to evaluate
postoperative pain, bleeding, post-nasal drip, dysphagia and
sleep disturbance for three days. Epiphora and septal hematoma
are also evaluated. Septal perforation, crustation, and adhesion
were evaluated at 4th postoperative week.
Results: The severity of pain and post nasal drip were
significantly lower in trans-septal suture group than silicone
group (P< 0.05). The septal hematoma and septal perforation
were not seen in the study. No any significant difference found
concerning epiphora, crustation and adhesion.
Conclusion: we conclude that, suturing can be used safely in
septoplasty sp
The main aim of energy efficient routing is to
minimize the energy required to transmit or receive packets also
called as active communication energy. Inactive energy is the
energy which not only tries to reduce the energy consumed
when a mobile node stays idle but also listens to the wireless
medium for any possible communication requests from other
nodes. To conserve energy, many energy efficient routing
protocols have been proposed. Networks of small, inexpensive,
disposable, smart sensors are emerging as a new technology with
tremendous potential. Wireless sensor networks can be randomly
deployed inside or close to phenomenon to be monitored. The
advantage of these networks is the fact that they are selfconfiguring,
which means that a sensor network can be deployed
randomly on a battlefield, in a disaster area or in an inaccessible
area without the need for human intervention. The energy
supplies of nodes are not replenished or replaced and therefore
nodes only participate in the network for as long as they have
energy. This fact necessitates energy efficiency in the design of
every aspect of such nodes. Energy consumption in sensor nodes
occurs mainly due to computational processing and, to a greater
extent, communication. The routing protocol employed by these
sensor nodes can minimize the number of transmissions that
nodes make as well as the computational complexity of routing
path selection. It is therefore of critical importance that the
routing protocol be designed with energy efficiency in mind.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...Editor IJMTER
The main motive of this research is to study energy-efficient data-gathering mechanisms to
abnormal packet data for saving the energy. To detect the abnormal packet irregularities is useful for
saving energy, as well as for management of network, because the patterns found can be used for
both decision making in applications and system performance tuning. Node distribution in WSNs is
either deterministic or self-organizing and application dependant. The sensor nodes in WSNs have
minimum energy and they use their energy for communication and sensing.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORKcscpconf
A sensor network is composed of a large number of sensor nodes, which are densely
deployed either inside the phenomenon or very close to it. Sensor nodes have
sensing, processing and transmitting capability . They however have limited energy
and measures need to be taken to make op- timum usage of their energy and save
them from task of only receiving and transmitting data without processing. Various
techniques for energy utilization optimisation have been proposed Ma jor players are
however clustering and relay node placement. In the research related to relay node
placement, it has been proposed to deploy some relay nodes such that the sensors
can transmit the sensed data to a nearby relay node, which in turn delivers the data
to the base stations. In general, the relay node placement problems aim to meet
certain connectivity and/or survivabil- ity requirements of the network by deploying a
minimum number of relay nodes. The other approach is grouping sensor nodes into
clusters with each cluster having a cluster head (CH). The CH nodes aggregate the
data and transmit them to the base station (BS). These two approaches has been
widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Background: Septoplasty is one of the commonest nasal surgeries
performed by otolaryngologist. Silicone is the most common
material used for nasal splints. Trans-septal suturing technique
has been described to approximate the mucosal flaps after septal
procedures to reduce the complication rate; however there are
few studies proving the efficacy.
Objective: This study is to elucidate the efficacy of trans-septal
suture method in preventing complications, discomfort and pain
in comparison with intranasal splinting using silicone plates after
septoplasty.
Patients and methods: This is a prospective study of 59 adult
patients underwent Septoplasty, between August 2013-January
2014 in Rizgary Teaching Hospital - Erbil city. Patients were
divided into 2 groups; trans-septal suture and silicone, 29 and 30
patients respectively. Visual analogue scale was used to evaluate
postoperative pain, bleeding, post-nasal drip, dysphagia and
sleep disturbance for three days. Epiphora and septal hematoma
are also evaluated. Septal perforation, crustation, and adhesion
were evaluated at 4th postoperative week.
Results: The severity of pain and post nasal drip were
significantly lower in trans-septal suture group than silicone
group (P< 0.05). The septal hematoma and septal perforation
were not seen in the study. No any significant difference found
concerning epiphora, crustation and adhesion.
Conclusion: we conclude that, suturing can be used safely in
septoplasty sp
The main aim of energy efficient routing is to
minimize the energy required to transmit or receive packets also
called as active communication energy. Inactive energy is the
energy which not only tries to reduce the energy consumed
when a mobile node stays idle but also listens to the wireless
medium for any possible communication requests from other
nodes. To conserve energy, many energy efficient routing
protocols have been proposed. Networks of small, inexpensive,
disposable, smart sensors are emerging as a new technology with
tremendous potential. Wireless sensor networks can be randomly
deployed inside or close to phenomenon to be monitored. The
advantage of these networks is the fact that they are selfconfiguring,
which means that a sensor network can be deployed
randomly on a battlefield, in a disaster area or in an inaccessible
area without the need for human intervention. The energy
supplies of nodes are not replenished or replaced and therefore
nodes only participate in the network for as long as they have
energy. This fact necessitates energy efficiency in the design of
every aspect of such nodes. Energy consumption in sensor nodes
occurs mainly due to computational processing and, to a greater
extent, communication. The routing protocol employed by these
sensor nodes can minimize the number of transmissions that
nodes make as well as the computational complexity of routing
path selection. It is therefore of critical importance that the
routing protocol be designed with energy efficiency in mind.
DESIGN OF ENERGY EFFICIENT ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORK (WSN...cscpconf
Development of energy efficient Wireless Sensor Network (WSN) routing protocol is nowadays main area of interest amongst researchers. This research is an effort in designing energy efficient Wireless Sensor Network (WSN) routing protocol under certain parameters consideration. Research report discusses various existing WSN routing protocols and propose a new WSN energy efficient routing protocol. Results show a significant improvement in life cycle of the nodes and enhancement in energy efficiency of WSN. In this paper, an attempt has been made to design a wireless sensor network involving the extraction of Pascal Graph features. The standard task involves designing a suitable topology using Pascal Graph. As per the definition of interconnection network it is equivalent that a suitable graph can represent the different computer network topologies very efficiently. Different characteristics of Pascal Graph Topology has been discovered and used in network topology design. Since Pascal Graph gives
better result in terms of finding the dependable and reliable nodes in topology, it has been considered for network analysis. Moreover, we propose a methodology that involves the Pascal
Graph Topology for wireless sensor network which can analyse and represent the network and help in routing.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...IJCI JOURNAL
With limited amount of energy, nodes are powered by
batteries in wireless networks. Increasing the lif
e
span of the network and reducing the usage of energ
y are two severe problems in Wireless Sensor
Networks. A small number of energy utilization path
algorithms like minimum spanning tree reduces tota
l
energy consumption of a Wireless Sensor Network, ho
wever very heavy load of sending data packets on
many key nodes is used with the intention that the
nodes quickly consumes battery energy, by raising t
he
life span of the network reduced. Our proposal work
aimed on presenting an Energy Conserved Fast and
Secure Data Aggregation Scheme for WSN in time and
security logic occurrence data collection
application. To begin with, initially the goal is m
ade on energy preservation of sensed data gathering
from
event identified sensor nodes to destination. Inven
tion is finished on Energy Efficient Utilization Pa
th
Algorithm (EEUPA), to extend the lifespan by proces
sing the collecting series with path mediators
depending on gene characteristics sequencing of nod
e energy drain rate, energy consumption rate, and
message overhead together with extended network lif
e span. Additionally, a mathematical programming
technique is designed to improve the lifespan of th
e network. Simulation experiments carried out among
different relating conditions of wireless sensor ne
twork by different path algorithms to analyze the
efficiency and effectiveness of planned Efficient E
nergy Utilization Path Algorithm in wireless sensor
network (EEUPA)
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Optimized Projected Strategy for Enhancement of WSN Using Genetic AlgorithmsIJMER
This paper put forward a new strategy for selecting the most favorable cluster head in Stable
Election Protocol (SEP). The planned approach selects a node as cluster head if it has the maximum
energy among all the available nodes in that particular cluster. It considers diverse nodes and divides
nodes among normal, transitional and advance nodes. To handle the heterogeneity of the nodes, different
optimized probability density functions are selected. First node dead time explain the network stability
period and last node dead explain the overall network lifetime. The main pressure is to increase the time
when first node dies and also when last node dies. The projected strategy is designed and implemented in
the Matlab using mathematics toolbox. The projected algorithm is also compared with the some prominent
protocols like leach, E-LEACH, SEP and extended SEP
Current issue- International Journal of Advanced Smart Sensor Network Systems...ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
DEVELOPMENT OF SOM NEURAL NETWORK BASED ENERGY EFFICIENT CLUSTERING HIERARCHI...ijassn
Cluster-Based Routing Protocols is a renowned scheme to extend the lifetime and energy consumption simultaneously for the Wireless Sensor Network (WSN). Every sensor node work homogenously or heterogeneously which is energy constrained when energy and memory capacity is limited. Congregating information resourcefully in perilous situations in the sensor network for a large-scale area and huge time is required an effectual protocol. In this paper, we proposed a cluster-based hierarchical routing path protocol, namely SOM-PEG protocol, which is a modified PEGASIS protocol based on traditional
PEGASIS with the employment of Self Organizing Map (SOM) neural network (NN). The simulation is performed on MATLAB simulation tool as well as NN GUI. The performance comparison shows that the proposed protocol provides better network lifetime and ensures less energy consumption compared with
traditional PEGASIS protocol.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
Energy efficient routing in wireless sensor network based on mobile sink guid...IJECEIAES
In wireless sensor networks (WSNs), the minimization of usage of energy in the sensor nodes is a key task. Three salient functions are performed by WSNs’ sensor nodes namely data sensing, transmitting and relaying. Routing technique is one of the methods to enhance the sensor nodes battery lifetime. Energy optimization is done by using one of the heuristic routing methods for data sensing and transmission. To enhance the energy optimization mainly concentrated on data relaying. In this work stochastic hill climbing is adapted. The proposed solution for data relaying utilizes geographical routing and mobile sink technique. The sink collects the data from cluster heads and movement of the sink is routed by stochastic hill climbing. Experimentation is done on the network simulator 2 Platform. The existing routing techniques like threshold sensitive energy efficient sensor network, energy-efficient low duty cycle, and adaptive clustering protocol are compared with the obtained results of chosen algorithm. The proposed work shows promising results with respect to lifetime, average energy of nodes and packet delivery ratio.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Similar to DESIGN AND IMPLEMENTATION OF ADVANCED MULTILEVEL PRIORITY PACKET SCHEDULING SCHEME (20)
Recent joint surgery studies reveal increased
revisions and resurfacing of the metal on metal hip joints. Metal
on metal hip implants were developed more than thirty years ago
and their application has been refined because of availability of
advanced manufacturing techniques and partly by advancements
in material science and engineering. Development of composite
materials may provide greater durability to metal-on-metal hip
implants .This review article is a study of the latest literature of
metal-on-metal hip implants and its various modeling techniques.
Numbers of methods are used for convergence and numerical
solution to investigate the performance of metal-on-metal hip
implant for accurate stable solution. This paper presents analysis
done by various researchers on metal-on-metal hip implants for
wear, lubrication, fatigue, bio-tribo-corrosion, design, toxicity
and resurfacing. After in vivo and in vitro studies, it is found that
all these methods have limitations. There is a need of more
insight for lubrication analysis, geometry of bearings, materials
and input parameters. The information provided in this work is
intended as an aid in the assessment of metal-on-metal hip joints.
Background Hospital contributes significantly tangible and intangible resources on a concurred plan by the scheduling of surgery on the OT list. Postponement decreases efficiency by declining throughput leads to wastage of resources hence burden to the nation. Patients and their family face economic and emotional implication due to the postponement. Postponement rate being a quality indicator controls check mechanism could be developed from the results. Postponement of elective scheduled operations results in inefficient use of the operating room (OR) time on the day of surgery. Inconvenience to patients and families are also caused by postponements. Moreover, the day of surgery (DOS) postponement creates logistic and financial burden associated with extended hospital stay and repetitions of pre-operative preparations to an extent of repetition of investigations in some cases causing escalated costs, wastage of time and reduced income. Methodology A cross-sectional study was done in the operation theaters of a tertiary care hospital in which total ten operation theaters of General Surgery Data of scheduled, performed and postponed surgeries was collected from all the operation theater with effect from March 1st to September 30th, 2018. A questionnaire was developed to find out the reasons for the postponement for all hospital’s stakeholders (surgeons, Anesthetist, Nursing Officer) and they were further evaluated time series analysis of scheduling of Operation Theater for moving average technique. Results Total 958 surgeries were scheduled and 772 surgeries performed were and 186 surgeries were postponed with a postponement rate of 19.42% in the cardiac surgery department during the study period. Month-wise postponement Rate exponential smoothing of time series data shows the dynamic of operating suits. To test throughput Postponement rate was plotted the postponed surgeries and on regression analysis is in a perfect linear relationship.
Introduction: Postponement of elective scheduled operations results in inefficient use of operating room (OR) time on the day of surgery. Inconvenience to patients and families also caused by postponements. Moreover, day of surgery (DOS) postponement creates logistic and financial burden associated with extended hospital stay and repetitions of pre-operative preparations to an extend of repetition of investigations in some cases causing escalated costs, wastage of time and reduced income. Methodology: A cross sectional study was done in the operation theaters of a tertiary care hospital in which total ten operation theaters of General Surgery Data of scheduled, performed and postponed surgeries was collected from all the operation theater with effect from march 1st to September 30th 2018. A questionnaire was developed to find out the reasons for the postponement for all hospital’s stakeholders (Surgeons, Anesthetist, Nursing officer) and they were further evaluated Time series analysis of scheduling of Operation Theater for Moving average Technique. Results: total 2,466 surgeries were scheduled and 1,980 surgeries were performed and 486 surgeries were postponed in the general surgery department during the study period. Month wise postponement forecast was in accordance with the performed surgeries and on regression analysis postponed surgeries were in perfect linear relationship with the postponement Rate.
In the present paper the experimental study of
Nanotechnology involves high cost for Lab set-up and the
experimentation processes were also slow. Attempt has also
been made to discuss the contributions towards the societal
change in the present convergence of Nano-systems and
information technologies. one cannot rely on experimental
nanotechnology alone. As such, the Computer- simulations and
modeling are one of the foundations of computational
nanotechnology. The computer modeling and simulations
were also referred as computational experimentations. The
accuracy of such Computational nano-technology based
experiment generally depends on the accuracy of the following
things: Intermolecular interaction, Numerical models and
Simulation schemes used. The essence of nanotechnology is
therefore size and control because of the diversity of
applications the plural term nanotechnology is preferred by
some nevertheless they all share the common feature of control
at the nanometer scale the latter focusing on the observation
and study of phenomena at the nanometer scale. In this paper,
a brief study of Computer-Simulation techniques as well as
some Experimental result
Solar cell absorber Kesterite- type Cu2ZnSnS4 (CZTS) thin films have been prepared by Chemical Bath Deposition (CBD). UV–vis absorption spectra measurement indicated that the band gap of as-synthesized CZTS was about1.68 eV, which was near the optimum value for photovoltaic solar conversion in a single-band-gap device. The polycrystalline CZTS thin films with kieserite crystal structure have been obtained by XRD. The average of crystalline size of CZTS is 27 nm
Multilevel inverters play a crucial part in the
areas of high and medium voltage applications. Among the three
main multilevel inverters used, the capacitor clamped multilevel
inverter(CCMLI) has advantage with respect to voltage
redundancies. This work proposes a switching pattern to improve
the performance of chosen H-bridge type CCMLI over
conventional CCMLI. The PWM technique used in this work is
Phase Opposition Disposition PWM(PODPWM). The
performance of proposed H-bridge type CCMLI is verified
through MATLAB-Simulink based simulation. It has been
observed that the THD is low in chosen CCMLI compared to
conventional CCMLI.
- In this paper, we introduce a practical mechanism of
compressing a binary phase code modulation (BPCM) signal
according to Barker code with 13 chips in presence of additive
white Gaussian noise (AWGN) by using a digital matched filter
(DMF) corresponding to time domain convolution algorithm of
input and reference signals using Cyclone II EP2C70F896C6
FPGA from ALTERA placed on education and development
board DE2-70 with the following parameters: frequency of
BPCM signal fIF=2 MHz, sampling frequency
f MHz SAM 50
,pulse period
T 200s
, pulse width
S 13sc
, chip width
CH 1sc
, compressing factor
KCOM 13
, SNRinp=1/1, 1/2, 1/3, 1/4, 1/5 and processing
gain factor SNRout/SNRinp=11.14 dB.
The results of filter operation are evaluated using a digital
oscilloscope GDS-1052U to display the input and output signals
for different SNRinp.
Flooding is one of the most devastating natural
disasters in Nigeria. The impact of flooding on human activities
cannot be overemphasized. It can threaten human lives, their
property, environment and the economy. Different techniques
exist to manage and analyze the impact of flooding. Some of these
techniques have not been effective in management of flood
disaster. Remote sensing technique presents itself as an effective
and efficient means of managing flood disaster. In this study,
SPOT-10 image was used to perform land cover/ land use
classification of the study area. Advanced Space borne Thermal
Emission and Reflection Radiometer (ASTER) image of 2010 was
used to generate the Digital Elevation Model (DEM). The image
focal statistics were generated using the Spatial Analyst/
Neighborhood/Focal Statistics Tool in ArcMap. The contour map
was produced using the Spatial Analyst/ Surface/ Contour Tools.
The DEM generated from the focal statistics was reclassified into
different risk levels based on variation of elevation values. The
depression in the DEM was filled and used to create the flow
direction map. The flow accumulation map was produced using
the flow direction data as input image. The stream network and
watershed were equally generated and the stream vectorized. The
reclassified DEM, stream network and vectorized land cover
classes were integrated and used to analyze the impact of flood on
the classes. The result shows that 27.86% of the area studied will
be affected at very high risk flood level, 35.63% at high risk,
17.90% at moderate risk, 10.72% at low risk, and 7.89% at no
risk flood level. Built up area class will be mostly affected at very
high risk flood level while farmland will be affected at high risk
flood level. Oshoro, Imhekpeme, and Weppa communities will be
affected at very high risk flood inundation while Ivighe, Uneme,
Igoide and Iviari communities will be at risk at high risk flood
inundation level. It is recommended among others that buildings
that fall within the “Very High Risk” area should be identified
and occupants possibly relocated to other areas such as the “No
Risk” area.
Without water, humans cannot live. Since time began,
we have lived by the water and vast tracts of waterless land have
been abandoned as it is too difficult to inhabit. At any given
moment, the earth’s atmosphere contains 4,000 cubic miles of
water, which is just 0.000012% of the 344 million cubic miles of
water on earth. Nature maintains this ratio via evaporation and
condensation, irrespective of the activities of man.
There is a certain need for an alternative to solve the water
scarcity. Obtaining water from the atmosphere is nothing new -
since the beginning of time, nature’s continuous hydrologic cycle
of evaporation and condensation in the form of rain or snow has
been the sole source and means of regenerating wholesome water
for all forms of life on earth.
An effective method to generate water is by the separation of
moisture present in air by condensation. In this study, the water
present in air is condensed on the surface of a container and then
collected in an external jacket provided on the container.
Insulations are provided to optimize the inner temperature of the
container.
The method is although uncommon but has certain advantages
which make it a success. The process is economical and does not
require a lot of utilities. It also helps in further reducing the
carbon footprint.
In every moment of functioning the Li-Ion
battery must provide the power required by the user, to have a
long operating life and to and to provide high reliability in
operation. The methods for analysis and testing batteries are
ensuring that all these conditions imposed to the batteries are
met by being tested depending on their intended use.
The success rate of real estate project is
decreasing as there is large scale of project and participation of
entities. It is necessary to study the risk factors involved in the
project. This paper focused on types of risks involved in the
project, risk factors, risk management tools & techniques.
Identification of risk of the project in terms of the total cost of the
project has been divided under Technical, Financial, Sociopolitical
and Statutory cost centers. Large real estate projects
have to tackle the following issues: land acquisition, skilledlabour
shortage, non-availability of skilled project managers, and
mechanization of the construction process to cater to the growing
demands. Non- availability of supporting infrastructure, political
issues like instability of the government leading to regulatory
issues, social issues, marketing forms an important part in these
projects as this is a onetime investment and the purchase cycle is
long , long development period makes the same project be at
different points in the real estate value cycle.
- In the present scenario carbon emission and sand
mining are major concern due to its hazardous effect to
environment and making serious imbalance to the ecosystem.
Various studies have been conducted to reduce severe effect on
environment, using byproducts like copper slag as partial
replacement of fine aggregate. Different researchers have also
revealed numerous uses of copper slag as a replacing agent in
determining the strength of concrete. A comprehensive review of
studies has been presented in this paper for scope of replacement
of fine aggregate from copper slag in concrete
- Security is a concept similar to being cautious
or alert against any danger. Network security is the condition of
being protected against any danger or loss. Thus safety plays a
important role in bank transactions where disclosure of any data
results in big loss. We can define networking as the combination
of two or more computers for the purpose of resource sharing.
Resources here include files, database, emails etc. It is the
protection of these resources from unauthorized users that
brought the development of network security. It is a measure
incorporated to protect data during their transmission and also
to ensure the transmitted is protected and authentic.
Security of online bank transactions here has been
improved by increasing the number of bits while establishing the
SSL connection as well as in RSA asymmetric key encryption
along with SHA1 used for digital signature to authenticate the
user
Background: Septoplasty is a common surgical
procedure performed by otolaryngologists for the correction of
deviated nasal septum. This surgery may be associated with
numerous complications. To minimize these complications,
otolaryngologists frequently pack both nasal cavities with
different types of nasal packing. Despite all its advantages,
nasal packing is also associated with some disadvantages. To
avoid these issues, many surgeons use suturing techniques to
obviate the need for packing after surgery.
Objective: To determine the efficacy and safety of trans-septal
suture technique in preventing complications and decreasing
morbidity after septoplasty in comparison with nasal packing.
Patients and methods: Prospective comparative study. This
study was conducted in the department of Otolaryngology -
Head and Neck Surgery, Rizgary Teaching Hospital - Erbil,
from the 6th of May 2014 to the 30th of November 2014.
A total of 60 patients aged 18-45 years, undergoing septoplasty,
were included in the study. Before surgery, patients were
randomly divided into two equal groups. Group (A) with transseptal
suture technique was compared with group (B) in which
nasal packing with Merocel was done. Postoperative morbidity
in terms of pain, bleeding, postnasal drip, sleep disturbance,
dysphagia, headache and epiphora along with postoperative
complications including septal hematoma, septal perforation,
crustation and synechiae formation were assessed over a follow
up period of four weeks.
Results: Out of 60 patients, 37 patients were males (61.7%)
and 23 patients were females (38.3%). Patients with nasal
packing had significantly more postoperative pain (P<0.05)><0.05). There was no significant difference between
the two groups with respect to nasal bleeding, septal
hematoma, septal perforation, crustation and synechiae
formation.
Conclusion: Septoplasty can be safely performed using transseptal
suturing technique without nasal packing.
The basic reason behind the need to
monitor water quality is to verify whether the examined
water quality is suitable for intended usage or not. This
study is conducted on Al -Shamiya al- sharqi drain in
Diwaniya city in Iraq to make valid assessment for the
level of parameters measured and to realize their effects
on irrigation. In order to assess the drainage water
quality for irrigation purposes with a high accuracy, the
Irrigation Water Quality Index (IWQI) will be examined
and upgraded (integrated with GIS) to make a
classification for drainage water. For this purpose, ten
samples of drainage water were taken from different ten
location of the stuay area. The collected samples were
analyzed chemically for different elements which affect
water quality for irrigation.These elements are :
Calcium(Ca+2), Sodium(Na+
), Magnesium(Mg+2),
Chloride( ), Potassium(K+
), Bicarbonate(HCO3),
Nitrate(NO3), Sulfate( , Phosphate( , Electrical
Conductivity(EC), Total Dissolved Solids (TDS), Total
Suspended Solids (TSS) and pH-values (PH). Sodium
Adsorption Ratio (SAR) and Sodium Content (Na%)
have been also calculated. Results suggest that, the use of
GIS and Water Quality Index (WQI) methods could
provide an extremely interesting as well as efficient tool
to water resource management. The results analysis of
(IWQI) maps confirms that: 52% of the drainage water
in study area falls within the "Low restriction" (LR) and
47%of study area has water with (Moderate
restriction)(MR),While 1% of drainage water in the
study area classified as (Sever restriction) (SR). So, the
drainage water should be used with the soil having high
permeability with some constraints imposed on types of
plant for specified tolerance of salts
The cable-hoisting method and rail cable-lifting
method are widely used in the construction of suspension bridge.
This paper takes a suspension bridge in Hunan as an example,
and expounds the two construction methods, and analyzes their
respective merits and disadvantages.
Baylis-Hillman reaction has been achieved on
different organic motifs but with completion times of three to
six days. Micellar medium of CTAB in water along with the
organic base DABCO has been used to effect the BaylisHillman
reaction on a steroidal nucleus of Withaferin-A for the
first time with different aromatic aldehydes within a day to
synthesize a library of BH adducts (W1a –W14a) and (W1bW14b)
as a mixture of two isomers and W15 as a single
compound. The isomers were separated on column and the
major components were chosen for bio-evaluation. Cytotoxic
activity of the synthesized compounds was screened against a
panel of four cancer cell lines Lung A-549, Breast MCF-7,
Colon HCT-116 and Leukemia THP-1 along with 5-florouracil
and Mitomycin-C as references. All the compounds exhibited
promising activity against screened cell lines and were found to
possess enhaunced activity than parent compound. BH adducts
with aromatic systems having methoxy and nitro groups were
found to be more active.
This paper presents the details on the
experimental investigation carried out to get the desired fresh
properties of the SCC. Tests were performed on various mixtures
to obtain the required SCC. In the present research work we
have replaced 15% of cement with class F fly ash. By varying the
quantity of water and sand the mortar mix was prepared. Later
varying percentage of coarse aggregate was added to the mortar
to obtain the desired SCC.
The batteries used in electric and hybrid vehicles
consists of several cells with voltages between 3.6V battery and
4.2 V in series or parallel combinations of configurations for
obtaining the necessary available voltages in the operation of a
hybrid electric vehicle. How malfunction of a single cell affects
the behavior of the entire battery pack, BMS main function is to
protect individual cells against over-discharge, overload or
overheating. This is done by correct balancing of the cells. In
addition BMS estimates the battery charge status
This project aims at using (PD-MCPWM) Phase
disposition multi carrier pulse width modulation technique to
reduce leakage current in a transformerless cascaded multilevel
inverter for PV systems. Advantages of transformerless PV
inverter topology is as follows, simple structure, low weight and
provides higher efficiency , but however this topology provides a
path for the leakage current to flow through the parasitic
capacitance formed between the PV module and the ground.
Modulation technique reduces leakage current with an added
advantage without adding any extra components.
More from International Journal of Technical Research & Application (20)
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
DESIGN AND IMPLEMENTATION OF ADVANCED MULTILEVEL PRIORITY PACKET SCHEDULING SCHEME
1. International Journal of Technical Research and Applications e-ISSN: 2320-8163,
www.ijtra.com Volume 3, Issue 1 (Jan-Feb 2015), PP. 18-22
18 | P a g e
DESIGN AND IMPLEMENTATION OF
ADVANCED MULTILEVEL PRIORITY PACKET
SCHEDULING SCHEME
A.VANI, D. Madhu Babu
Dept of ECE
CBIT
Hyderabad, India
vanialamur@yahoo.in, madhubabud4u@gmail.com
Abstract— Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and end-
to-end data transmission delays. Most of the existing packet-
scheduling mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in pre-
emptive priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Index Terms—Wireless sensor network, FCFS, CSMA, Q-
MAC
I. INTRODUCTION
The communications in the WSN has the many-to-one
property in that data from a large number of sensor nodes tend
to be concentrated into a few sinks. Since multi-hop routing is
generally needed for distant sensor nodes from the sinks to
save energy, the nodes near a sink can be burdened with
relaying a large amount of traffic from other nodes Sensor
nodes are resource constrained in term of energy, processor and
memory and low range communication and bandwidth.
Limited battery power is used to operate the sensor nodes and
is very difficult to replace or recharge it, when the nodes die.
This will affect the network performance.Energy consumption
and harvesting increase the lifetime of the network. Optimize
the communication range and minimize the energy usage.
Sensor nodes are deployed to gather information and desired
that all the nodes works continuously and transmit information
as long as possible. This addresses the lifetime problem in
wireless sensor networks. Sensor nodes spend their energy
during transmitting the data, receiving and relaying packets.
Hence, designing routing algorithms that maximize the life
time until the first battery expires is an important consideration
designing energy aware algorithms increase the lifetime of
sensor nodes. In some applications the network size is larger
required scalable architectures. Energy conservation in wireless
sensor networks has been the primary objective [2], but
however, this constrain is not the only consideration for
efficient working of wireless sensor networks. There are other
objectives like scalable architecture, routing and latency. In
most of the applications of wireless sensor networks are
envisioned to handled critical scenarios where data retrieval
time is critical, i.e., delivering information of each individual
node as fast as possible to the base station becomes an
important issue.
II. RELATED WORK
To fulfill the objectives of the thesis, understanding the
basics of Wireless Sensor Networks and its characteristics is
essential. Wireless Sensor Networks Technology, Protocols
and Applications [2] (a john Wiley & sons Inc.,
Publication2007) was referred to understand the basics of
wireless sensor networks and its characteristics. This book
refers about the concept of wireless sensor networks,
characteristics, and applications of the wireless sensor
networks. And also refers about the routing protocols for
wireless sensor networks. And also described about the
different MAC protocols useful in wireless sensor network
technology.
In this paper “RAP, new real-time communication
architecture for large-scale sensor networks” [3], Authors
(Chenyang Lu et al, Brian et al) proposed Velocity Monotonic
Scheduling (VMS). VMS assigns the priority of a packet based
on its requested velocity. A packet with a higher requested
velocity is assigned a higher priority. VMS improves the
number of packets that meet their deadlines because it assigns
the “right” priorities to packets based on their urgencies on the
current hop. But there is no detail for packet arrival distance.
And in this he paper [4], “Extending the Lifetime of
Wireless Sensor Networks through Adaptive Sleep”, when the
queue is full, higher priority incoming packets overwrite lower
priority ones. It may problem to be the low priority
information. In the paper [4], author Giuseppe et al and Hong
et al proposed an Adaptive Staggered SLEEP Protocol
(ASLEEP) for efficient power management in wireless sensor
networks targeted to periodic data acquisition. This protocol
dynamically adjusts the sleep schedules of nodes to match the
network demands, even in time-varying operating conditions. It
uses the CSMA scheme for process the data, but it may be not
efficient in fixed WSN network and there is no detail to data
management.
In this paper [5], author presents how to place sensors by
use of a minimal number to maximize the coverage area when
the communication radius of the SN is not less than the sensing
radius, which results in the application of regular topology to
2. International Journal of Technical Research and Applications e-ISSN: 2320-8163,
www.ijtra.com Volume 3, Issue 1 (Jan-Feb 2015), PP. 18-22
19 | P a g e
WSNS deployment. In this paper [5] author discussed the
details of sensor deployment. Due to optimal coverage sensor
deployment, it reduces the no of sensors usage and also
increases the lifetime of sensors. But till lifetime of sensor need
to increase.
In this paper [6], author proposed a clustering method with
coverage and energy aware TDMA scheduling scheme. And
the cluster formation is done by the base station according to
the current residual energy, and the coverage area of cluster
Member is reduced to avoid the congestion and energy
management. In this paper there is no discussion on the real
time and non-real time packet scheduling.
In this the paper [7] author present a cluster based routing
algorithm. One of author’s main goals is to design the energy
efficient routing protocol. This algorithm makes the best use of
node with low number of cluster head know as super node.
Here author divided the full region in equal zones and the
center area of the region is used to select for super node. Each
zone is considered separately and the zone may be or not
divided further that’s depending upon the density of nodes in
that zone and capability of the super node. In the paper author
considered, cluster head changes when the cluster head is
failed. It may be the problem to sensing in that area.
Author sinem et al [8] proposed the two centralized
heuristic algorithms: one based on direct node-based
scheduling, which is adapted from classical multi-hop
scheduling algorithms for general ad hoc networks, and the
other based on scheduling the levels in the routing tree before
scheduling the nodes, which is a novel scheduling algorithm
for many-to-one communication in sensor networks.
In this paper [9], authors propose Q-MAC scheme that
provides quality of service by differentiating network services
based on priority levels. The priority levels reflect the
criticality of data packets originating from different sensor
nodes. The Q-MAC accomplishes its task through two steps;
intra-node and inter-node scheduling. This paper effectively
handled the priority scheduling, but this paper only considered
the priority packets and it schedules the priority packet as the
first non-priority as second. And in the case of node gives the
first priority to own priority data compare than other nodes
packet.
Author [10] developed scheme by designing the network
with multiple-sized fixed grids while taking into account the
arbitrary-shaped area sensed by the sensor nodes. In this paper
[10], author Tarandeep et al considers the different initial
energy level of sensors, and placed that sensor according to
that energy level. So energy loss was avoided. But calculating
different initial energy level and placing the node according to
that energy level is difficult in real time.
III. Wireless Node Architecture and WSN
A wireless sensor node is capable of gathering information
from surroundings, processing and transmitting required data to
other nodes in network. The sensed signal from the
environment is analog which is then digitized by analog-to-
digital converter which is then sent to microcontroller for
further processing.[5] The block diagram of a sensing node is
shown in figure. While designing the hardware of any sensor
node the main feature in consideration is the reduction of
power consumption by the node. Most of the power
consumption is by the radio subsystem of the sensing node. So
the sending of required data over radio network is
advantageous. An algorithm is required to program a sensing
node so that it knows when to send data after event sensing in
event driven based sensor model. Another important factor is
the reduction of power consumption by the sensor which
should be in consideration as well. During the designing of
hardware of sensing node microprocessor should be allowed to
control the power to different parts such as sensor, sensor
signal conditioner and radio.
Depending on the needs of the applications and on sensors
to be deployed, the block of signal conditioning can be
replaced or re-programmed. Due to this fact a variety of
different sensors with wireless sensing node are allowed for
use. To acquire data from base station remote nodes uses flash
memory.
Fig 1. Sensor Node Architecture
Characteristics of WSN’s:
WSN have the following distinctive characteristics:
They can be deployed on large scale.
These networks are scalable; the only limitation is the
bandwidth of gateway node.
Wireless sensor networks have the ability to deal with
node failures.
Another unique feature is the mobility of nodes.
They have the ability to survive in different
environmental surroundings.
1. Advanced Multi level Priority scheduling scheme
In non pre-emptive packet scheduling schemes, real-time
data packets have to wait for completing the transmissions of
other non-real-time data packets. On the other hand, in pre-
emptive priority scheduling, non real time data will be in the
waiting state because of continuous arrival of real time data.
This Advanced Multilevel Priority packet scheduling scheme
ensures a trade off between priority and fairness. And in
existing scheduling schemes, expired packets (Dead Packets)
are removed after reaching the base station. But in this method,
node will check for the expired packets while processing the
data packets and it will delete those packets at the node itself.
Scheduling data packets among several queues of a sensor
node is presented in Figure 2. In the Advanced Multilevel
priority packet scheduling scheme, Nodes are virtually
organized following a hierarchical structure. Nodes that are
same hop distance from the bases station (BS) are considered
to be the same level. Data packets of different levels at nodes
are processed using the TDMA Scheme. Nodes that are at
lowest level and second lowest levels can be allotted time slots
1 & 2 respectively. In advanced multilevel priority packet
scheduling scheme, node has three level of priority queue.
The three priority levels are
Prirority1: Real time packets have high priority. So these
packets will be placed in priority queue level1 (PR1).
3. International Journal of Technical Research and Applications e-ISSN: 2320-8163,
www.ijtra.com Volume 3, Issue 1 (Jan-Feb 2015), PP. 18-22
20 | P a g e
Prirority2: Non Real Time packets which are generated at
lower levels have second highest priority to reduce the average
waiting time. So these packets are placed in second priority
queue level (Pr2).
Priority3: Non Real Time packets which are generated at
the local nodes have third highest priority. So these are placed
in third highest priority queue level (PR3).
Assigning the priority for the packets depending on the type of
the data is shown in the above figure 2.Real packets i.e.
emergency data packets has to reach the base station (BS) as
soon as possible so that these packets are given high priority
compared to the other data packets. Thus, end to end delay for
the real time packets is reduced. In the ready queue, Real time
data packets are processed using FCFS (First come First serve)
method.
Fig 2. Task Scheduling
Real time data packets are placed in pre-emptive priority
queue. Thus these packets on arrival preempt the processing of
non real time data packets. And priority2 packets are placed in
preempt-able queue. The processing of priority1 reduces the
end to end delay for the real time packets. If the low priority
data do not get processed for a long time then it can preempt
the high priority tasks and then starts processing of high
priority tasks. [7] And node also monitors the lifetime of the
non real time packets, if the lifetime of the packet is less than
half of its actual lifetime then node starts processing of those
packets to improve the packet delivery probability. The amount
of real time tasks is very low when compared to other tasks
because real time or emergency data will occur rarely. The
operation at the node is shown in the figure3.
Fig 3. Scheduling Scheme Operation
Each packet has an ID which consists of Level ID and
Node ID, when two equal priority packets arrive the node at
same time, node process the packet which is coming from the
lowest level. Level will be identified by the Level ID. If the
two packets having same priority reach the node at the same
time, then node starts processing of the packet which is having
less size. Node has to process and forward most of the data
sensed at the node itself and also the data which is coming
from below levels in its allocated time slot to reduce the
probability that the ready queue at the node becomes full and
also probability of packet drops. And remaining data will be
sent in further timeslots. Time slot comprised of data sensing
time, data transmission time and CPU Speed. The remaining
time of a timeslot at a particular node will be assigned to other
queues. So the presence of data packets at queue is low. The
quality of service is improved. If processing of data is
completed before expiration of its allocated timeslot, then node
goes into sleep mode. So that energy efficiency is improved.
Dead Packet Removal
Node compares the life time of the packet with the time
packet needs to reach the base station, if it is less than then
those packets are considered as dead packets and automatically
node deletes those packets at node itself so that energy
efficiency is improved. End to End delay for the remaining
packets will be improved by deleting the dead packets.
IV. ALGORITHM (for packet scheduling)
The main aim of this algorithm is how send task (packet)
according to their priority in three types of queue. Considering
level also, if data comes from lowest level then giving more
priority than local data (which is sensed at intermediate level)
then finally consider time slot at particular level.
While (task (k,i))
//task means any packet receiving that node i and K means
level
{
If (that is real time data)
{
Put that is in PR1 queue
}
Else if (node at which data sensed that’s not at lowest
level) //data also non real data
{
If (data is non local) //check whether it came from lowest level
node
{
Put in PR2 Queue
} else {
Put in PR3 Queue // local data sensed at that node itself
}
} else {//data sensed at lowest level
Put in PR2 Queue
}
//Some time slot given to level consider total time slot is Tk at
k level
Consider data sensing time Ts
Remaining time T1(K) = Tk –Ts
Let total real time task at (NODE)i at level at Level k -
nk(pr1)
Proctime(Pr1)k is total time for pr1
If (Proctime (Pr1)k <T1(k))
{
All pr1 tasks of node (i) at l (k) are processed as FCFS
Remaining Time T2 (k)= T1(k)-ProcTime(Pr1)k
Proctime (Pr2)k is total time for pr2
If (Proctime(Pr2) k < T2(K)) {
All pr2 tasks are processed as FCFS pr3 tasks are processed as
FCFS for the remaining time,
T3 (k) = T2 (k) − procTimepr2 (k)
}
else {//this loop for if pr1 task time greater than Remaining
time T2 (k)
pr2 tasks are processed for t2(k) time
no pr3 tasks are processed }//end of inner if loop
} else { //this loop for if pr1 task time greater time than total
time slot of that level
only pr1 tasks are processed for T1(k) time
4. International Journal of Technical Research and Applications e-ISSN: 2320-8163,
www.ijtra.com Volume 3, Issue 1 (Jan-Feb 2015), PP. 18-22
21 | P a g e
no pr2 and pr3 tasks are processed
}
If (pr1 queue is empty and pr2 task are processing some time
Y since T(K) < Proctimepr2(K))
{
At that time if pr3 task are coming then Pr2 task are pre-
empted
If (any pr1 task coming in this )
{
Pr3 task pre-empted and giving priority to Pr1....
Context are transferred again for processing pr3 tasks
}
If( reach_time > Reamining_time)
{ Drop that packet at node itself
}
} //end of if
}//end of while
V. RESULTS
The below parameters are assumed while simulation:
No. of mobile nodes = 15
Simulation end = 5sec
Packet size = 1000 bytes
Initial energy of the node = 1000 joules
Queue length = 50 packets
Channel Access scheme = MAC-TDMA
AODV protocol is used for creating the nodes. And minimum
distance between the nodes will be calculated to form the route
between the sources to destination via nodes.
Results of the Advanced Multilevel Priority Packet
scheduling scheme are observed by comparing with the FIFO,
multi priority, and hop based multi priority scheduling
schemes.
A. Dead Packet Removal
In this scheduling scheme, node monitors the reach time
and life time of the packets. And if the reach time is less than
the remaining lifetime then node treat them as expired packets
and immediately node deletes those packets because there is no
use of those packets, their lifetime will be completed before
reaching the base station. So that this scheduling scheme
provides good performance in terms of end to end delay and
waiting time of the packets and energy saving when compared
to other schemes. Deletion of expired packets is shown in the
figure 5.5.Reach time is calculated by using the below
equation,
Reach time = remaining hop count *10ms
Fig 4 Dead Packet Removal
B. Non Real Time Packet delay
Scheme Non Real Time Packet
delay
FIFO scheme 300 ms
Priority Based scheme 350 ms
Hop Based Multi Priority scheme 360 ms
Advanced Multilevel Priority
Scheme
260 ms
Table 1. Non Real Time Packet Delay
Fig 5.Non Relay Time Packet Delay Graph
C. Real Time Packet Delay
Scheme Real Time Packet delay
FIFO scheme 300 ms
Priority Based scheme 25 ms
Hop Based Multi Priority
scheme
28 ms
Advanced Multilevel Priority
Scheme
26 ms
Table2. Real time packet delay
Fig 6. Real Time packet delay graph
D. Waiting Time for packets at Node
The comparison of waiting time of the packets at the node
for various scheduling schemes is shown in the figure 7. For
FIFO scheme, waiting time for real time and non real time
packets is equal. In priority scheduling scheme waiting time for
non real time packets is much more when compared with the
real time packet waiting time. In hop based priority scheduling
scheme waiting time for non real time packets is less when
compared to the priority based scheduling scheme. In life based
priority packet scheduling scheme, waiting time for non real
time is reduced when compared to above three methods. And
advanced multilevel priority packet scheduling scheme,
waiting time for non real time and real time packets is reduce
when compared to all the other scheduling schemes
5. International Journal of Technical Research and Applications e-ISSN: 2320-8163,
www.ijtra.com Volume 3, Issue 1 (Jan-Feb 2015), PP. 18-22
22 | P a g e
Fig 7. Waiting timing of packets
E. Energy Consumption
Scheme Energy Saving (%)
FIFO scheme 88
Priority Based scheme 88
Hop Based Multi Priority
scheme
88
Life Time Priority scheme 88
Advanced Multilevel
Priority Scheme
90
Table 3. Energy Saving in %
Fig 8. Energy Saving Graph
VI. CONCLUSION AND FUTURE SCOPE
Advanced Multilevel Priority (DMP) packet scheduling
scheme for Wireless Sensor Networks (WSN’s). The scheme
uses three-level of priority Queues to schedule data packets
based on their types and priorities. It ensures minimum end-to-
end data transmission End-to-End Delay of all Tasks
(microSec) for the highest priority data while exhibiting
acceptable fairness towards lowest-priority data. Experimental
results show that the proposed DMP packet scheduling scheme
has better performance than the existing FCFS and Multilevel
Queue Scheduler in terms of the average task waiting time and
end to-end. It assigns the priority based on task deadline
instead of the shortest task processing time.
As a Future enhancement, by forming the nodes into zones
(consisting node levels) based topology, end to end delay
further can be reduced and also by using other channel access
techniques, deadlock situation can be avoided further.
REFERENCES
[1] Nidal Nasser, Lutful Karim, and Tarik Taleb, “Dynamic
Multilevel Priority Packet Scheduling Scheme for Wireless
Sensor Network,” IEEE Transaction wireless communications,
vol. 12, no. 4, April 2013
[2] Wireless Sensor Networks Technology, Protocols and
Applications (a john Wiley & sons Inc., Publication2007)
[3] Chenyang Lu, Brian M. Blum, Tarek F. Abdelzaher, John A.
Stankovic, Tian He, “RAP: A Real-Time Communication
Architecture for Large-Scale Wireless Sensor Networks”, 2002.
[4] Giuseppe Anastasi, Marco Conti, Mario Di Francesco,
“Extending the Lifetime of Wireless Sensor Networks through
Adaptive Sleep”, 2007
[5] “Maximizing Networking Lifetime in Wireless Sensor Networks
with Regular Topologies”, Hui Tian, Hong Shen and Matthew
Roughan.
[6] Ms.Namrata S. Baghele, “An Adaptive Energy Aware Node
Scheduling Scheme In Clustering for Wireless Sensor
Networks”, 2012
[7] Ashim Kumar Ghosh1, Anupam Kumar Bairagi2, Dr. M. Abul
Kashem3, Md. Rezwan-ul-Islam1, A J M Asraf Uddin1 “Energy
Efficient Zone Division Multihop Hierarchical Clustering
Algorithm for Load Balancing in Wireless Sensor Network. ”,
2011.
[8] Sinem Coleri Ergen and Pravin Varaiya, “TDMA Scheduling
Algorithms for Wireless Sensor Networks”, 2009
[9] Y. Liu, I. Elhanany, and H. Qi, “An energy-efficient QoS-aware
media access control protocol for wireless sensor networks,”
Nov. 2005.
[10] “A Strategic Deployment and Cluster-Header Selection for
Wireless Sensor Networks”, Tarandeep Kaur, and Jinsuk Baek,
Member, IEEE.
[11] A book on “Introduction to Network Simulator NS2” by
Teerawat Issariyakul, Ekram Hossain; Springer Publications.