International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
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.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
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
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
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.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
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
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
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.
Supporting efficient and scalable multicastingingenioustech
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/
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
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/
On the surface a packet is a chunk of information
but at the deeper level a packet is one unit of binary data capable
of being transferred through a network. Delivering data packets
for highly dynamic mobile ad hoc networks in a reliable and
timely manner. Driven by this issue, an efficient Position-based
Opportunistic Routing (POR) protocol which takes advantage of
the stateless property of geographic routing. In proactive routing
protocols the route discovery and recovery procedures are time
and energy consuming process. Once the path breaks, data
packets will get lost or be delayed for a long time until the
reconstruction of the route, causing transmission interruption.
but Geographic routing (GR) uses location information to
forward data packets, in a hop-by-hop routing fashion. Greedy
forwarding is used to select next hop forwarder with the largest
positive progress toward the destination while void handling
mechanism is triggered to route around communication voids. No
end-to-end route need to be maintained, leading to GR’s high
efficiency and scalability. In the operation of greedy forwarding,
the neighbour which is relatively far away from the sender is
chosen as the next hop. If the node moves out of the sender’s
coverage area, the transmission will fail. In GPSR (a very famous
geographic routing protocol), the MAC-layer failure feedback is
used to offer the packet another chance to reroute.
In MANET, the mobiles nodes are connected dynamically with the help of wireless links without
having a fixed infrastructure or centralized administration. These nodes move freely and organize
themselves arbitrarily thus change the network topology rapidly and unpredictably. As a result, there exits
frequent link breakages which leads to path failures and route discoveries. The route discovery can lead to
overhead which cannot be neglected. Therefore, the fundamental challenge of MANET is to develop a
dynamic routing protocol that efficiently establish routes to deliver the packets with minimum overhead,
high throughput and low end to end delay. In order to handle overhead issues, the proposed system has
presented a novel scheme rebroadcast delay and a rebroadcast probability which will help to reduce the
number of retransmissions thereby improving routing performance. In addition, the proposed system is
compared with existing routing protocol AODV in terms of packet delivery ratio, packet loss and end to
end delay
Analysis of Selfish behavior in energy consumption model based Multihop cellu...ijsrd.com
Many nodes would not transmit during data transmission and they are considered to be in cooperative. To make them cooperative a fair charging policy is used by charging the since and destination nodes so that both of them can benefit from the communication and it can secure the payment. Charging since and destination nodes almost computationally free, and significantly reduce the number of generated and submitted checks. In this way, each intermediate node earns some credits and the destination node pays the total packet relaying cost. To implement this charging policy efficiently, hashing operations are used in the ACK packets to reduce the number of public-key-cryptography operations. Moreover, reducing the overhead of the payment checks is essential for the efficient implementation of the incentive mechanism due to the large number of payment transactions
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Este informe presenta el análisis de los resultados estadísticos de la información contenida en los mapas sociales, realizados en los talleres de la fase I de la estrategia de participación ciudadana “Un lugar para cada cosa y cada cosa en su lugar”, cuyo objetivo consistió en recopilar información relacionada con el estado actual del territorio, identificando potencialidades y conflictos en las áreas analizadas. Este diagnóstico se efectuó con 18 de las 22 comunas que conforman el área urbana del Municipio de Santiago de Cali, donde participaron aproximadamente 360 personas, equivalente al 0,015 % de la población total.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
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.
Supporting efficient and scalable multicastingingenioustech
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/
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
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/
On the surface a packet is a chunk of information
but at the deeper level a packet is one unit of binary data capable
of being transferred through a network. Delivering data packets
for highly dynamic mobile ad hoc networks in a reliable and
timely manner. Driven by this issue, an efficient Position-based
Opportunistic Routing (POR) protocol which takes advantage of
the stateless property of geographic routing. In proactive routing
protocols the route discovery and recovery procedures are time
and energy consuming process. Once the path breaks, data
packets will get lost or be delayed for a long time until the
reconstruction of the route, causing transmission interruption.
but Geographic routing (GR) uses location information to
forward data packets, in a hop-by-hop routing fashion. Greedy
forwarding is used to select next hop forwarder with the largest
positive progress toward the destination while void handling
mechanism is triggered to route around communication voids. No
end-to-end route need to be maintained, leading to GR’s high
efficiency and scalability. In the operation of greedy forwarding,
the neighbour which is relatively far away from the sender is
chosen as the next hop. If the node moves out of the sender’s
coverage area, the transmission will fail. In GPSR (a very famous
geographic routing protocol), the MAC-layer failure feedback is
used to offer the packet another chance to reroute.
In MANET, the mobiles nodes are connected dynamically with the help of wireless links without
having a fixed infrastructure or centralized administration. These nodes move freely and organize
themselves arbitrarily thus change the network topology rapidly and unpredictably. As a result, there exits
frequent link breakages which leads to path failures and route discoveries. The route discovery can lead to
overhead which cannot be neglected. Therefore, the fundamental challenge of MANET is to develop a
dynamic routing protocol that efficiently establish routes to deliver the packets with minimum overhead,
high throughput and low end to end delay. In order to handle overhead issues, the proposed system has
presented a novel scheme rebroadcast delay and a rebroadcast probability which will help to reduce the
number of retransmissions thereby improving routing performance. In addition, the proposed system is
compared with existing routing protocol AODV in terms of packet delivery ratio, packet loss and end to
end delay
Analysis of Selfish behavior in energy consumption model based Multihop cellu...ijsrd.com
Many nodes would not transmit during data transmission and they are considered to be in cooperative. To make them cooperative a fair charging policy is used by charging the since and destination nodes so that both of them can benefit from the communication and it can secure the payment. Charging since and destination nodes almost computationally free, and significantly reduce the number of generated and submitted checks. In this way, each intermediate node earns some credits and the destination node pays the total packet relaying cost. To implement this charging policy efficiently, hashing operations are used in the ACK packets to reduce the number of public-key-cryptography operations. Moreover, reducing the overhead of the payment checks is essential for the efficient implementation of the incentive mechanism due to the large number of payment transactions
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Este informe presenta el análisis de los resultados estadísticos de la información contenida en los mapas sociales, realizados en los talleres de la fase I de la estrategia de participación ciudadana “Un lugar para cada cosa y cada cosa en su lugar”, cuyo objetivo consistió en recopilar información relacionada con el estado actual del territorio, identificando potencialidades y conflictos en las áreas analizadas. Este diagnóstico se efectuó con 18 de las 22 comunas que conforman el área urbana del Municipio de Santiago de Cali, donde participaron aproximadamente 360 personas, equivalente al 0,015 % de la población total.
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Wireless sensor network consists of hundreds to thousands of nodes that communicate among themselves
using radio signals and any node can leave or join the network when required. In Wireless sensor network no
central controller is present. Sensor nodes deployed in the network are responsible for data routing in the network.
Wireless sensor network is used to monitor the environmental conditions such as temperature, pressure, humidity,
sound, noise etc. Wireless Sensor nodes have very small size and have limited resources. In far places, it is very
difficult to recharge or replace the battery of the sensor nodes. In such conditions, focus is to reduce the battery
consumption of the sensor nodes. In this work, a new technique is proposed to enable efficient battery
consumption in a multicasting routing protocol. In this technique, the cluster heads are selected on the basis of
dynamic clustering using neural network. Simulation results show that the proposed technique is more reliable,
energy efficient and provide better results as compared to the existing technique.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
IRJET-Mobility Aware Refined Counter Based Broadcasting Model of MANETIRJET Journal
Manjusha Deshmukh,Ratnadeep Deshmukh, Sangeeta Kakarwal, "Mobility Aware Refined Counter Based Broadcasting Model of MANET", International Research Journal of Engineering and Technology (IRJET), Vol2,issue-01 March 2015. p-ISSN:2395-0056, e-ISSN:2395-0072. www.irjet.net ,published by Fast Track Publications
Abstract
The MANET is a special type of wireles mobile network in which mobile hosts can communicate without any aid of established infrastructure. Broadcast or flooding is a dissemination technique oparamount importance in mobile ad-hoc networks MANETs are generating lots of interest due to their dynamic topology and decentralized administration Due to the mobility of nodes there are many problem occurred during the packet transmission. Basic routing protocols such as Ad hoc on Demand Distance Vecto(AODV), Dynamic source routing (DSR) could lead toissues such as Broadcast Storm Problem, Large power consumption, link failure due to mobility. Counter based approaches inhibit a node from broadcasting a packet based on number of copies of the broadcaspacket received by the node within a random accessdelay time. It relies on the threshold value to decide whether or not to forward broadcast packet. In this paper, model is proposed which refines the counter based threshold based on network density and the mobility of nodes. The paper refined the sparse threshold as low sparse threshold and high sparse threshold and dense threshold as low dense threshold and high dense threshold.
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.
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
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
GridMate - End to end testing is a critical piece to ensure quality and avoid...ThomasParaiso2
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
GridMate - End to end testing is a critical piece to ensure quality and avoid...
Eb34777780
1. Anusha M M, Prof. Padmanayana / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.777-780
777 | P a g e
Stateless Multicasting In Ad-Hoc Networks Guided By Motion
Estimation
Anusha M M (M.Tech)1
, Assoc. Prof. Padmanayana2
1, 2
(Department of Computer Science, Srinivas Institute of Technology, Mangalore, India
Abstract
Multicast routing protocols typically rely
on the a priori creation of a multicast tree (or
mesh), which requires the individual nodes to
maintain state information. In sensor networks
where traffic is bursty, with long periods of
silence between the bursts of data, this multicast
state maintenance adds a large amount of
overhead for no benefit to the application. Thus,
Chen-Hsiang Feng et al. have developed a
stateless receiver-based multicast protocol that
simply uses a list of the multicast members (e.g.,
sinks), embedded in packet headers, to enable
receivers to decide the best way to forward the
multicast traffic. This protocol, called
RBMulticast (Receiver-Based Multicast), exploits
the knowledge of the geographic locations of the
nodes to remove the need for costly state
maintenance (e.g., tree/mesh/neighbor table
maintenance), making it ideally suited for sensor
network multicast applications. But the problem
in this approach is that to know geographic
locations of all nodes at particular node frequent
beacons must be sent by all nodes. Through these
beacons, each node knows about the geographic
locations of all other nodes. But if the node speed
is high & nodes moves great distance in the
beacon interval RBMulticast will fail. Routing
will get longer hops & packet delivery ratio will
drop. To solve this problem, we propose motion
estimation & RBMulticast guided by location
learnt using motion estimation.
Keywords : Ad-Hoc, MANET, multicast routing
protocols, RBMulticast, stateless.
I. INTRODUCTION
Communication in sensor networks is
hindered by the limited energy capacity of the
individual sensor nodes. Consequently, reducing the
total number of packets transmitted throughout the
network is essential for power conservation. For
sensor networks with multiple sink nodes, multicast
routing is an ideal approach to manage and reduce
network traffic. Reducing the number of packets
transmitted when multicasting data requires both
shorter routing paths from the multicast source to
the multicast members, as well as improved
efficiency in terms of the total number of links the
packets traverse to get to all the multicast members,
i.e., the packet should be split off to different
routing branches only when necessary. Shorter
routing paths lead to reduced packet delay, and
improved efficiency leads to a reduction in the
energy consumption from transmitting fewer
packets. These two properties are usually
contradictory to each other, and algorithms must
make a trade-off to best fit their requirements. In the
paper [1], author develop a novel multicast protocol
called RBMulticast (Receiver-Based Multicast).
RBMulticast is a completely stateless multicast
protocol, using only location information with no
tree creation or maintenance or even neighbor table
maintenance, which makes it ideally suited for
sensor networks. Packet routing and splitting
packets into multiple routes relies solely on the
location information of each multicast member,
which is assumed to be known.
RBMulticast is a receiver-based protocol
(as with the ExOR protocol [12]), which means that
a sender can transmit packets
without specifying the next hop node, because the
potential receivers of this packet make the decision
of whether or not to forward this packet in a
distributed manner. This approach for transmitting
packets means that routing is a result of the joint
decisions of all participating nodes. Therefore, no
routing tables are required within the sender node,
as potential receivers decide on a valid route.
RBMulticast was motivated by the cross-
layer protocol XLM [2], which is a receiver-based
unicast protocol designed for WSNs. As in XLM,
RBMulticast assumes a MAC protocol whereby
receivers contend for channel access based on their
assessed contribution towards forwarding the
packet. Nodes with more energy and better links and
nodes that make the most forward progress to the
destination will contend earlier and hence have a
higher chance to become the next hop node.
The solution works fine with good packet
delivery ratio as long the nodes moves slowly &
does not have big variation in between two
consequent beacon intervals. As the nodes move
faster in the beacon intervals, then position
information on which routing is based is erroneous
& false routing path is created. Due to this false
routing path delay increases & also packet delivery
ratio fails. Motivated by this fact, we propose a
effective solution for this problem.
2. Anusha M M, Prof. Padmanayana / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.777-780
778 | P a g e
II. Related Work
Existing multicast protocols for WSNs and
mobile ad hoc networks (MANETs) generally use a
tree to connect the multicast members. For example,
the Takahashi-Matsuyama heuristic can be used to
incrementally build a Steiner tree for
multicast routing [3]. Additionally, multicast
algorithms rely on routing tables maintained at
intermediate nodes for building and maintaining the
multicast tree [4].
Due to the specificities of WSNs, knowing
sensor nodes locations is a reasonable assumption.
In the location-based approach to multicast routing,
nodes obtain location information by default as an
application requirement (e.g., a home fire alarm
would know where it is located) or as provided by a
system module (e.g., GPS or a location-finding
service). If location information is known, multicast
routing is possible based solely on location
information without building any external tree
structure. For example, PBM [5] weights the
number of next hop neighbor nodes and total
geographic distance from the current node to all
destination nodes and compares this to a predefined
threshold to decide whether or not the packet should
be split. Geocast [6] delivers multicast packets by
restricted flooding. Nodes forward multicast packets
only if they are in the Forwarding Zone calculated at
run time from global knowledge of location
information.
RBMulticast differs from these approaches
in that it is completely stateless and hence no costly
state maintenance is required. PBM [5] uses a
similar idea of stateless multicast but requires
information about neighbor nodes. RBMulticast
further eliminates the requirement of knowing a
node’s neighbors by using a receiver-based
mechanism, and only the
location of the nodes is needed for multicast packet
routing. Additionally, RBMulticast includes a list of
the multicast members in the packet header, which
prevents the overhead of building and maintaining a
multicast tree at intermediate sensor nodes, because
all the necessary information for routing the packet
is included within the packet header. We believe
that RBMulticast requires the least state of any
multicast routing protocol and is thus ideally suited
for WSNs Receiver-based communication is a
different way of thinking about protocol design in
that decisions are not required to be made at the
sender side but instead are made at the receiver side.
For example, a source node in ExOR [1] broadcasts
packets that include a potential forwarders’ list
inside the header, and these potential forwarders
will contend to forward the packet through the use
of different back-off times, which depend on the
network distance to the destination. A source node
in XLM [2] broadcasts packets with the
destination’s geographic location in the header, and
every receiver contends to forward the packet
through the use of different back-off times, which
depend on the geographic distance to the
destination. In other words, in receiver-based
routing, decision-making is deferred to the possible
receivers, who make decisions in a distributed
manner.
Receiver-based routing is different from
“On-demand” or “Reactive” routing in that reactive
routing calculates a route at the time a packet is sent
down to the MAC layer. For example, AODV [7]
begins transmission by first sending a
“RouteRequest” to create temporary routes among
intermediate nodes and then transmits data packets
through this route. The ability to transmit data
without requiring a route to be formed is enabled via
extra knowledge in the MAC layer and join
decisions of sensor nodes. For example, nodes could
be assigned an ID in a structured manner and hence
next hop nodes are implied in the destination
address itself. In this case, packets are broadcast by
the MAC layer, and only potential next-hop nodes
relay it to the destination. As another example,
nodes may have statistics (e.g., energy, channel
quality) that could assist in making forwarding
decisions. A source node can send an RTS packet,
enabling potential receivers to contend for the
ability to forward the packet, with the receiver node
that has the best route being the first to return a CTS
to receive this packet.
We simulated the use of RBMulticast
under different network densities for large-scale
WSNs.There are a total of either 50, 150 or 300
nodes randomly distributed throughout the
simulation area. The source node is located at the
bottom left corner (0,0), and the multicast receiver
nodes are scattered over the boundary of the region.
We set the nodes movement as 30m/sec & set the
beacon interval as 5 sec.
From this we see the delay is in order of
seconds even for a network of 50 nodes. This
becomes the objective for the paper to reduce this
delay.
3. Anusha M M, Prof. Padmanayana / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.777-780
779 | P a g e
III. PROPOSED SOLUTION
As we analyze the RBMulticast protocol,
the delay is caused due to inaccurate position
information available at nodes. The inaccurate
information is more as the node speed increases.
In most MANET networks, the nodes don’t
do random movement they follow a pattern in the
movement. The pattern is either directional, circular
etc. If node initial position & its pattern of
movement is known well in advance at each node,
then the position of a node at particular time can be
easily estimated. This position information is then
used by the RBMulticast protocol to do region based
routing.
The protocol works as follows. During the
system initialization time, each node will broadcast
information of its current position & its pattern of
movement to all other nodes. After broadcasting this
information each node must wait for configurable
time period T before starting the movement.
If the node wants to change the pattern of
movement, it must stop its movement & broadcast
the change request to all nodes. It must wait for time
T before starting the movement. The time T is
expected time that broadcast reaches all the nodes.
Each node caches the position & pattern of
movement in its memory.
Whenever the nodes receives RBMulticast
receive packet, it has to first find the estimated
movement of the targets in the receive packet.
The estimation must be done using the
position & pattern of movement. The pattern is
nothing but a combination of speed & direction.
Say initial position of node is (100,100) in a total
plane of 1000 x 1000.
If it moves in direction of 45 degree at speed of 10
m/ sec , then the new position at any point of time
can be estimated using trigonometric formula
Y(t) = y(0) * tan 45 + t * 10;
X(t) = x(0) * tan 45 + t * 10;
Using the information of estimated position, the
RBMulticast Send procedure will split targets to
region & forward multicast packets.
IV. PERFORMANCE ANALYSIS
We implemented the RBMulticast and the
proposed estimation method to reduce delay &
increase packet delivery ratio using JProwler
simulator. We simulated for different speed of 10 to
50 for a network of 100 nodes. For each node
density we measure the average packet delay &
packet delivery ratio with RB Multicast and
proposed extension to RBMulticast.
The packet delivery ratio drops faster in
RBMulticast compared to our approach as speed of
movement of node increases.
The delay increases faster in RBMulticast compared
to our approach as the speed of movement increases.
V. CONCLUSION AND
ENHANCEMENTS
In this paper, we improved the
RBMulticast by adding motion estimation to learn
the position of nodes with our proposed solution.
Though simulation we proved that out approach
reduces the delay & also increases the packet
delivery ratio. In future we plan to do a detailed
analysis for different patterns of movement to arrive
at the estimation method for finding the position of
nodes.
REFERENCES
[1] S. Biswas and R. Morris, “Opportunistic
routing in multi-hop wireless networks,”
SIGCOMM Computer Communications
Review, vol. 34, no. 1,pp. 69–74, 2004.
4. Anusha M M, Prof. Padmanayana / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.777-780
780 | P a g e
[2] I. Akyildiz, M. Vuran, and O. Akan, “A
cross-layer protocol for Wireless sensor
networks,” in Proc. of CISS 2006, March
2006.
[3] K. Chen and K. Nahrstedt, “Effective
location-guided tree construction
algorithms for small group multicast in
manet,” INFOCOM. Twenty-First Annual
Joint Conference of the IEEE Computer
and Communications Societies.
Proceedings. IEEE, vol. 3, pp. 1180–1189,
2002.
[4] A. Okura, T. Ihara, and A. Miura, “Bam:
branch aggregation multicast for wireless
sensor networks,” Mobile Adhoc and
Sensor Systems Conference, 2005. IEEE
International Conference on, pp. 10 pp.–,
Nov. 2005.
[5] M. M. andand Holger Fuler, J. Widmer,
and T. Lang, “Positionbased multicast
routing for mobile ad-hoc networks,”
SIGMOBILE Mob.Comput. Commun. Rev.,
vol. 7, no. 3, pp. 53–55, 2003.
[6] Y.-B. Ko and N. H. Vaidya, “Geocasting in
mobile ad hoc networks: Location-based
multicast algorithms,” wmcsa, vol. 0, p.
101, 1999.
[7] “Ad-hoc on-demand distance vector
routing,” Mobile Computing Systems
and Applications, 1999. Proceedings.
WMCSA. Second IEEE Workshop on, pp.
90–100, 1999.
[8] B. Karp and H. T. Kung, “GPSR: greedy
perimeter stateless routing for wireless
networks,” in MobiCom ’00: Proceedings
of the 6th annual international conference
on Mobile computing and networking. New
York, NY, USA: ACM, 2000, pp. 243–
254.
[9] V. D. Park and M. S. Corson, “A highly
adaptive distributed routing algorithm for
mobile wireless networks,” infocom, vol.
00, p. 1405, 1997.
[10] “UPS: Unified Protocol Stack for Wireless
Sensor Networks,” under submission.
[11] H. Chen and Y. Li, “Performance model of
ieee 802.11 dcf with variable packet
length,” Communications Letters, IEEE,
vol. 8, no. 3, pp. 186.
[12] Chen-Hsiang Feng, Yuqun Zhang, Ilker
Demirkol, Wendi B. Heinzelman,
“Stateless Multicast Protocol”, IEEE
Transactions on Mobile Computing, Vol.
11, No.2, February 2012.