The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
The most significant problem in the design of wireless sensor networks is to coordinate the sensors
with dynamism into a wireless communication network and route sensed data to the base station. The energy
efficiency is the most important key point of the network routing designing. This paper presents the efficient
multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma
principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the
application requirements or offering network response to the application when the requirements cannot be met.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
Hybrid networks are next generation of wireless networks that could be a
combination of Mobile wireless adhoc (MANET) networks and Wireless Infrastructure
networks. They are increasingly utilized in wireless communications that are extremely
supporting real time transmission with restricted Quality of Service. Invalid reservation and
race condition issues happens in MANET. In existing system, QoS-Oriented Distributed
routing protocol (QOD) is employed to boost the QoS support capability of hybrid networks,
it transforms the packet routing problem to resource scheduling problem that has 5
algorithms. They are, QoS guaranteed neighbor selection algorithm, Distributed packet
scheduling algorithm, Mobility based segment resizing algorithm, Traffic redundant
elimination algorithm and Data redundancy elimination based transmission algorithm. The
main drawback of hybrid networks is so far examined in minimum transmission hops and has
less beneficial feature with restricted number of mobile access points, mobility speeds, and
mobile workloads and with different network sizes. It will extremely perform on random
way point model and less in real mobility model. This paper present Data Transparent
Authentication to authenticates data streams by adjusting interpacket delay. Data Transparent
Authentication while not Communication overhead is an approach which reduces breakdown
of original information or sends out of band authentication data.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
The most significant problem in the design of wireless sensor networks is to coordinate the sensors
with dynamism into a wireless communication network and route sensed data to the base station. The energy
efficiency is the most important key point of the network routing designing. This paper presents the efficient
multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma
principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the
application requirements or offering network response to the application when the requirements cannot be met.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
Hybrid networks are next generation of wireless networks that could be a
combination of Mobile wireless adhoc (MANET) networks and Wireless Infrastructure
networks. They are increasingly utilized in wireless communications that are extremely
supporting real time transmission with restricted Quality of Service. Invalid reservation and
race condition issues happens in MANET. In existing system, QoS-Oriented Distributed
routing protocol (QOD) is employed to boost the QoS support capability of hybrid networks,
it transforms the packet routing problem to resource scheduling problem that has 5
algorithms. They are, QoS guaranteed neighbor selection algorithm, Distributed packet
scheduling algorithm, Mobility based segment resizing algorithm, Traffic redundant
elimination algorithm and Data redundancy elimination based transmission algorithm. The
main drawback of hybrid networks is so far examined in minimum transmission hops and has
less beneficial feature with restricted number of mobile access points, mobility speeds, and
mobile workloads and with different network sizes. It will extremely perform on random
way point model and less in real mobility model. This paper present Data Transparent
Authentication to authenticates data streams by adjusting interpacket delay. Data Transparent
Authentication while not Communication overhead is an approach which reduces breakdown
of original information or sends out of band authentication data.
Enhanced Zigbee Tree Routing In Wireless Sensor Networkpaperpublications3
Abstract: Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are particularly critical in the resource constrained system such as WSNs. The existing protocols are not fully satisfied. In this paper propose a new routing protocol that is enhanced zigbee tree routing (EZTR), to satisfy the QoS parameters. The new protocol provides less delay as compared with other protocol.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using 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. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
A SECURE QOS ROUTING PROTCOL FOR HYBRID WIRELESS NETWORKSAAKASH S
A wireless hybrid network is integrates a mobile wireless ad-hoc network and a wireless infrastructure
It proven the better alternative for next generation Wireless network
It popular among critical mission applications like military use or emergency recovery
However, the open medium and wide distribution of nodes make HWN vulnerable to malicious attackers
In this case, it is crucial to develop efficient intrusion-detection mechanisms to protect HWN from attacks
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 routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
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.
QoS Framework for a Multi-stack based Heterogeneous Wireless Sensor Network IJECEIAES
Wireless sensor nodes consist of a collection of sensor nodes with constrained resources in terms of processing power and battery energy. Wireless sensors networks are used increasingly in many industrial and consumer applications. Sensors detect events and send via multi hop routing to the sink node for processing the event. The routing path is established through proactive or reactive routing protocols. To improve the performance of the Wireless Sensor Networks, multi stack architecture is addressed. But the multi stack architecture has many problems with respect to life time, routing loop and QOS. In this work we propose a solution to address all these three problems of life time, routing loop and QOS in case of multi stack architecture.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
Study Of Coded Based Mechanism In WSN SystemIJERA Editor
Wireless Sensor networks (WSN) is an emerging technology and have great potential to be employed in critical
situations like battlefields and commercial applications such as building, traffic surveillance, habitat monitoring
and smart homes and many more scenarios.One of the major challenges wireless sensor networks face today is
QoS. In order to ensure data security and quality of service required by an application in an energy efficient
way, we propose a mechanism for QoS routing with coding and selective encryption scheme for WSNs.Our
approach provides reliable and secure data transmission and can adapt to the resource constraints of WSNs.
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.
Load balanced clustering with mimo uploading technique for mobile data gather...Munisekhar Gunapati
in these we three-layers of framework is proposed for mobile data collection in wireless sensor networks which includes the sensor layer, cluster head layer, and mobile collector(called sen car)layer.
the framework employs distributed load balanced clustering and multi data uploading ,which is referred as LBC-MDU .
the objective is to achieve good scalability,long network lifetime,and low data collection latency.
a sensor layer a distributed load balanced clustering algorithm(LBC) is preposed for sensors are self organized themselelves into clusters, in contrast existing clustering methods our scheme generate multiple cluster heads in each cluster to balance the ork load and facilitate multi data uploading .
at clustering head layer the inter-cluster transmission range carefully chosen to guarantee the connectivity among the clusters, multiple clusters heads within a cluster head can cooperate with each other to perform energy-saving inter clustering communication. though inter cluster transimission cluster head information is forwarded to sencar for moving trajectory planning .
at mobile collector layer,sencor equipped with two cluster head ,which enables to simultaneously upload the data into the sencar by using multi-user MIMO technique,the moving trajectory planning for sencar is optimized to fully utilize multi data uploading capability by properly selecting polling points in each cluster ,by visiting each selected polling point, sencar can efficiently gather data from cluster head transport the data static data sink the results show that when each cluster has at most two cluster heads, LBU-MDU achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Enhanced Zigbee Tree Routing In Wireless Sensor Networkpaperpublications3
Abstract: Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are particularly critical in the resource constrained system such as WSNs. The existing protocols are not fully satisfied. In this paper propose a new routing protocol that is enhanced zigbee tree routing (EZTR), to satisfy the QoS parameters. The new protocol provides less delay as compared with other protocol.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using 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. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
A SECURE QOS ROUTING PROTCOL FOR HYBRID WIRELESS NETWORKSAAKASH S
A wireless hybrid network is integrates a mobile wireless ad-hoc network and a wireless infrastructure
It proven the better alternative for next generation Wireless network
It popular among critical mission applications like military use or emergency recovery
However, the open medium and wide distribution of nodes make HWN vulnerable to malicious attackers
In this case, it is crucial to develop efficient intrusion-detection mechanisms to protect HWN from attacks
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 routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
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.
QoS Framework for a Multi-stack based Heterogeneous Wireless Sensor Network IJECEIAES
Wireless sensor nodes consist of a collection of sensor nodes with constrained resources in terms of processing power and battery energy. Wireless sensors networks are used increasingly in many industrial and consumer applications. Sensors detect events and send via multi hop routing to the sink node for processing the event. The routing path is established through proactive or reactive routing protocols. To improve the performance of the Wireless Sensor Networks, multi stack architecture is addressed. But the multi stack architecture has many problems with respect to life time, routing loop and QOS. In this work we propose a solution to address all these three problems of life time, routing loop and QOS in case of multi stack architecture.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
Study Of Coded Based Mechanism In WSN SystemIJERA Editor
Wireless Sensor networks (WSN) is an emerging technology and have great potential to be employed in critical
situations like battlefields and commercial applications such as building, traffic surveillance, habitat monitoring
and smart homes and many more scenarios.One of the major challenges wireless sensor networks face today is
QoS. In order to ensure data security and quality of service required by an application in an energy efficient
way, we propose a mechanism for QoS routing with coding and selective encryption scheme for WSNs.Our
approach provides reliable and secure data transmission and can adapt to the resource constraints of WSNs.
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.
Load balanced clustering with mimo uploading technique for mobile data gather...Munisekhar Gunapati
in these we three-layers of framework is proposed for mobile data collection in wireless sensor networks which includes the sensor layer, cluster head layer, and mobile collector(called sen car)layer.
the framework employs distributed load balanced clustering and multi data uploading ,which is referred as LBC-MDU .
the objective is to achieve good scalability,long network lifetime,and low data collection latency.
a sensor layer a distributed load balanced clustering algorithm(LBC) is preposed for sensors are self organized themselelves into clusters, in contrast existing clustering methods our scheme generate multiple cluster heads in each cluster to balance the ork load and facilitate multi data uploading .
at clustering head layer the inter-cluster transmission range carefully chosen to guarantee the connectivity among the clusters, multiple clusters heads within a cluster head can cooperate with each other to perform energy-saving inter clustering communication. though inter cluster transimission cluster head information is forwarded to sencar for moving trajectory planning .
at mobile collector layer,sencor equipped with two cluster head ,which enables to simultaneously upload the data into the sencar by using multi-user MIMO technique,the moving trajectory planning for sencar is optimized to fully utilize multi data uploading capability by properly selecting polling points in each cluster ,by visiting each selected polling point, sencar can efficiently gather data from cluster head transport the data static data sink the results show that when each cluster has at most two cluster heads, LBU-MDU achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Cluster Based Routing using Energy and Distance Aware Multi-Objective Golden ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such as communication, electronics, and information technologies. When the clustering algorithm incorporates both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal of this research is to reduce energy consumption for prolong the lifetime of the network. In order to achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces retransmissions and delays to improve the performance metrics. And so, this research carried out two major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN. Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss during the transmission. For generating the routing path between the source and the Base Station (BS), the ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio (0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
CLUSTER BASED ROUTING USING ENERGY AND DISTANCE AWARE MULTI-OBJECTIVE GOLDEN ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such
as communication, electronics, and information technologies. When the clustering algorithm incorporates
both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal
of this research is to reduce energy consumption for prolong the lifetime of the network. In order to
achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle
Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces
retransmissions and delays to improve the performance metrics. And so, this research carried out two
major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN.
Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss
during the transmission. For generating the routing path between the source and the Base Station (BS), the
ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves
better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio
(0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing
Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
Mobile Agents based Energy Efficient Routing for Wireless Sensor NetworksEswar Publications
Energy Efficiency and prolonged network lifetime are few of the major concern areas. Energy consumption rated of sensor nodes can be reduced in various ways. Data aggregation, result sharing and filtration of aggregated data among sensor nodes deployed in the unattended regions have been few of the most researched areas in the field of wireless sensor networks. While data aggregation is concerned with minimizing the information transfer from source to sink to reduce network traffic and removing congestion in network, result sharing focuses on sharing of information among agents pertinent to the tasks at hand and filtration of aggregated data so as to remove redundant information. There exist various algorithms for data aggregation and filtration using different mobile agents. In this proposed work same mobile agent is used to perform both tasks data aggregation and data filtration. This approach advocates the sharing of resources and reducing the energy consumption level of sensor nodes.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
GPS Enabled Energy Efficient Routing for ManetCSCJournals
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
Energy efficiency has recently turned out to be primary issue in wireless sensor networks.
Sensor networks are battery powered, therefore become dead after a certain period of time. Thus,
improving the data dissipation in energy efficient way becomes more challenging problem in order to
improve the lifetime for sensor devices. The clustering and tree based data aggregation for sensor
networks can enhance the network lifetime of wireless sensor networks. Non-dominated Sorting Genetic
Algorithm (NSGA) -III based energy efficient clustering and tree based routing protocol is proposed.
Initially, clusters are formed on the basis of remaining energy, then, NSGA-III based data aggregation
will come in action to improve the inter-cluster data aggregation further. Extensive analysis demonstrates
that proposed protocol considerably enhances network lifetime over other techniques.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSIAEME Publication
Energy is a serious resource parameter in Wireless Sensor Networks. Utilizing energy in an effectual manner is a challenging task in Wireless Sensor Networks. This paper presents an overview on various energy efficient routing protocols which fulfills the criteria of QoS parameters. Various energy effective and QoS based routing protocols have been compared. To improve the QoS in a network, data fusion and data accumulation is considered to be one of major energy saving technique. The routing protocols based on data aggregation, reduced cost routing and secure routing are also discussed in detail. Simulation tools like NS2, NS3, OMNET etc can be used to evaluate the network performance.
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSIAEME Publication
Energy is a serious resource parameter in Wireless Sensor Networks. Utilizing energy in an effectual manner is a challenging task in Wireless Sensor Networks. This paper presents an overview on various energy efficient routing protocols which fulfills the criteria of QoS parameters. Various energy effective and QoS based routing protocols have been compared. To improve the QoS in a network, data fusion and data accumulation is considered to be one of major energy saving technique. The routing protocols based on data aggregation, reduced cost routing and secure routing are also discussed in detail. Simulation tools like NS2, NS3, OMNET etc can be used to evaluate the network performance.
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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.
CLUSTER HEAD SELECTION ALGORITHMS FOR ENHANCED ENERGY EFFICIENCY IN WIRELESS ...IJCSES Journal
The extension of the sensor node's life span is an essential requirement in a Wireless Sensor Network.
Cluster head selection algorithms undertake the task of cluster head election and rotation among nodes,
and this has significant effects on the network's energy consumption. The objective of this paper is to
analyze existing cluster head selection algorithms and the parameters they implement to enhance energy
efficiency. To achieve this objective, systematic literature review methodology was used. Relevant papers
were extracted from major academic databases Elsevier, Springer, Wiley, IEEE, ACM Digital Library,
Citeseer Library, and preprints posted on arXiv. The results show that there are many existing Cluster
Head Selection Algorithms and they are categorized as deterministic, adaptive and hybrid. These
algorithms use different parameters to elect Cluster Heads. In future the researchers should derive more
parameters that can be used to elect cluster heads to improve on energy consumption
CLUSTER HEAD SELECTION ALGORITHMS FOR ENHANCED ENERGY EFFICIENCY IN WIRELESS ...IJCSES Journal
The extension of the sensor node's life span is an essential requirement in a Wireless Sensor Network.
Cluster head selection algorithms undertake the task of cluster head election and rotation among nodes,
and this has significant effects on the network's energy consumption. The objective of this paper is to
analyze existing cluster head selection algorithms and the parameters they implement to enhance energy
efficiency. To achieve this objective, systematic literature review methodology was used. Relevant papers
were extracted from major academic databases Elsevier, Springer, Wiley, IEEE, ACM Digital Library,
Citeseer Library, and preprints posted on arXiv. The results show that there are many existing Cluster
Head Selection Algorithms and they are categorized as deterministic, adaptive and hybrid. These
algorithms use different parameters to elect Cluster Heads. In future the researchers should derive more
parameters that can be used to elect cluster heads to improve on energy consumption.
Similar to Routing Optimization with Load Balancing: an Energy Efficient Approach (20)
Content-Based Image Retrieval (CBIR) systems have been used for the searching of relevant images in various research areas. In CBIR systems features such as shape, texture and color are used. The extraction of features is the main step on which the retrieval results depend. Color features in CBIR are used as in the color histogram, color moments, conventional color correlogram and color histogram. Color space selection is used to represent the information of color of the pixels of the query image. The shape is the basic characteristic of segmented regions of an image. Different methods are introduced for better retrieval using different shape representation techniques; earlier the global shape representations were used but with time moved towards local shape representations. The local shape is more related to the expressing of result instead of the method. Local shape features may be derived from the texture properties and the color derivatives. Texture features have been used for images of documents, segmentation-based recognition,and satellite images. Texture features are used in different CBIR systems along with color, shape, geometrical structure and sift features.
The cyber attacks have become most prevalent in the past few years. During this time, attackers have discovered new vulnerabilities to carry out malicious activities on the internet. Both the clients and the servers have been victimized by the attackers. Clickjacking is one of the attacks that have been adopted by the attackers to deceive the innocuous internet users to initiate some action. Clickjacking attack exploits one of the vulnerabilities existing in the web applications. This attack uses a technique that allows cross domain attacks with the help of userinitiated clicks and performs unintended actions. This paper traces out the vulnerabilities that make a website vulnerable to clickjacking attack and proposes a solution for the same.
Performance Analysis of Audio and Video Synchronization using Spreaded Code D...Eswar Publications
The audio and video synchronization plays an important role in speech recognition and multimedia communication. The audio-video sync is a quite significant problem in live video conferencing. It is due to use of various hardware components which introduces variable delay and software environments. The objective of the synchronization is used to preserve the temporal alignment between the audio and video signals. This paper proposes the audio-video synchronization using spreading codes delay measurement technique. The performance of the proposed method made on home database and achieves 99% synchronization efficiency. The audio-visual
signature technique provides a significant reduction in audio-video sync problems and the performance analysis of audio and video synchronization in an effective way. This paper also implements an audio- video synchronizer and analyses its performance in an efficient manner by synchronization efficiency, audio-video time drift and audio-video delay parameters. The simulation result is carried out using mat lab simulation tools and simulink. It is automatically estimating and correcting the timing relationship between the audio and video signals and maintaining the Quality of Service.
Due to the availability of complicated devices in industry, models for consumers at lower cost of resources are developed. Home Automation systems have been developed by several researchers. The limitations of home automation includes complexity in architecture, higher costs of the equipment, interface inflexibility. In this paper as we have proposed, the working protocol of PIC 16F72 technology is which is secure, cost efficient, flexible that leads to the development of efficient home automation systems. The system is operational to control various home appliances like fans, Bulbs, Tube light. The following paper describes about components used and working of all components connected. The home automation system makes use of Android app entitled “Home App” which gives
flexibility and easy to use GUI.
Semantically Enchanced Personalised Adaptive E-Learning for General and Dysle...Eswar Publications
E-learning plays an important role in providing required and well formed knowledge to a learner. The medium of e- learning has achieved advancement in various fields such as adaptive e-learning systems. The need for enhancing e-learning semantically can enhance the retrieval and adaptability of the learning curriculum. This paper provides a semantically enhanced module based e-learning for computer science programme on a learnercentric perspective. The learners are categorized based on their proficiency for providing personalized learning environment for users. Learning disorders on the platform of e-learning still require lots of research. Therefore, this paper also provides a personalized assessment theoretical model for alphabet learning with learning objects for
children’s who face dyslexia.
Agriculture plays an important role in the economy of our country. Over 58 percent of the rural households depend on the agriculture sector as their means of livelihood. Agriculture is one of the major contributors to Gross Domestic Product(GDP). Seeds are the soul of agriculture. This application helps in reducing the time for the researchers as well as farmers to know the seedling parameters. The application helps the farmers to know about the percentage of seedlings that will grow and it is very essential in estimating the yield of that particular crop. Manual calculation may lead to some error, to minimize that error, the developed app is used. The scientist and farmers require the app to know about the physiological seed quality parameters and to take decisions regarding their farming activities. In this article a desktop app for seed germination percentage and vigour index calculation are developed in PHP scripting language.
What happens when adaptive video streaming players compete in time-varying ba...Eswar Publications
Competition among adaptive video streaming players severely diminishes user-QoE. When players compete at a bottleneck link many do not obtain adequate resources. This imbalance eventually causes ill effects such as screen flickering and video stalling. There have been many attempts in recent years to overcome some of these problems. However, added to the competition at the bottleneck link there is also the possibility of varying network bandwidth which can make the situation even worse. This work focuses on such a situation. It evaluates current heuristic adaptive video players at a bottleneck link with time-varying bandwidth conditions. Experimental setup includes the TAPAS player and emulated network conditions. The results show PANDA outperforms FESTIVE, ELASTIC and the Conventional players.
WLI-FCM and Artificial Neural Network Based Cloud Intrusion Detection SystemEswar Publications
Security and Performance aspects of cloud computing are the major issues which have to be tended to in Cloud Computing. Intrusion is one such basic and imperative security problem for Cloud Computing. Consequently, it is essential to create an Intrusion Detection System (IDS) to detect both inside and outside assaults with high detection precision in cloud environment. In this paper, cloud intrusion detection system at hypervisor layer is developed and assesses to detect the depraved activities in cloud computing environment. The cloud intrusion detection system uses a hybrid algorithm which is a fusion of WLI- FCM clustering algorithm and Back propagation artificial Neural Network to improve the detection accuracy of the cloud intrusion detection system. The proposed system is implemented and compared with K-means and classic FCM. The DARPA’s KDD cup dataset 1999 is used for simulation. From the detailed performance analysis, it is clear that the proposed system is able to detect the anomalies with high detection accuracy and low false alarm rate.
Spreading Trade Union Activities through Cyberspace: A Case StudyEswar Publications
This report present the outcome of an investigative research conducted to examine the modu-operandi of academic staff union of polytechnics (ASUP) YabaTech. The investigation covered the logistics and cost implication for spreading union activities among members. It was discovered that cost of management and dissemination of information to members was at high side, also logistics problem constitutes to loss of information in transit hence cut away some members from union activities. To curtail the problem identified, we proposed the
design of secure and dynamic website for spreading union activities among members and public. The proposed system was implemented using HTML5 technology, interface frameworks like Bootstrap and j query which enables the responsive feature of the application interface. The backend was designed using PHPMYSQL. It was discovered from the evaluation of the new system that cost of managing information has reduced considerably, and logistic problems identified in the old system has become a forgotten issue.
Identifying an Appropriate Model for Information Systems Integration in the O...Eswar Publications
Nowadays organizations are using information systems for optimizing processes in order to increase coordination and interoperability across the organizations. Since Oil and Gas Industry is one of the large industries in whole of the world, there is a need to compatibility of its Information Systems (IS) which consists three categories of systems: Field IS, Plant IS and Enterprise IS to create interoperability and approach the
optimizing processes as its result. In this paper we introduce the different models of information systems integration, identify the types of information systems that are using in the upstream and downstream sectors of petroleum industry, and finally based on expert’s opinions will identify a suitable model for information systems integration in this industry.
Link-and Node-Disjoint Evaluation of the Ad Hoc on Demand Multi-path Distance...Eswar Publications
This work illustrates the AOMDV routing protocol. Its ancestor, the AODV routing protocol is also described. This tutorial demonstrates how forward and reverse paths are created by the AOMDV routing protocol. Loop free paths formulation is described, together with node and link disjoint paths. Finally, the performance of the AOMDV routing protocol is investigated along link and node disjoint paths. The WSN with the AOMDV routing protocol using link disjoint paths is better than the WSN with the AOMDV routing protocol using node disjoint paths for energy consumption.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
Now a days we are living in an era of Information Technology where each and every person has to become IT incumbent either intentionally or unintentionally. Technology plays a vital role in our day to day life since last few decades and somehow we all are depending on it in order to obtain maximum benefit and comfort. This new era equipped with latest advents of technology, enlightening world in the form of Internet of Things (IoT). Internet of things is such a specified and dignified domain which leads us to the real world scenarios where each object can perform some task while communicating with some other objects. The world with full of devices, sensors and other objects which will communicate and make human life far better and easier than ever. This paper provides an overview of current research work on IoT in terms of architecture, a technology used and applications. It also highlights all the issues related to technologies used for IoT, after the literature review of research work. The main purpose of this survey is to provide all the latest technologies, their corresponding
trends and details in the field of IoT in systematic manner. It will be helpful for further research.
Automatic Monitoring of Soil Moisture and Controlling of Irrigation SystemEswar Publications
In past couple of decades, there is immediate growth in field of agricultural technology. Utilization of proper method of irrigation by drip is very reasonable and proficient. A various drip irrigation methods have been proposed, but they have been found to be very luxurious and dense to use. The farmer has to maintain watch on irrigation schedule in the conventional drip irrigation system, which is different for different types of crops. In remotely monitored embedded system for irrigation purposes have become a new essential for farmer to accumulate his energy, time and money and will take place only when there will be requirement of water. In this approach, the soil test for chemical constituents, water content, and salinity and fertilizer requirement data collected by wireless and processed for better drip irrigation plan. This paper reviews different monitoring systems and proposes an automatic monitoring system model using Wireless Sensor Network (WSN) which helps the farmer to improve the yield.
Multi- Level Data Security Model for Big Data on Public Cloud: A New ModelEswar Publications
With the advent of cloud computing the big data has emerged as a very crucial technology. The certain type of cloud provides the consumers with the free services like storage, computational power etc. This paper is intended to make use of infrastructure as a service where the storage service from the public cloud providers is going to leveraged by an individual or organization. The paper will emphasize the model which can be used by anyone without any cost. They can store the confidential data without any type of security issue, as the data will be altered
in such a way that it cannot be understood by the intruder if any. Not only that but the user can retrieve back the original data within no time. The proposed security model is going to effectively and efficiently provide a robust security while data is on cloud infrastructure as well as when data is getting migrated towards cloud infrastructure or vice versa.
Impact of Technology on E-Banking; Cameroon PerspectivesEswar Publications
The financial services industry is experiencing rapid changes in services delivery and channels usage, and financial companies and users of financial services are looking at new technologies as they emerge and deciding whether or not to embrace them and the new opportunities to save and manage enormous time, cost and stress.
There is no doubt about the favourable and manifold impact of technology on e-banking as pictured in this review paper, almost all banks are with the least and most access e-banking Technological equipments like ATMs and Cards. On the other Hand cheap and readily available technology has opened a favourable competition in ebanking services business with a lot of wide range competitors competing with Commercial Banks in Cameroon in providing digital financial services.
Classification Algorithms with Attribute Selection: an evaluation study using...Eswar Publications
Attribute or feature selection plays an important role in the process of data mining. In general the data set contains more number of attributes. But in the process of effective classification not all attributes are relevant.
Attribute selection is a technique used to extract the ranking of attributes. Therefore, this paper presents a comparative evaluation study of classification algorithms before and after attribute selection using Waikato Environment for Knowledge Analysis (WEKA). The evaluation study concludes that the performance metrics of the classification algorithm, improves after performing attribute selection. This will reduce the work of processing irrelevant attributes.
Mining Frequent Patterns and Associations from the Smart meters using Bayesia...Eswar Publications
In today’s world migration of people from rural areas to urban areas is quite common. Health care services are one of the most challenging aspect that is must require to the people with abnormal health. Advancements in the technologies lead to build the smart homes, which contains various sensor or smart meter devices to automate the process of other electronic device. Additionally these smart meters can be able to capture the daily activities of the patients and also monitor the health conditions of the patients by mining the frequent patterns and
association rules generated from the smart meters. In this work we proposed a model that is able to monitor the activities of the patients in home and can send the daily activities to the corresponding doctor. We can extract the frequent patterns and association rules from the log data and can predict the health conditions of the patients and can give the suggestions according to the prediction. Our work is divided in to three stages. Firstly, we used to record the daily activities of the patient using a specific time period at three regular intervals. Secondly we applied the frequent pattern growth for extracting the association rules from the log file. Finally, we applied k means clustering for the input and applied Bayesian network model to predict the health behavior of the patient and precautions will be given accordingly.
Network as a Service Model in Cloud Authentication by HMAC AlgorithmEswar Publications
Resource pooling on internet-based accessing on use as pay environmental technology and ruled in IT field is the
cloud. Present, in every organization has trusted the web, however, the information must flow but not hold the
data. Therefore, all customers have to use the cloud. While the cloud progressing info by securing-protocols. Third
party observing and certain circumstances directly stale in flow and kept of packets in the virtual private cloud.
Global security statistics in the year 2017, hacking sensitive information in cloud approximately maybe 75.35%,
and the world security analyzer said this calculation maybe reached to 100%. For this cause, this proposed
research work concentrates on Authentication-Message-Digest-Key with authentication in routing the Network as
a Service of packets in OSPF (Open Shortest Path First) implementing Cloud with GNS3 has tested them to
securing from attackers.
Microstrip patch antennas are recently used in wireless detection applications due to their low power consumption, low cost, versatility, field excitation, ease of fabrication etc. The microstrip patch antennas are also called as printed antennas which is suffer with an array elements of antenna and narrow bandwidth. To overcome the above drawbacks, Flame Retardant Material is used as the substrate. Rectangular shape of microstrip patch antenna with FR4 material as the substrate which is more suitable for the explosive detection applications. The proposed printed antenna was designed with the dimension of 60 x 60 mm2. FR-4 material has a dielectric constant value of 4.3 with thickness 1.56 mm, length and width 60 mm and 60 mm respectively. One side of the substrate contains the ground plane of dimensions 60 x60 mm2 made of copper and the other side of the substrate contains the patch which have dimensions 34 x 29 mm2 and thickness 0.03mm which is also made of copper. RMPA without slot, Vertical slot RMPA, Double horizontal slot RMPA and Centre slot RMPA structures were
designed and the performance of the antennas were analysed with various parameters such as gain, directivity, Efield, VSWR and return loss. From the performance analysis, double horizontal slot RMPA antenna provides a better result and it provides maximum gain (8.61dB) and minimum return loss (-33.918dB). Based on the E-field excitation value the SEMTEX explosive material is detected and it was simulated using CST software.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Routing Optimization with Load Balancing: an Energy Efficient Approach
1. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2582
Routing Optimization with Load Balancing: an
Energy Efficient Approach
S. Prabhavathi
Associate Professor, Dept of CSE, RYMEC Bellary, India
Email: prabkir@gmail.com
Dr. A. Subramanyam
Prof & Head Dept of CSE AITS Rajampet, India
Email: smarige@gmail.com
Dr. A. Ananda Rao
Prof. & Director Academic & Planning, JNTUA, Anantapur, India
Email: akepogu@gmail.com
----------------------------------------------------------------------ABSTRACT-----------------------------------------------------------
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of
research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have
proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that
uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The
routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of
energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy
efficiency within optimal data aggregation duration.
Keywords - Wireless Sensor Network, Energy, Load balancing, Routing, Agent
-------------------------------------------------------------------------------------------------------------------------------------------------
Date of Submission: May 19, 2015 Date of Acceptance: June 25, 2015
-------------------------------------------------------------------------------------------------------------------------------------------------
I. INTRODUCTION
Wireless sensor network (WSN) is one of the area of
commercial utilization for faster and effective
communication without the presence of any infrastructures
[1]. Generically, a wireless sensor network will consist of
the huge quantity of electronic sensing motes with high
radio frequency and base station, which characteristically
act as a relative link with many other processing networks
facilitating potential processing of data, location of
storage, and an access point to the sensor motes in its
network. Sensor motes sense its environment, gather the
data sensed and transmit it to the base station.
Unfortunately, the area of wireless sensor is also
accompanied by various issues e.g. restriction of power,
computational capability, and memory. Wireless sensor
network can be deployed in various application right from
military, biomedical, and environmental utilization [2]. It
is very difficult to detect the route and retain it as the
confined quantity of power and frequent alteration in the
locus of the position of the sensor nodes gives rise much
changes which are very dynamic and tough to forecast.
Although there has been an extensive research work
towards energy [3], [4], [5], [6], but still it has remain a
major obstruction towards development of the effective
routing algorithm in wireless sensor networks. One of the
most discussed routing protocols in connection with the
conservation of energy is LEACH routing protocol [7] [8]
[9]. The topology of WSN is normally studied with respect
to cluster formation in the network. It was also found that
sensor node usually do not have enough energy for
transmitting directly to the sink and therefore they take
assistance of cluster head who gathers all the non-
redundant data from sensor nodes and forward to sink.
Therefore, consumption of energy for cluster head will be
prime focus as if the cluster node is non-reliable and is not
selected properly; the data transmission will inevitably
fail. The literature explored that there are dual methods of
selection of either cluster first or cluster leader first [10].
In the cluster first approach, the network selects the cluster
formation initially and then cluster leader is selected
whereas in leader first approach, cluster leader is selected
first and then formation of the cluster takes place. Initially
the sensor nodes are randomly deployed. Usually, the
different sensor nodes are used in real times and therefore
heterogeneous network is formulated with varied scales of
energy retention. Usually, the sensor nodes which have
highest score of residual energy are selected as cluster
leader where the entire cluster leader formulated their
personal communication range and thereby formulates
clusters. The sensor nodes residing in each clusters
transmits their gathered information and forward it to the
cluster leader which in turn forward it to the sink. In
majority of the networking situation, cluster leader was
assumed to transmit the data directly to the sink located at
a specified distance from the cluster leader. The
phenomenon of clustering basically assists in diminishing
the memory utilization of the routing table updates,
preserves the communication channel capacity, enhances
the cumulative lifetime of the network, and minimizes the
chances of collection of redundant data [11].
The proposed study presents a schematic formulation of
energy efficiency using routing agent that is aimed to
perform an effective data aggregation in wireless sensor
2. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2583
network. The prime aim of the study is to enhance the
network lifetime towards the traffic load in the network.
Section-2 discusses about the prior work being undertaken
for the purpose of accomplishing energy efficiencies in
WSN. Section-3 discusses about the problem identification
of the study. Section-4 discuses about the evolution of the
study followed by proposed model in section 5. Section 6
discusses about the implementation as well as
accomplished outcome of the study. Finally Section 7
summarizes the work in brief.
II. RELATED WORK
This section discusses about the various approaches that
have been proposed in the literature to minimize energy
usage in WSN. Some of the prior study e.g. [12] shows
that energy efficient route can be mechanized for
enhancing the lifetime of network. This fact was
preliminarily supported by the study conducted by Chang
et al. [13]. The author exclusively highlighted that network
lifetime tends to degrade if the routes are established
among the nodes with less energy.
D-Haggerty et al [14] presented results from @scale;
one of the largest deployment in terms of mote-years yet
published. They were successful in achieving their science
goals while testing several hypotheses about network
dynamics, and reinforced emerging design practice on the
construction of this type of network.
Gu et al [15] have investigated various sorts of trade-
offs existing in the energy-aware concepts of WSN and
presented a solution for it using task planning. The
evaluation was performing using real-time sensors using
their routing protocol. The outcome of the study shows
prominent energy preservation over arbitrary
synchronization managements.
Jang e.t. al [16] present an energy efficient MAC
protocol for WSNs that avoids overhearing and reduces
contention and delay by asynchronously scheduling the
wakeup time of neighboring nodes.
Alwadi and Chetty [17] examined Isolet, ionosphere
and forest cover type datasets from the UCI repository to
emulate the wireless sensor network scenario. From their
simulation results, they show that it is possible to achieve
two important objectives using the proposed scheme: (1)
Increase the lifetime of the wireless sensor network, by
using optimal number of sensors, and (2) Manage sensor
failures with optimal number of sensors without
compromising the accuracy.
Rezaei and Mobininejad [18] focused of this article is
primarily on duty cycling schemes which represent the
most compatible technique for energy saving and they also
focus on the data-driven approaches that can be used to
improve the energy efficiency. Finally, they will make a
review on some communication protocols proposed for
sensor networks.
Zhao e.t. al [19] proposed a Medium-contention based
Energy-efficient DIstributed Clustering (MEDIC) scheme,
through which sensors self-organize themselves into
energy-efficient clusters by bidding for cluster headship.
although the proposed MEDIC uses only local
information, it achieves better energy efficiency than
native LEACH in terms of Data/Energy Ratio and an
effective lifetime.
Liu et al. [20] presented a multiple path routing techniques
for mobile adhoc network, where the authors emphasized
on exploring the optimal residual energy of every
communication channel in the continuous process of route
establishment. Finally, the system arranges the routes in
decreasing order based on remnant energy of the nodes.
After new path is generated with higher remnant energy,
the data packets are forwarded using that route. The best
part of the system is that it maintained better equilibrium
between sensor’s battery consumption and cumulative
energy drainage. The outcome shows better
accomplishment of enhancing cumulative network
lifetime.
Sun et al [21] have presents a new technique that enhances
the route selection technique for enhancing the detection
capability of the statistical filtering. The system permits
the sensor to determine the receiving energy for data
packets from the sink and selects the best route for data
transmission purpose.
Nikravan et al [22] have presents a technique that
indirectly attempts to reduce the energy depletion using
fuzzy logic. The system selects both energy factor as well
as transmission rate for selecting the next immediate node
for performing data aggregation process. The outcome of
the study shows that proposed system furnishes optimal
enhancement of packet delivery ratio as well as restores
energy conservation even in care of dynamic wireless
environment.
Shah et al. [23] have presented an energy aware routing
protocol that keeps a set of minimal energy paths and
randomly selects one of these sub-optimal paths, thereby
significantly increasing the network lifetime.
Akojwar e.t. al [24] focuses on use of classification
techniques using neural network to reduce the data traffic
from the node and thereby reduce energy consumption.
The paper discusses classification technique using ART1
neural network models. The classified sensor data is
communicated over the network using two different cases
of routing: cooperative routing and diffusion routing.
Razavi e.t. al [25] proposes fuzzy logic control (FLC) of
automatic repeat request (ARQ) as a way of reconciling
these factors, with a 40% saving in power in the worst
channel conditions from economizing on transmissions
when channel errors occur.
Begum et al. [26] have presented an optimization method
for enhancing the phenomenon of energy conservation
using swarm intelligence. The author has used ant colony
optimization, where the outcome of the study
minimization of searching duration with less
computational complexities compared with conventional
energy efficient algorithms in WSN.
Bogliolo e.t. al [27] discusses the main issues which
prevent WSNs to fully exploit the idleness and presents a
general power state model capturing the energy efficiency
of a mote. VirtualSense motes are used as case study to
characterize the proposed power state model and to
illustrate its application.
3. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2584
Fafoutis and Dragoni [28] presented an improved and
xtended version of ODMAC and they analyze it by means
of an analytical model that can approximate several
performance metrics in an arbitrary network topology.
Kannadas and Daniel [29] proposed a Dynamic
Conflict-free Query Scheduling (DCQS), a novel
scheduling technique for queries in wireless sensor
networks. In contrast to earlier Time Division Multiple
Accesses (TDMA) designed for query services in wireless
sensor networks.
Verma et al [30] presented a technique on energy
efficiency in WSN using reliability study. The author has
discussed their study considering the comparative analysis
of conventional LEACH algorithm (LEACH-C). The
outcome of the study shows better energy efficiency as
compared to the conventional LEACH algorithm.
Dam and Langendoen [31] have presented MAC based
solution for the purpose of establishing energy efficiency
in WSN called as T-MAC. The formulation is based on
active and sleep stage duty cycle. The author has discussed
that applicability of T-MAC is quite high as it is highly
insensitive to delay.
Xie e.t. al [32] investigated the operation of a sensor
network under this new enabling energy transfer
technology. They consider the scenario of a mobile
charging vehicle periodically traveling inside the sensor
network and charging each sensor node’s battery
wirelessly.
Cammarano e.t. al [33] proposed Pro-Energy-VLT, an
enhancement of the Pro-Energy prediction algorithm that
improves the accuracy of energy predictions, while
reducing its memory and energy overhead.
Lakshmi [34] proposes novel energy efficient algorithm
Fuzzy Dynamic Power Control Algorithm for Wireless
Sensor Networks.
Although it can be seen that there are huge blocks of
research work being done in the field of routing issues
related to power consumption in wireless sensor network
using Fuzzy Logic. But every approach has yielded
enhancement in the performance using Fuzzy only 50%,
whereas we have achieved around 80% in performance
efficiency using dual level of fuzzy inference system.
Therefore, it can be seen that majority of the prior research
work has been focused on distance between the cluster
leader and the sensor motes which ignore majority of the
other parameters which influences the power draining and
maximizing the network lifetime.
Understanding the research gap from the review of the
prior research work, the current research work considers
tri-factors e.g. magnitude of remoteness between the
cluster leader and the sensor motes, Euclidean’s distance
between the cluster leader, and finally the power factor of
the cluster leader.
III. PROBLEM IDENTIFICATION
Organizing sensor networks into clustered architectures
has been extensively explored over the previous couple of
years, leading to the surfacing of an excellent variety of
tasks-specific clustering protocols in WSN. Clustering is a
cost-effective approach for information aggregation within
the WSN. Every sensor node within the network sends
information to the aggregator node, meaning the cluster
leader, then the cluster leader performs the aggregation
method on the received information and sends it to the
bottom station. However, performing the aggregation
operation over the cluster leader causes the vital energy
drains. In case of a homogeneous type of WSN, the cluster
head can soon die out, and once more re-clustering should
be done, which once more causes energy consumption. In
this study, the focus is placed on designing a protocol that
can extract information for data dissemination within the
range of clusters. The termination of the old clustering
technique and the design of a new clustering technique
will be highly avoided to maintain algorithm efficiency.
The behavior of power utilization in WSN is one of the
most challenging areas in this field, as it is never possible
to attain the ideal solution in terms of power preservation.
However, a couple of research works [35] were carried out
in the field of control systems, as was a study on the
electrical impulse to the core computing system. It was
also seen that the types of WSN will totally depend on the
resource-constrained sensor motes accumulate information
from the physical environment. Power preservation is
known to be one of the most critical concerns in the
majority of the research work. To analyze the reason for
the unwanted draining of power from the sensor motes, it
is important to understand its root cause. The existence of
the cluster leader is one of the most significant phenomena
of effective communication. All the other nodes
communicate to the cluster leader, which will transmit
data to the defined base station. Therefore, an efficient
selection procedure is required to maintain power
efficiency. The cluster should be formed in the best way
possible to ensure that power is utilized in a reasonable
manner for a power-proficient process. Generically, every
process of the cluster formation on the WSN is classified
into various rounds, where every round is developed by
the election of the cluster leader, the formation of the
cluster, and the transmission of the data. The cumulative
lifetime of the network is the quantity of the rounds in
which all the sensor motes will have certain power
retained. Certain prominent groups of researchers have
concentrated on the selection process of the cluster leader
[36]. However, the focus of the current study is more on
analyzing the LEACH protocol [37], where every sensor
mote decides which cluster it belongs to by selecting the
cluster leader that requires the minimum power for radio
transmission.
It is already known that the majority of WSN applications
require a longer network lifetime. In various types of
WSN applications, nodes are deployed to the location
where it is very tough to replace the defective or dead
node. The amount of energy allocated in the sensor node is
actually very limited, which further drains out at every
communication even in an inactive phase. Hence, a
clustering technique can be introduced in which all the
sensor nodes can directly communicate with the cluster
leader, which in turn can gather the data from all the
sensor nodes and forward to the assigned base station.
4. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2585
Hence, the role of the cluster leader is very essential in
terms of communication in WSN.
Along with energy, routing and load balancing is another
parameters that also requires significant attention for
designing optimization solution in wireless sensor
network. From the literatures, the existing geographic
routing is found with various challenges. The theoretical
study of geographic routing protocol has better packet
delivery ratio which doesn’t matches with the radio
network [38]. The consideration in such routing schema
uses a communication range that is highly dependent on
the environment causing failures to planarization [39].
Another prominent protocol called as Cross-Link
Detection Protocol proposed by Kim et al. [40] is found to
work effectively in practical environment but is highly
expensive from exploring single link multiple times. Two
factors of load balancing techniques with respect to
optimization was ignored much viz. data aggregation
duration and energy consumption. The data aggregation
duration is very often estimate from the time taken by the
physically sensed aggregated data by the aggregator node
to the base station. However, possibly, if a new model is
design that aims to enhance the data aggregation by
introducing a new module within aggregator node and
base station need to be involved while estimating data
aggregation time. This types of evaluation will show
effectiveness of the proposed module with respect to
energy optimization as well as load balancing, which is
missing in the literatures. Hence, the proposed system
aims to overcome such issues.
IV. EVOLUTION OF THE STUDY
This section will illustrate the evolution of our previous
work pertaining to techniques adopted for mitigating the
problems in wireless sensor network. With a list of
problems existing in the area of wireless sensor network,
the current study is focused on energy efficiency for the
purpose of disseminating the data to the sink in wireless
sensor network. The primary objectives of the study as
formulated by the researchers are mainly three fold e.g. i)
Objective-1: To accomplish the energy optimization and
load balancing at different levels of clustering, ii)
Objective-2: To design a framework for dynamically
reconfiguring the new routing agents as the designated
routing agents exhaust their energy, and iii) Objective-3:
when the node moves from one to another cluster, the
periodical registration update could be omitted for saving
the unnecessary overhead. The previous study has
introduced a novel protocol named Enhancing Network
Lifetime Using Probabilistic Logic (ENLPL) [41], which
deploys a hierarchical clustering technique to maximize
the cumulative lifetime of the electronic sensor motes in
wireless sensor networks. Compared with standard
LEACH protocol, ENLPL has witnessed successful energy
optimization as evident from the increased alive nodes in
successive iteration, greater extent of residual energy, and
normalized power variance. However, the study didn’t
focus much on load balancing issues as it is totally
concentrating on mitigation of energy issues and thereby
optimize it. The problem of load balancing issues in the
mobility scenario is addressed in the second work of the
researcher [42]. This study has introduced a novel globular
topology of WSN that ensures an efficient task allocation
strategy in large-scale WSN architecture. The performance
of the data aggregation process is further increased by
considering the presence of multiple mobile sink that adds
an exponential benefit to the task allocation policy
proposed in the second study. Therefore, when the nodes
moves from one region of one cluster to another region of
different cluster, the information renewable process
continues for updating the routing until the data packets
reaches its destination point (sink). Different from
conventional schemes found in literature, the scheme
discussed in [42] performs endeavors to collect the
information and then the information gather will be
transmitted to the sink. Receiving these update packets by
mobile sink nodes in basic region means that all task
allocation policies are periodically updated and posses a
capability by responding to any queries. Hence, it can be
seen that study discussed in [41] accomplishes the
objective-1 while study discussed in [42] accomplishes
mainly objective-3. Objective-2 is only accomplished to
minor extent; however, most robust technique is required
with support of data aggregation model in wireless sensor
network for performing reconfigurable operation for the
exhausted routing agents to further optimize the network
lifetime. Hence, the proposed study discusses about certain
formulated technique that will attempt to further optimize
the cumulative network lifetime by exploring the efficient
energy for the purpose of disseminating the data to the
sink of wireless sensor network. It is expected that
proposed study will accomplish better energy aware
network structure that could be deployed for large scale
wireless sensor network in future.
V. PROPOSED MODEL
The proposed model introduces a novel model that can
perform dynamic reconfiguration of the new routing
agents as the designated routing agents depletes their
residual energy to a large extent in the process of data
aggregation. However, the primary goal of the study will
be to accomplish much better energy efficiency while
disseminating the data from the sensors to the sink in
wireless sensor network. The adoption of the routing agent
in the current study is motivated by the work discussed by
Shakshuki et al. [43]. According to Shakshuki et al. [43],
the term ‘routing agent’ is a critical module that has the
capability to perform communication with all the sensor
nodes in the wireless environment. The routing agent is
built within aggregator node and base station[47].The
routing agent is also responsible for assigning the cluster
leader and evaluates their decision making strategies for
energy efficient routing in wireless sensor network. In the
current work, a novel technique will be introduced that
will incorporate the capabilities of an agent to explore the
energy efficiency. The block diagram of the study is as
follow in Figure 1:
5. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2586
Initialize Simulation Parameters
(Nodes, Clusters, Time, Simulation Area)
Create Network Model
Create Energy Model
(ETX, ERX )
Data Packet
Size
Data rate
Supply
Voltage
Current Drawn from
Communication Module
Current Drawn from
Sensor Module
Overhead
Decide number of clusters for
proposed system
Calculate maximum number of
nodes in each clusters
Calculate Total Energy for all Clusters
12 1
C
ηi = 2i-1
Member
Node
Aggregator
Node
Routing
Agent
Base
Station
Compare with
LEACH
Cumulative Energy Consumption
Cumulative Data Aggregation
Duration
Perform Data Aggregation
Figure 1 Block Diagram of the Proposed Study
The proposed study formulates a routing agent using graph
theory that ensures energy efficient data aggregation
technique within less duration and more computational
capability. The proposed system discusses about the agent
based routing structure where the nodes are managed into
numerous unit stratum cluster of multiple size for the
purpose that cluster can communicate with the routing
agent. Consider a WSN topology, considering C as a
cluster with Nsen as total number of sensor nodes.
1
1 1
C
i
C
i
iseni N (1)
In the above equation, η is acting as the highest number of
the sensor node in the ith
cluster that can be represented in
the form of geometric progression as follows:
ηi = 2i-1
(2)
Therefore, substituting the value of i = 1, 2, 3, ….., it can
be seen that the ηi will generate the values of 1, 2, 4, 8 etc
as a geometric progression. Therefore, eq.(1) can be
amended as below,
1212 1
C
sen
C
N (3)
It is quite evident that a smaller dimension of the cluster
size can reduce the process of data dissemination
technique. Therefore, the proposed system considers the
Cth
cluster (last cluster) to be the ultimate member to
perform communication with the routing agent. Hence,
during the cluster formation phase, the members are
allocated to (C-1)th
clusters initially coming down to Cth
cluster for member node allocations within that cluster.
The system considers the time period of the cumulative
data aggregation to be lower bound by the total number of
sensor nodes. Considering a topology with eq.(3), it can be
seen that the initial (C-1) clusters are completely filled
with the member nodes and needs a following cumulative
timeslot for forwarding all the aggregated data to routing
agent as,
C
i
C
i
1
1
12 (4)
And the last cluster (Cth
cluster) is allocated with Nsen-2C-1
member nodes. Which means that the aggregator node will
consume time period of (2C-1
-1) to aggregate the physical
data and (Nsen-2C-1
+1) time period to forward the data to
the routing agent. Therefore the complete time period (Tp)
to perform data aggregation can be represented as
TP(Nsen) = ( 2C-1
-1) + (Nsen-2C-1
+1)
=Nsen (max) (5)
It should be noted that cluster size is highly dependable
factor for the evaluation of the time period (Tp). Hence,
the study formulates a condition of Tp as when Cth
cluster
can establish transmission with the routing agent only
when (C-1)th
cluster is done with communication.
Therefore, Tp can be now represented as,
1
1
2
1
2
max
1
11
]2),12([
C
sen
C
sen
N
j
jN
j
jC
sen
C
pp RRNTT (6)
In the above eq.(6), )12( 1
C
pT is considered as
cumulative time period by the initial (C-1) clusters for
aggregating the data from their member nodes and
transmit the aggregated data to the routing agent. It can
also be seen that all these (C-1) clusters are cumulatively
allocated and so
)12( 1
C
pT = )1( 1 CpT
1
1
1
1
1
1
[1
C
C
p
p
C RR
(7)
As the formulation of the current study is the critical
implementation aiming at energy efficiency, hence better
standards are considered to evaluate the effectiveness of
the model. The proposed study considers the similar radio
and energy model that has been used in LEACH
algorithm. The justification behind this logic is that
although there were various formulations of design,
algorithms, and mathematical model in the past that has
totally focused on solving the energy issue in order to
maximize the lifetime of the WSN. However, very few of
the prior work have received recognition. Out of the
majority of the work introduced in the past, LEACH is
considered as highly standard and benchmarked
formulation till data. May be this is one of the reason, why
97% of the outcome of the existing research work focusing
on energy issues is compared with LEACH algorithm.
Although there are various versions of LEACH algorithm,
but major research communities has selected LEACH
model as the standard work because of the design of the
radio model and energy model. Various components that
maps with the physical entities in the sensor mote is
considered in the LEACH protocol. However, various
studies also proved that LEACH is not the appropriate
protocol to mitigate the energy issues. As the study is
6. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2587
considering the radio and energy model that has been used
in LEACH algorithm so it is important to say that the
study will need to consider the loss of energy due to
channel transmission. As radio can perform energy
management of a sensor node so it will tend to use the
minimized energy value to reach the intended destination
(that may be some intermediate node or other cluster head
or base station). Considering the wireless environment,
there is a possibility of signal attenuation with the
distance; hence one energy loss model can be mechanized
for relatively short distance and other for relatively long
distance. Therefore, using the standard radio and energy
model [44], the depletion of energy by the radio model in
transmitting l bits of data over a distance d can be
represented by,
ETX (l, d) = l . Eelec + l.ЄFS.d2
, if d < do
= l. Eelec + l. ЄTR.d4
, if d > do (8)
In the above equation Eelec is the energy depleted per bit to
operate the transmitter or the receiver circuit. ЄFS and ЄTR
are the constant and is highly dependent on the transmitter
amplifier model that is considered in the study and do is
the threshold transmission distance that is represented as,
TR
FS
od
(9)
The energy consumption on the receiver end to obtain l
bits of the data can be represented as ERX (l) = l. Eelec. The
data aggregation framework in this part of the study
assumes that the aggregator node would process (n/2). l
bits of the data at the end of one frame, where n represents
number of aggregator node. The study also considers the
energy cost for performing data aggregator that is
initialized as EDA=4nJ/bit. Considering the standard energy
model as exhibited in eq.(8), the present network of 2C-1
-
1<N≤2C
-1 sensor nodes will be allocated in C clusters.
Hence, the total energy consumption can be represented as
following,
1
1
1
1
1
1
].[].[
C
i p
RXpcTX
p
RXpiTXo
Ci
EdEEdEE
1
1
....
C
i
cRATXCiRATXi dEdE (10)
In the above equation, dji is the distance between the jth
member nodes to ith
aggregator nodes; djk is the distance
between jth
member node and cth
aggregator node. While
diRA is the distance between the ith
aggregator node to route
agent and dcRA is the distance between cth
aggregator node
and route agent. In the above eq.(10). The first two
components are associated with energy depletion due to
internal transmission and reception within a cluster while
the last two components are associated with transmission
activity from aggregator node to the routing agent.
Therefore, considering the highest value for the ETX,
eq.(10) is now amended as follows,
])[1(])[1(
1
1
RX
h
TXi
C
i
RX
h
TXi
h
o EEEEE
1
1
.
C
i
h
TXi
h
TXi EE (11)
Normalizing the above equation becomes,
])[1(])[1(
1
1
RX
h
TXi
C
i
RX
h
TXi
h
o EEEEE
1
1
1
1
1
1
1
1
)().(
C
i
h
TX
p
ph
TX
p
p
ERRERR
i
i
i
i
(12)
The current study basically introduces routing agent as a
auxiliary node for the purpose of optimizing the energy
depletion factor in wireless sensor network and in order to
do so the transmission distance of the current network
management should be reduced. Hence, in order to carry
out optimization, following techniques were adopted. The
network is decided in the considered topology with 2C-1
-
1<Nsen ≤2C
-1 sensor nodes. Then the system sorts the
sensor nodes as per the residual energy in decreasing order
and stored in a matrix of the form M=[M1, M2, . . . , MNsen]
so that residual energy of M1 is more than that of M2 and
continues. The system than chooses C elements in matrix
M as the aggregator node. The transmission distance
between the aggregator node and the member nodes are
optimized using the following,
C
i
N
Cp
ipip
sen
dI
1 1
2
.min (13)
With a condition that
C
p
senip NCiI
1
],...,1[,1 (14)
senN
Ci
pCip CpI
1
1 ]1,...,1[,1 (15)
senN
Ci
cipI
1
(16)
In the above conditions, dip is the relative distance between
the sensor node Mi and Mp, Iip is the deployed indicator to
exhibit the established communication between Mi and
Mp. The aggregation of the physical data from the member
is done by aggregator node and sends the notification of
the aggregated data to the routing agent. It is already
known that aggregator node consumes relatively higher
energy as compared to member nodes in the process of
data aggregation. Therefore, the optimization process in
this study basically allocates the nodes with maximum
7. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2588
residual energy to be aggregator node. However deploying
eq(13) with its specified condition will enable the
reduction of the transmission distance among every
aggregator node and member nodes in the simulation
environment. Eq.(13)(14), and (15) discusses about the
constraints that need to be satisfied by Iip of eq.(13). The
condition specified in eq(13) ensures that all the member
nodes are connected to only one aggregator node, while
the condition specified in eq(14) and (15) ensures that the
Cth
cluster is the ultimate cluster to be allocated by
respective member nodes.
VI. IMPLEMENTATION & RESULTS
The implementation of the proposed research work is done
on Windows 32-bit OS with 1.84 GHz dual core processor
considering MATLAB as programming language. The
proposed work is experiment on a simulation area of 100 x
100 m2
. We have considered a various scenarios with 100
nodes with arbitrary distribution. The preliminary power
of sensor motes is initialized at 0.1 Joules with 100
rounds. The proposed system is compared to frequently
used LEACH [44] protocol. The network simulation
parameters considered are as shown below in table 3.
Table 3 Simulation Parameters
Total Number of Nodes 100
Size of network 100 x 100 m2
Position of BS (60,150) m
Preliminary Energy Initialization 0.1J
Feasibility of CL election 0.5
Size of packet 6500 bits
The current framework considers that all the cumulative
energy depletion are happening overheads as well as due
to spontaneous receiving and transmitting of physical data.
Another fact is different hardware components of a sensor
node consumes different rate of energy. As a property of
sleep scheduling algorithm [45], whenever a sensor node
is in inactive stage, it will preserve the energy
consumption of the different hardware components in a
sensor node. Therefore, the energy depletion in the
inactive stage of ith
node can be represented as,
Einactive = δi ρ (γ1+ γ2+ γ3) (17)
In the above equation (17), δi is the time period of the
inactive stage of ith
sensor node, ρ is the amount of the
potential difference, while γ1, γ2, and γ3 are current drained
by transmission, processing, and the amount of current in
inactive stage (i.e. even in inactive stage, a sensors draws
some amount of energy) respectively. The routing agent
introduced in the model thereby ensures that the
framework dynamically reconfigures the all the nodes if
any node is found in the verge of energy depletion. In the
data packet transmitting stage, a sensor node will always
turn on its radio model thereby performing computation.
Hence, the transmittance energy for a sensor node in this
model with its final threshold energy ETH
in the maximum
of Max level can be expressed as,
ETX
TH
(Max) = E1(Max) + δi ρ(γ1(Max)+ γ2+ γ3)(18)
In the above equation, E1(Max) is considered as
cumulative overhead power depletion in the processing
stage while switching to and from transmission to
receiving stage, γ1(Max) is the total current required to
perform communication when the node is transmitting
with its defined final threshold energy at the Maxth
level
and γ2 is the amount of the current required in the active
stage. Similarly, the energy ERX drained by the prime
sensor node to receive the data packet from the member
nodes is represented as,
ERX = ERX_1 + δi ρ(γ1+ γ2+ γ3) (19)
In the above eq (19), ERX_1 is the cumulative overhead
energy drained by the communication and frequent
toggling of active and inactive state of the sensor nodes.
Similarly, the energy required for processing the data can
be represented by,
EPRO = EPRO_1 + δi ρ(γ1+ γ2+ γ3)
Where EPRO_1 is the cumulative energy consumed due to
overhead occurred by frequent toggling of active and
inactive state of the sensor nodes. The parameters are
selected based on MEMSIC nodes [46]
The result evaluation of the study is classified into
multiple unit stratum groups or clusters. It is already know
that networks deployed using LEACH principles have
uniform cluster nodes to total number of nodes in many
cases. Therefore, the simulation is being studied
considering two parameters mainly i.e. energy
consumption and total time of data aggregation. Both the
above performance evaluation parameters are also
evaluated with respect to three different values of
compression ratio i.e. when compression ratio is 0.5, 0.75,
and 1 respectively. Figure 1 represents the total energy
consumption in joules when compression ratio is
initialized to 0.5 and the simulation is done considering
100 nodes. The outcome highlights that energy
consumption of proposed system is less as compared to
LEACH protocol. In the next phase as exhibited in Fig.3-
4, when the compression ratio is increased to 0.75 to 1, s
similar trend is observed which shows that proposed
system has better energy conservation as compared to
standard LEACH protocol with increased compression
ratio. One of the basic reason behind this is the proposed
tree based approach which don’t allow the aggregator
node to send the data directly to the base station, but
creates a better hoping strategy thereby mitigating the
enough traffic load using the new module of routing agent.
Hence, if in the duration of data aggregation, if the
aggregator node is about to die off, the routing agent
performs selection of new aggregator node even before the
old aggregator a node dies off. In this manner, the
cumulative network’s energy is highly preserved by
dynamically reconfiguring the new routing agents when
the previous routing agent is about to die off. The system
therefore ensures better energy optimization along with
8. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2589
better balancing traffic load using the novel schema of
routing agents introduced in the current study.
Figure 2 Total Energy Consumption at CR=0.5
Figure 3 Total Energy Consumption at CR=0.75
Figure 4 Total Energy Consumption at CR=1
The performance evaluation of the current study is
cumulative data aggregation time. In this evaluation phase,
each simulation is studied by varying the value of
compression ratio to 0.5, 0.75, and 1. Fig.5 shows that
cumulative data aggregation duration for proposed system
is higher compared to LEACH at compression ratio 0.5.
This increased dimension of the duration for the proposed
system is basically due to the initial routing stage that
attempts to perform preliminary communication within
various clusters after performing data aggregation. The
prime reason here is although the system might experience
a bit high delay in the preliminary rounds, but the delays
will be highly minimized in the consecutive cycle of data
aggregation. However, when the compression ratio is
increased to 0.75 from 0.5, the system is witnessed with
increasing linearity in curves with increasing number of
sensor nodes. Hence, the data aggregation time for
proposed system is now found to be minimized as
compared to preliminary outcome when compression ratio
was 0.5.
Figure 5 Total Data Aggregation Time at CR=0.5
Figure 6 Total Data Aggregation Time at CR=0.75
9. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2590
Figure 7 Total Data Aggregation Time at CR=1
A closer look into the curves in Fig.6 shows that data
aggregation duration for both LEACH as well as proposed
system exponentially differs with respect to performance
as the current study provides a better routing schema that
can direct its packets, minimizing its redundancies, and
routing them in proper direction (either base station or
next hop) using routing agents. Moreover, due to higher
level of sustenance (owing to better energy conservation),
the algorithm can perform thrice times better than LEACH
in minimizing the duration of data aggregation. As the
system is designed based on the radio and energy model
using multiple layer grouping of nodes, the accomplished
outcome is therefore easy to measure and hence scalable.
With the increasing number of nodes, the number of
cluster will possibly increases, however, it is still not
found with any significant effect in the data aggregation
duration. The outcome shows that data aggregation
duration of the proposed system is exponentially
minimized to larger extent as compared to the standard
LEACH protocol.
VII. CONCLUSION
The proposed system highlights a novel energy aware
routing protocol and load balancing scheme by introducing
a module called as routing agent for the purpose of
accomplishing energy efficiency. The prime task of a new
agent is to collect the aggregate data to the base station.
The simulation result analysis is bench marked for optimal
throughput considering the power retention process in
WSN. The simulation result shows that the proposed
network has complete utilization of energy optimization to
minimize data duration time. The implemented algorithm
is compared with standard LEACH protocol is highly
satisfactory.
REFERENCES
[1] C.Y. Chong and S.P. Kumar, “Sensor Networks:
Evolution, opportunities, and Challenges”, Proceedings of
the IEEE, vol. 91, no. 8, Aug. 2003, pp. 1247-1256
[2] Y. Li, M. T. Thai, W. Wu, “Wireless sensor networks
and applications”, Springer, 2008 – Computers, pp.441,
2008
[3] Y.Zou, K.Chakrabarty, “Energy-aware target
localization in wireless sensor networks, Pervasive
Computing and Communications”, Proceedings of the
First IEEE International Conference on March, pp. 60 –
67, ISBN: 0-7695-1893-1, 2003
[4] A. Sharma, K. Shinghal, N. Srivastava, R. Singh,
“Energy Management for Wireless Sensor Network
Nodes”, International Journal of Advances in Engineering
& Technology, Vol. 1, 2011, 2011
[5] M.Cardei, M.T.Thai, L.Yingshu W.Weili, “Energy-
Efficient Target Coverage in Wireless Sensor Networks”,
24th Annual Joint Conference of the IEEE Computer and
Communications Societies. INFOCOM, pp.1976 - 1984
vol. 3, ISBN: 0-7803-8968-9, 2005
[6] K.Y. Jang, K.T.Kim,H. Y. Youn, S.U. Suwon, “An
Energy Efficient Routing Scheme for Wireless Sensor
Networks”, Computational Science and its Applications,
Aug-2007, pp. 399 – 404, ISBN:0-7695-2945-3, 2007
[7] D.K.Patel, M.P.Patel, K.S.Patel, V.T. Patel,
“Scalability Analysis in Wireless Sensor Network with
LEACH Routing Protocol”, Computer and Management
(CAMAN), International Conference,, pp. 1 – 6, 2011
[8] J.Wang, G.Yang, S. Chen,Y. Sun, “Secure LEACH
routing protocol based on low-power cluster-head
selection algorithm for wireless sensor networks”,
Intelligent Signal Processing and Communication
Systems, 2007. International Symposium on ISPACS 2007,
pp.341 – 344, E-ISBN: 978-1-4244-1447-5
[9] W. Xiaoping, L.Hong, L. Gang, “An Improved
Routing Algorithm Based on LEACH Protocol”,
Distributed Computing and Applications to Business
Engineering and Science (DCABES), Ninth International
Symposium, pp.259 – 262, ISBN: 978-0-7695-4110-5
[10] K.Sun, P.Ning, “Secure Distributed Cluster
Formation in Wireless Sensor Networks”, Proceedings of
the 22nd Annual Computer Security Applications
Conference, pp.131-140, 2006
[11] V.Katiyar, N.Chand, S.Soni, “Clustering Algorithms
for Heterogeneous Wireless Sensor Network: A Survey”,
International Journal of Applied Engineering Research,
Vol.1, No-2, 2010
[12] F.Akyildiz, “A Survey on Sensor Networks,”
Computer Journal of IEEE Communications Magazine,
Vol. 40,Nno. 8, pp. 102-114, 2002.
[13] H.Chang, S.Leandros, L. Tassiulas, “Maximum
Lifetime Routing in Wireless Sensor Networks,”
Computer Journal of IEEE/ACM Transactions on
Networking, vol. 12, no. 4, pp. 609-619, 2004
[14] S. D-Haggerty, S. Lanzisera, J. Taneja, R.
Brown,D.Culler, “scale: Insights from a Large, Long-
Lived Appliance Energy WSN”, Proceeding of the ACM,
2012
[15] Y.Gu, L. He, T. Zhu, T. He, “Achieving energy-
synchronized communication in energy-harvesting
wireless sensor networks”, ACM Transactions on
Embedded Computing Systems (TECS), 2014, vol. 13, no.
2
10. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2591
[16] J. Beakcheol, J. B.Lim, M. L. Sichitiu, “An
asynchronous scheduled MAC protocol for wireless sensor
networks”, Computer Networks 57.1, pp. 85-98, 2013
[17] M.Alwadi and G. Chetty, “Feature Selection and
Energy Management for Wireless Sensor Networks”,
IJCSNS International Journal of Computer 46 Science and
Network Security, VOL.12 No.6, 2012
[18] Z. Rezaei, S. Mobininejad, “Energy Saving in
Wireless Sensor Networks, Energy Saving in Wireless
Sensor Networks”, International Journal of Computer
Science & Engineering Survey (IJCSES), Vol.3, No.1,
2012
[19] l. Zhao and q. Liang, “Medium-Contention Based
Energy-Efficient Distributed Clustering (MEDIC) for
Wireless Sensor Networks”, International Journal of
Distributed Sensor Networks, 3: 347–369, Oct 2007 Vol.
3, Issue 4, 2007
[20] Y. Liu, L. Guo,H. Ma,T. Jiang, “Energy Efficient
on–demand Multipath Routing Protocol for Multi-hop Ad
Hoc Networks”, IEEE, pp. 592 – 597, 2008
[21] C.Sun, H.Y. Lee, T.H. Cho, “A Path Selection
Method for Improving the Detection Power of Statistical
Filtering in Sensor Networks”, Journal of Information
Science and Engineering 25, 1163-1175, 2009
[22] M. Nikravan, S. M. Jameii, M. H. Kashani, “An
Intelligent Energy Efficient QoS- Routing Scheme
forWSN”, (IJAEST) International Journal Of Advanced
Engineering Sciences And Technologies, Vol No. 8, Issue
No. 1, 121 – 124 ISSN: 2230-7818 -2011
[23] R.C. Shah, J.M.Rabaey J, “Energy Aware Routing for
Low Energy Ad Hoc Sensor Networks”, Proceedings of
the IEEE Wireless Communications and Networking
Conference (WCNC2002), Orland, pp. 350-355, 2002
[24] S.G. Akojwar, R.M. Patrikar, “Improving Life Time
of Wireless Sensor Networks Using Neural Network
Based Classification Techniques with Cooperative
Routing”, International Journal of Communications Issue
1, Vol.2, ISBN: 978-960-6766-84-8, 2008
[25] R. Razavi, M. Fleury, and M. Ghanbari, “Power-
Constrained Fuzzy Logic Control of Video Streaming over
aWireless Interconnect”, EURASIP Journal on Advances
in Signal Processing, 2008
[26] S.Begum, N.Tara, S.Sultana, “Energy-Efficient
Target Coverage in Wireless Sensor Networks Based on
Modified Ant Colony Algorithm”, International Journal
of Ad hoc, Sensor & Ubiquitous Computing (IJASUC),
Vol.1, No.4, 2010
[27] A.Bogliolo, E. Lattanzi, and V. Freschi, “Idleness as a
resource in energy-neutral WSNs”, In Proceedings of the
1st International Workshop on Energy Neutral Sensing
Systems (ENSSys '13). ACM, New York, NY, USA, 2013
[28] F.Xenofon and N. Dragoni, “Adaptive media access
control for energy harvesting—Wireless sensor networks”,
Networked Sensing Systems (INSS), Ninth International
Conference on. IEEE, 2012.
[29] P. Kannadas, S.J. Daniel, “Energy Efficient Conflict
Free Query Scheduling For Wireless Sensor Networks”,
International Journal of Engineering and Advanced
Technology (IJEAT) ISSN: 2249 – 8958, Vol.1, Issue.5,
2012
[30] N. Verma, S.C. Gupta, P.Sethi, Secure & Energy
Efficient Routing for Hierarchical WSNs, International
Journal of Emerging Trends & Technology in Computer
Science, Vol. 1, Issue. 3, 2012
[31] V.Dam, and K. Langendoen, “An adaptive energy-
efficient MAC protocol for wireless sensor networks."
Proceedings of the 1st international conference on
Embedded networked sensor systems. ACM, 2003
[32] L.Xie, Y.Shi, Y.T.Hou, H.D.Sherali, "Making Sensor
Networks Immortal: An Energy-Renewal Approach With
Wireless Power Transfer," Networking, IEEE/ACM
Transactions on , vol.20, no.6, pp.1748,1761, Dec. 2012
[33] A. Cammarano, C. Petrioli, D. Spenza, “Improving
energy predictions in EH-WSNs with Pro-Energy-VLT”,
In Proceedings of the 11th ACM Conference on Embedded
Networked Sensor Systems (SenSys '13). ACM, New York,
NY, USA, Article 41 , pp. 2, 2013
[34] A.Lakshmi, S.V. Manisekaran, “Fuzzified dynamic
power control algorithm for wireless sensor networks”,
International Journal of Engineering Science and
Technology (IJEST) Vol. 3 No. 4,, ISSN : 0975-5462, 2011
Problem identification
[35] W. Dargie, C. Poellabauer, “Fundamentals of
Wireless Sensor Networks: Theory and Practice”, August
2010.
[36] M.Nikravan, S.M.Jameii, M. H. Kashani, “An
Intelligent Energy Efficient QoS- Routing Scheme for
WSN,” International Journal Of Advanced Engineering
Sciences And Technologies (IJAEST), Vol No. 8, Issue No.
1, 121–124
[37] l.Zhao and q.Liang, “Medium-Contention Based
Energy-Efficient Distributed Clustering (MEDIC) for
Wireless Sensor Networks”, International Journal of
Distributed Sensor Networks, 3: 347–369, 2007
[38] B.Karp, “Challenges in geographic routing: Sparse
networks, obstacles, and traffic provisioning”, May 2001.
[39] Y.J. Kim, R. Govindan, B. Karp, and S. Shenker “On
the pitfalls of geographic face routing”, In Proceedings of
DIAL-M-POMC 2005, pp. 34 – 43, 2005.
[40] J. Kim, R. Govindan, B. Karp, S. Shenker
“Geographic routing made practical”, In Proceedings of
NSDI 2005, pp. 217-–230, May 2005.
[41] A.Subramanyam, A.Ananda Rao, S.Prabhavathi
“Clustering Process For Maximizing Lifetime
Using Probabilistic Logic In WSN” published in
IEEE proceedings of Fifth International Conference
ICCNT-2014, IEEE Technical Activities, held at Hefie
China.
[42] A.Subramanyam, A.Ananda Rao, S.Prabhavathi
“Globular Topology of large Scale WSN for Efficient
Load Balancing Using Multiple sink Node” published in
IEEE proceedings of Fouth International
ConferenceICCNT-2013, IEEE Technical Activities USA,
held at VCEW, Tiruchengode
[43] E. Shakshuki, S.Hussain, A.R. Matin, A.W. Matin,
Routing Agent for Wireless Sensor Networks, Mobile
Adhoc and Sensor Systems (MASS), IEEE International
Conference on , vol., no., pp.645,649, 2006
[44] W.R. Heinzelman, A. Chandrakasan, and
H.Balakrishnan, “Energy-Efficient Communication
11. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 01 Pages: 2582-2592 (2015) ISSN: 0975-0290
2592
Protocol for Wireless Microsensor Networks”, IEEE
proceedings of the Hawaii International Conference on
System Sciences, 2000
[45] B.Jiang, B. Ravindran, and H.Cho, “Energy
Efficient Sleep Scheduling in Sensor Networks for
Multiple Target Tracking”, Proceedings of the 4th IEEE
international conference on Distributed Computing in
Sensor Systems, Pages 498 – 509, ACM, 2008
[46] Wireless Sensor Networks, Memsic, Powerful
Sensing Solutions, Retrieved, 15th,
2015
[47]A. Subramanyam, A.Ananda Rao, S. Prabhavathi
“Energy Efficient Dynamic Reconfiguration of Routing
Agent for WSN Data Aggregation” publication in
Springer proceedings of Third International Conference
on ERCICA 2015, held at NMIT, Bangalore, India.
S. S. Prabhavathi received her B.E
degree in Electronics &
Communication Engineering from
Gulbarga University, Karanataka,
India, her M.S degree in
Electronics & Control from BITS
Pillani, Rajasthan, and her M. Tech
degree in Computer Network Engineering from VTU
Belgaum University, Karnataka. She is now pursuing her PhD
degree at JNTU Ananthapur University, Andhra Pradesh. Her
research interests include wireless sensor networks, especially
the clustering techniques in wireless sensor networks. She is
currently working as Associate Professor in the Department of
Computer Science Engineering of Rao Bhadur Y
Mahabaleshwarappa Engineering College, Bellary,
Karnataka.
Dr. A. Subramanyam received
his Ph.D. degree in Computer Science
and Engineering from JNTU College
of Engineering, Anantapur. He
obtained his B.E. (ECE) from the
University of Madras and his M.
Tech.(CSE) from Visweswaraiah
Technological University. He has 18 years of experience in
teaching. He is currently working as Professor & HOD in the
Department of Computer Science and Engineering of
Annamacharya Institute of Technology & Sciences,
Rajampet, Y.S.R. Dist. A.P. He has presented and published
25 papers in international and national conferences and
journals. He is guiding a few PhDs. His research areas of
interest are parallel processing, computer networks, network
security, and data mining
Dr. Ananda Rao Akepogu received
his B. Tech degree in Computer Science
& Engineering from the University of
Hyderabad, Andhra Pradesh, India, and
his M. Tech degree in A.I & Robotics
from the University of Hyderabad,
Andhra Pradesh, India. He received his
PhD degree from the Indian Institute of
Technology Madras, Chennai, India. He is Professor of
Computer Science & Engineering Department and is
currently working as Director Academic & Planning in
Jawaharlal Nehru Technological University, Andhra
Pradesh, Anantapur, India. Dr. Rao has published more
than 100 papers in various national and international
journals/conferences. He received the Best Research Paper
award for the paper titled “An Approach to Test Case
Design for Cost Effective Software Testing” in an
International Conference on Software Engineering held at
Hong Kong, 18-20 March 2009. He also received the Best
Educationist Award for outstanding achievements in the
field of education from the International Institute of
Education & Management, New Delhi, on 21st Jan. 2012.
He was conferred the Bharat Vidya Shiromani Award by
the Indian Solidarity Council and the Rashtriya Vidya
Gaurav Gold Medal Award by the International Institute of
Education & Management, New Delhi on 19th March,
2012. His main research interests include software
engineering, networking and data mining.