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.
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.
Opportunistic routing algorithm for relay node selection in wireless sensor n...LogicMindtech Nologies
NS2 Projects for M. Tech, NS2 Projects in Vijayanagar, NS2 Projects in Bangalore, M. Tech Projects in Vijayanagar, M. Tech Projects in Bangalore, NS2 IEEE projects in Bangalore, IEEE 2015 NS2 Projects, WSN and MANET Projects, WSN and MANET Projects in Bangalore, WSN and MANET Projects in Vijayangar
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.
Opportunistic routing algorithm for relay node selection in wireless sensor n...LogicMindtech Nologies
NS2 Projects for M. Tech, NS2 Projects in Vijayanagar, NS2 Projects in Bangalore, M. Tech Projects in Vijayanagar, M. Tech Projects in Bangalore, NS2 IEEE projects in Bangalore, IEEE 2015 NS2 Projects, WSN and MANET Projects, WSN and MANET Projects in Bangalore, WSN and MANET Projects in Vijayangar
CONTEXT-AWARE ENERGY CONSERVING ROUTING ALGORITHM FOR INTERNET OF THINGSIJCNCJournal
Internet of Things (IoT) is the fast- growing technology, mostly used in smart mobile devices such as notebooks, tablets, personal digital assistants (PDA), smartphones, etc. Due to its dynamic nature and the limited battery power of the IoT enabled smart mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Existing algorithm does not concentrate about communication links and battery power/energy, but these node links are a very important factor for improving the quality of routing in IoT. In this paper, Context-aware Energy Conserving Algorithm for routing (CECA) was proposed which employs QoS routing metrics like Inter-Meeting Time and residual energy and has been applied to IoT enabled smart mobile devices using different technologies with different microcontroller which resulted in an increased network lifetime, throughput and reduced control overhead and the end to end delay. Simulation results show that, with respect to the speed of the mobile nodes from 2 to 10m/s, CECA increases the network lifetime, thereby increasing the average residual energy by 11.1% and increasing throughput there by reduces the average end to end delay by 14.1% over the Energy-Efficient Probabilistic Routing (EEPR) algorithm. With respect to the number of nodes increases from 10 to 100 nodes, CECA algorithms increase the average residual energy by16.1 % reduces the average end to end delay by 15.9% and control overhead by 23.7% over the existing EEPR
Performance Evaluation of Mini-sinks Mobility Using Multiple Paths in Wireles...CSCJournals
This paper presents a new approach based on the use of many data collectors, which we designate Mini-Sinks (MSs), instead of a single sink to collect the data in order to improve Wireless Sensor Network (WSN) performance. One or more MS are mobile and move according to a controlled arbitrary mobility model inside the sensor field in order to maintain a fully-connected network topology, collecting data within their coverage areas and forwarding it towards the single main sink. Energy Conserving Routing Protocol (ECRP), based on route diversity, is implemented in MSs and sensors in order to optimize the transmission cost of the forwarding scheme. A set of multiple routing paths between MSs and sensors is generated to distribute the global traffic over the entire network. Simulations were performed in order to validate the performance of our new approach. We compare the results obtained with those for a single static sink and mobile sink, and show that our approach can achieve better performances such as packet delivery ratio, throughput, end-to-end delay, network lifetime, residual energy, energy and routing diversity overhead.
The Wireless sensor networks (WSN) consisting of a large number of sensors that are effective for gathering data
in a variety of environments, as the sensor operate on battery which is of limited power. To support high scalability and better data aggregation in fixed base station communication, sensor nodes are often grouped into disjoint, non overlapping subsets called clusters. Clusters create hierarchical WSN which incorporate efficient utilization of limited resources of sensor nodes. These clusters are formed by specialized cells. Each cluster is managed by a special node called cluster head and advanced node. An algorithm for better cluster head selection
based on the node energy and the distance from base station to the cluster head for the efficient transmission and to reduce energy consumption by the sensor nodes is proposed in this paper. And the same algorithm is compared with the LEACH algorithm in terms of energy consumption.
Survey: energy efficient protocols using radio scheduling in wireless sensor ...IJECEIAES
An efficient energy management scheme is crucial factor for design and implementation of any sensor network. Almost all sensor networks are structured with numerous small sized, low cost sensor devices which are scattered over the large area. To improvise the network performance by high throughput with minimum energy consumption, an energy efficient radio scheduling MAC protocol is effective solution, since MAC layer has the capability to collaborate with distributed wireless networks. The present survey study provides relevant research work towards radio scheduling mechanism in the design of energy efficient wireless sensor networks (WSNs). The various radio scheduling protocols are exist in the literature, which has some limitations. Therefore, it is require developing a new energy efficient radio scheduling protocol to perform multi tasks with minimum energy consumption (e.g. data transmission). The most of research studies paying more attention towards to enhance the overall network lifetime with the aim of using energy efficient scheduling protocol. In that context, this survey study overviews the different categories of MAC based radio scheduling protocols and those protocols are measured by evaluating their data transmission capability, energy efficiency, and network performance. With the extensive analysis of existing works, many research challenges are stated. Also provides future directions for new WSN design at the end of this survey.
AN OPTIMIZED WEIGHT BASED CLUSTERING ALGORITHM IN HETEROGENEOUS WIRELESS SENS...cscpconf
The last few years have seen an increased interest in the potential use of wireless sensor networks (WSNs) in various fields like disastermanagementbattle field surveillance, and border security surveillance. In such applications, a large number of sensor nodes are deployed, which are often unattended and work autonomously. The process of dividing the network into interconnected substructures is called clustering and the interconnected substructures are called clusters. The cluster head (CH) of each cluster act as a coordinator within the substructure. Each CH acts as a temporary base station within its zone or cluster. It also communicates with other CHs. Clustering is a key technique used to extend the lifetime of a sensor network by reducing energy consumption. It can also increase network scalability. Researchers in all fields of wireless sensor network believe that nodes are homogeneous, but
some nodes may be of different characteristics to prolong the lifetime of a WSN and its reliability. We have proposed an algorithm for better cluster head selection based on weights for different parameter that influence on energy consumption which includes distance from base station as a new parameter to reduce number of transmissions and reduce energy consumption by sensor nodes. Finally proposed algorithm compared with the WCA, IWCA algorithm in terms of number of clusters and energy consumption.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyAM Publications
a wireless sensor network is network form of sense compute, and communication elements which helps to
observe, events in a specified environment. Sensor nodes in wireless sensor network are depends on battery power they
have limited transmission range that’s why energy efficiency plays a vital role to minimize the overhead through which
the Network Lifetime can be achieved. The lifetime of network, depends on number of nodes, strength, range of area
and connectivity of nodes in the network. In this paper we are over viewing techniques which are used in wireless sensor
network for load balancing. Wireless sensor network having different nodes with different kind of energy which can be
improve the lifetime of the network and its dependability. This paper will provide the person who reads with the
groundwork for research in load balancing techniques for wireless sensor networks.
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.
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.
Mobile relay configuration in data intensive wireless sensor networksIEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Mobile relay configuration in data i...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
CONTEXT-AWARE ENERGY CONSERVING ROUTING ALGORITHM FOR INTERNET OF THINGSIJCNCJournal
Internet of Things (IoT) is the fast- growing technology, mostly used in smart mobile devices such as notebooks, tablets, personal digital assistants (PDA), smartphones, etc. Due to its dynamic nature and the limited battery power of the IoT enabled smart mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Existing algorithm does not concentrate about communication links and battery power/energy, but these node links are a very important factor for improving the quality of routing in IoT. In this paper, Context-aware Energy Conserving Algorithm for routing (CECA) was proposed which employs QoS routing metrics like Inter-Meeting Time and residual energy and has been applied to IoT enabled smart mobile devices using different technologies with different microcontroller which resulted in an increased network lifetime, throughput and reduced control overhead and the end to end delay. Simulation results show that, with respect to the speed of the mobile nodes from 2 to 10m/s, CECA increases the network lifetime, thereby increasing the average residual energy by 11.1% and increasing throughput there by reduces the average end to end delay by 14.1% over the Energy-Efficient Probabilistic Routing (EEPR) algorithm. With respect to the number of nodes increases from 10 to 100 nodes, CECA algorithms increase the average residual energy by16.1 % reduces the average end to end delay by 15.9% and control overhead by 23.7% over the existing EEPR
Performance Evaluation of Mini-sinks Mobility Using Multiple Paths in Wireles...CSCJournals
This paper presents a new approach based on the use of many data collectors, which we designate Mini-Sinks (MSs), instead of a single sink to collect the data in order to improve Wireless Sensor Network (WSN) performance. One or more MS are mobile and move according to a controlled arbitrary mobility model inside the sensor field in order to maintain a fully-connected network topology, collecting data within their coverage areas and forwarding it towards the single main sink. Energy Conserving Routing Protocol (ECRP), based on route diversity, is implemented in MSs and sensors in order to optimize the transmission cost of the forwarding scheme. A set of multiple routing paths between MSs and sensors is generated to distribute the global traffic over the entire network. Simulations were performed in order to validate the performance of our new approach. We compare the results obtained with those for a single static sink and mobile sink, and show that our approach can achieve better performances such as packet delivery ratio, throughput, end-to-end delay, network lifetime, residual energy, energy and routing diversity overhead.
The Wireless sensor networks (WSN) consisting of a large number of sensors that are effective for gathering data
in a variety of environments, as the sensor operate on battery which is of limited power. To support high scalability and better data aggregation in fixed base station communication, sensor nodes are often grouped into disjoint, non overlapping subsets called clusters. Clusters create hierarchical WSN which incorporate efficient utilization of limited resources of sensor nodes. These clusters are formed by specialized cells. Each cluster is managed by a special node called cluster head and advanced node. An algorithm for better cluster head selection
based on the node energy and the distance from base station to the cluster head for the efficient transmission and to reduce energy consumption by the sensor nodes is proposed in this paper. And the same algorithm is compared with the LEACH algorithm in terms of energy consumption.
Survey: energy efficient protocols using radio scheduling in wireless sensor ...IJECEIAES
An efficient energy management scheme is crucial factor for design and implementation of any sensor network. Almost all sensor networks are structured with numerous small sized, low cost sensor devices which are scattered over the large area. To improvise the network performance by high throughput with minimum energy consumption, an energy efficient radio scheduling MAC protocol is effective solution, since MAC layer has the capability to collaborate with distributed wireless networks. The present survey study provides relevant research work towards radio scheduling mechanism in the design of energy efficient wireless sensor networks (WSNs). The various radio scheduling protocols are exist in the literature, which has some limitations. Therefore, it is require developing a new energy efficient radio scheduling protocol to perform multi tasks with minimum energy consumption (e.g. data transmission). The most of research studies paying more attention towards to enhance the overall network lifetime with the aim of using energy efficient scheduling protocol. In that context, this survey study overviews the different categories of MAC based radio scheduling protocols and those protocols are measured by evaluating their data transmission capability, energy efficiency, and network performance. With the extensive analysis of existing works, many research challenges are stated. Also provides future directions for new WSN design at the end of this survey.
AN OPTIMIZED WEIGHT BASED CLUSTERING ALGORITHM IN HETEROGENEOUS WIRELESS SENS...cscpconf
The last few years have seen an increased interest in the potential use of wireless sensor networks (WSNs) in various fields like disastermanagementbattle field surveillance, and border security surveillance. In such applications, a large number of sensor nodes are deployed, which are often unattended and work autonomously. The process of dividing the network into interconnected substructures is called clustering and the interconnected substructures are called clusters. The cluster head (CH) of each cluster act as a coordinator within the substructure. Each CH acts as a temporary base station within its zone or cluster. It also communicates with other CHs. Clustering is a key technique used to extend the lifetime of a sensor network by reducing energy consumption. It can also increase network scalability. Researchers in all fields of wireless sensor network believe that nodes are homogeneous, but
some nodes may be of different characteristics to prolong the lifetime of a WSN and its reliability. We have proposed an algorithm for better cluster head selection based on weights for different parameter that influence on energy consumption which includes distance from base station as a new parameter to reduce number of transmissions and reduce energy consumption by sensor nodes. Finally proposed algorithm compared with the WCA, IWCA algorithm in terms of number of clusters and energy consumption.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyAM Publications
a wireless sensor network is network form of sense compute, and communication elements which helps to
observe, events in a specified environment. Sensor nodes in wireless sensor network are depends on battery power they
have limited transmission range that’s why energy efficiency plays a vital role to minimize the overhead through which
the Network Lifetime can be achieved. The lifetime of network, depends on number of nodes, strength, range of area
and connectivity of nodes in the network. In this paper we are over viewing techniques which are used in wireless sensor
network for load balancing. Wireless sensor network having different nodes with different kind of energy which can be
improve the lifetime of the network and its dependability. This paper will provide the person who reads with the
groundwork for research in load balancing techniques for wireless sensor networks.
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.
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.
Mobile relay configuration in data intensive wireless sensor networksIEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Mobile relay configuration in data i...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
Content personalisation is becoming more prevalent. A site, it's content and/or it's products, change dynamically according to the specific needs of the user. SEO needs to ensure we do not fall behind of this trend.
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...Editor IJMTER
In recent years there has been an increased focus on the use of sensor networks to sense and measure
the environment. This leads to a wide variety of theoretical and practical issues on appropriate protocols for data
sensing and transfer. Recent work shows sink mobility can improve the energy efficiency in wireless sensor
networks (WSNs). However, data delivery latency often increases due to the speed limit of mobile sink. Most of
them exploit mobility to address the problem of data collection in WSNs. The WSNs with MS (mobile Sink) and
provide a comprehensive taxonomy of their architectures, based on the role of the MS. An overview of the data
collection process in such a scenario, and identify the corresponding issues and challenges. A protocol named
weighted rendezvous planning (WRP) which is a heuristic method that finds a near-optimal traveling tour that
minimizes the energy consumption of sensor nodes. Focus on the path selection problem in delay-guaranteed
sensor networks with a path-constrained mobile sink. Concentrate an efficient data collection scheme, which
simultaneously improves the total amount of data and reduces the energy consumption. The optimal path is chosen
to meet the requirement on delay as well as minimize the energy consumption of entire network. Predictable sink
mobility is exploited to improve energy efficiency of sensor networks.
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.
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKJournal For Research
Wireless sensor networks have attracted much attention in the research community over the last few years, driven by a wealth of theoretical and practical challenges and an increasing number of practical civilian application. ‘one deployment, multiple applications’ is an emerging trend in the development of WSN, due to the high cost of deploying hundreds and thousands of sensors nodes over a wide geographical area and the application-specific nature of tasking a WSN. A wireless sensor network is a collection of nodes organized into a cooperative network. To reduce the energy consumption, the transmission of data between sensor nodes must be reduced in order to preserve the remaining energy in cluster node. We propose a new energy balancing architecture based on cluster with hexagonal geometry with radius R.select the base station and after select the cluster head with maximum energy of the node and after select mobile agent in minimum distance to cluster head and second highest maximum energy. And then send the data mobile agent to cluster head and cluster head to base station.and we have energy management must be followed to balance the energy in the whole network and improving network lifetime.
Mobile Relay Configuration in Data-Intensuive Wireless Sensor with Three Rout...IJERA Editor
Wireless sensor network are increasingly used in data-intensive applications such as micro-climate monitoring,
precision agriculture and audio/video surveillance. A key challenges faced by data-intensive wsn’s is to transmit
all the data generated with an application’s lifetime to the base station despite the fact that sensor nodes have
limited power supply. We propose using low-cost disposable mobile really and our work in the following
aspects First, it does not require complex motion planning of mobile nodes. Second we integrate the energy
consumption due to both mobility and wireless transmission. Our framework consists of first algorithm
computes an optimal routing tree. The second, we integrate the energy consumption due to both mobility and
wireless transmissions .The second algorithm improves the topology of the routing tree by greedily adding new
nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology.
Frequently forming a network topology without the use of any existing network infrastructure. We compare the
performance of the three prominent routing protocols for the mobile relay is Adhoc on Demand Distance Vector
(ADVO), Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Protocols (TORA).
We have chosen four performance metrics such as Average Delay, Packet Delivery Fraction, Routing load and
varying Mobility nodes, simulation for the popular routing protocols AODV, DSDV, and TORA. The
simulation is carried out on NS-2. The performance differentials are analyzed using varying network size and
simulations times. The simulation results confirm that ADVO performs well in terms of Average Delay, Packet
Delivery Fraction. As far as routing load concers TORA performs well.
A novel energy efficient routing algorithm for wireless sensor networks using...ijwmn
There are numerous applications for wireless sensor networks which are inevitable now a day in our daily
life. Majority of such applications which use wireless sensor networks will be in areas where the direct
human intervention is impossible. So the limited energy available in such sensors is a threat for prolonging
the life of the entire network. The need of energy efficiency in wireless sensor networks is a hot research
topic in which lot of new strategies for improvement in energy efficiency has been sought after. As
communication process consumes more energy, an energy efficient routing strategy can probably reduce
the energy consumption to a great extend. This paper gives an overview of the different routing techniques
in which mobile sinks are used to facilitate the routing process which can effectively reduce the energy use.
A new routing strategy with mobile sinks and a static sink is proposed and is compared based on the
matrices life time and average energy of the nodes with the existing Shortest Hop path (SH) algorithm. The
simulation results shows the proposed algorithm is more energy efficient than the existing one.
Range-Based Data Gathering Algorithm With a Mobile Sink in Wireless Sensor Ne...ijwmn
Wireless Sensor Networks (WSNs) have been emerged in many important aspects in the real world, such as
industry, agriculture, and military applications. As the main challenge that WSNs facing is the energy
consumption, it is necessary to investigate the suitability of using mobile sinks for data collection in these
networks. In this paper, therefore, a new data gathering technique with mobile elements referred to as
Intersection Point of Communication Ranges (IPCR) is proposed. The IPCR algorithm endeavours to
compute the optimal trajectory of the mobile sink for which the data collection latency is reduced.
Simulation results presented in this study showed that the IPCR algorithm has achieved the optimal Travel
Sales-Man Problem algorithm. In addition, the IPCR algorithm outperformed the Connectivity Based Data
Collection (CBDC) algorithm in terms of data gathering latency and network throughput.
International Journal of Wireless & Mobile Networks (IJWMN)ijwmn
Wireless Sensor Networks (WSNs) have been emerged in many important aspects in the real world, such as
industry, agriculture, and military applications. As the main challenge that WSNs facing is the energy
consumption, it is necessary to investigate the suitability of using mobile sinks for data collection in these
networks. In this paper, therefore, a new data gathering technique with mobile elements referred to as
Intersection Point of Communication Ranges (IPCR) is proposed. The IPCR algorithm endeavours to
compute the optimal trajectory of the mobile sink for which the data collection latency is reduced.
Simulation results presented in this study showed that the IPCR algorithm has achieved the optimal Travel
Sales-Man Problem algorithm. In addition, the IPCR algorithm outperformed the Connectivity Based Data
Collection (CBDC) algorithm in terms of data gathering latency and network throughput.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
A review of Hierarchical energy Protocols in Wireless Sensor Networkiosrjce
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.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
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.
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.
Improvising Network life time of Wireless sensor networks using mobile data a...Editor IJCATR
Energy consumption becomes a primary concern in a Wireless Sensor Network. To pursue high energy saving at sensor
nodes, a mobile collector should traverse the transmission range of each sensor in the field such that each data packet can be directly
transmitted to the mobile collector without any relay.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
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.
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.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
A tale of scale & speed: How the US Navy is enabling software delivery from l...
T0440899104
1. Pallavi H B et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 8), April 2014, pp.99-104
www.ijera.com 99 | P a g e
Design of Mobile Relay in Data-Rigorous Wireless Sensor
Networks
Pallavi H B*, Smeja K**
*(PG Student, Department of Computer Science & Engineering, Srinivas Institute of Technology, Mangalore,
India)
** (Assistant Professor, Department of Computer Science & Engineering, Srinivas Institute of Technology,
Mangalore, India)
ABSTRACT
Wireless Sensor Networks are widely used in variety of data rigorous application like traffic monitoring,
agriculture, network centric warfare, forest area monitoring. The challenging task in WSN is to transmit the
gathered data to the base station within the application’s life time. In this paper we are proposing a concept on
how to use mobile relay which have more energy than the static sensors to minimize the power consumption in
data rigorous wireless sensor networks and this approach don’t require complex movement of mobile nodes, so
it can be effectively used with minimal cost.
Keywords – Energy Optimization, Mobile node, Relay node, Wireless Sensor Networks
I. INTRODUCTION
Smart environments will be the next
evolutionary development step in building, utilities,
military, shopping mall, industrial, and home,
shipboard, and transportation systems automation.
Sensory data is generated from multiple sensors of
different modalities in distributed locations. This
information can be utilized to create smarter
environment. But to achieve these challenges will be
enormous like detecting the relevant quantities,
monitoring and collecting the data, assessing and
evaluating the information, formulating meaningful
user information, and performing decision-making.
A WSN (WSN) consists of a set of sensors that are
interconnected by a communication network. The
sensors are deeply embedded devices that are
integrated with a physical environment and capable
of acquiring signals, processing the signals,
communicating and performing simple computation
tasks. While this new class of networks has the
potential to enable wide range of applications, it also
poses serious challenges like frequent network
topology change, limited computational, memory and
power supply. Sensors are more prone to failures.
With all these constraints an efficient and effective
method to extract data from the network is
challenging task. Below Fig. 1 shows the scenario of
WSN environment where sensors can be deployed for
smarter computing.
In this paper, we make use of low cost
disposable mobile relays to minimise the total energy
consumption of data-rigorous WSNs.
Fig. 1: Different Applications of Wireless Sensor
Networks
Mobile relays do not carry the collected data
at sensors instead they move to different locations
and forward the data from source to the base stations.
In this approach we can significantly reduce the delay
occurring in communication process between the
nodes and each mobile node performs a relocation
only once unlike other approaches performs repeated
relocations.
There are numerous low-cost mobile sensor
prototypes such as Robomote [1], Khepera [2], and
FIRA [3] are now available. Their manufacturing
cost of static sensors had been compared with mobile
sensors. As a result, they can be massively deployed
in a network and used in a disposable manner. As the
manufacturing cost of sensor nodes is low, hence
mobile sensor platforms are powered by batteries and
capable of less mobility. By considering these
constraints, our approach only requires one relocation
to the designated positions after deployment.
RESEARCH ARTICLE OPEN ACCESS
2. Pallavi H B et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 8), April 2014, pp.99-104
www.ijera.com 100 | P a g e
We design the Mobile Relay in data rigorous
WSNs. Our goal is minimize the energy consumed by
both mobility of relays and wireless transmissions,
which is in contrast to existing mobility approaches
that only minimize the transmission energy
consumption.
II. LITERATURE SURVEY
Analyzing the three different approaches:
Mobile base stations, data mules and mobile relays.
All the three approaches use mobility to reduce
energy consumption in wireless sensor networks.
1. MOBILE BASE STATION
A mobile base station is a sensor node
collects the data by moving around the network from
the nodes [4]. In some work, in order to balance the
transmission load, all nodes are performing multiple
hop transmissions to the base station. The goal is to
rotate the nodes which are close to the base station.
Before the nodes suffer buffer overflows,
the base station computes the mobility path to collect
data from the visited nodes. Several rendezvous
based data collection algorithms are proposed, where
the mobile base station only visits a selected set of
nodes referred to as rendezvous points within a
deadline and the rendezvous points buffer the data
from sources.
High data traffic towards the base station is
always a threat to the networks life time. [5]. The
battery life of the base station gets depleted very
quickly due to the sensor nodes which are located
near to the base station relay data for large part of the
network. The proposed solution includes the mobility
of the base station such that nodes located near base
station changes over time. All the above approaches
incur high latency due to the low to moderate speed
of mobile base stations.
2. DATA MULES
Data mules are another form of base
stations. They gather data from the sensors and carry
it to the sink. The data mule collects the data by
visiting all the sources and then transmits it to the
static base station through the network. In order to
minimize the communication and mobility energy
consumption the mobility paths are determined.
In paper [6] the author analyses an
architecture based on mobility to address the energy
efficient data collection problem in a sensor network.
This approach utilizes the mobile nodes as
forwarding agents. As a mobile node moves in close
propinquity to sensors, data is transmitted to the
mobile node for later dumps at the destination.
In the MULE architecture sensors transmit
data only over a short range that requires less
transmission power. However, latency is increased
because a sensor has to wait for a mule before its data
can be delivered.
The Mule architecture has high latency and
this limits its applicability to real time applications
(although this can be mitigated by collapsing the
MULE and access point tiers).
The system requires sufficient mobility. For
example, mules may not arrive at a sensor or after
picking the data may not reach near an access-point
to deliver it. Also, data may be lost because of radio-
communication errors or mules crashing. To improve
data delivery, higher-level protocols need to be
incorporated in the MULE architecture.
Data mules also introduce large delays like
base stations since sensors have to wait for a mule to
pass by before initiating their transmission.
3. MOBILE RELAY
In this approach, the network consists of
three nodes such as mobile relay nodes along with
static base station and data sources. To reduce the
transmission cost relay nodes do not transport data
rather it will move to different locations. We use the
mobile relay approach in this work.
In [7] author showed that an iterative
mobility algorithm where each relay node moves to
the midpoint of its neighbors converges on the
optimal solution for a single routing path
This paper presents mobility control scheme
for improving communication performance in WSN.
The objectives of the paper [7] are
1) Analyse when controlled mobility can improve
fundamental networking performance metrics such as
power efficiency and robustness of communications
2) Provide initial design for such networks.
Mobile nodes move to midpoint of the
neighbours only when movement is beneficial [8].
Unlike mobile base stations and data mules, our
approach reduces the energy consumption of both
mobility and transmission. Our approach also
relocates each mobile relay only once immediately
after deployment.
The paper study the energy optimization
problem that accounts for energy costs associated
with both communication and physical node
movement. Unlike previous mobile relay schemes the
proposed solution consider all possible locations as
possible target locations for a mobile node instead of
just the midpoint of its neighbors.
III. PROBLEM STATEMENT
1. ENERGY CONSUMPTION MODEL
During the transferring of the data,
computation and mobility the energy is consumed by
sensor nodes but the large amount battery depletion
takes place due to data transfer and mobility.
3. Pallavi H B et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 8), April 2014, pp.99-104
www.ijera.com 101 | P a g e
Even in the idle listening state Radios
consumes more energy, but by using sleep scheduling
protocols the idle listening time of radios is
considerably reduced [9]. In this work, we mainly
concentrate on decreasing the total power
consumption due to data transmissions and
movement. Such a holistic objective of energy
conservation is motivated by the fact that mobile
relays act the same as static forwarding nodes after
movement.
We consider wheeled sensor nodes with
differential drives such as Khepera, Robomote and
FIRA for mobility. This type of node usually has two
wheels, each controlled by independent engines. For
this kind of node we adopt the distance proportional
energy consumption model [10]. The energy EM (d)
consumed by moving a distance d is modelled as:
EM (d) = kd
The factor k value depends on the speed of
the node. In general, there is an optimal speed at
which k is small. The variants of energy consumed
with respect to mote speed are discussed by author in
[10]. When the node is running at optimal speed, k =
2.
We evaluate the experimental results got by
two radios CC2420 [11] and CC1000 [12] that are
most commonly used on existing sensor networks
platform to model the energy consumed by
transmissions. The authors of [13], for CC2420
studied the transmission power level required for
transmitting packets reliably (e.g., over 95% packet
reception ratio) over different distances. Let ET (d)
be the energy consumed to transmit reliably over
distance d. It can be modelled as
ET (d) = m (a + bd2
)
Where m is the number of bits transmitted a
and b are constants depending on the environment.
We now discuss the instantiation of the above model
for both CC2420 and CC1000 radio platforms.
We obtain a = 0.6 × 10−7J/bit and b = 4 ×
10−10Jm−2
/bit from the measurements on CC2420 in
[14], for received signal strength of -80 dbm (which
corresponds to a packet reception ratio higher than
95%) in an outdoor environment. This model is
constant with the hypothetical analysis discussed in
[15]. We also consider the energy needed by CC1000
to output the same levels. We get lower consumption
parameters:
a = 0.3 × 10−7
J/bit and b = 2 × 10−10Jm−2
/bit.
We note that although the mobility
parameter k is approximately 1010 times larger than
the transmission parameter b, the relays move only
once whereas large amounts of data are transmitted.
For larger data chunk sizes, the savings in energy
transmission costs compensates for the energy
expended to move the nodes resulting in a decrease in
total energy consumed.
2. AN EXAMPLE
We now demonstrate the key idea of our
approach using a simple example. Imagine that we
have three nodes s1, s2, s3 located at positions x1, x2,
x3, respectively (Fig. 2), in which s2 is a mobile relay
node. The aim is to reduce the total energy
consumption due to both mobility and transmissions.
Suppose the node s1 needs to transmit a stored data
chunk to sink s3 through relay node s2. This can
achieved by one the way is to have s1 transmit the
data from x1 to node s2 at position x2 and node s2
forwards it to sink s3 at position x3, without s2’s
movement. Another approach is in which it takes
advantage of s2’s mobility as suggested in [16], node
s2 move to the midpoint of the segment x1x3. This
approach will reduce the transmission energy by
reducing the distances separating the nodes. Still,
moving relay node s2 also consumes energy.
We assume the following parameters for the energy
models:
k = 2, a = 0.6 × 10−7, b = 4 × 10−10.
In this example, for a given data chunk mi,
the optimal solution is to move s2 to xi
2 (a position
that we can compute precisely). This will reduce the
total energy utilization due to both transmission and
mobility. For small chunk of data, s2 moves very little
if at all. As the size of the data increases, relay node
s2 moves closer to the midpoint. In this example, it is
beneficial to move when the message size exceeds 4
MB.
Fig. 2: Reduction in Energy Consumption due to
Mobile Relay. As the Data Chunk Size Increases the
Optimal Position Converges to the Midpoint of S1 S3.
We demonstrate in Table 1 the energy
savings achieved using our optimal approach and the
other two approaches for the significant range of data
sizes. For large enough data chunks (≈ 13 MB), one
relay node can reduce total energy consumption by
10% compared to the other two approaches. As the
data chunk size increases further, the energy savings
decrease, and the optimal position converges to the
mid-point when the data size exceeds 43 MB. In
4. Pallavi H B et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 8), April 2014, pp.99-104
www.ijera.com 102 | P a g e
general, by using multiple relay nodes the reduction
in energy consumption increases.
TABLE. 1: ENERGY CONSUMPTION COMPARISON
The above example demonstrate the two
interesting outcome. When both mobility and
transmissions costs are taken into consideration the
optimal position of a mobile relay is not only the
midpoint between the source and sink. This is in
contrast to the conclusion of several previous studies
[6] which only account for transmission costs.
Second, the optimal position of a mobile relay
depends on not only the network topology (e.g., the
initial positions of nodes) but also the amount of data
to be transmitted. Moreover, as the data chunk size
increases, the optimal position converges to the
midpoint of s1 and s3. These results are mainly
significant for reducing the energy cost of data-
rigorous WSNs.
3. PROBLEM FORMULATION
In our definitions, we assume that all
movements are completed before any transmissions
begin. We also assume there are no obstacles that
affect mobility or transmissions. In this case, the
distance moved by a mobile relay is no more than the
distance between its starting position and its
corresponding position in the evenly spaced
configuration which often leads to a short delay in
mobile relay relocation. Furthermore, we assume that
all mobile nodes know their locations either by GPS
units mounted on them or a localization service in the
network. We focus on the case where all nodes are in
a 2-dimensional plane R2
, but the results apply to R3
and other metric spaces.
Our problem can be described as follows.
Given a network containing one or more static source
nodes that store data gathered by other nodes, a
number of mobile relay nodes and a static sink, we
want to find a directed routing tree from the sources
to the sink as well as the optimal positions of the
mobile nodes in the tree in order to minimize the total
energy consumed by transmitting data from the
source(s) to the sink and the energy consumed by
relocating the mobile relays. The source nodes in our
problem formulation serve as storage points which
cache the data gathered by other nodes and
periodically transmit to the sink, in response to user
queries. Our problem formulation also considers the
initial positions of nodes and the amount of data that
needs to be transmitted from each storage node to the
sink. The formal definition of the problem is given
below.
Definition 1: (Optimal Mobile Relay Configuration):
Input Instance: S, a list of n nodes (s1,...,, sn)
in the network; O, a list of n locations (o1, . . . , on)
where oi is the initial position of node si for 1 ≤ i ≥ n;
S sources, a subset of S representing the source
nodes; r, a node in S, representing the single sink; M
sources = {Mi | si ∈ Ssources}, a set of data chunk sizes
for all sources in Ssources;
We define mi, which we compute later, to be
the weight of node si which is equal to the total
number of bits to be transmitted by node si. We
define a configuration <E,U> as a pair of two sets: E,
a set of directed arcs (si, sj) that represent the directed
tree in which all sources are leaves and the sink is the
root and U, a list of locations (u1, . . . , un) where ui is
the transmission position for node si for 1 ≤ i ≤ n. The
cost of a configuration <E, U> is given by:
Output: <E, U>, an optimal configuration that
minimizes the cost c (<E, U>).
IV. OPTIMAL POSITION
ALGORITHM
In this section, we consider the problem of
finding the optimal positions of relay nodes for a
routing tree given that the topology is fixed. We
assume the topology is a directed tree in which the
leaves are sources and the root is the sink. We also
assume that separate messages cannot be compressed
or merged; that is, if two distinct messages of lengths
m1 and m2 use the same link (si ,sj) on the path from
a source to a sink, the total number of bits that must
traverse link (si ,sj) is m1+m2. The algorithm [4]
converges to the optimal solution for the given tree
given the topology is fixed.
procedure OPTIMALPOSITIONS(Uo
)
converged ← false;
j ← 0;
repeat
anymove ← false;
j ← j + 1;
⊳ Start an even iteration followed by an odd iteration
for idx = 2 to 3 do
Data
Size Costs at Costs at Costs at
Reductio
n
(MB)
Original
Pos.
Midpoin
ts
Optimal
Pos.
5.00 42.78 70.71 42.04 1.73%
11.00 94.12 101.93 88.39 6.09%
12.00 102.68 107.13 94.71 7.75%
13.00 111.23 112.33 100.87 9.32%
14.00 119.79 117.53 106.89 9.06%
15.00 128.35 122.74 112.80 8.09%
16.00 136.90 127.94 118.62 7.28%
17.00 145.46 133.14 124.37 6.58%
18.00 154.01 138.34 130.06 5.98%
40.00 342.26 252.77 247.58 2.05%
5. Pallavi H B et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 8), April 2014, pp.99-104
www.ijera.com 103 | P a g e
for i = idx to n by 2 do
(uj
i ,moved) ← LOCALPOS(oi, S(si), sd
i );
anymove ← anymove OR moved
end for
end for
converged ← NOT any move
until converged
end procedure
Fig. 4: Algorithm to compute optimal position
V. SIMULATION RESULT
As in data-rigorous wireless sensor networks
power management is challenging task so, mobile
relay node is used to minimize the consumption of
energy mobile relay node is used. The task of relay
node is to forward the data which is gathered by
sensor node to sink.
The simulation is carried out for the three
pairs of static sensor node. Relay node computes the
optimal position by comparing the size of the data at
the sensor nodes rather than considering mid-point
between two sensor nodes as optimal position. Relay
node moves nearer to sensor node which has large
size of data and forwards the data to the sink.
The below fig. 3 shows the energy
optimization chart for three pairs of sensor nodes.
The size of data in terms of KB at each node. Chart
shows the energy consumed to transfer the data in the
mid positions and optimal positions.
Fig. 3: Energy optimization chart
VI. CONCLUSION
In this paper we propose an approach to
minimize the energy consumption of sensor nodes for
transferring data to sink by using mobile relay node
by taking cost of relay node mobility into
consideration.
The optimal position of relay node which
forwards the data from one or multiple sensor to sink
is not only mid-point between two sensors
.Depending upon the size of the data collected at
each sensor node the optimal position is computed
using optimal mobile relay position algorithm. Our
simulation result shows decrease in energy consumed
by sensor nodes for transferring of data.
REFERENCES
[1] K. Dantu, M. Rahimi, H.Shah, S. Babel, A.
Dhariwal, and G.S.Sukhatme, “Robomote:
Enabling Mobility in Sensor Networks”,in
IPSN,2005.
[2] http://www.k team.com/robots/khepera/inde
x.html.
[3] J.-H. Kim, D.-H. Kim, Y.-J. Kim, and K.-T.
Seow, Soccer Robotics, Springer, 2004.
[4] Fatme El-Moukaddem, Eric Torng,
Guoliang Xing" Mobile Relay Configuration
in Data-intensive Wireless Sensor
Networks" in IEEE Transactions on Mobile
computing, 2013.
[5] J. Luo and J.-P. Hubaux, Joint Mobility and
Routing for Lifetime Elongation in Wireless
Sensor Networks, in INFOCOM, 2005.
[6] S. Jain, R. Shah, W. Brunette, G. Borriello,
and S. Roy, Exploiting Mobility for
Energye_Cient Data Collection in Wireless
Sensor Networks, MONET,vol. 11, pp.
327339, 2006.
[7] D. K. Goldenberg, J. Lin, and A. S. Morse,
Towards Mobility as a Network Control
Primitive, in MobiHoc, 2004, pp. 163174.
[8] C. Tang and P. K. McKinley, Energy
Optimization Under Informed Mobility,
IEEE Trans. Parallel Distrib. Syst., vol.
17,pp. 947962, 2006.
[9] http://inst.eecs.berkeley.edu/cs150/Documen
ts/CC2420.pdf
[10] G. Wang, M. J. Irwin, P. Berman, H. Fu,
and T. F. L. Porta, “Optimizing Sensor
Movement Planning for Energy Efficiency,”
in ISLPED, 2005, pp. 215–220.
[11] http://inst.eecs.berkeley.edu/cs150/Documen
ts/CC2420.pdf.
[12] http://focus.ti.com/lit/ds/symlink/cc1000.pdf
[13] M. Sha, G. Xing, G. Zhou, S. Liu, and
X.Wang, “C-mac: Modeldriven Concurrent
Medium Access Control for Wireless Sensor
Networks,” In INFOCOM, 2009.
[14] W. R. Heinzelman, A. Chandrakasan, and H.
Balakrishnan,“Energy-efficient
Communication Protocol for Wireless
Microsensor Networks,” in HICSS, 2000.
[15] W. Wang, V. Srinivasan, and K.-C. Chua,
“Using Mobile Relays to Prolong the
6. Pallavi H B et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 8), April 2014, pp.99-104
www.ijera.com 104 | P a g e
Lifetime of Wireless Sensor Networks”, in
MobiCom, 2005.
[16] S. Ratnasamy, B. Karp, S. Shenker, D.
Estrin, R. Govindan, L. Yin, and F. Yu,
“Data-Centric Storage in Sensor Nets with
ght, a Geographic Hash Table,” MONET,
vol. 8, pp. 427–442, 2003.
AUTHORS PROFILE
Pallavi H B, pursuing Master of
Technology in Computer Science
and Engineering, Department of
Computer Science and Engineering,
Srinivas Institute of Technology,
Mangalore, Karnataka, India. Her
areas of interest are Wireless Sensor
Networks and Cloud Computing.
Smeja K. received the B.E. and
M.Tech. Degree in Information
science & Engineering and
Computer Science & Engineering
from Visvesvaraya Technological
University respectively, Karnataka
in 2006 and 2010, respectively. She
is an Assistant professor in the Department of
Computer Science & Engineering, Srinivas institute
of Technology, Mangalore. Her research interests
include wireless Sensor Network, Network security
and cryptography.