The document summarizes research on geographic routing and relay selection in wireless sensor networks. It discusses how geographic routing uses location information to route packets towards a destination but faces challenges around connectivity holes and optimal relay selection. The document reviews several existing approaches and their limitations. It then describes an alternative method called ALBA-R that was proposed to more efficiently route around holes while enhancing relay selection to maximize node lifetime. Simulation results showed ALBA-R outperformed other methods with respect to metrics like overhead and end-to-end delay.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
The Expansion of 3D wireless sensor network Bumps localizationIJERA Editor
Bump localization of wireless sensor network is a hot topic, but present algorithms of 3D wireless sensor node localization arenot accurate enough. In this paper, the DR-MDS algorithm is proposed, DR-MDS algorithm mainly calibrates the coordinatesof nodes and the ranging of nodes based on multidimensional scaling, it calculates the distance between any nodes exactlyaccording to the hexahedral measurement, introducing a modification factor to calibrate the measuring distance by ReceivedSignal Strength Indicator (RSSI). Results of simulation show that DR-MDS algorithm has significant improvement inlocalization accuracy compare with MDS-MAP algorithm.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
The Expansion of 3D wireless sensor network Bumps localizationIJERA Editor
Bump localization of wireless sensor network is a hot topic, but present algorithms of 3D wireless sensor node localization arenot accurate enough. In this paper, the DR-MDS algorithm is proposed, DR-MDS algorithm mainly calibrates the coordinatesof nodes and the ranging of nodes based on multidimensional scaling, it calculates the distance between any nodes exactlyaccording to the hexahedral measurement, introducing a modification factor to calibrate the measuring distance by ReceivedSignal Strength Indicator (RSSI). Results of simulation show that DR-MDS algorithm has significant improvement inlocalization accuracy compare with MDS-MAP algorithm.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Security based Clock Synchronization technique in Wireless Sensor Network for...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.
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
Flbra fuzzy logic based routing algorithm for indoor wireless sensor networksijcsit
Considering the context of building management systems with wireless sensor networks monitoring
environmental features, this paper presents a proposal of a Fuzzy Logic Based Routing Algorithm (FLBRA)
to determine the cost of each link and the identification of the best routes for packet forwarding. We
describe the parameters (Received Signal Strength Indicator - RSSI, Standard Deviation of the RSSI and
Packet Error Rate - PER) for the cost definition of each path, the sequence of identifying best routes and
the results obtained in simulation. As expected in this proposal, the simulation results showed an increase
in the packet delivery rate compared to RSSI-based forward protocol (RBF).
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
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.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Security based Clock Synchronization technique in Wireless Sensor Network for...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.
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
Flbra fuzzy logic based routing algorithm for indoor wireless sensor networksijcsit
Considering the context of building management systems with wireless sensor networks monitoring
environmental features, this paper presents a proposal of a Fuzzy Logic Based Routing Algorithm (FLBRA)
to determine the cost of each link and the identification of the best routes for packet forwarding. We
describe the parameters (Received Signal Strength Indicator - RSSI, Standard Deviation of the RSSI and
Packet Error Rate - PER) for the cost definition of each path, the sequence of identifying best routes and
the results obtained in simulation. As expected in this proposal, the simulation results showed an increase
in the packet delivery rate compared to RSSI-based forward protocol (RBF).
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
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
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
Efficient Destination Discovery using Geographical Gossiping in MANETsidescitation
Due to dynamic topology of Mobile ad hoc networks (MANETS), early designs of
routing protocols incur a large number of discovery packets while trying to discover a route
to a destination node in the network. To reduce the number of discovery packets,
geographical information assisted routing protocols came into picture. In case of
geographical ad hoc routing protocols, there is no need to discover a route to a destination
node. But, they need to discover the fresh location of a destination node to deliver data
packets to the destination location. Geographical information assisted ad hoc routing
protocols reduce discovery packet overhead using past information about the destination
node such as location, velocity and direction of motion. When a source node does not have
any information about a destination node, the existing geographical routing protocols use
flooding techniques or location database server to know the present location of the
destination. A flooding technique or a location database server induces large number of
control packets in the network. To reduce the number of control packets during location
discovery, we propose a novel geographical gossiping technique for MANETs. The
technique basically uses two types of gossiping viz. selective and random gossiping. We have
evaluated the performance of the proposed technique using qualnet simulator and
compared its performance with flooding technique and probability based gossiping
technique. The simulation results clearly show that our technique has considerably reduced
control packet overhead compared to flooding and probability based gossiping technique.
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.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Virtual Position based Olsr Protocol for Wireless Sensor Networksijcnes
In wireless sensor networks usually taken in routing void problem in geographical routing in high control overhead and transmission delay .The routing void protocol is proposed in this paper is efficient bypassing void routing protocol. This protocol based on virtual co-ordinates is to transform a structure of random process in virtual circle .The circle are composed by void edge in to by mapping of edge nodes. In this paper to used the greedy forwarding algorithm. This algorithm can be process on virtual circle. The virtual circle greedy forwarding failing on routing void process. There are forwarding process are source to destination. The proposed protocol as find the shortest path, long transmission and High quality link maintenance.
GPS-less Localization Protocol for Underwater Acoustic NetworksCSCJournals
The problem of underwater positioning is increasingly crucial due to the emerging importance of sub-sea activities. Knowledge of node location is essential for many applications for which sensor networks can be used. At the surface, positioning problems have been resolved by the extended use of GPS, which is straightforward and effective. Unfortunately, using GPS in the sub-sea environment is impossible and positioning requires the use of special systems. One of the major challenges in the underwater acoustic networks (UANs) area of research is the development of a networking protocol that can cope with the management of a dynamic sub-sea network. We propose a scheme to perform node discovery, using only one seed node (primary seed) in a known position. The discovery protocol can be divided into two parts: First, building up the relative co-ordinate system. Second, involving more remote nodes becoming seed nodes for further discoveries. Four different algorithms have been investigated; (i) Farthest/Farthest Algorithm, (ii) Farthest/Nearest Algorithm, (iii) Nearest/Farthest Algorithm and (iv) Nearest/Nearest Algorithm. We investigated the performances of random and fixed (grid) network topologies. Different locations of primary seed node were exercised and statistics for node discovery will be reported.
Back-Bone Assisted HOP Greedy Routing for VANETijsrd.com
Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc., currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...ssuser7dcef0
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
ACRP 4-09 Risk Assessment Method to Support Modification of Airfield Separat...
Iaetsd a survey on geographic routing relay selection in
1. A Survey on Geographic Routing Relay Selection in
Wireless Sensor Network
Santosh Kumar K1
, Dr.N.Duraipandian2
1. PG Scholar, Department of Computer Science and Engineering, Velammal Engineering College, Chennai, Tamilnadu, India.
2. Professor, Department of Computer Science and Engineering, Velammal Engineering College, Chennai, Tamilnadu, India.
Email: santhosh2567@gmail.com1
, emailpandiandurai@gmail.com2
ABSTRACT: Geographic routing (or
position-based routing) is the technique
which employs position information of nodes
while routing from the source to the sink.
Geographic routing has been considered as a
simple, effective and scalable routing
protocol for designing a variety of
applications ranging from mobility
prediction, management of nodes and
metrics such as hop count, power, relay
selection, energy consuming, delay, etc. Most
geographic routing algorithms use a greedy
strategy for selecting the neighbor closest to
the sink as a next hop. However, greedy
forwarding fails in reaching a node that is
closer to the sink than all its neighbors and
so planar graph routing is adopted which
guides the packet with guarantees delivery.
Geographic routing algorithms exploit
location information but the problem exist is
convergecasting around connectivity holes
and relay selection of each node. For
resolving these issues, an alternative method
termed ALBA_R was proposed along with
enhanced relay selection mechanism in order
to maximum the lifetime of a node.
I. INTRODUCTION
A Wireless Sensor Networks (WSN) has been
emerged as a promising area for research and
scientific advancement. WSNs are greatly
applied in many application domains such as
surveillance, environmental monitoring,
vehicular applications, defense applications,
traffic systems, medical monitoring, precision
agriculture, etc. WSN consist of nodes with
sensing (measuring), computing, and wireless
communications capabilities. Technology
upgradation in WSN is the result of integration
of sensor, transceiver, memory and
microcontroller technologies on single unit
called sensor node. The Sensor Node, a basic
element of WSN capable of observing(sensing)
physical capabilities, process the monitored and
received information and communicate the
observed or processed information to the nearby
sensor nodes to form a network of sensor nodes.
Fig.1 components of a sensor node
Many sensor nodes are randomly distributed
over larger distance and each sensor node
having data content were gathered in the sink.
Through internet everyone can view the
collected data in the network. As shown in
Fig.1, it consists of three major components
namely Sensing unit, processing unit, and
Transmission unit. They include some
additional components like position finding
system, power supply and a mobilizer. Sensing
unit composed of two subunits such as Sensors
and Analog-to-Digital Converters (ADCs).The
analog signals are measured by the sensors are
digitized through an ADC and in turn fed into
the processing unit (storage unit and a
processor). The processor and its associated
memory commonly RAM is used to manage the
procedures that make the sensor node carry out
its assigned sensing and collaboration tasks. In
Transmission unit, the transceiver connects the
node with the network and serves as the
communication medium of the node. The power
supply/battery is the most important component
of the sensor node because it implicitly
determines the lifetime of the entire network.
Proceedings International Conference On Advances In Engineering And Technology
ISBN NO: 978 - 1503304048
www.iaetsd.in
International Association of Engineering & Technology for Skill Development
11
2. A major evolution in communication
technology has been the introduction of the
Global Positioning System (GPS) which
provides the location information and universal
timing of a node. The recent development of a
wireless sensor network has led to an innovative
use of small sensory nodes which operate with a
very low power in extreme environmental
conditions. A group of small sensory nodes are
randomly deployed in a sensor field. These
nodes have the ability to organize themselves
automatically and to detect the data content
accurately.
II. LITERATURE REVIEW
A New Contention-Based MAC Protocol for
Geographic Forwarding in Ad Hoc and
Sensor Networks [1]:
Michele Zorzi referred that Geographic
Random Forwarding (GeRaF) is based on the
assumption that sensor nodes have a means to
determine their location information, and that
the positions of the final destination and of the
transmitting node are explicitly included in each
message. GeRaF is designed to integrate MAC
message exchanges and the designation of the
most convenient relay (from a geographic point
of view). Thanks to awake/sleep cycles and to
this cross–layer design, it is very energy–
efficient. Moreover, it is simple and easy to
implement on real nodes. However, it has some
drawbacks, e.g., it cannot route around
connectivity holes, and thus may not be able to
deliver all messages in sparse networks
(because of the physical absence of nodes).
Also, it is not able to operate in dense traffic
scenario (when congestion builds up).
On the Effect of Localization Errors on
Geographic Face Routing in Sensor
Networks [2]:
The reason for geographic routing protocols
does not need to maintain per destination
information and only neighbor location
information is needed to route packets.
Geographic routing protocols are very attractive
choices for routing in sensor networks. Most
geographic routing protocols use greedy
forwarding for basic operations. Greedy
forwarding is based on next forwarding hop is
chosen to minimize the distance of the
destination. It fails in dead-ends. Most
geographic routing protocols use greedy
forwarding for basic operations. In order to
provide correct routing in the presence of dead
ends, face routing has been introduced. GPSR is
a geographic routing protocol for wireless
networks that combines greedy forwarding and
face routing. GPSR uses geographic hash table
(GHT) system that hashes keys into geographic
location and stores the key-value pair at the
sensor node closest to the hash of its key.GHT
uses mainly for geographic routing to the hash
location. The applications are data centric
storage and distributed indexing.
Locating and Bypassing Holes in Sensor
Networks [3]:
In routing, connectivity holes cause difficulties
in organizing the networks. Holes define the
“hot spots” regions created by traffic congestion
and sensor power shortage. A commonly used
assumption in studying sensor networks is that
sensors are uniformly densely distributed in the
plane. However in system deployment, this
assumption does not hold in general. Even if
sensors nodes are distributed randomly, there
are still regions with sensor density much lower
than others. In practice, sensor networks usually
have holes, i.e. regions without enough working
sensors. An example of a large number of dead
sensor nodes it creates a big hole in the
network. A packet is forwarded to a 1-hop
neighbor who is closer to the destination than
the current sensor node. This process is repeated
until the packet data reaches the destination, or
the packet is stuck at a node when there is no
neighbor to reach the destination. Here, holes
define to be simple regions enclosed by a
polygon cycle which contains all the nodes
where local minima can appear. The
information storage and Memory requirement
are based on boundary node. The applications
are avoiding network hot spots, supporting path
migration. The applications are avoiding
network hot spots, supporting path migration,
information storage mechanisms. It can able to
handle node failures, information storage and
memory requirement. It uses TENT rule and
BOUNDHOLE techniques to identify and build
around holes. TENT rule requires each node to
know its 1-hop neighbors locations. To help
packets get out of stuck nodes, BOUNDHOLE
to find the boundary of the hole.
Proceedings International Conference On Advances In Engineering And Technology
ISBN NO: 978 - 1503304048
www.iaetsd.in
International Association of Engineering & Technology for Skill Development
12
3. Efficient Non-Planar Routing around Dead
Ends in Sparse Topologies Using Random
Forwarding [4]:
Geographic forwarding in wireless sensor
networks (WSN) has long suffered from the
problem of bypassing "dead ends," i.e., those
areas in the network where no node can be
found in the direction of the data collection
point (the sink). However previous scheme
resolve these problems that rely on geometric
techniques leading to the planarization of the
network topology graph. In this paper, a
alternative method to planarization is proposed,
termed ALBA-R, which successfully routes
packets to the sink transparently to dead ends.
ALBA-R combines scheduling of awake or
asleep nodes, channel access and geographic.
By enhancing geographic routing along dead-
ends with a mechanism that is capable of
routing packets around connectivity holes.
Through simulations results, it demonstrates
that ALBA-R can provide insignificant
overhead, and outperforms similar solutions
with respect to all the metrics of interest
investigated, especially specifying the
benchmark for geographic routing protocols..
Localization Error-Resilient Geographic
Routing for Wireless Sensor Networks [5]:
This paper concerns the demonstration of the
resilience to localization errors of ALBA-R, a
protocol for geographic routing in wireless
sensor networks (WSNs). In particular, it shows
that a simple effective nodal coloring
mechanism for handling nodal connectivity
holes, ALBA-R achieves the further desirable
benefit of being totally resilient to localization
errors, which are unavoidable in WSNs.
Through ns2-based simulations it explains that
fundamental network parameters such as
network density, and also independently of
errors in nodal coordinate estimations as high as
the node transmission radius, ALBA-R is
successful in delivering all generated packets
while incurring reasonable degradation for
metrics such as route-length and end-to-end
latency and still remaining and energy efficient
protocol.
ALBA-R: Load-Balancing Geographic
Routing Around Connectivity Holes in
Wireless Sensor Networks [7]:
ALBA-R features the cross-layer integration of
geographic routing with contention-based MAC
for relay selection and load balancing (ALBA),
as well as a mechanism to detect and route
around connectivity holes (Rainbow). ALBA
and Rainbow (ALBA-R) together solve the
problem of routing around a dead end without
overhead-intensive techniques such as graph
planarization and face routing. The Rainbow
mechanism allows ALBA-R to efficiently route
packets out of and around dead ends. Rainbow
is resilient to localization errors and to channel
propagation impairments. It does not need the
network topology to be planar, unlike previous
routing protocols. It is, therefore, more general
than face routing-based solutions and is able to
guarantee packet delivery in realistic
deployments.
III. PRELIMINARY
A. Routing in WSN
Routing is a process of determining a path
between source and destination regarding the
transmission of packet messages. When the
sink is far away from the source or not in the
range of source node, multi-hop technique is
followed. In order to moving a packet of data
from source to destination, intermediate sensor
nodes have to relay their packets efficiently. As
shown in Fig.2 depend on network structure,
routing protocol that perform an end-to-end
message delivery can be classified as flat-based
routing, hierarchical-based routing, and
geographic routing (location-based routing). In
flat-based routing, all the nodes are treated as
equal and ensure same roles or functionality. In
hierarchical-based routing, all the nodes are
assigned with differed roles and provide higher
energy nodes for transmission as well as lower
energy nodes for sensing. In location-based
routing, node’s positions are extracted to route
packet data i.e. Sensor nodes are addressed by
means of their locations and their location were
obtained by distance estimation, neighbor
discovery, GPS etc.
Proceedings International Conference On Advances In Engineering And Technology
ISBN NO: 978 - 1503304048
www.iaetsd.in
International Association of Engineering & Technology for Skill Development
13
4. Fig.2 classification of routing protocols
Based on their protocol operations, routing
protocols are categorized into negotiation-based
routing, QoS-based routing, multipath-based
routing, query-based routing and coherent-
based routing. In negotiation-based routing,
these protocols add top-level data descriptors to
eliminate duplicate data transmissions through
negotiation. In multipath-based routing, it
increases fault tolerant capabilities that routes
the data packet through a path. The path gets
changed whenever a short path is discovered. In
query-based routing, the target nodes transmit a
query of data from a node in the network and a
node with this data that matches the query sends
back to the initial node. In QoS-based routing,
this protocol ensures balance between energy
consumption and data quality in the network.
In coherent-based routing, sensor nodes send
data to an intermediate node where necessary
data can be aggregated and may be subject to
minimum processing. Hence each node can
reduce route cost in terms of energy
consumption. Each of these routing schemes
has the common objective of trying to get better
throughput and to extend the lifetime of the
sensor network.
B. Geographic routing
Geographic routing (also called position-based
routing) is a routing principle that relies on
geographic location information. It is defined
only for wireless networks and based on the
idea that the source sends a message to the
geographic location of the destination instead of
using the network address. In geographical
routing, a sender uses the destination’s
geographic location to deliver a message.
Information of physical location might be
determined by means of a global positioning
technique (GPS) or relative positioning.
Geographical routing assumes that each node
knows its own location and each source is
aware of the location of its destination.
Geographic routing protocols require only local
information and thus are very efficient in
wireless networks.
Geographic Greedy Forwarding:
Fig.3 Greedy Forwarding
An important technique in geographic routing is
greedy forwarding, in which each node should
transfer packet by selecting the neighbor closest
to the destination along the path until the packet
reaches the destination as shown Fig.3. Greedy
forwarding, however, fails in the presence of
connectivity holes or dead-ends when a node
that has no neighbors closer to the destination.
A greedy forwarding can minimize the distance
to reach the destination location but it cannot
assure guarantee in delivery of messages.
Planar Graph Routing:
A widely adopted approach to solve this
guaranteed message delivery is planar graph
routing. Planar graph routing is a key concept
for recovery from a local minimum situation. It
can provide delivery guarantees using face
routing used when greedy forwarding fails. In
order to perform face routing, a planar
connectivity graph for the network needs to be
constructed and so a planarization algorithm is
required to create the planar graph as shown in
Fig.4. Face routing is integrated with greedy
forwarding and is used as a way to overcome
dead-ends when greedy forwarding fails.
Greedy forwarding coupled with face routing is
the common efficient approach of the currently
proposed geographic protocols.
Proceedings International Conference On Advances In Engineering And Technology
ISBN NO: 978 - 1503304048
www.iaetsd.in
International Association of Engineering & Technology for Skill Development
14
5. Fig.4 Planar graph routing
C. Issues in geographic routing
Some of the following issues while designing
geographic routing schemes are
(a)Routing around dead ends,
(b) Flexibility to localization errors,
(c)Relay selection process.
IV. OVERVIEW
D. Relay Selection in Geographic routing
Adaptive load balancing algorithm improves a
convergecasting in WSNs that integrates
awake/asleep schedules, Medium access control
(MAC), load balancing, and back-to-back data
transmissions. While transmission, it is
necessary to ensure that a node which is awake
or asleep or else usage of energy can get
increases. A sensor node can forward packet
from source to destination by sending RTS
(Request-to-send) packet to all the neighbor
nodes in order to ensure their availability of
awake nodes. The sensor nodes which are
available will report with clear-to-send (CTS)
packet carrying information through which the
sender can choose the best relay. A ‘best
throughput’ can get performed through effective
relay selection. Every upcoming relay is
characterized by two parameters: the queue
priority index (QPI), and the geographic priority
index (GPI). The QPI is measured as, the
requested number of packets to be transmitted
in a burst is Nb, and the number of packets in
the queue of an eligible relay is Q. The potential
relay keeps a moving average M of the number
of packets it was able to transmit back-to-back,
without errors, in the last forwarding attempts.
The QPI is then defined as min (Q+Nb)/M,
Nq, where Nq is the maximum allowed QPI.
Rainbow is the mechanism used by ALBA_R to
deal with dead ends. An important feature for
avoiding dead ends is that of allowing the nodes
to forward packets away from the sink when a
relay selection toward the sink cannot be
found. To remember whether to search for
relays in the direction of the sink, each node is
labeled with different colors. Rainbow
mechanism discovers a specific color of each
node so that a possible route to the sink is
determined.
E. Enhanced Relay Selection Scheme
The relay selection scheme of ALBA_R [7] can
fail in two cases:
1. If no node with any QPI is found
2. If the contention among nodes with the
same QPI and GPI is not resolved within
a maximum number of attempts.
Both situations cause the sender to back off. It
will lead to end to end delay also.
To overcome that, we can send the RTS packets
to all the one hop neighbor nodes to collect the
QPI value as the reply instead of sending RTS
with particular QPI value. After receiving QPI
value, we can select the relay node based on the
QPI value in the increasing order. If there is a
tie, we can choose the relay node which is
having lowest GPI value as shown in Fig.5.
Thus the delay will be reduced by transmitting
the RTS packets again and again until find out
the node with particular QPI value.
Fig.5 System architecture
Proceedings International Conference On Advances In Engineering And Technology
ISBN NO: 978 - 1503304048
www.iaetsd.in
International Association of Engineering & Technology for Skill Development
15
6. V. CONCLUSION
WSNs have seen tremendous developments in
design and applications over the recent years.
This speedy progress has resulted in the stress
towards solving the hurdles that this area has to
face. The area of WSN is thriving and every day
new ideas are emerging. The positive benefits
of this are quite obvious; such a technology will
achieve fine granularity tracking of what is
going on at far away and generally in
inaccessible locations. A wireless senor network
is the latest and fastest growing technology and
is expected to revolutionize a wide range of
applications in terms of its quality and
availability in the near future.
REFERENCES
[1]M. Zorzi, “A New Contention-Based MAC
Protocol for Geographic Forwarding in Ad Hoc
and Sensor Networks,” Proc. IEEE Int’l Conf.
Comm. (ICC ’04), vol. 6, pp. 3481-3485, June
2004.
[2]K. Seada, A. Helmy, and R. Govindan, “On
the Effect of Localization Errors on Geographic
Face Routing in Sensor Networks,” Proc.
IEEE/ACM Third Int’l Symp. Information
Processing in Sensor Networks (IPSN ’04), pp.
71-80, Apr. 2004.
[3]Q. Fang, J. Gao, and L.J. Guibas, “Locating
and Bypassing Holes in Sensor Networks,”
ACM Mobile Networks and Applications, vol.
11, no. 2, pp. 187-200, Apr. 2006.
[4]P. Casari, M. Nati, C. Petrioli, and M. Zorzi,
“Efficient Non-Planar Routing around Dead
Ends in Sparse Topologies Using Random
Forwarding,” Proc. IEEE Int’l Conf. Comm.
(ICC ’07), pp. 3122-3129, June 2007.
[5]S. Basagni, M. Nati, and C. Petrioli,
“Localization Error-Resilient Geographic
Routing for Wireless Sensor Networks,” Proc.
IEEE GLOBECOM, pp. 1-6, Nov./Dec. 2008.
[6]A. Camillo, M. Nati, C. Petrioli, M. Rossi,
and M. Zorzi, “IRIS: Integrated Data Gathering
and Interest Dissemination System for Wireless
Sensor Networks,” Ad Hoc Networks, Special
Issue on Cross-Layer Design in Ad Hoc and
Sensor Networks, vol. 11, no. 2, pp. 654-671,
Mar. 2013.
[7]C.Petrioli, P.Casari, M.Zorzi, M.Nati, and
S.Basagni, “ALBA-R: Load-Balancing
Geographic Routing Around Connectivity
Holes in Wireless Sensor Networks” IEEE
Transactions on parallel and distributed
systems, vol.25, no.3, March 2014.
[8]S. Ru¨ hrup and I. Stojmenovic, “Optimizing
Communication Overhead while Reducing Path
Length in Beaconless Georouting with
Guaranteed Delivery for Wireless Sensor
Networks,” IEEE Trans. Computers, vol. 62,
no. 12, pp. 2240-2253, Dec. 2013.
[9] H. Frey, S. Ru¨ hrup, and I. Stojmenovic,
“Routing in Wireless Sensor Networks,” Guide
to Wireless Sensor Networks, S. Misra, I.
Woungang, and S. C. Misra, eds., ch. 4, pp. 81-
112, Springer-Verlag, May 2009.
[10] Fraser Cadger, Member, Kevin Curran,
IEEE, Jose Santos and Sandra Moffett “A
Survey of Geographical Routing in Wireless
Ad- Hoc Networks “, IEEE Communications
Surveys and Tutorials, Vol. PP, No. 99, pp: 1-
33, 2012.
[11] Rama Sundari Battula, O. S. Khanna
“Geographic Routing Protocols for Wireless
Sensor Networks: A Review”, International
Journal of Engineering and Innovative
Technology (IJEIT) Volume 2, Issue 12, June
2013
Proceedings International Conference On Advances In Engineering And Technology
ISBN NO: 978 - 1503304048
www.iaetsd.in
International Association of Engineering & Technology for Skill Development
16