This document proposes a new routing scheme called node reliance for wireless sensor networks. Node reliance rates how much each node is relied upon for routing data from sources to sinks. Sources will route through nodes with low reliance ratings to avoid overusing critical nodes and maximize network lifetime. The scheme is evaluated using an example network and compared to other routing methods. Node reliance aims to reduce energy waste from disconnected sources by encouraging collaboration between sources in path selection.
This document discusses enhancing the capacity of the wireless portion of a hybrid wireless-optical broadband access network (WOBAN) through the strategic placement of additional radios at bottleneck nodes. Deploying multiple radios at every node improves performance but increases costs. The document proposes formulating the problem of optimally placing a limited number of additional radios as an integer linear program to maximize performance while minimizing costs. Prior work on routing, capacity assignment, and radio placement in wireless mesh networks is reviewed. The impact of deploying multiple radios only at overloaded bottleneck nodes is studied through numerical examples.
Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowe...IDES Editor
This paper investigates the effects of
shadowing on the optimal transmit power required to
sustain the network connectivity while maintaining a
predefined maximum tolerable Bit Error Rate (BER) in
a Wireless Sensor Networks (WSN). Optimization of
transmit power is of great importance in WSN since
sensor nodes are battery driven and optimization helps
to increase battery life by reducing inter node
interference significantly. An infinite Automatic Repeat
Request (ARQ) model has been considered to assess the
impact of shadowing and other network conditions on
energy requirement for successful packet transmission in
WSN. We also find the optimal packet length based on
energy efficiency. Effects of shadowing on optimal packet
size and energy efficiency in packetized data
transmission are also investigated. Further energy
consumption is minimized considering a variable packet
length based transmission. Use of optimal packet size
shows a significant reduction in energy spending.
This document proposes DELAR, a Device-Energy-Load Aware Routing protocol for heterogeneous mobile ad hoc networks. DELAR aims to reduce energy consumption and improve end-to-end delay by selecting power-efficient routes using a cost function that considers residual energy and queue length. It introduces mechanisms for P-node neighbor discovery, hybrid transmission scheduling, an asymmetric MAC protocol, and multi-packet transmission to further optimize energy efficiency and performance. Simulation results show that DELAR achieves lower energy consumption, higher packet delivery ratio, and less end-to-end delay compared to existing protocols under different conditions of node mobility, number of P-nodes, and traffic load.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
An ad-hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network .
In ad-hoc networks, nodes are not familiar with the topology of their networks; instead, they have to discover it.The basic idea is that a new node may announce its presence and should listen for announcements broadcast by its neighbors.Each node learns about nodes nearby and how to reach them, and may announce that it, too, can reach them
This document summarizes routing and communication techniques for wireless sensor networks using clustering. It discusses single-hop, dual-hop, and multi-hop communication modes and how they can be used in hierarchical clustered networks. It proposes using multi-level clustering and dual/multi-hop communication between cluster heads to enhance network lifetime compared to traditional single-hop protocols like LEACH. Algorithms for dual-hop LEACH with concentric circles (DLCC) and multi-hop LEACH with concentric circles (MLCC) are presented to leverage both clustering and layered architectures for efficient routing to extend network lifetime.
A Novel Timer-Based Hybrid Rerouting Algorithm for Improving Resource Utiliza...IJERA Editor
In this paper we investigate hybrid rerouting and minimization of incurred service disruption period due to
rerouting in Wavelength Division Multiplexed (WDM) transparent optical network. One limitation of such a
network is the wavelength continuity constraint which does not allow a circuit to be placed on a non
wavelength-continuous route. The impact of this constraint might have a severe consequence on the
performance of transparent optical networks especially in terms of rejection ratio ant it is especially severe when
traffic demands are unpredictable and characterized by random arrivals and departures. To alleviate the impact
of these constraints, either wavelength conversion or traffic rerouting can be used. Since, in the foreseeable
future, wavelength conversion is expected to remain an expensive technology, traffic rerouting is an attractive
alternative solution. Thus, we here propose to employ hybrid rerouting to improve the network performances.
Hybrid rerouting combines passive and active rerouting. Through simulation results, the performances of the
proposed algorithm in terms of rejection ratio are demonstrated to be promising while rerouting a small number
of already established lightpaths using Lightpath ReRouting (LRR). By rerouting a small number of existing
lightpaths using LRR, we hope that the incurred service disruption period due to rerouting is minimized.
This document discusses enhancing the capacity of the wireless portion of a hybrid wireless-optical broadband access network (WOBAN) through the strategic placement of additional radios at bottleneck nodes. Deploying multiple radios at every node improves performance but increases costs. The document proposes formulating the problem of optimally placing a limited number of additional radios as an integer linear program to maximize performance while minimizing costs. Prior work on routing, capacity assignment, and radio placement in wireless mesh networks is reviewed. The impact of deploying multiple radios only at overloaded bottleneck nodes is studied through numerical examples.
Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowe...IDES Editor
This paper investigates the effects of
shadowing on the optimal transmit power required to
sustain the network connectivity while maintaining a
predefined maximum tolerable Bit Error Rate (BER) in
a Wireless Sensor Networks (WSN). Optimization of
transmit power is of great importance in WSN since
sensor nodes are battery driven and optimization helps
to increase battery life by reducing inter node
interference significantly. An infinite Automatic Repeat
Request (ARQ) model has been considered to assess the
impact of shadowing and other network conditions on
energy requirement for successful packet transmission in
WSN. We also find the optimal packet length based on
energy efficiency. Effects of shadowing on optimal packet
size and energy efficiency in packetized data
transmission are also investigated. Further energy
consumption is minimized considering a variable packet
length based transmission. Use of optimal packet size
shows a significant reduction in energy spending.
This document proposes DELAR, a Device-Energy-Load Aware Routing protocol for heterogeneous mobile ad hoc networks. DELAR aims to reduce energy consumption and improve end-to-end delay by selecting power-efficient routes using a cost function that considers residual energy and queue length. It introduces mechanisms for P-node neighbor discovery, hybrid transmission scheduling, an asymmetric MAC protocol, and multi-packet transmission to further optimize energy efficiency and performance. Simulation results show that DELAR achieves lower energy consumption, higher packet delivery ratio, and less end-to-end delay compared to existing protocols under different conditions of node mobility, number of P-nodes, and traffic load.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
An ad-hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network .
In ad-hoc networks, nodes are not familiar with the topology of their networks; instead, they have to discover it.The basic idea is that a new node may announce its presence and should listen for announcements broadcast by its neighbors.Each node learns about nodes nearby and how to reach them, and may announce that it, too, can reach them
This document summarizes routing and communication techniques for wireless sensor networks using clustering. It discusses single-hop, dual-hop, and multi-hop communication modes and how they can be used in hierarchical clustered networks. It proposes using multi-level clustering and dual/multi-hop communication between cluster heads to enhance network lifetime compared to traditional single-hop protocols like LEACH. Algorithms for dual-hop LEACH with concentric circles (DLCC) and multi-hop LEACH with concentric circles (MLCC) are presented to leverage both clustering and layered architectures for efficient routing to extend network lifetime.
A Novel Timer-Based Hybrid Rerouting Algorithm for Improving Resource Utiliza...IJERA Editor
In this paper we investigate hybrid rerouting and minimization of incurred service disruption period due to
rerouting in Wavelength Division Multiplexed (WDM) transparent optical network. One limitation of such a
network is the wavelength continuity constraint which does not allow a circuit to be placed on a non
wavelength-continuous route. The impact of this constraint might have a severe consequence on the
performance of transparent optical networks especially in terms of rejection ratio ant it is especially severe when
traffic demands are unpredictable and characterized by random arrivals and departures. To alleviate the impact
of these constraints, either wavelength conversion or traffic rerouting can be used. Since, in the foreseeable
future, wavelength conversion is expected to remain an expensive technology, traffic rerouting is an attractive
alternative solution. Thus, we here propose to employ hybrid rerouting to improve the network performances.
Hybrid rerouting combines passive and active rerouting. Through simulation results, the performances of the
proposed algorithm in terms of rejection ratio are demonstrated to be promising while rerouting a small number
of already established lightpaths using Lightpath ReRouting (LRR). By rerouting a small number of existing
lightpaths using LRR, we hope that the incurred service disruption period due to rerouting is minimized.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Impact of le arrivals and departures on bufferingenioustech
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Stable and Reliable Route Identification Scheme for Efficient DSR Route Cache...IJASCSE
This document summarizes a research paper that proposes a Stable and Reliable Route Identification (SRRI) scheme to improve the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. The SRRI scheme aims to improve route stability by periodically updating node transmission ranges and improve reliability by considering bandwidth availability. Simulation results show that SRRI achieves higher packet delivery ratios and lower routing overhead compared to the existing Expected Link Expiration Time (ELET) scheme, especially with increased node mobility. SRRI also helps minimize bandwidth consumption by maintaining route bandwidth histories in node caches.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
1) The document analyzes opportunistic routing in ad hoc networks, focusing on how to optimize the transmission probability and spectral efficiency.
2) It defines a "forward progress-rate-density" metric to characterize end-to-end performance as the product of transmitter density, average hop distance, and transmission rate.
3) The authors derive an approximation to calculate this metric, and use it to determine the optimal transmission probability and spectral efficiency that maximize end-to-end performance.
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...cscpconf
Network-wide broadcasting is a fundamental operation for mobile ad hoc networks. Inbroadcasting, a source node sends a message to all other nodes in the network. Under ordinary
flooding procedure, each node transmits the broadcast message to all of its 1-hop downlinkneighbours, i.e. all nodes residing within its radio-range. Receiving the broadcast message all those downlink neighbours reply with an acknowledgement. Since in an ad hoc network a node
may have multiple uplink neighbours, in ordinary flooding procedure, a node is supposed to receive the broadcast message from all those uplink neighbours and send acknowledgement to all of them, generating huge message contention and collision. This is popularly referred to as
the broadcast storm problem. The present article is focused to remove the broadcast redundancy within 2-hop neighbourhood and beyond, as much as possible by prioritizing the 1-
hop downlink neighbours of a node. Priority of a 1-hop downlink neighbour of a node ni increases if it is equipped with a large number of 1-hop downlink neighbours, large radiorange,
high remaining battery power and very small number of uplink neighbours closer to the broadcast source than ni
. ni waits a predefined amount of time to receive proactive
acknowledgements from the 1-hop downlink neighbours having less priority. If it does not receive acknowledgement from those downlink neighbours within the waiting time, it sends the
broadcast message to them. A fuzzy controller named Priority Assignor (PA) is embedded in every node that determines the priority of a 1-hop downlink neighbour. Simulation results firmly
establish that the proposed protocol FP2 B produces high broadcast delivery ratio at muchlesser message cost, compared to other state-of-the-art broadcast algorithms.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
The document discusses routing and wavelength assignment (RWA) in wavelength-division multiplexing (WDM) networks. It covers both static and dynamic RWA problems. For routing, it discusses integer linear programming formulations for static routing and online algorithms for dynamic routing. For wavelength assignment, it discusses graph coloring approaches for static assignment and heuristics like first-fit for dynamic assignment. Several heuristics for RWA are presented, along with their computational complexities and performance. Future research directions like survivable RWA and managing multicast connections are also outlined.
MuMHR: Multi-path, Multi-hop Hierarchical RoutingM H
This document proposes a new routing protocol called MuMHR for wireless sensor networks. MuMHR aims to improve energy efficiency and robustness over LEACH in three ways: 1) By enabling nodes to select cluster heads based on the number of hops away to reduce transmission distances. 2) By using a back-off timer and multiple paths for transmissions to reduce setup overhead and add reliability. 3) By electing backup cluster heads to substitute when primary heads fail. The protocol operates in setup and data transfer phases, with the setup phase selecting cluster heads and forming clusters in an energy-efficient multi-hop manner.
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STR...ijwmn
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between
lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint
algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive
multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipath set. We assume a multi-path set exists as long as at least one path in the set exists. Simulation results
indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower
than the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjoint multi-path discoveries would be far lower than the time between node and link-disjoint multi-path
route discoveries and can be at most 45% more than the time between single minimum-hop path route
discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint,
node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the average
minimum hop count determined using single-path routing. We also observe that even though the number
of link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjoint
paths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be at
most 15-25% more than the time between two successive node-disjoint multi-path discoveries, without
any significant difference in the hop count per multi-path set.
Supporting efficient and scalable multicastingingenioustech
The document proposes a new multicast protocol called Efficient Geographic Multicast Protocol (EGMP) to support efficient and scalable multicasting over mobile ad hoc networks. EGMP uses a virtual zone-based structure for scalable group membership management. It constructs a network-wide zone-based bi-directional tree to achieve more efficient membership management and multicast delivery. Several strategies are introduced to improve efficiency, including using zone depth to build an optimal tree structure and integrating location search with membership management. Simulation results show EGMP has high delivery ratio and low overhead under different scenarios, and is scalable to both group size and network size.
This document proposes a new contention-based forwarding (CBF) mechanism for position-based routing in mobile ad hoc networks. CBF selects the next hop through a distributed contention process using biased timers, without requiring periodic beacon messages. It aims to use more accurate position information than existing beacon-based approaches and eliminate routing overhead from beacons. CBF works in three steps: broadcast of the packet, contention between neighbors to become the next hop using biased timers, and suppression of duplicate packets from losing neighbors. The document analyzes CBF's properties and compares its performance to beacon-based greedy forwarding through simulation.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
This document summarizes three routing strategies - Cluster and Chain Based (CCB), Transmission Ranges and Chain Based (TRCB), and GRAdient Broadcast (GRAB) - proposed for wireless sensor networks to improve energy efficiency. CCB uses both clustering from LEACH and chain formation from PEGASIS to transmit sensor data to the base station. TRCB uses transmission ranges and distances to transmit sensor data within clusters to heads, which then form chains to the base station. GRAB builds and maintains a cost field to efficiently transmit data along descending costs towards the base station along multiple paths. Simulation results show GRAB performs better than CCB and TRCB in terms of network lifetime.
The document discusses geo-cast routing protocols, which deliver data packets to nodes within a specified geographic region. It describes two categories of geo-cast protocols: data-transmission oriented protocols, which focus on transmitting information from source to geographic region, and routing creation oriented protocols, which aim to reduce flooding overhead while maintaining delivery accuracy. Specific protocols discussed include Location-Based Multicast, Geo-GRID, Geo-TORA, and mesh-based geo-cast routing. The document concludes by noting open issues like scalability, applications, addressing, and security for geo-cast routing over mobile ad hoc networks.
This document summarizes a research paper that proposes a Modified Ultra Smart Counter Based Broadcast (MUSCBA) algorithm for mobile ad hoc networks (MANETs). The algorithm dynamically adjusts the counter-based broadcast threshold based on locally available neighborhood information, without requiring location devices. It improves on previous fixed counter-based approaches. Simulation results show the minimum and maximum number of neighbors observed for nodes in different network configurations and densities. The algorithm aims to reduce redundant broadcasts while maintaining high propagation, using only neighborhood data from periodic "Hello" packet exchanges.
Iaetsd game theory and auctions for cooperation inIaetsd Iaetsd
This document summarizes game theory and auction approaches for encouraging cooperation in wireless networks. It first discusses how cooperative communication can improve wireless capacity by exploiting antennas across devices. However, applying cooperation is challenging because nodes lack incentives to help. The document surveys existing game theoretic solutions for providing cooperation incentives. It outlines classification of games, concepts like Nash equilibrium, and how game theory has been applied in contexts like the relay dilemma game and Stackelberg game to model node interactions and identify stable cooperation strategies.
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
Improving Capacity and Load Distribution of a Node Using Circular Sailing Rou...ijafrc
Routing in wireless networks has been heavily studied in the last decade. In mobile ad-hoc network (MANETs) can route travelled by a packet from the source to the destination usually consists of multiple hops where intermediate nodes act as relays. The packets usually follow the shortest path between source and destination in routing protocols to achieve smallest travelled distance. However, this leads to the uneven distribution of traffic load in a network. The wireless nodes in the center of the network will have heavier traffic. Since most of the shortest routes go through them. There are many algorithms available in the load balancing and improving capacity technique. In this paper, describe a novel routing algorithm called Circular Sailing Routing (CSR), which we can distribute the traffic more evenly in the network. Based on our study, found to reduced traffic distribution and capacity of a node in the wireless network compared to any other algorithm. This is because they proposed maps in the network onto a sphere via a simple stereographic projection and then the route decision is made by the distance on the sphere instead of Euclidean distance in the plane.
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Impact of le arrivals and departures on bufferingenioustech
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Stable and Reliable Route Identification Scheme for Efficient DSR Route Cache...IJASCSE
This document summarizes a research paper that proposes a Stable and Reliable Route Identification (SRRI) scheme to improve the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. The SRRI scheme aims to improve route stability by periodically updating node transmission ranges and improve reliability by considering bandwidth availability. Simulation results show that SRRI achieves higher packet delivery ratios and lower routing overhead compared to the existing Expected Link Expiration Time (ELET) scheme, especially with increased node mobility. SRRI also helps minimize bandwidth consumption by maintaining route bandwidth histories in node caches.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
1) The document analyzes opportunistic routing in ad hoc networks, focusing on how to optimize the transmission probability and spectral efficiency.
2) It defines a "forward progress-rate-density" metric to characterize end-to-end performance as the product of transmitter density, average hop distance, and transmission rate.
3) The authors derive an approximation to calculate this metric, and use it to determine the optimal transmission probability and spectral efficiency that maximize end-to-end performance.
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...cscpconf
Network-wide broadcasting is a fundamental operation for mobile ad hoc networks. Inbroadcasting, a source node sends a message to all other nodes in the network. Under ordinary
flooding procedure, each node transmits the broadcast message to all of its 1-hop downlinkneighbours, i.e. all nodes residing within its radio-range. Receiving the broadcast message all those downlink neighbours reply with an acknowledgement. Since in an ad hoc network a node
may have multiple uplink neighbours, in ordinary flooding procedure, a node is supposed to receive the broadcast message from all those uplink neighbours and send acknowledgement to all of them, generating huge message contention and collision. This is popularly referred to as
the broadcast storm problem. The present article is focused to remove the broadcast redundancy within 2-hop neighbourhood and beyond, as much as possible by prioritizing the 1-
hop downlink neighbours of a node. Priority of a 1-hop downlink neighbour of a node ni increases if it is equipped with a large number of 1-hop downlink neighbours, large radiorange,
high remaining battery power and very small number of uplink neighbours closer to the broadcast source than ni
. ni waits a predefined amount of time to receive proactive
acknowledgements from the 1-hop downlink neighbours having less priority. If it does not receive acknowledgement from those downlink neighbours within the waiting time, it sends the
broadcast message to them. A fuzzy controller named Priority Assignor (PA) is embedded in every node that determines the priority of a 1-hop downlink neighbour. Simulation results firmly
establish that the proposed protocol FP2 B produces high broadcast delivery ratio at muchlesser message cost, compared to other state-of-the-art broadcast algorithms.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
The document discusses routing and wavelength assignment (RWA) in wavelength-division multiplexing (WDM) networks. It covers both static and dynamic RWA problems. For routing, it discusses integer linear programming formulations for static routing and online algorithms for dynamic routing. For wavelength assignment, it discusses graph coloring approaches for static assignment and heuristics like first-fit for dynamic assignment. Several heuristics for RWA are presented, along with their computational complexities and performance. Future research directions like survivable RWA and managing multicast connections are also outlined.
MuMHR: Multi-path, Multi-hop Hierarchical RoutingM H
This document proposes a new routing protocol called MuMHR for wireless sensor networks. MuMHR aims to improve energy efficiency and robustness over LEACH in three ways: 1) By enabling nodes to select cluster heads based on the number of hops away to reduce transmission distances. 2) By using a back-off timer and multiple paths for transmissions to reduce setup overhead and add reliability. 3) By electing backup cluster heads to substitute when primary heads fail. The protocol operates in setup and data transfer phases, with the setup phase selecting cluster heads and forming clusters in an energy-efficient multi-hop manner.
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STR...ijwmn
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between
lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint
algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive
multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipath set. We assume a multi-path set exists as long as at least one path in the set exists. Simulation results
indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower
than the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjoint multi-path discoveries would be far lower than the time between node and link-disjoint multi-path
route discoveries and can be at most 45% more than the time between single minimum-hop path route
discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint,
node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the average
minimum hop count determined using single-path routing. We also observe that even though the number
of link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjoint
paths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be at
most 15-25% more than the time between two successive node-disjoint multi-path discoveries, without
any significant difference in the hop count per multi-path set.
Supporting efficient and scalable multicastingingenioustech
The document proposes a new multicast protocol called Efficient Geographic Multicast Protocol (EGMP) to support efficient and scalable multicasting over mobile ad hoc networks. EGMP uses a virtual zone-based structure for scalable group membership management. It constructs a network-wide zone-based bi-directional tree to achieve more efficient membership management and multicast delivery. Several strategies are introduced to improve efficiency, including using zone depth to build an optimal tree structure and integrating location search with membership management. Simulation results show EGMP has high delivery ratio and low overhead under different scenarios, and is scalable to both group size and network size.
This document proposes a new contention-based forwarding (CBF) mechanism for position-based routing in mobile ad hoc networks. CBF selects the next hop through a distributed contention process using biased timers, without requiring periodic beacon messages. It aims to use more accurate position information than existing beacon-based approaches and eliminate routing overhead from beacons. CBF works in three steps: broadcast of the packet, contention between neighbors to become the next hop using biased timers, and suppression of duplicate packets from losing neighbors. The document analyzes CBF's properties and compares its performance to beacon-based greedy forwarding through simulation.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
This document summarizes three routing strategies - Cluster and Chain Based (CCB), Transmission Ranges and Chain Based (TRCB), and GRAdient Broadcast (GRAB) - proposed for wireless sensor networks to improve energy efficiency. CCB uses both clustering from LEACH and chain formation from PEGASIS to transmit sensor data to the base station. TRCB uses transmission ranges and distances to transmit sensor data within clusters to heads, which then form chains to the base station. GRAB builds and maintains a cost field to efficiently transmit data along descending costs towards the base station along multiple paths. Simulation results show GRAB performs better than CCB and TRCB in terms of network lifetime.
The document discusses geo-cast routing protocols, which deliver data packets to nodes within a specified geographic region. It describes two categories of geo-cast protocols: data-transmission oriented protocols, which focus on transmitting information from source to geographic region, and routing creation oriented protocols, which aim to reduce flooding overhead while maintaining delivery accuracy. Specific protocols discussed include Location-Based Multicast, Geo-GRID, Geo-TORA, and mesh-based geo-cast routing. The document concludes by noting open issues like scalability, applications, addressing, and security for geo-cast routing over mobile ad hoc networks.
This document summarizes a research paper that proposes a Modified Ultra Smart Counter Based Broadcast (MUSCBA) algorithm for mobile ad hoc networks (MANETs). The algorithm dynamically adjusts the counter-based broadcast threshold based on locally available neighborhood information, without requiring location devices. It improves on previous fixed counter-based approaches. Simulation results show the minimum and maximum number of neighbors observed for nodes in different network configurations and densities. The algorithm aims to reduce redundant broadcasts while maintaining high propagation, using only neighborhood data from periodic "Hello" packet exchanges.
Iaetsd game theory and auctions for cooperation inIaetsd Iaetsd
This document summarizes game theory and auction approaches for encouraging cooperation in wireless networks. It first discusses how cooperative communication can improve wireless capacity by exploiting antennas across devices. However, applying cooperation is challenging because nodes lack incentives to help. The document surveys existing game theoretic solutions for providing cooperation incentives. It outlines classification of games, concepts like Nash equilibrium, and how game theory has been applied in contexts like the relay dilemma game and Stackelberg game to model node interactions and identify stable cooperation strategies.
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
Improving Capacity and Load Distribution of a Node Using Circular Sailing Rou...ijafrc
Routing in wireless networks has been heavily studied in the last decade. In mobile ad-hoc network (MANETs) can route travelled by a packet from the source to the destination usually consists of multiple hops where intermediate nodes act as relays. The packets usually follow the shortest path between source and destination in routing protocols to achieve smallest travelled distance. However, this leads to the uneven distribution of traffic load in a network. The wireless nodes in the center of the network will have heavier traffic. Since most of the shortest routes go through them. There are many algorithms available in the load balancing and improving capacity technique. In this paper, describe a novel routing algorithm called Circular Sailing Routing (CSR), which we can distribute the traffic more evenly in the network. Based on our study, found to reduced traffic distribution and capacity of a node in the wireless network compared to any other algorithm. This is because they proposed maps in the network onto a sphere via a simple stereographic projection and then the route decision is made by the distance on the sphere instead of Euclidean distance in the plane.
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
K dag based lifetime aware data collection in wireless sensor networksijwmn
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In
this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's
neighbours while providing the worst-case latency guarantee for data collection, and a distributed
algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the
longest path and the shortest path of each sensor node to the base station differ by at most k. By adding
sibling edges to a SPD, our distributed algorithm allows critical nodes to have more routing choices. The
simulation results show that our approach significantly outperforms the SPD-based data collection
approach in both network lifetime and load balance.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
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
Haqr the hierarchical ant based qos aware on demand routing for manetscsandit
A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre
existing infrastructure or centralized control. Supporting QoS during routing is a very
challenging task. Clustering is an effective method for resource management regarding network
performance, routing protocol design, QoS etc. In real time various types of nodes with different
computing and transmission power, different rolls and different mobility pattern may exist.
Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper,
HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster
based topology in MANET which will be more scalable and efficient compared to flat
architecture and will give better throughput.
HAQR: THE HIERARCHICAL ANT BASED QOS AWARE ON-DEMAND ROUTING FOR MANETScscpconf
A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre existing infrastructure or centralized control. Supporting QoS during routing is a very challenging task. Clustering is an effective method for resource management regarding network performance, routing protocol design, QoS etc. In real time various types of nodes with different computing and transmission power, different rolls and different mobility pattern may exist.Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper,HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical clusterbased topology in MANET which will be more scalable and efficient compared to flat architecture and will give better throughput.
This document summarizes a research paper that proposes an enhanced cross-layer protocol (ECLP) for wireless sensor networks. ECLP integrates medium access control and routing to improve energy efficiency and reduce latency. It uses an adaptive duty cycling scheme with adaptive timeouts and reservation requests. It also designs a tree-based energy-aware routing algorithm to prolong the network lifetime while minimizing control overhead for data delivery. Simulation results show ECLP outperforms other existing algorithms in terms of energy efficiency and latency.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
ENERGY-BALANCED IMPROVED LEACH ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKScscpconf
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
A gateway based energy efficient multi hop routing protocol for wireless sensor networks (WSNs) is
introduced. The main aim of our paper is to design a protocol which minimizes energy consumption.
Gateway nodes are deployed in sensing field.
1) The document presents the OPRAH protocol, which leverages the broadcast nature of wireless networks to enable opportunistic routing.
2) During route setup, RREQ packets are flooded to discover multiple paths from source to destination, filling nodes' route tables with multiple upstream paths.
3) During data forwarding, the best next hop is selected opportunistically based on link quality, avoiding settling on a single suboptimal path.
1) The document proposes a new opportunistic routing protocol called OPRAH for dynamic ad hoc networks that leverages the broadcast nature of wireless transmissions.
2) It motivates opportunistic routing by showing through simulations that typical shortest path routes in dynamic networks with fading can vary dramatically over time.
3) The OPRAH protocol works on top of the link layer and uses promiscuous listening to opportunistically select intermediate forwarders that have the best chance of reliably delivering packets toward the destination.
Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile devices connected through wireless. Nowadays mobile devices in mobile Ad-hoc network are battery operated. Battery is an important factor in MANET. Dynamic topology of mobile ad-hoc network and limited battery capacity are constrained on network life time. In this paper, we have presented variants of power aware techniques in an on-demand reactive routing protocol i.e. AODV which aims to prolong network lifetime. AODV is reactive protocol and it establish route on demand.
We make use of the existence of cell-disjoint paths in the 3D grid topology to design a new highly reliable adaptive geographic routing protocol called Grid-based Adaptive Routing Protocol (GARP) for Underwater Wireless Sensor Networks. In GARP, the underwater environment is viewed as a virtual 3D grid of cells. A packet is forwarded following a pre-constructed routing path from a node in a grid cell to a node in a neighbouring grid cell repeatedly until the destination sink node is reached. When a selected routing path becomes unavailable, GARP adapts to the condition by switching to an alternative path making use of the existing cell-disjoint paths. Since the protocol uses pre-constructed routing paths, it avoids path establishment and path maintenance overheads. Analytical performance evaluation results for GARP are obtained showing its high reliability. In tested cases, the delivery ratio has approached 100% when the network density has reached a minimum number of sensor nodes per grid cell.
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
The document proposes a hybrid network-on-chip (NoC) architecture that combines spatial division multiplexing (SDM)-based circuit switching and packet switching. The SDM-based circuit-switched sub-network handles streaming traffic, using SDM to increase path diversity and improve throughput. The packet-switched sub-network handles best-effort traffic and configures the circuit-switched sub-network. The hybrid router architecture was implemented in FPGA and ASIC, showing it can build a practical hybrid NoC while providing quality of service for streaming traffic without complex resource sharing.
Similar to A collaborative wireless sensor network routing (20)
Bulk Projects For sale
IEEE 2009-10-11-12-13 PAPERS AVILABLE.
We are providing low cost project for final year student projects.
Solved 2010 -2011 -2012 - 2013 IEEE in all the domain
Mobile : 8940956123
E-Mail : ambitlick@gmail.com,
INNOVATIVE TITLES ARE ALSO WELLCOME TO DO WITH US
For All BE/BTech, ME/MTech, MSC/MCA/MS , and diplamo graduates
PROJECT SUPPORTS & DELIVERABLES
•Project Abstract
•IEEE Paper
•PPT / Review Details
•Project Report
•Working Procedure in Video
•Screen Shots
•Materials & Books in CD
•Project Certification
This document lists 15 potential 2013 IEEE NS2 project titles related to wireless networks and sensor networks. It includes projects on topics like capacity of hybrid wireless mesh networks, delay-optimal broadcast in multihop wireless networks, detection of spoofing attackers, and harvesting-aware energy management for wireless sensor networks. The document provides contact information for a company called Ambitlick Solutions that offers support and deliverables for IEEE projects, including project abstracts, papers, presentations, reports, and certification.
This document lists over 40 potential 2013 IEEE Java Dotnet project titles across various domains including wireless networks, mobile computing, network security, data mining, cloud computing, parallel and distributed computing, and multimedia/image processing. The projects focus on technical topics such as wireless sensor networks, wireless mesh networks, cognitive radio networks, mobile ad hoc networks, network coding, video streaming, machine learning, data warehousing, and more. Project deliverables include an abstract, IEEE paper, presentation, report, working prototype or proof of concept, and certification. Bulk older and new projects can be provided at a low cost.
Handling selfishness in replica allocationambitlick
The document discusses techniques for handling selfish nodes in replica allocation over mobile ad hoc networks. It aims to reduce traffic overhead while maintaining high data accessibility. The techniques include a selfish node detection algorithm that considers partial selfishness and novel replica allocation methods to address issues caused by selfish nodes hoarding replicas for their own benefit instead of sharing memory space. Simulations are used to evaluate the performance of these techniques in improving data delivery rates.
Mutual Distance Bounding Protocols enable entities to determine an upper bound on their physical distance and authenticate each other. They have been actively researched due to distance-based attacks on wireless systems like RFID. While most protocols provide unilateral authentication of a tag to a reader, one was proposed to provide mutual authentication with a lower false acceptance rate. However, this analysis is shown to overestimate security, as a new attack achieves a higher false acceptance rate. A method is also introduced to modify existing unilateral authentication protocols into mutual authentication protocols.
Moderated group authoring system for campus wide workgroupsambitlick
This paper describes a distributed authoring system for campus workgroups that allows group members to modify any document type using their own devices. Each member maintains an updatable copy of shared content, and read-only copies are distributed asynchronously based on wireless availability. Group members manually reconcile updates through moderation, merging changes from others into their copy. Over time, successive moderation converges all copies into a single version. An evaluation found the asynchronous update model effective and the moderation process intuitive for students.
Efficient spread spectrum communication without pre shared secretsambitlick
This document proposes a new mechanism called Time Reversed Message Extraction and Key Scheduling (TREKS) that allows for efficient spread spectrum communication without pre-shared secrets. TREKS is four orders of magnitude faster than previous solutions to this problem. It enables long-term spread spectrum communication with optimal energy costs, minimal storage overhead, and a computation cost at most twice traditional spread spectrum. The approach was evaluated through simulations and experiments sustaining 1Mbps communication spread over 100 Megachips per second using modest hardware.
The document lists 23 networking and mobile computing projects implemented in NS2. It includes projects on topics like mobility in wireless networks, intrusion detection, neighbor discovery, energy renewal with wireless power transfer, load balancing, and spectrum access control. Contact information is provided for those interested in the project reports, presentations, source code, or implementing new projects.
Adaptive weight factor estimation from user review 1ambitlick
This document proposes a novel technique called Adjacent Pair Priorities (APP) to estimate weight factors for quality of service parameters in vertical handoff decision algorithms. The APP technique allows users to set relative priority levels for adjacent pairs of QoS parameters in descending order using an exponential mapping. This adaptive approach controls the width of the weight distribution to provide flexibility for users. The document outlines the system requirements, block diagram, modules and references several research papers on vertical handoff decision schemes and network selection algorithms.
The document proposes an Integrated Institutional Portal that allows all colleges and institutions within a university or district to share information. [1] The portal would allow students and staff from different colleges to discuss and request information from one another through blogs, forums and by publishing notices. [2] Currently, each college maintains separate portals without a common forum for communication. [3] The proposed centralized portal managed by a super administrator would make all college information like results, events and departments accessible to benefit students and staff across institutions.
This document describes an Embassy Administration portal that aims to centralize and automate manual processes at a college. [1] The portal allows separate login access for staff, parents, students and other members of the college. [2] It displays student results, attendance, and performance for parents to view as well as enables communication between parents and faculty. [3] The system conducts model and unit examinations.
The document proposes a customer relationship management system (CRMS) to help space marketing executives, managers, and management interact and share information online. The existing CRMS is manual and DOS-based, which has disadvantages like a distributed database, obsolete technology, and low efficiency. The proposed system is a web-based online CRMS designed for the space marketing department. It allows monitoring executive calls, tracking performance, and sharing information among departments to improve customer relationships and business operations. The system has modules for corporate administration, regional management, center management, and executives to organize work and monitor progress at different levels.
Mutual Distance Bounding Protocols enable entities to determine an upper bound on their physical distance and authenticate each other. They have been actively researched due to distance-based attacks on wireless systems like RFID. While most protocols provide unilateral authentication of a tag to a reader, one was proposed to provide mutual authentication with a lower false acceptance rate. However, this analysis is shown to overestimate security, as a new attack achieves a higher false acceptance rate. A method is also introduced to modify existing unilateral authentication protocols into mutual authentication protocols.
Moderated group authoring system for campus wide workgroupsambitlick
This paper describes a distributed authoring system for campus workgroups that allows group members to modify any document type using their own devices. Each member maintains an updatable copy of shared content, and read-only copies are distributed based on wireless availability. Group members manually reconcile updates through moderation, merging changes from others into their copy. Over time, successive moderations converge the multiple versions into a single version. An evaluation found the asynchronous update propagation and moderation process intuitive for students.
Efficient spread spectrum communication without pre shared secretsambitlick
This document proposes a new mechanism called Time Reversed Message Extraction and Key Scheduling (TREKS) that allows for efficient spread spectrum communication without pre-shared secrets. TREKS is four orders of magnitude faster than previous solutions to this problem and enables long-term spread spectrum communication without establishing keys. It was evaluated through simulation and on a testbed and can sustain 1Mbps communication spread over a 100 Megachips bandwidth in real-time, with provably optimal energy cost and minimal storage overhead.
Comments on “mabs multicast authentication based on batch signature”ambitlick
This document summarizes and critiques the MABS-DSA protocol proposed by Zhou et al. for multicast authentication using batch verification. While MABS-DSA was intended to increase efficiency and security over other implementations, the author finds through reexamination of the arithmetic that the algorithm is actually incorrect and batch signature verification would fail almost always, even when individual packets were properly signed by an honest sender. The key issue is a flaw in protocol correctness rather than the intended security improvements.
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage In Sen...ambitlick
The document proposes a new probabilistic coverage protocol (PCP) for sensor networks that can employ different sensing models. PCP aims to address the costly task of designing and testing different coverage protocols for each sensing model. It works with common disk sensing models as well as probabilistic sensing models with minimal changes. Simulation results show that PCP outperforms other deterministic and probabilistic protocols in terms of number of activated sensors, total energy consumed, and network lifetime while being robust against failures and inaccuracies.
Energy efficient protocol for deterministicambitlick
The document describes a new probabilistic coverage protocol (PCP) for sensor networks that can employ both deterministic and probabilistic sensing models. PCP works by activating sensors to construct an approximate triangular lattice over the monitored area. It is more energy efficient than previous protocols by reducing the number of activated sensors needed for coverage. Simulation results show PCP outperforms other protocols in terms of energy consumption and network lifetime while maintaining coverage under various conditions.
Estimating Parameters of Multiple Heterogeneous Target Objects Using Composit...ambitlick
This article proposes a method for estimating parameters of multiple heterogeneous target objects (objects with different sizes and shapes) using networked binary sensors. The sensors are simple and only report detections, but no individual sensor location is known. The method introduces "composite sensor nodes" containing multiple sensors in a fixed arrangement. This provides relative location information to help distinguish individual target objects. As an example, the article considers a composite node with two sensors on a line segment. Measures from these nodes can identify target shapes and estimate object parameters like radius and side lengths. Numerical tests demonstrate networked composite sensors can estimate parameters of multiple target objects.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Walmart Business+ and Spark Good for Nonprofits.pdfTechSoup
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
Leveraging Generative AI to Drive Nonprofit InnovationTechSoup
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
2. A. Minimum hop routing therefore returns the minimum hop path of least energy.
Minimum hop routing selects a path based on the minimum Although MLRP assumes bidirectionality, the proposal of
number of hops necessary to reach a sink. The oldest using an incremental transmission power can be applied to
minimum hop routing protocol is DSDV [1], later superseded virtually any other routing protocol. However, MLRP
by AODV [2] which forms routes on demand rather than encourages the global use of nodes with low transmission
proactively. Both protocols operate similarly. A route request energies. For example, if the transmission cost of C to Z in
(RREQ) message, containing a sequence number, the source Fig. 1 is small then the use of node C is encouraged, even
from which the message originated and the number of nodes though its loss would disconnect source A. It could be argued
through which the message has travelled, is flooded through that since C’s transmission power is low, it will take much
the network. Eventually, some node that has a path to the longer to expire. However node C may only be fractionally
destination or is the destination receives the message, and that cheaper than some alternative. Furthermore if every source
node responds with a route reply (RREP), which is routed routes through node C, it may still expire very quickly.
back through the network. Each node forwards the RREP to C. Load balancing routing
the node from which it received the original RREQ. Since
Load balancing routing distributes the routing workload
each RREP message is required to travel the same path as the
across as many nodes as possible, even if the paths chosen by
corresponding RREQ, but in the reverse, AODV and DSDV
sources are not optimal with respect to the energy
both require bidirectional edges.
consumption.
In DSR [3], all RREQ messages contain the sequence of
The MREP [10] (also known as Max-min) routing protocol
nodes through which they have travelled. The RREP is
works by selecting the path whose node of least remaining
encapsulated in its own RREQ so that a path can be
energy is the greatest (the maximum minimum element). In
discovered from the sink back to the source, and contains the
MREP, the cost of a node is inversely proportional to the
sequence of nodes from the RREQ originating from the
remaining energy of that node and the lowest
source. Since the RREP is flooded, there is no requirement for
lexicographically ordered path is used. Lexicographically
edges to be bidirectional. Therefore, route discovery requires
comparing two paths P and Q involves an examination of the
two floods per (source, sink) pair. RREQs and RREPs must
highest cost node on each path. The path whose highest cost
also carry a sequence of node identities rather than a simple
node has the lowest cost has the lowest lexicographic order. If
hop count. These two features combine to limit the scalability
the nodes are of equal cost, the next highest cost nodes are
of protocols such as DSR.
examined, and so on.
In [4-7] it has been suggested that minimum hop routing is
Load balancing routing suffers from two disadvantages.
prone to a number of disadvantages. Firstly, minimising the
Firstly, it is difficult to determine the remaining energy on
number of hops encouraged the use of nodes that are
each node. Secondly, distributing the routing workload might
geographically distant [4]. Since energy expenditure is argued
cause additional energy expenditure.
to be proportional to either the second [5] or fourth power [8]
In order to provide an accurate approximation to the amount
of the distance, long hops either require more energy or are
of energy stored in a node, Lin [11] proposes representing the
less reliable for a fixed amount of energy. Secondly, it has
energy of nodes using discrete energy levels. Using this
been suggested that the use of minimum hop routing (and
technique, a four-level logarithmic scale is proposed with level
more generally shortest path routing of which minimal hop is
0 corresponding to full energy, level 1 between half and full
an example) causes a subset of nodes to expire more quickly
energy, level 2 between quarter and half energy, and level 3
[6, 7], potentially disconnecting sources from sinks. For
between one eighth and zero energy. Whilst this reduces the
example, in Fig. 1, the use of the minimum hop routes from A
overhead associated with load balancing, routes are required to
and D (ACZ and DCZ) would cause C to expire quickly, and
be recalculated when any node changes its energy level.
disconnect A from Z.
Load balancing typically puts off the time until first node
B. Minimum energy routing expiration by distributing workload. However, this approach
Since there is a polynomial relationship between the energy does not necessarily reduce the wastage of energy of sources
required for transmission and the transmission distance, a since it may be to the detriment of the entire network’s energy.
longer sequence of small hops may require less energy than a D. Potential based routing
short sequence of long hops. Minimum energy routing seeks
PMRP [12] aims to limit the path maintenance overhead on
to use (source, sink) paths of least energy expenditure.
node failure. Each node carries a score initially based on its
In MLRP [9], when an RREQ message is sent from a
distance (in hops) from a sink. Data is always routed to the
source, it specifies a minimum transmission power that must
neighbour with the lowest score. If such a node cannot be
be used. Any node receiving an RREQ retransmits it at the
found, for example after a failure, a widening search is
power specified in the message. After some period of time, if
conducted for a node of lower score. When such a node is
the source has not received an RREP, it increases the
found, the scores of nodes on the path to the discovered node
transmission energy and resends the RREQ. The protocol
Authorized licensed use limited to: Bharat University. Downloaded on July 23,2010 at 08:14:37 UTC from IEEE Xplore. Restrictions apply.
3. are lowered. Adjusting the scores in this manner ensures that necessary to determine the cost of each available path in order
other routes to the sink are not disrupted and allows new paths to establish the optimal one. The results (Section VII) indicate
to be formed using only a subset of local nodes. Unlike our that shortest path routing maximises (source, sink)
proposed routing scheme, PMRP does not actively encourage connectivity. Thus, the optimal path is the one where the sum
lifetime extension or the preservation of particular nodes. of reliance costs of nodes is the least.
As discussed in Section III, shortest path routing causes a
IV. NODE RELIANCE subset of nodes in the network to be overused and quickly
None of the routing schemes examined in Section III are disconnected from the network. However, these concerns do
suitable for minimising the energy wastage of source nodes. not apply when node reliance is used, since the cost of a node
We therefore introduce a new means of costing nodes known is inversely proportional to the number of paths on which it
as node reliance and demonstrate how it may be applied to lies. Consequently, it is unlikely that the cheapest nodes can
form routes that minimise energy wastage at sources. be overused. Even if overused, they will be of little
The premise of node reliance routing is that each node is importance in routing by definition.
assigned a weighting, which gives an indication of how much
that node is relied upon in routing from sources to sinks. A V. EXAMPLE
node that is greatly relied upon should be avoided where To illustrate the approach, we use the network shown in Fig.
possible, whereas a node that is not relied upon can be used 1. The pair (A, Z) has one simplest path (ACZ). Consequently,
freely. Each source may rely on a particular node to a different all three nodes, A, C and Z have a relative reliance of 1.0 to
degree. Any model of node reliance must be able to the pair (A, Z). The pair (D, Z) has two simplest paths (DCZ
distinguish between how relied upon a node is to a particular and DFGZ). Thus, nodes C, F and G each have a relative
source and in the context of the entire network. To distinguish reliance of 0.5 to the pair (D, Z) and D and Z have a relative
between these concepts, we make the following definitions: reliance of 1.0 to (D, Z). Nodes that do not lie on any simplest
• The relative reliance of a node B to a (source, sink) path between a (source, sink) pair have a relative reliance of 0.
pair (A, Z) is the degree to which node B is relied upon A node’s absolute reliance is equal to the mean of its relative
in routing data from A to Z. reliances. For example, node D has a relative reliance of 0 to
• The absolute reliance of a node B is the degree to (A, Z) and a relative reliance of 1 to (D, Z), giving it an
which node B is relied upon in the entire network. absolute reliance of 0.5. The reliance values for the nodes
Several models may be used to express node reliance. In shown in Fig. 1 are shown in Table I.
this paper, we present the simplest paths model. A simplest TABLE I
RELATIVE AND ABSOLUTE NODE RELIANCE VALUES
path is a sequence of nodes from a source to a sink such that it
Relative Relative
is not possible to construct another path between the same Absolute
Node reliance to reliance to
reliance
(source, sink) pair by removing nodes. For example, in Fig. 1, (A, Z) (D, Z)
the pair (A, Z) has one simplest path: ACZ and (D, Z) has two: A 1.00 0.00 0.50
B 0.00 0.00 0.00
DCZ and DFGZ. The path ABCZ is not a simplest path,
C 1.00 0.50 0.75
because it is possible to remove node B to form the path ACZ. D 0.00 1.00 0.50
Our model considers the set of simplest paths between each E 0.00 0.00 0.00
(source, sink) pair. A given (source, sink) pair may have F 0.00 0.50 0.25
multiple simplest paths associated with it. In the simplest G 0.00 0.50 0.25
paths model, a path may never contain more than one sink. H 0.00 0.00 0.00
Consequently, the set of paths under consideration is actually Z 1.00 1.00 1.00
the set of single-sink, simplest paths. Visual inspection reveals the absolute and relative reliance
The relative reliance, of a node B to a (source, sink) pair values follow intuition. The most valuable node is sink Z
(A, Z) is the proportion of simplest paths between A and Z on whose loss would cause the entire network to fail (if the
which node B lies. If node B is a bottleneck, then it lies on all network had multiple sinks, then this value would be lower).
paths between A and Z and its relative reliance is 1. If node B The next highest reliance value node is C. Node C is a
does not lie on any simplest paths, then it is unused in routing, bottleneck to source A and therefore if C were to expire, A
and it has a relative node reliance of 0. The absolute reliance would be disconnected from the network. Furthermore, the
of a node under this model is the average of relative reliance loss of node C causes half D’s (source, sink) paths to become
across all pairs for which there is at least one path. The set of unusable. Thus, node C is given a high absolute value. The
simplest paths is considered in calculating node reliance since loss of a source node yields that node unusable and
it contains all routes from a source to a sink that have no consequently the source nodes have the next highest reliance
superfluous nodes. The loss of such nodes does not prevent value. Although not relevant in this network, where no
sources from routing to sinks. simplest path contains both sources, it is important to consider
Once reliance values have been assigned to nodes, it is the reliance values of sources, since it may be beneficial to the
Authorized licensed use limited to: Bharat University. Downloaded on July 23,2010 at 08:14:37 UTC from IEEE Xplore. Restrictions apply.
4. entire network for one source to route through another. Of the process involves one flood per source to find paths to the
remaining nodes, F and G have a low reliance because they sink(s) and one flood per sink to discover path to the
are unused by source A and appear on only half the simplest source(s). Furthermore, each message must contain a partially
paths of source D. Finally, nodes B, E and H are all unused. constructed path to the destination and similarly the RREP
There is no simplest path from any source to any sink that uses message must additionally contain the (source, sink) path.
any of these nodes. Thus, their reliance value is 0 and their However, it may be argued that any routing protocol that can
loss has no impact on (source, sink) connectivity. exploit unidirectional links has lower efficacy than one that
In general, having assigned reliance values to nodes, it is assumes bidirectionality.
possible to determine which path is the cheapest for each
B. Realistic physical layer
source. It is only necessary to consider the set of simplest
paths; any non-simplest path contains nodes that are In a physical WSN deployment, it may be difficult to define
unnecessary, and thus, a path of lower cost must exist. when two nodes are connected. In reality, a node B receives a
The only simplest path from source A to sink Z is ACZ. Its transmission from a node A based on some probability P
cost is calculated by adding the node reliance values of A, C which is dependent upon the distance between A and B, the
and Z to give a total of 2.25 (0.50 + 0.75 + 1.00). There are power with which the transmission is sent, the sensitivity of
two paths from source D to Z, DFGZ and DCZ. The cost of the receiver and the local noise which includes other radio
DFGZ is the sum of the costs of D, F, G and Z, which gives transmissions. The probability of radio reception may also be
2.00 (0.50 + 0.25 + 0.25 + 1.00). The cost of DCZ is the sum dependent on factors that change over time. For example, poor
of the costs of D, C and Z, which gives 2.25 (0.50 + 0.75 + weather or obstacles moving between the nodes may cause the
1.00). Thus, the optimal routes are ACZ and DFGZ. Assuming reception probability to drop. To address the problem of
the sink has a sufficient energy to receive every message deciding when two nodes are connected, Stojmenovic [13]
generated at the source nodes and assuming that every provides a number of potential solutions. The simplest of these
message sent from sources to sinks consumes the same is for each node to make a number of attempts to communicate
amount of energy on each node then both sources will expire with potential neighbours. The nodes that are reliably
simultaneously and no energy will be wasted at any source. discovered some proportion of times are considered to be
directly connected. It is possible that some nodes capable of
VI. DISCUSSION receiving transmissions may not be included in this list.
However, those nodes are unlikely to be reliable and so it may
In this section we discuss node reliance and its implications
be argued that it is undesirable to use them.
for routing protocols. We also examine the significance of
realistic physical layers in which communications may be C. Alternative node reliance models
unreliable and alternatives to the simplest paths model. Sometimes the use of a node is predetermined by some
A. Node reliance routing protocol earlier routing decision. For example, in Fig. 1, the use of
node F always requires use of node G, which has no impact on
This paper has described a new routing scheme. We now
the path selection or the attribution of node reliance values.
consider how this scheme may be converted into a routing
Where the use of such nodes is deterministic, it is possible to
protocol. The node reliance routing scheme only requires
contract the network such that the two nodes are combined
knowledge of the network topology. However, since the full
into a single virtual supernode. It is hypothesised that by
set of paths between all sources and sinks in the network must
considering this smaller set of nodes, the accuracy of node
be known, it is necessary to have a view of the entire network.
reliance values may be improved.
Preliminary experiments have indicated that the most suitable
A final consideration is in message overhearing. Since
means of gathering the network topology is by link state
radios do not usually have the ability to unicast, a node may
advertisement (LSA), i.e. each node shares its set of
expend energy receiving a message and decoding it before
neighbours with all other nodes in the network. The growth
determining that it was not the intended recipient. Taking
rate of such an operation is O(n2) where n represents the
overhearing into account when calculating a node’s reliance
number of nodes in the network.
value may improve the accuracy of node reliance values
Although this growth rate is high, the use of LSA has a
appreciably and further reduce the energy wasted by sources.
number of advantages. Firstly, the cost of LSA does not
In such a scheme, a node’s reliance is composed from two
increase as a result of increasing the proportion of sources
components: the pure reliance values as described earlier and
since each node has a view of the network. Secondly, non-
an inherited component from the node’s neighbours. The
LSA routing protocols often deal poorly with unidirectional
inherited component is derived from the sum of the pure
links. A common tactic is to assume that every edge is
reliance values of those neighbours from which a node
bidirectional. However, this may result in the selection of an
overhears messages. The intuition is that a well-connected
unusable path, causing the routing protocol to fail. Another
node will overhear many messages and will consequently have
solution is to carry out forward and backward path discovery
a high reliance value reflecting the additional energy
in the same way as DSR (discussed in Section III.A). Such a
Authorized licensed use limited to: Bharat University. Downloaded on July 23,2010 at 08:14:37 UTC from IEEE Xplore. Restrictions apply.
5. expenditure used as a consequence of overhearing. upon for routing. By firstly using those nodes that are least
relied upon, it is theorised that sources will naturally choose
VII. RESULTS paths that either have minimal conflict or whose expiration has
The Castalia 1.3 simulator was used to compare the efficacy the least effect on the network.
of the node reliance routing scheme with other well-known Possible further work includes merging features from other
protocols. Networks of 2, 5, 10, 20 and 40 nodes were placed routing protocols. For example, by additionally considering
in triangular, square, hexagonal and random shaped load balancing, a routing protocol could encourage the use of
deployments. For each network, sources and sinks were nodes with low reliance or with high remaining energy. One
randomly selected and each experiment was repeated 30 times might also consider combining node reliance with a clustering
using different random seeds and different sources and sinks. protocol such as LEACH [5]. Since clusters are independent,
The simulated application caused each source to generate a node reliance values for a cluster would only require the
randomly sized piece of data (between 2 and 100 bytes) every topology of that cluster rather than the entire network. Thus,
five seconds and route it to a sink. For each routing protocol, the scalability of the routing protocol could be improved.
the normalised total data transfer and connectivity weighted Finally, we intend to evaluate the reliance model discussed
transfer (CWT) [14] were calculated. CWT is the product of in Section VI.C, in which message overhearing is taken into
transferred data and the number of different sources that account when calculating a node’s reliance value.
provided the data, raised to some power (2 in these
experiments). It therefore represents the degree to which REFERENCES
sources remain connected to sinks and is thus representative of [1] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-
Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," ACM
well-spent energy. SIGCOMM Computer Communication Review, vol. 24, pp. 234-244, 1994.
TABLE II [2] C. E. Perkins and E. M. Royer, "Ad-hoc On-Demand Distance
COMPARISON OF ROUTING PROTOCOLS
Vector Routing," in Proceedings of the Second IEEE Workshop on Mobile
Topology Computer Systems and Applications, New Orleans, USA, 1999, pp. 90-100.
Heuristic Ordering CWT Transfer
Gathering [3] D. B. Johnson, et al., "DSR: The Dynamic Source Routing
Load LSA Shortest 0.988±0.000 0.983±0.000 Protocol for Multi-Hop Wireless Ad Hoc Networks," in Ad-Hoc Networking,
Balance [8] C. E. Perkins, Ed., ed: Addison-Wesley, 2000, pp. 139-172.
Contracted LSA Shortest 0.985±0.000 0.986±0.000 [4] A. Woo, et al., "Taming the Underlying Challenges of Reliable
Multihop Routing in Sensor Networks," in Los Angeles, California, USA,
Simplest LSA Shortest 0.984±0.000 0.985±0.000 Conference On Embedded Networked Sensor Systems, 2003, pp. 14-27.
[5] W. R. Heinzelman, et al., "Energy-Efficient Communication
Min Hop LSA Shortest 0.972±0.000 0.983±0.000 Protocol for Wireless Microsensor Networks," in 33rd International
Conference on System Sciences, Hawaii, USA, 2000, pp. 8020-8029.
Load DSR Shortest 0.961±0.000 0.961±0.000
[6] H. Dai and R. Han, "A Node-Centric Load Balancing Algorithm
Balance [8]
for Wireless Sensor Networks," in IEEE GLOBECOM - Wireless
Contracted LSA Lexicographic 0.956±0.001 0.972±0.001 Communications, San Francisco, USA, 2003, pp. 548 - 552.
Simplest LSA Lexicographic 0.954±0.001 0.971±0.001 [7] S. Singh, et al., "Power-Aware Routing in Mobile Ad Hoc
Networks," in Mobile Computing and Networking, Dallas, Texas, United
States, 1998, pp. 181-190.
[8] G. J. Pottie and W. J. Kaiser, "Wireless Integrated Network
The results show that load balancing is slightly better than Sensors," Communications of the ACM, vol. 43, pp. 51-58, 2000.
the node reliance approach described here (with a very small [9] B. Zhang and H. T. Mouftah, "Energy-aware on-demand routing
margin). The node reliance approach achieves higher transfer protocols for wireless ad hoc networks," Wireless Networks, vol. 12, pp. 481-
494, 2006.
again, with a small margin. [10] J.-H. Chang and L. Tassiulas, "Routing for Maximum System
We postulate that with the addition of the overhearing Lifetime in Wireless Ad-hoc Networks," in 37th Annual Allerton Conference
compensation, reflecting real–world conditions, described in on Communication, Control and Computing, Monticello, IL, 1999.
[11] L. Lin, et al., "Asymptotically Optimal Power-Aware Routing for
Section VI.C, that this protocol may prove to be superior. Multihop Wireless Networks with Renewable Energy Sources," in 24th Joint
Annual Conference of the IEEE Computer and Communications Societies,
VIII. CONCLUSIONS AND FURTHER WORK Miami, FL, USA, 2005, pp. 1262 - 1272.
[12] D. Y. Kwon, et al., "A Potential Based Routing Protocol for
This paper has examined mechanisms for reducing the Mobile Ad Hoc Networks," presented at the 11th IEEE International
wastage of energy on source nodes in a WSN when routing Conference on High Performance Computing and Communications, Seoul,
data from sources to sinks. Common routing protocol Korea, 2009.
[13] I. Stojmenovic, et al., "Design Guidelines for Routing Protocols in
approaches such as minimum hop routing, minimum energy Ad Hoc and Sensor Networks with a Realistic Physical Layer," IEEE
routing and load balancing routing were argued to be Communications Magazine (Ad Hoc and Sensor Networks Series), vol. 43,
problematic and may not be capable of resolving the problem. pp. 101-106, 2005.
[14] A. W. F. Boyd, et al., "On the Selection of Connectivity-based
A new collaborative routing scheme known as node Metrics for WSNs using a Classification of Application Behaviour," in IEEE
reliance was introduced. Rather than having each source International Conference on Sensor Networks, Ubiquitous, and Trustworthy
dynamically negotiate which path to use, node reliance assigns Computing, Newporn Beach, California, USA (accepted for publication).
a score to each node based on the degree for which it is relied
Authorized licensed use limited to: Bharat University. Downloaded on July 23,2010 at 08:14:37 UTC from IEEE Xplore. Restrictions apply.