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.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
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.
An Energy-efficient Data Transmission Scheme in Underwater Wireless Sensor Ne...yousef emami
Energy is a precious resource in underwater wireless
sensor networks (UWSNs). In these networks, the number of data transmissions between sensor nodes dominates energy
consumption. Complex signal processing techniques also increase energy consumption. In this paper an energy-efficient data transmission scheme based on bloom filters is proposed.
Extensive simulation is carried out to demonstrate the
effectiveness of the proposed method. Simulation results indicate that the proposed scheme outperforms the primary technique in terms of energy efficiency, lifetime, load and loss rate. The results of this research suggest that exploiting bloom filters is a viable solution for reducing the number of transmissions in UWSNs.
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.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
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.
An Energy-efficient Data Transmission Scheme in Underwater Wireless Sensor Ne...yousef emami
Energy is a precious resource in underwater wireless
sensor networks (UWSNs). In these networks, the number of data transmissions between sensor nodes dominates energy
consumption. Complex signal processing techniques also increase energy consumption. In this paper an energy-efficient data transmission scheme based on bloom filters is proposed.
Extensive simulation is carried out to demonstrate the
effectiveness of the proposed method. Simulation results indicate that the proposed scheme outperforms the primary technique in terms of energy efficiency, lifetime, load and loss rate. The results of this research suggest that exploiting bloom filters is a viable solution for reducing the number of transmissions in UWSNs.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
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.
Performance Evaluation of Consumed Energy-Type-Aware Routing (CETAR) For Wire...ijwmn
This work evaluates the performance of Consumed-Energy-Type-Aware Routing (CETAR) which incorporates the amount of energy consumed per type of operation for routing decision to extend the lifetime of the Wireless Sensor Networks (WSNs). CETAR makes routing decision using statistics of the energy consumed for each type of node activities including sensing, data processing, data transmission as a source node, and routing operations. In particular, CETAR encourages a node which seldom plays a role of source node as a routing node to preserve the energy of active source nodes to prolong the functionality of the WSNs. Extensive simulation study demonstrates that the lifetime of the Geographic and Energy Aware Routing (GEAR) can be significantly extended with CETAR. With its adaptability to deployed sensor node behaviors, the significance of CETAR to extend the lifetime of WSNs is clear.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Ad hoc networks are self-configuring networks and each node executes routing functionalities by itself;
they are powered by battery, which is prone to decrease with time. In this paper, a power aware routing
algorithm called Dynamic path switching is proposed which attempt to extend the lifetime of network in
MANET. It creates a new path based on the energy level of the nodes. Along with DPS the Transmission
power control technique is incorporated which varies the transmission power based on the distance. It
reduces power consumption further. The proposed techniques are incorporated in Zone Routing Protocol
(ZRP) and simulated by using NS-2 simulator to obtain the QOS parameters.
Modified ccef for energy efficiency and extended network lifetime in wsnsijujournal
The widespread application of wireless sensor networks (WNSs) is obstructed by the severely limited energy constraints and security threat for sensor nodes. Since traditional routing and security schemes are not suited for these networks, a large part of research focusses on energy efficient routing protocols while extending the network lifetime. Uneven distribution of communication loads result in network partitioning.
Traditional novel en-route filtering approaches, notably commutative cipher based en-route filtering (CCEF) saves energy by early filtering of false reports. However this approach main focus is security not network lifetime is limited by fixed paths and underlying routing not suitable for WSNs. In order to cater these problems we propose energy efficient routing and pre-deterministic key distribution with dynamic path selection in CCEF. Modified CCEF (MCCEF) aims at saving energy and extending network lifetime while maintaining filtering power as in CCEF. Experimental results demonstrate the validity of our
approach with an average of three times network lifetime extension, 5.022% energy savings, and similar filtering power as the original scheme
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Impact of Frequency Offset on Interference between Zigbee and Wifi for Smart ...IOSR Journals
Abstract: The Zigbee is a low cost communication technology used for low data rate communication system such as industrial automation etc. Because of its low complexity it is widely adopted for many applications. But the utilization of the same spectrum band by the WLAN system causes interference between both the systems. The proposed approach presents an analysis of this interference effect on Zigbee system when operated with WLAN sources at different distances and different power. It also analyzes the effect when a frequency offset is established between both systems. The simulation results shows that a small offset can provide sufficient improvement in the performance. Keywords: Smart Grids, Zigbee Network, Mesh Network, Wireless LAN (WLAN), BER
Design and Implementation of Encoder for (15, k) Binary BCH Code Using VHDL a...IOSR Journals
Abstract: In this paper we have designed and implemented(15, k) a BCH Encoder on FPGA using VHDL for reliable data transfers in AWGN channel with multiple error correction control. The digital logic implementation of binary encoding of multiple error correcting BCH code (15, k) of length n=15 over GF (24) with irreducible primitive polynomial x4+x+1 is organized into shift register circuits. Using the cyclic codes, the reminder b(x) can be obtained in a linear (15-k) stage shift register with feedback connections corresponding to the coefficients of the generated polynomial. Three encoder are designed using VHDL to encode the single, double and triple error correcting BCH code (15, k) corresponding to the coefficient of generated polynomial. Information bit is transmitted in unchanged form up to k clock cycles and during this period parity bits are calculated in the LFSR then the parity bits are transmitted from k+1 to 15 clock cycles. Total 15-k numbers of parity bits with k information bits are transmitted in 15 code word. Here we have implemented (15, 5, 3), (15, 7, 2) and (15, 11, 1) BCH code encoder on Xilinx Spartan 3 FPGA using VHDL and the simulation & synthesis are done using Xilinx ISE 13.3. BCH encoders are conventionally implemented by linear feedback shift register architecture. Encoders of long BCH codes may suffer from the effect of large fan out, which may reduce the achievable clock speed. The data rate requirement of optical applications require parallel implementations of the BCH encoders. Also a comparative performance based on synthesis & simulation on FPGA is presented. Keywords: BCH, BCH Encoder, FPGA, VHDL, Error Correction, AWGN, LFSR cyclic redundancy checking, fan out .
Wireless Network Security Architecture with Blowfish Encryption ModelIOSR Journals
Abstract: In this research paper ,we developed a model for a large network, wireless nodes are interconnected and each can be considered as a node processor that offer services to other node processors connected to a specific network. A very high proportion of the nodes that offer services need to carry out an authentication process so as to make an access request to the node offering the service. In this context, an integrated reconfigurable network security architecture moved to the application layer has become the need of the day for secure wireless data sharing. The security schemes of the seven layer OSI architecture need to be placed intrinsically in the wireless node itself and should be capable of supporting the MAC layer, IP address based layer and the routing protocols of the network layer. This work focuses on the use of emulator and embedded hardware architectures for wireless network security. In this work, the individual nodes can have a unique security signature pattern maintained by respective wireless nodes using an encryption algorithm and this is made dynamic. The metrics includes latency, throughput, Scalability, Effects of data transfer operation on node processor and application data located in the processor Keywords:Wireless Network security, Embedded hardware, Reconfigurable architecture, blowfish algorithm
Experimental investigation on effect of different shaped steel fibers on comp...IOSR Journals
Abstract: This paper presents the results of the experimental investigation of various strengths of steel fiber
reinforced concrete (SFRC). Variables considered in the research work of various shapes and fiber volume
fractions. Compressive strength is investigated using mix of M70 grade and hooked, flat and waved fibers with
aspect ratio 50. The fiber volume fraction is varied from 0.5% to 4% at an interval of 0.5% by weight of cement
separately. Standard test specimens for compressive strengths were cast and water cured for 7 and 28 days. All
the test specimens were tested according to relevant Indian Standards and standard test procedures available in
the literature wherever applicable. Compressive strengths are found to be increased continuously with increase
in fiber volume fraction.
Keywords: composites, SFRC, aspect ratio, fiber volume fraction, strengths
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
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.
Performance Evaluation of Consumed Energy-Type-Aware Routing (CETAR) For Wire...ijwmn
This work evaluates the performance of Consumed-Energy-Type-Aware Routing (CETAR) which incorporates the amount of energy consumed per type of operation for routing decision to extend the lifetime of the Wireless Sensor Networks (WSNs). CETAR makes routing decision using statistics of the energy consumed for each type of node activities including sensing, data processing, data transmission as a source node, and routing operations. In particular, CETAR encourages a node which seldom plays a role of source node as a routing node to preserve the energy of active source nodes to prolong the functionality of the WSNs. Extensive simulation study demonstrates that the lifetime of the Geographic and Energy Aware Routing (GEAR) can be significantly extended with CETAR. With its adaptability to deployed sensor node behaviors, the significance of CETAR to extend the lifetime of WSNs is clear.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Ad hoc networks are self-configuring networks and each node executes routing functionalities by itself;
they are powered by battery, which is prone to decrease with time. In this paper, a power aware routing
algorithm called Dynamic path switching is proposed which attempt to extend the lifetime of network in
MANET. It creates a new path based on the energy level of the nodes. Along with DPS the Transmission
power control technique is incorporated which varies the transmission power based on the distance. It
reduces power consumption further. The proposed techniques are incorporated in Zone Routing Protocol
(ZRP) and simulated by using NS-2 simulator to obtain the QOS parameters.
Modified ccef for energy efficiency and extended network lifetime in wsnsijujournal
The widespread application of wireless sensor networks (WNSs) is obstructed by the severely limited energy constraints and security threat for sensor nodes. Since traditional routing and security schemes are not suited for these networks, a large part of research focusses on energy efficient routing protocols while extending the network lifetime. Uneven distribution of communication loads result in network partitioning.
Traditional novel en-route filtering approaches, notably commutative cipher based en-route filtering (CCEF) saves energy by early filtering of false reports. However this approach main focus is security not network lifetime is limited by fixed paths and underlying routing not suitable for WSNs. In order to cater these problems we propose energy efficient routing and pre-deterministic key distribution with dynamic path selection in CCEF. Modified CCEF (MCCEF) aims at saving energy and extending network lifetime while maintaining filtering power as in CCEF. Experimental results demonstrate the validity of our
approach with an average of three times network lifetime extension, 5.022% energy savings, and similar filtering power as the original scheme
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Impact of Frequency Offset on Interference between Zigbee and Wifi for Smart ...IOSR Journals
Abstract: The Zigbee is a low cost communication technology used for low data rate communication system such as industrial automation etc. Because of its low complexity it is widely adopted for many applications. But the utilization of the same spectrum band by the WLAN system causes interference between both the systems. The proposed approach presents an analysis of this interference effect on Zigbee system when operated with WLAN sources at different distances and different power. It also analyzes the effect when a frequency offset is established between both systems. The simulation results shows that a small offset can provide sufficient improvement in the performance. Keywords: Smart Grids, Zigbee Network, Mesh Network, Wireless LAN (WLAN), BER
Design and Implementation of Encoder for (15, k) Binary BCH Code Using VHDL a...IOSR Journals
Abstract: In this paper we have designed and implemented(15, k) a BCH Encoder on FPGA using VHDL for reliable data transfers in AWGN channel with multiple error correction control. The digital logic implementation of binary encoding of multiple error correcting BCH code (15, k) of length n=15 over GF (24) with irreducible primitive polynomial x4+x+1 is organized into shift register circuits. Using the cyclic codes, the reminder b(x) can be obtained in a linear (15-k) stage shift register with feedback connections corresponding to the coefficients of the generated polynomial. Three encoder are designed using VHDL to encode the single, double and triple error correcting BCH code (15, k) corresponding to the coefficient of generated polynomial. Information bit is transmitted in unchanged form up to k clock cycles and during this period parity bits are calculated in the LFSR then the parity bits are transmitted from k+1 to 15 clock cycles. Total 15-k numbers of parity bits with k information bits are transmitted in 15 code word. Here we have implemented (15, 5, 3), (15, 7, 2) and (15, 11, 1) BCH code encoder on Xilinx Spartan 3 FPGA using VHDL and the simulation & synthesis are done using Xilinx ISE 13.3. BCH encoders are conventionally implemented by linear feedback shift register architecture. Encoders of long BCH codes may suffer from the effect of large fan out, which may reduce the achievable clock speed. The data rate requirement of optical applications require parallel implementations of the BCH encoders. Also a comparative performance based on synthesis & simulation on FPGA is presented. Keywords: BCH, BCH Encoder, FPGA, VHDL, Error Correction, AWGN, LFSR cyclic redundancy checking, fan out .
Wireless Network Security Architecture with Blowfish Encryption ModelIOSR Journals
Abstract: In this research paper ,we developed a model for a large network, wireless nodes are interconnected and each can be considered as a node processor that offer services to other node processors connected to a specific network. A very high proportion of the nodes that offer services need to carry out an authentication process so as to make an access request to the node offering the service. In this context, an integrated reconfigurable network security architecture moved to the application layer has become the need of the day for secure wireless data sharing. The security schemes of the seven layer OSI architecture need to be placed intrinsically in the wireless node itself and should be capable of supporting the MAC layer, IP address based layer and the routing protocols of the network layer. This work focuses on the use of emulator and embedded hardware architectures for wireless network security. In this work, the individual nodes can have a unique security signature pattern maintained by respective wireless nodes using an encryption algorithm and this is made dynamic. The metrics includes latency, throughput, Scalability, Effects of data transfer operation on node processor and application data located in the processor Keywords:Wireless Network security, Embedded hardware, Reconfigurable architecture, blowfish algorithm
Experimental investigation on effect of different shaped steel fibers on comp...IOSR Journals
Abstract: This paper presents the results of the experimental investigation of various strengths of steel fiber
reinforced concrete (SFRC). Variables considered in the research work of various shapes and fiber volume
fractions. Compressive strength is investigated using mix of M70 grade and hooked, flat and waved fibers with
aspect ratio 50. The fiber volume fraction is varied from 0.5% to 4% at an interval of 0.5% by weight of cement
separately. Standard test specimens for compressive strengths were cast and water cured for 7 and 28 days. All
the test specimens were tested according to relevant Indian Standards and standard test procedures available in
the literature wherever applicable. Compressive strengths are found to be increased continuously with increase
in fiber volume fraction.
Keywords: composites, SFRC, aspect ratio, fiber volume fraction, strengths
Mathematical Modelling: A Comparatively Mathematical Study Model Base between...IOSR Journals
In this paper, we have studied on the topic of „Corruption‟. Also, I will try to find or study the effect of corruption on the Development of the country or any country of the world. Therefore, how find the solution of the problem of corruption will be destroyed completely from the society. We have observed that the Development of the country depends upon Corruption. That is, when the Corruption increases, Development decreases automatically of any country of the world. Therefore, I will try to find the formula on the problem of „Relation between the Corruption and Development of any field or any country of the world‟. Also, I have to highlight the concept of „Application of Mathematical modeling in the interesting problem “corruption” in every field of our country or world .Also, Applied Mathematics focuses on the formulation and study of Mathematical Models .Thus the activity of Applied Mathematics is vitally connected with Research in Pure Mathematics. So I will try to study on it and find, what is corruption and quantity of corruption and also find the growth of corruption and how it will decay? Now we convert this areal world problem to mathematics problem and find some formulae on it such as Mathematical Corruption Growth formula, Mathematical Constant corruption level formula and Mathematical decay of corruption formula.
Fluorescence technique involves the optical detection and spectral analysis of light emitted by a substance undergoing a transition from an excited electronic state to a lower electronic state. The aim of this study is to assess the -amino levulinic acid (-ALA) uptake. Based on image processing technique, Matlab was used to analyze the fluorescence images resulted from activation of (-ALA) and follow its uptake along one week. Analyzing the RGB colours pixel profile from obtained results showed different profiles for malignant tissues, normal tissues, treated just after PDT and finally at one week post PDT. The treated tissues fluorescence profile showed changes from closer to malignant tissue profile till been closed to normal one.
Perishable Inventory Model Having Weibull Lifetime and Time Dependent DemandIOSR Journals
In this paper we develop and analyse an inventory model for deteriorating items with Weibull rate of decay and time dependent demand. Using the differential equations, the instantaneous state of inventory at time‘t’, the amount of deterioration etc. are derived. With suitable cost considerations the total cost function and profit rate function are also obtained by maximizing the profit rate function, the optimal ordering and pricing policies of the model are derived. The sensitivity of the model with respect to the parameters is discussed through numerical illustration. It is observed that the deteriorating parameters have a tremendous influence on the optimal selling price and ordering quantity.
Performance and Evaluation of Data Mining Techniques in Cancer DiagnosisIOSR Journals
Abstract: We analyze the breast Cancer data available from the WBC, WDBC from UCI machine learning with
the aim of developing accurate prediction models for breast cancer using data mining techniques. Data mining
has, for good reason, recently attracted a lot of attention, it is a new Technology, tackling new problem, with
great potential for valuable commercial and scientific discoveries. The experiments are conducted in WEKA.
Several data mining classification techniques were used on the proposed data. There are many classification
techniques in data mining such as Decision Tree, Rules NNge, Tree random forest, Random Tree, lazy IBK. The
aim of this paper is to investigate the performance of different classification techniques. The data breast cancer
data with a total 286 rows and 10 columns will be used to test and justify the different between the classification
methods and algorithm.
Keywords - Machine learning, data mining Weka, classification, breast cancer
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of MIMO communication in such type of network is enhancing the packet transmission capabilities. There are different techniques for cooperative transmission and broadcasting packet in MIMO equipped Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a new scheduling algorithm based on investigating the different broadcasting algorithm. The new broadcasting algorithm improves the packet transmission rate of the network based on energy performance of the network and minimizes the BER for different transmission mode which is illustrated in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result for the packet transmission rate are collected and shown in the tabular form. Also simulate the network for generating a comparative statement for each mobile node. And performance analysis is also done for the model network. The main focus is to minimize BER and improve information efficiency of the network.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
Energy efficient load balanced routing protocol for wireless sensor networkscsandit
Telecommunications is increasingly vital to the society at large, and has become essential to
business, academic, as well as social activities. Due to the necessity to have access to
telecommunications, the deployment requires regulations and policy. Otherwise, the deployment
of the infrastructures would contribute to environment, and human complexities rather than
ease of use.
However, the formulation of telecommunication infrastructure deployment regulation and
policy involve agents such as people and processes. The roles of the agents are critical, and are
not as easy as it meant to belief. This could be attributed to different factors, as they produce
and reproduce themselves overtime.
This paper presents the result of a study which focused on the roles of agents in the formulation
of telecommunication infrastructures deployment regulation and policy. In the study, the
interactions that take place amongst human and non-human agents were investigated. The study
employed the duality of structure, of Structuration theory as lens to understand the effectiveness
of interactions in the formulation of regulations, and how policy is used to facilitate the
deployment of telecommunications infrastructure in the South African environment.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
Leading Change strategies and insights for effective change management pdf 1.pdf
M010226367
1. IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 2, Ver. II (Mar - Apr.2015), PP 63-67
www.iosrjournals.org
DOI: 10.9790/2834-10226367 www.iosrjournals.org 63 | Page
Finding an Optimum Transmission Range in a multi-sink
Wireless sensor network to make a tradeoff between delay and
energy consumption
Bharti sharma1 and Kaushik Ghosh2
1,2Department of Computer Science & Engineering, Mody university Lakshmangarh, Rajasthan, India
Abstract: Increasing the lifetime in wireless sensor networks is a major challenge because the nodes are
equipped with low power batteries. The effective way to increase the energy efficiency is to reduce the
transmission overheads and to choose accurate routing technique for data transmission. When two
communicating nodes are not in range of each other in wireless Sensor networks, they need to rely on multi-hop
transmissions. In such a case, packet forwarding or packet routing, becomes imperative. The selected value of
radio transmission range considerably affects network topology and node energy consumption. On the one
hand, a large transmission range increases the distance progress of data packets toward their final destinations.
This is unfortunately achieved at the expense of high energy consumption per transmission. On the other hand,
a short transmission range uses less energy to forward packets to the next hop, but a large number of hops are
required for packets to reach their destinations. Thus, there exists an optimum value of the radio transmission
range. In this paper we have studied the effect of certain factor such as source selection, node deployment,
transmission range, number of intermediate hops and forwarding techniques to make a tradeoff between Delay
and Energy Consumption
Keywords: Lifetime, Energy Efficiency, Transmission range, energy consumption, intermediate hops.
I. Introduction
Wireless Sensor Networks (WSN's) have attracted a great deal of research attention due to the wide-
range of potential applications. Applications of WSNs include battlefield surveillance, biological detection,
medical monitoring, home security and inventory tracking [2]. This type of Network consists of a group of
nodes and each node has limited battery power. There may be many possible routes available between two
nodes over which data can flow. Any node in the network can easily transmit their data packet to a distance
node if it has enough battery power. If any node is far from its neighbour node then large amount of
transmission energy is required to transmit the data to Destination node. After every transmission, remaining
energy of this node decreases and some amount of data transmission this node will be eliminated from the
network because of empty battery power and in similar situation there will be a condition that no node is
available for data transmission and overall lifetime of network will decreases [4]. One of the most important
performance measures for wireless sensor networks is network lifetime. Whereas network lifetime is defined as
the time until all nodes are able to send or receive data. For maximizing the network lifetime, data should be
routed such that energy expenditure is fair among the nodes in proportion to their energy reserved, instead of
routing the data to a path that Minimize consumed power [5].
The main component of energy consumption in a wireless sensor network is the energy consumed for
transmitting. This transmitting energy consumption increases exponentially with the transmitting distance [7] so
it might appear that more the transmitting radius of a node more is the energy consumption and thereby lesser
the lifetime of a network. But the flip side of having more transmitting radius is having more number of
neighbours we choose for packet forwarding. So it becomes important to choose an optimum transmitting radius
for nodes to enhance the life time of multi-sink wireless sensor network.
In section 2 of this paper, we discuss some of the existing routing protocols. In section 3 the proposed
scheme to show the energy consumption and number of intermediate hops variations according to different
parameters have been described. Section 4 consists of the experimental results and in section 5 follows the
conclusions thus drawn.
II. Related Works
In wireless sensor network, data transmission is very expensive in terms of energy consumption, while
data processing consumes significantly lesser energy [1]. The energy cost of transmitting a single bit of the
information is approximately the same as that needed for processing a thousand operations in typical sensor
node [2]. The communication subsystem has much higher energy requirement than the computation subsystem.
Most of the earlier works on energy efficient routing in wireless sensor network uses the Minimum total energy
2. Finding an Optimum Transmission Range in a multi-sink Wireless sensor network to make a ….
DOI: 10.9790/2834-10226367 www.iosrjournals.org 64 | Page
(MTE) routing for data transmission approach to minimize the energy consumption to reach the destination.
This was done by sending the traffic through same path for consecutive transmissions. But if all the traffic
follows the same path then all the nodes of that path will deplete their energy quickly [3].
Effect of a transmission radius, number of nodes and the transmission area in the lifetime of a wireless
sensor network has been discussed in[4].It was seen that lifetime increases with an increase in number of nodes
and transmission area and decreases with an increase in transmission range of sensor nodes. In [5], the optimal
transmission radii1 that maximizes the expected packet progress in the desired direction were determined for
different transmission protocols in a multi-hop packet radio network with randomly distributed terminals. The
optimal transmission radii were expressed in terms of the number of terminals in the range.
In [6], Multiple Sink Dynamic Destination Geographic Routing (MSDDGR) is proposed. It is based on
greedy forwarding scheme. When a packet needs to be sent the sender selects the nearest sink as the current
destination. Also, if the intermediate node sees that another sink is nearer to it, then the current destination node
is changed and the new sink node is selected as the destination
The optimization of transmission range as a system design issue was studied in [7]. The wireless
network was assumed to have high node density and to consist of nodes with relatively low mobility and short
transmission range. As justified by the assumption of high node density, the authors further assumed that
intermediate routing nodes are always available at the desired location whenever they are needed. Considering
the nodes without power control capability, the authors argued that the optimal transmission range can be set at
the system design stage. Specifically, they showed that the optimal one-hop transmission progressive distance is
independent of the physical network topology, the number of transmission sources, and the total transmission
distance; and that it only depends on the propagation environment and radio transceiver device parameters.
A similar assumption was made in [8], even though the node density was only considered for the
energy consumption of overhearing nodes. They investigated the problem of selecting an energy-efficient
transmission power to minimize global energy consumption for ad hoc networks. They concluded that the
average neighbourhood size is a useful parameter in finding the optimal balance point. Effect of network
lifetime on forwarding technique selection has been discussed by Ghosh and Das [13]. In [15], a protocol called
MRMS (Multipath Routing in large scale Sensor networks with Multiple Sink nodes) is proposed which
incorporates multiple sink nodes. In MRMS, a primary path is created with minimum path cost. It also saves the
other paths from different Sinks. Thus, when the primary path is not reachable or if the residual energy of the
sensors along the path falls below a certain threshold, another path is selected.
III. Present work
Transmission range, number of intermediate hops, size of the coverage area and data forwarding
techniques are the crucial factors in calculating the energy consumption of WSNs. A comparable study of
different forwarding techniques is present in [4 ]. The source nodes or intermediate nodes select a next node to
forward the data to the destination based on different criteria, the process repeats until data reaches the
destination. In the greedy forwarding technique, neighbour node nearer to the sink is chosen considering its
distance from sink node as a criterion. In the residual energy based forwarding technique, remaining energy of
the neighbouring nodes is used as a criterion to select the next node. We have used these two forwarding
techniques here for finding an optimum transmission range to enhance network lifetime.
The nodes were deployed in a grid fashion as shown in Figure 1.
3. Finding an Optimum Transmission Range in a multi-sink Wireless sensor network to make a ….
DOI: 10.9790/2834-10226367 www.iosrjournals.org 65 | Page
NOTE: The (*) marked fields shows the default values. These values have been changed as per the experimental
needs.
The radio model proposed in [17] has been used here.
ETX (m, d) =m*E+m* ε * d2
ERX (m) =m*E
Where
E=50nJ/bit and ε = 10 pJ/bit/ m2.
ETX= Energy Consumed for transmission
ERX=Energy Consumed for reception
d= Distance between transmitting and receiving node
ε= Permittivity of free space
m=number of bits
IV. Performance Evaluation and discussion
Before measuring the energy consumption in a WSN, one must decide a particular forwarding
technique for transmission and receiving data packet. In our case, we are using greedy forwarding and residual
energy based forwarding. Figure 1 show the deployment pattern formed when the location of nodes is taken in a
grid fashion and the source node is selected randomly.
Fig.1 Pseudo-random deployment with 387 nodes in an area of 250 x 250. Node 111selected as Source node and
Node 1, 2, 3 are Sink nodes.
4.1 Transmission Range vs. Energy Consumption
Fig.2 Energy consumption variation with increase Fig.3 Energy Consumption variation with increase
Transmission Transmission Range by using greedy forwarding technique. Range by using residual energy
based forwarding.
In Fig.3 and fig, 4 shows an increment in the total energy consumption of the network with increase the
transmission range of nodes within a fixed coverage area by using greedy forwarding and residual energy based
forwarding respectively. The total energy Consumption in the WSN is directly proportional to the transmission
4. Finding an Optimum Transmission Range in a multi-sink Wireless sensor network to make a ….
DOI: 10.9790/2834-10226367 www.iosrjournals.org 66 | Page
range while using greedy forwarding technique. Whereas, for residual energy based forwarding, we see a
parabolic nature of the graph, when total energy consumption is plotted against increased transmission range.
4.2 transmission ranges vs. No. of intermediate nodes
Fig.4 No. of intermediate hops variation with increase Fig.5 No. of intermediate hops variation
with increase
Transmission Range by using greedy forwarding technique. Transmission Range by using residual
energy based forwarding
The figure 5 and 6 shows the effect of transmission range on the total number of intermediate hops of a
WSN by using greedy forwarding and residual energy based forwarding respectively within a fixed coverage
area. As we increase the transmission range the Number of intermediate hops of the sensor node decreases. By
total number of intermediate hops we mean, the cumulative number of hops every packet encounters throughout
the lifetime of the network.
4.3 optimum transmission ranges
Fig.6 optimum transmission Range by using greedy Fig.7optimum Transmission range by using
residual energy based
Forwarding Technique forwarding
Now, to find out the optimum transmission range, we plot both graphs in together to get a crossover point . We
propose this crossover point to be the optimum transmission range.
In figure 6 we can see the optimum transmission range is 50 using greedy forwarding.
Same comparison for residual energy based forwarding. In figure 7 shows that range 50 is also an optimum
range for residual energy based forwarding.
Hence, we can say range 50 is an optimum range of both forwarding techniques.
V. Conclusion and future work
The experimental result shows that the transmission range, number of intermediate nodes and the
transmission area have a direct effect on the lifetime of a WSN. Our experimental result shows a direct relation
5. Finding an Optimum Transmission Range in a multi-sink Wireless sensor network to make a ….
DOI: 10.9790/2834-10226367 www.iosrjournals.org 67 | Page
to the energy consumption and transmission range while an inverse relation to the transmission range and
number of intermediates hops of the sensor nodes. Energy consumption increase with increases transmission
range and number of intermediate nodes decreases with increase transmission ranges. The future work may
involve the effect of various parameters on lifetime of WSN and will propose a protocol that enhance the
lifetime of a WSN.
References
[1]. V. Raghunathan, C. Schurghers& M. Srivastava, (2002) "Energy-aware Wireless Micro sensor Networks", IEEE Communication
Magazine, pp. 40-50.
[2]. G. Pottie, W. Kaiser, (2000) "Wireless Integrated Network Sensors, Communication of ACM", Vol. 43, no. 5, pp. 51-58.
[3]. Singh, Woo &Raghavendra, (1998) Power-aware routing in mobile ad hoc networks, 4th Annual IEEE/ACM Int. Conf. Mobile
Computing and Networking, pp. 181–190, Dallas, TX .
[4]. Jyoti Kaurav and Kaushik Ghosh "Effect of Transmitting Radius, Coverage Area and Node Density on the Lifetime of a Wireless
Sensor Network" Department of Computer Science & Engineering, Mody University 2012.
[5]. I. Dietrich and F. Dressler, “On the Lifetime of Wireless Sensor Networks,” ACM Transactions on Sensor Networks (TOSN), vol.
5, no. 1, pp. 1–39, February 2009.
[6]. R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proc.
IEEE INFOCOM, Mar. 2000, pp. 404–413.
[7]. H. Takagi and L. Kleinrock, "Optimal transmission ranges for randomly distributed packet radio terminals," IEEE Trans. Commun.,
vol. COM-32,no. 3, pp. 246–257, Mar. 1984.
[8]. T.-C. Hou and V. O. K. Li, "Transmission range control in multihop packet radio networks," IEEE Trans. Commun., vol. COM-34,
no. 1, pp. 38–44, Jan. 1986.
[9]. L. Cao, C. Xu, W. Shao, Multiple Sink Dynamic Destination Geographic Routing in Wireless Sensor Networks, in Procs. of the
International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Huangshan, 2010.
[10]. V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks,"IEEE J. Sel. Areas Commun., vol. 17, no. 8, pp. 1333–
1344, Aug. 1999.
[11]. P. Chen, B. O'Dea, and E. Callaway, "Energy efficient system design with optimum transmission range for wireless ad hoc
networks," in Proc. IEEE ICC, 2002, pp. 945–952.
[12]. Y. Chen, E. G. Sirer, and S. B. Wicker, "On selection of optimal transmission power for ad hoc networks," in Proc. 36th Hawaii Int.
Conf. Syst. Sci., Jan. 2003, pp. 300–309.
[13]. Y. Chen, E. Chan, S. Han, Energy-Efficient Multipath Routing in Large Scale Sensor Networks with Multiple Sink Nodes, in Procs.
of APPT, 2005, 390-399.
[14]. Ghosh, K., Das, P.K.: Effect of forwarding strategy on the lifetime of multi-hop multi-sink sensor network.In: Third International
Conference on Trends in Information, Telecommunication, and Computing, vol. 150.LNEE (2013).
[15]. K.N. Chairman, M. Younus, M.Y. Javed, NSN based Multi-Sink Minimum Delay Energy Efficient Routing in Wireless Sensor
Networks, European Journal of Scientific Research, 41, 2010, 399-411.