A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
A Fast Convergence and Quick Route Updates Based Energy Aware Tree-Based Rout...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
A Fast Convergence and Quick Route Updates Based Energy Aware Tree-Based Rout...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
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.
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage ...CSCJournals
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
ON THE CELL BREATHING TECHNIQUE TO REDUCE CONGESTION APPLYING BANDWIDTH LIMIT...ijgca
In order to effectively analyze or evaluate the performance of Wireless Local Area Networks (WLANs), it is important to identify what types of network settings can cause bad performance in the network when analyzing poor network performance, there is an important factor which is responsible for poor performance is when a number of users may obtain a much larger share of the available bandwidth in access point in a limited boundary as provided in the concept of cell breathing technique. In this paper, we proposed a new concept in which we can set bandwidth limitation so that no user can access data more than the specified limit for a particular access point. In this way the different users will get an efficient access over the network.
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
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networksijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
Wireless networking has been an active research focus since the early days of the packet radio
network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent
developments in wireless devices have made laptop computers, personal digital assistants (PDA),
pagers, and cellular telephones portable. Now, users can carry these devices to any place at any
time. Hence, there is a need for a network that can be deployed at any place at any time without
any infrastructure support. In some cases, an infrastructure-based network is hard to build.
Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases,
infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados.
Hence, there is always a need for setting up a temporary network among a group of users without
any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks
(MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs
consist of a group of mobile nodes, which have limited battery and limited processing power.
MANETs are self-organizing and self-configuring networks and they can be deployed without any
infrastructure support. Numerous groundbreaking applications have been proposed based on
MANETs. These applications include disaster management, search and recovery, remote
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.12, No.2, April 2021
2
healthcare, tele-geoprocessing, education, traffic management, process control, and security [2].
These applications impose diversified design and performance constraints on the MANETs.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Performance Evaluation of Mini-sinks Mobility Using Multiple Paths in Wireles...CSCJournals
This paper presents a new approach based on the use of many data collectors, which we designate Mini-Sinks (MSs), instead of a single sink to collect the data in order to improve Wireless Sensor Network (WSN) performance. One or more MS are mobile and move according to a controlled arbitrary mobility model inside the sensor field in order to maintain a fully-connected network topology, collecting data within their coverage areas and forwarding it towards the single main sink. Energy Conserving Routing Protocol (ECRP), based on route diversity, is implemented in MSs and sensors in order to optimize the transmission cost of the forwarding scheme. A set of multiple routing paths between MSs and sensors is generated to distribute the global traffic over the entire network. Simulations were performed in order to validate the performance of our new approach. We compare the results obtained with those for a single static sink and mobile sink, and show that our approach can achieve better performances such as packet delivery ratio, throughput, end-to-end delay, network lifetime, residual energy, energy and routing diversity overhead.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
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.
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage ...CSCJournals
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
ON THE CELL BREATHING TECHNIQUE TO REDUCE CONGESTION APPLYING BANDWIDTH LIMIT...ijgca
In order to effectively analyze or evaluate the performance of Wireless Local Area Networks (WLANs), it is important to identify what types of network settings can cause bad performance in the network when analyzing poor network performance, there is an important factor which is responsible for poor performance is when a number of users may obtain a much larger share of the available bandwidth in access point in a limited boundary as provided in the concept of cell breathing technique. In this paper, we proposed a new concept in which we can set bandwidth limitation so that no user can access data more than the specified limit for a particular access point. In this way the different users will get an efficient access over the network.
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
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networksijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
Wireless networking has been an active research focus since the early days of the packet radio
network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent
developments in wireless devices have made laptop computers, personal digital assistants (PDA),
pagers, and cellular telephones portable. Now, users can carry these devices to any place at any
time. Hence, there is a need for a network that can be deployed at any place at any time without
any infrastructure support. In some cases, an infrastructure-based network is hard to build.
Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases,
infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados.
Hence, there is always a need for setting up a temporary network among a group of users without
any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks
(MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs
consist of a group of mobile nodes, which have limited battery and limited processing power.
MANETs are self-organizing and self-configuring networks and they can be deployed without any
infrastructure support. Numerous groundbreaking applications have been proposed based on
MANETs. These applications include disaster management, search and recovery, remote
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.12, No.2, April 2021
2
healthcare, tele-geoprocessing, education, traffic management, process control, and security [2].
These applications impose diversified design and performance constraints on the MANETs.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Performance Evaluation of Mini-sinks Mobility Using Multiple Paths in Wireles...CSCJournals
This paper presents a new approach based on the use of many data collectors, which we designate Mini-Sinks (MSs), instead of a single sink to collect the data in order to improve Wireless Sensor Network (WSN) performance. One or more MS are mobile and move according to a controlled arbitrary mobility model inside the sensor field in order to maintain a fully-connected network topology, collecting data within their coverage areas and forwarding it towards the single main sink. Energy Conserving Routing Protocol (ECRP), based on route diversity, is implemented in MSs and sensors in order to optimize the transmission cost of the forwarding scheme. A set of multiple routing paths between MSs and sensors is generated to distribute the global traffic over the entire network. Simulations were performed in order to validate the performance of our new approach. We compare the results obtained with those for a single static sink and mobile sink, and show that our approach can achieve better performances such as packet delivery ratio, throughput, end-to-end delay, network lifetime, residual energy, energy and routing diversity overhead.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Similar to A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID APPROACH (20)
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID APPROACH
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
DOI : 10.5121/ijasuc.2010.1101 1
A FASTER ROUTING SCHEME FOR
STATIONARY WIRELESS SENSOR NETWORKS -
A HYBRID APPROACH
Jasmine Norman1
, J.Paulraj Joseph2
and P.Prapoorna Roja3
1
Measi Institute of Information Technology, Chennai – 14, India
ddjnorman@yahoo.com
2
Manonmaniam Sundaranar University, Tirunelveli-12, India
3
Jerusalem College of Engineering, Chennai – 100, India
ABSTRACT
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
KEYWORDS
Sensor network, Routing, Energy, Load Balance, Hop
1. INTRODUCTION
A wireless sensor network (WSN) consists of spatially distributed autonomous sensors to
cooperatively monitor physical or environmental conditions, such as temperature, sound,
vibration, pressure, motion or pollutants. The emergence of wireless sensor networks has enabled
new classes of applications that benefit a large number of fields. In [1] Joseph Polastre et al have
identified the need for using WSN for habitat and environmental monitoring. The challenges in
the hierarchy of: detecting the relevant quantities, monitoring and collecting the data, assessing
and evaluating the information, formulating meaningful user displays, and performing decision-
making and alarm functions are enormous as suggested by F.L.Lewis [2]. Unique characteristics
of a WSN include limited power, ability to withstand harsh environmental conditions, ability to
cope with node failures, mobility of nodes, dynamic network topology, communication failures,
heterogeneity of nodes, large scale of deployment and unattended operation.
Many to one communication paradigm is widely used in regard to sensor networks since sensor
nodes send their data to a common sink for processing. This many-to-one paradigm also results in
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
2
non-uniform energy drainage in the network. Sensor networks can be divided in two classes as
event driven and continuous dissemination networks according to the periodicity of
communication. In event-driven networks, data is sent whenever an event occurs. In continuous
dissemination networks, every node periodically sends data to the sink. Routing protocols are
usually implemented to support one class of network in order to save energy.
The challenges of WSN have been studied by Yao K [3]. The key challenge in wireless sensor
networks is maximizing network lifetime.The appropriate communication mode will significantly
reduce energy consumption of communication and prolong networks lifetime. Therefore, many
researchers are currently focusing on the design of power-aware protocols for wireless sensor
networks. Regardless of communication protocol, researchers must choose communication mode:
single hop or multi hop. Using a single hop communication mode, each sensor sends its data
directly to the base station. In multi hop mode, each node sends its data destined ultimately for
the base station through intermediate nodes. Now multi hop communication enjoys more
researches’ favor. In [13], Bhardwaj et al. have studied a multi hop sensor network; they
minimized the energy spent on sending a packet by using optimum number of relay nodes.
Bandyopadhyay et al. [14] have studied a multi hop clustered wireless sensor network. [8,11]
give a comparative study of multihop routing protocols. The reason many researches choose
multi hop mode lies in that it is expected to consume less power than the single hop
communication, but that is not always correct. In most wireless sensor networks nodes are static,
using multi hop mode, nodes closest to the base station have a highest load of relaying packets as
compared to other nodes, just as the nodes located farthest away from the base station have the
highest energy burden due to long range communication in single hop mode. These key nodes
will quickly drain the battery and result in invalidation of the whole system, although other nodes
have enough energy. It is evident from [20] that multi hop communication is not always the best
mode.
Monitoring the environment is one of the main applications of wireless sensor networks. Given
that these networks are densely populated and that local variations in the environmental variables
are small, a large amount of redundant data is generated by sensor nodes. The time delay in
receiving information in the base station end is very critical to the better functioning of the
network. When an event occurs all the sensors in the region will sense and start transmission of
data. The base station will receive the same data from a number of sensors. Also transmission
energy is greater than the processing energy. Thus energy is wasted to transmit redundant
information to the base station. So there is a trade off between time and reliability and in WSN
reliability can be compromised as redundancy.
Most of the protocols suggested are based on energy conservation. The redundancy of
information from the sensors is not taken into consideration. Again most of the protocols assume
multi hop paths. Single hop networks also proved to be energy efficient. Thus there is a need to
approach the problem in a balanced way. This paper argues the energy savings due to single hop
and presents an efficient algorithm to use the hybrid structure.
2. RELATED WORK
Sensor networks introduce new challenges that need to be dealt with as a result of their special
characteristics. Their new requirements need optimized solutions at all layers of the protocol
stack in an attempt to optimize the use of their scarce resources. In particular, the routing
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
3
problem, has received a great deal of interest from the research community with a great number
of proposals being made. Basically these protocols can be fit in one of two major categories: on-
demand such as AODV [4] and DSR [5], and proactive such as DSDV [6] and OLSR [7]. The
review and performance comparison of these protocols are in [8,9,10.11]. Directed diffusion [15]
is a good candidate for robust multi hop multipath routing and delivery. The common belief is
that a multi-hop configuration with rather small per-hop distance is the only viable energy
efficient option for wireless sensor networks.
Cellular networks, WiFi and many other single hop networks have used single hop structures not
for energy considerations, but for other reasons: infrastructure constraints, simpler network
management and the other benefits of a single hop structure enumerated in the previous section.
There also exist designs developed for single hop sensor networks [19,21,22]. These work choose
a single hop network not because of its energy efficiency, but because it is a less complicated
network.
Location-based algorithms [16,17,18] rely on the use of nodes position information to find and
forward data towards a destination in a specific network region. Position information is usually
obtained from GPS (Global Positioning System) equipment. They usually enable the best route to
be selected, reduce energy consumption and optimize the whole network. In [18] Ye Ming Luz et
al have proposed location based energy efficient protocol. Na Wang et al in [9] have studied the
performance of the geographic based protocols.
It is proved in [20] that the single hop cost less communication energy than multi-hop when
amount of sensor nodes and communication radius is little and multi-hop mode is more effective
unless amount of sensor nodes and communication radius is very small when value of
propagation loss exponent becomes larger. When a realistic radio model is applied for a sensor
network, it was discovered that with feasible transmission distances single-hop communications
can be more efficient than multi-hop in the energy perspective.In [19] Lizhi Charlie Zhong et al
discuss a single hop configuration, utilizing the asymmetry between lightweight sensor nodes and
a more powerful "base station" and demonstrate that such a single hop configuration can actually
have lower overall power consumption than a multi-hop counterpart.
Existing wireless sensor routing protocols commonly use minimum hop count as metric to find
routes, and under two assumptions: a link which is good for route discovery messages is still
good for data packets; secondly, the link quality is binary: either very good or very bad. Protocols
such as DSR [5] and AODV [4] use broadcast messages to find the shortest paths, when the node
receives the route reply, it will use this route to transmit data. Thus in additions to the data
packets, a lot of control packets are generated adding to the traffic congestion, which will have an
effect on the delivered time to the base station. This could prove to be very costly. This paper
proposes a model based on location which takes into account load distribution, energy and
redundancy as the main parameters, and maximizes the network lifetime with faster delivery
time.
3. SYSTEM MODEL
The network is assumed to be static and fairly distributed with a single base station. All the nodes
are assumed to know their location as well as destination’s location. The model proposed is used
for making a decision on which neighbour a sensor node should forward the data message to in
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
4
case if it is not able to deliver the message straight to the base station. There are two phases in the
proposed model.
3.1 Initial Configuration Phase
After deployment each sensor sends its location to the base station. The base station prepares the
neighbour hood table of each sensor and forwards. The neighbour discovery process is location
oriented. Each node must have a minimum specified number of neighbours. The region is divided
into vertical areas. If the location of the node is (x,y) all nodes within the range x+i ,y+j are its
neighbours where i <= M (a specific integer) and j <= N , any number. Since all the nodes are
assigned neighbours, all the sensors equally participate in the transmission.
3.2 Transmission / Receive Phase
When a node senses an event , it compares the residual energy (r) and the threshold energy (tr)
levels. If r < tr, then the node has no more energy to take any transmission job and it goes off to
sleep. If the node has sufficient energy, it checks the data buffer for an equivalent entry. If a
match is not found, it measures the strength of the received signal. If it finds one, the packet will
be discarded. The node calculates the feasibility of a single hop transmission taking into account
SNR and location of the destination. If feasible, it sends the data directly to the destination.
Otherwise the node computes the best neighbor and forwards data. The best neighbour is
computed based on SNR, Residual energy level, use count and the location. The farthest location
node in the vertical region towards the destination will be examined first.
The same process will be repeated till the packet reaches the destination. After transmission, the
nodes that were involved in the transmission send their residual energy to the base station so that
they can update their routing table. Periodically the neighbourhood table is updated by the base
station leaving the dead nodes. There are no control packets overhead in this model as against
AODV[4] and DSR[5]. This model suppresses redundant data packets but there is no data
aggregation as in Directed Diffusion [15] which will consume more energy. [18] proposes an
energy efficient location oriented protocol but does not take care of load balancing and redundant
data suppression.
Figure 1: Path Selected for sample nodes
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
5
3.3 Neighbourhood Table Computation
Assume the sensors are fairly distributed. Each sensor node sends the location and the residual
energy to the base station. The base station computes the neighbours for each sensor by using the
location. A sample format of the location table and neighbourhood table are given below. Each
sensor has a unique ID. In the neighbour table the first column represents the sensor ID and the
rest are the best neighbours computed based on the location towards the destination. 0 in the best
neighbour column indicates that the node is positioned close to the base station. The neighbours
are arranged in the order of closer proximity to the base station.
Location Table
0 , 58 , 258
1 , 160 , 275
2 , 163 , 192
3 , 216 , 202
4 , 205 , 166
5 , 167 , 227
Neighbour Table
0 0 0 0
1 67 66 50
2 5 69 43
3 5 70 33
4 3 39 37
5 0 0 0
3.4 Best Neighbour Algorithm
This is based on residual energy level of the neighbour, signal strength, usage count and the
location.
1. Pick the first neighbour with the least use count
2. If (residual energy level > threshold )
3. If (SNR is high) Forward the data
Else Repeat the process eliminating the current node explored.
4. ADVANTAGES OF THE SYSTEM
Faster Delivery Time - If the SNR is high , the delay in multi hop can be avoided. No control
packets are used.
Energy Efficient - Utilizing the best of single hop and multi hop
Collision Management - When a channel is busy the source wishes to transmit chooses the next
best neighbour and transfers the data. If two nodes choose the same neighbour, depending on
signal strength (SNR) the node picks one and discards the other.
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
6
Congestion Control - Only mutually exclusive paths are explored. An already visited node will
not be included in the path. It speeds up the entire process avoiding congestion in one route.
Load Balancing - Whichever node that senses an event can initiate the transmission and it can
use only its neighbours with least use count to forward the data. Thus without draining the
already used nodes, network life time can be extended.
Fault Tolerant - After a specific period of transmission the base station computes the
neighbourhood table for each sensor upon receiving the energy level from the nodes. The dead
nodes will be eliminated from the network.
QOS – It is guaranteed to deliver data to the destination quickly.
5. PERFORMANCE ANALYSIS
We simulate this protocol on GloMoSim, [23, 24] a scalable discrete-event simulator developed
by UCLA. This software provides a high fidelity simulation for wireless communication with
detailed propagation, radio and MAC layers. We compare the routing protocol named as HYB
with two popular sensor networks routing protocols – AODV and DSR
5.1 Simulation Model
The GloMoSim library [24] is used for protocol development in sensor networks. The library is a
scalable simulation environment for wireless network systems using the parallel discrete event
simulation language PARSEC. The distributed coordination function (DCF) of IEEE 802.11 is
used as the MAC layer in our experiments. It uses Request-To-Send (RTS) and Clear-To-Send
(CTS) control packets to provide virtual carrier sensing for unicast data packets to overcome the
well-known hidden terminal problem.
There are some initial values used in the simulation. Intel Research Berkeley Sensor Network
Data and WiFi CMU data from Select Lab [25] are used to get the positions for the nodes. The
experiment is repeated for varying number of nodes. CBR traffic is assumed in the model. The
new protocol is written in Parsec and hooked to GloMoSim. All the three protocols are simulated
in GloMoSim to enable comparisons among them. When a packet is generated, the corresponding
routing algorithm is invoked.
5.2 Performance Metrics
For the evaluation of protocols the following metrics have been chosen. Each metric is evaluated
as a function of the topology size, the number of nodes deployed, and the data load of the
network.
Execution Time : It is the total time taken by the various protocols for the given CBR traffic to
complete within the simulation time. This does not guarantee the reliability of data packets
generated. The faster protocol may have less execution time but it may not guarantee the delivery
of all the generated packets.
Hop Count : The number of hops used by the protocol to reach the destination.
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
7
Collision : The number of collisions occurred while delivering the packet. This is an indication of
congestion in the traffic.
Table 1. Assumed Parameters
Parameters Value
Transmission range 250 m
Simulation Time 5M
Topology Siz 2000m x 2000m
Number of sensors 25, 50.75
Number of sinks 1
Mobility None
Traffic type Constant bit rate
Packet rate 8 packets/s
Packet size 512 bytes
Radio Type Standard
Packet Reception SNR
Radio range 350m
MAC layer IEEE 802.11
Bandwidth 2Mb/s
Node Placement Node File
Initial energy in batteries 10 Joules
Signal Strength Threshold -80 dbm
Energy Threshold 0.001mJ
5.3 Simulation Results
Figure 2 shows the execution time of three protocols for different sets of nodes and traffic. The
execution time increases as the traffic increases. Due to control packets overhead in route
discovery and maintenance AODV and DSR have high execution time as against the proposed
protocol. But the proposed protocol does not guarantee the delivery of all the packets generated.
This is based on the assumption that at a particular time the nodes sense the same data and
transmit. So it is not necessary for the base station to receive all the redundant information. The
data get suppressed in the intermediate nodes due to redundancy and bad link quality. Also if
there is congestion the data packet will simply be discarded after waiting for a specific time ‘t’.
The nodes once rejected the packet never try to retransmit after a specified time as in AODV.
Figure 2. Execution Time
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
8
Figure 3 shows the average hop count where the proposed model has the lowest and AODV has
the highest. If the link quality is good then direct transmission is possible. In this case the hop
count will be equal to 0. The average hop count will always be less than or equal to the other
models as it chooses the best neighbour at each cycle.
Figure 3. Average Hopcount
Figure 4 is an indication of congestion control in the various protocols. The more number of
collisions indicate high traffic in a particular region. The redundancy suppression and SNR factor
manage the congestion efficiently than AODV and DSR. Also retransmission is not suggested in
the proposed model to manage the traffic efficiently.
Figure 4. Number of Collisions
For maximizing the network lifetime energy conservation is important. Figure 5 shows the total
number of signals transmitted for a given traffic The proposed model has transmitted less number
of signals and therefore consumed less energy compared to the other protocols.
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
9
Figure 5. Transmission of Signals
6. CONCLUSION
Latency time is critical to the functioning of the environmental monitoring sensor networks. Also
energy resource limitations are of priority concern in sensor networks. Distributing the load to the
nodes significantly impacts the network life time. In this paper a faster energy efficient load
balancing protocol for routing is proposed. It does fairly well compared to popular protocols DSR
and AODV when simulated in GloMoSim environment. The proposed model has less time delay,
more energy and better distributed work mode. This can be very effective for detecting
environmental changes where sensors have a fixed location. The limitation in this protocol is that
it does not guarantee the delivery of all the packets generated as retransmission is not supported.
So there is a very small probability of missing relevant data. Our next step is to consider a faster
mobile sensor network based on location and data aggregation.
REFERENCES
[1] J. Polastre, R. Szewcyk, A. Mainwaring, D. Culler, J. Anderson, (2004) , "Analysis of Wireless Sensor
Networks for Habitat Monitoring in Wireless Sensor Networks” , Kluwer Academic Publishers (NY), pp.
399-423.
[2] F. L. LEWIS (2004) “Wireless Sensor Networks” , Smart Environments: Technologies, Protocols, and
Applications , ed. D.J. Cook and S.K. Das, John Wiley
[3] YAO Kung , (2006) , “Sensor Networking: Concepts, Applications, and Challenges”, ACTA Automatica
Sinica , Vol. 32, No. 6
[4] C. E. Perkins, E. M. Royer, and S. R. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing” ,
IETF Mobile Ad Hoc Networks Working Group, IETF RFC 3561
[5] D. B. Johnson, D. A. Maltz, and Y-C Hu., (2003), “ The Dynamic Source Routing Protocol for Mobile Ad
Hoc Networks (DSR)” , IETF Mobile Ad Hoc Networks Working Group, Internet Draft
[6] C. E. Perkins and P. Bhagwat, (1994) , “Highly dynamic destination-sequenced distance-vector routing
(DSDV) for mobile computers” . In Proceedings of the ACM Special Interest Group on Data
Communications (SIGCOMM), pp 234-244
[7] T. Clausen, Ed., P. Jacquet, “ Optimized Link State Routing Protocol (OLSR) “ , Network Working Group,
Request for Comments: 3626
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing ( IJASUC ), Volume 1, Number 1, March 2010
10
[8] Bharat Kumar Addagada, Vineeth Kisara and Kiran Desai , (2009) , “A Survey: Routing Metrics for
Wireless Mesh Networks”
[9] Na Wang and Chorng Hwa Chang (2009) “Performance analysis of probabilistic multi-path geographic
routing in wireless sensor networks” , International Journal of Communication Networks and Distributed
Systems , Vol 2 , pp 16 – 39
[10] A. H. Azni, Madihah Mohd Saudi, Azreen Azman, and Ariff Syah Johari D (2009) , “Performance
Analysis of Routing Protocol for WSN Using Data Centric Approach” , World Academy of Science,
Engineering and Technology 53
[11] Jamal N. Al-Karaki Ahmed E. Kamal , (2004) , “Routing Techniques in Wireless Sensor Networks: A
Survey”
[12] S. Das, R. Castaneda, and J. Yan, (2000) "Simulation-Based Performance Evaluation of Routing Protocols
for Mobile Ad Hoc Networks," Mobile Networks and Applications, Vol. 5, No.3, pp 179-189
[13] Bhardwaj M, Garnett T and Chandrakasan A P (2001), “ Upper bounds on lifetime of sensor networks” ,
IEEE International Conference on Communications (Helsinki) pp 785-790
[14] Bandyopadhyay S and Coyle E (2003) “ An energy efficient hierarchical clustering algorithm for wireless
sensor networks” , IEEE Infocom 1713-23
[15] C. Intanagonwiwat, R. Govindan, and Estrin, (2000) “Directed diffusion: A scalable and robust
communication paradigm for sensor networks,” in Proc. of ACM MobiCom’00, Boston, MA, USA, pp.
56–67
[16] Author:Zheng Kai, Tong Libiao, Lu Wenjun, (2009) , “Location-Based Routing Algorithms for Wireless
Sensor Network “ , ZTE Communications
[17] Nicklas Beijar, “Zone Routing Protocol (ZRP)” , CiteSeer
[18] Khalid Kaabneh, Azmi Halasa and Hussein Al-Bahadili , (2009) , “An Effective Location-Based Power
Conservation Scheme for Mobile Ad Hoc Networks” , American Journal of Applied Sciences 6 (9) , pp
1708-1713
[19] Lizhi Charlie Zhong , Jan M. Rabaey, Adam Wolisz , (2005) “Does Proper Coding Make Single Hop
Wireless Sensor Networks Reality: The Power Consumption Perspective “ , Proc. Of IEEE Wireless
Comm. and Networking Conf
[20] J F Shi, X X Zhong and S Chen (2006) “Study on Communication Mode of Wireless Sensor Networks
Based on Effective Result“ , Journal of Physics: Conference Series 48 1317–1321
[21] S. Saha and P. Bajcsy, (2003) “System design issues in single-hop wireless sensor networks”, Proc. of 2nd
IASTED ICCIIT , Scottsdale, Arizona
[22] M. Singh and V.K. Prasanna, (2003) “Optimal energy-balanced algorithm for selection in a single-hop
sensor network”, IEEE international workshop on SNPA ICC
[23] M. Takai, L. Bajaj, R, Ahuja, R. Bagrodia and M. Gerla. (1999) , “GloMoSim: A Scalable Network
Simulation Environment”, Technical report 990027, UCLA
[24] Jorge Nuevo , “A Comprehensible GloMoSim Tutorial “
[25] http://www.select.cs.cmu.edu/data/index.html