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 EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
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.
Application independent based multicast routing protocols in mobile ad hoc ne...Alexander Decker
This document summarizes and compares several application-independent multicast routing protocols for mobile ad hoc networks (MANETs). It discusses the key challenges in designing multicast routing protocols for MANETs, including robustness, efficiency, control overhead, and dependency on unicast routing. It also presents a reference model architecture for multicast routing protocols and classifications based on topology (tree-based vs. mesh-based) and approach (reactive vs. proactive). Several specific multicast routing protocols are described, including AMRoute, AMRIS, and ODMRP, focusing on their mechanisms for group management, tree/mesh construction, and maintenance in dynamic network conditions.
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.
Performance Evaluation of Routing Protocol on AODV and DSR under Wormhole Attackijcncs
This document evaluates the performance of the AODV and DSR routing protocols under wormhole attacks in a mobile ad hoc network (MANET) simulation. The simulation analyzed packet delivery ratio, end-to-end delay, and throughput with and without wormhole attacks. Without attacks, AODV performed better than DSR for packet delivery ratio and end-to-end delay, while DSR had higher throughput due to using multiple paths. Under wormhole attacks, both protocols saw degraded performance, with DSR being more severely impacted due to its vulnerability to the attacks. The study aims to compare how the two reactive routing protocols are affected by wormhole attacks in MANETs.
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.
This document discusses routing strategies in delay tolerant networks (DTNs) using wireless sensor network (WSN) nodes for localization applications. It first provides background on WSNs and DTNs, and then reviews common DTN routing protocols like epidemic routing, PROPHET, spray and wait, and MaxProp. The aim of the dissertation is to propose a new routing protocol for DTNs using WSN nodes where GPS is unavailable. It discusses using a hybrid of knowledge-based and additional node-based routing. The document outlines simulating the proposed filtered flooding protocol in NS-2 to evaluate delivery ratio and delay for a mining activity scenario. Results show delivery ratio is high for small networks but decreases with more nodes, while delay is
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.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
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.
Application independent based multicast routing protocols in mobile ad hoc ne...Alexander Decker
This document summarizes and compares several application-independent multicast routing protocols for mobile ad hoc networks (MANETs). It discusses the key challenges in designing multicast routing protocols for MANETs, including robustness, efficiency, control overhead, and dependency on unicast routing. It also presents a reference model architecture for multicast routing protocols and classifications based on topology (tree-based vs. mesh-based) and approach (reactive vs. proactive). Several specific multicast routing protocols are described, including AMRoute, AMRIS, and ODMRP, focusing on their mechanisms for group management, tree/mesh construction, and maintenance in dynamic network conditions.
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.
Performance Evaluation of Routing Protocol on AODV and DSR under Wormhole Attackijcncs
This document evaluates the performance of the AODV and DSR routing protocols under wormhole attacks in a mobile ad hoc network (MANET) simulation. The simulation analyzed packet delivery ratio, end-to-end delay, and throughput with and without wormhole attacks. Without attacks, AODV performed better than DSR for packet delivery ratio and end-to-end delay, while DSR had higher throughput due to using multiple paths. Under wormhole attacks, both protocols saw degraded performance, with DSR being more severely impacted due to its vulnerability to the attacks. The study aims to compare how the two reactive routing protocols are affected by wormhole attacks in MANETs.
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.
This document discusses routing strategies in delay tolerant networks (DTNs) using wireless sensor network (WSN) nodes for localization applications. It first provides background on WSNs and DTNs, and then reviews common DTN routing protocols like epidemic routing, PROPHET, spray and wait, and MaxProp. The aim of the dissertation is to propose a new routing protocol for DTNs using WSN nodes where GPS is unavailable. It discusses using a hybrid of knowledge-based and additional node-based routing. The document outlines simulating the proposed filtered flooding protocol in NS-2 to evaluate delivery ratio and delay for a mining activity scenario. Results show delivery ratio is high for small networks but decreases with more nodes, while delay is
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.
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.
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/
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
Routing protocol for delay tolerant network a survey and comparisonPhearin Sok
Routing protocols for delay tolerant networks can be categorized as either flooding or forwarding strategies. Flooding strategies replicate messages to multiple nodes to increase delivery probability but use more resources, while forwarding strategies select a single path using network knowledge to minimize resource usage but have lower delivery probability. The survey compares these routing protocol categories and their advantages for different applications in delay tolerant networks, which must deal with intermittent connectivity and large delays.
Delay tolerant networks allow communication in environments with intermittent connectivity, tolerating delays of days. They are also called intermittently connected mobile networks. Key challenges include unpredictable encounter schedules between nodes, limited network capacity, storage constraints on nodes, and energy efficiency. Routing protocols for DTNs include epidemic routing, where nodes exchange all data on encounter, and schemes that use knowledge of node locations or mobility patterns to move data closer to destinations opportunistically during encounters. Gradient routing uses metrics representing a node's delivery ability to pass messages to nodes moving the message progressively closer to the destination. Spray and wait limits message copies to control overhead. Security risks in DTNs include denial of service attacks due to long latencies enabling resource depletion, and
This document discusses a new approach for clustering in mobile ad hoc networks (MANETs) called the cluster head gateway (CHG) approach. The CHG approach aims to reduce overhead, increase energy efficiency, and improve reliability in MANETs. It removes the election of separate cluster heads and gateway nodes, instead having a single node act as both the cluster head and gateway for its cluster. This node is called the CHG node. The approach also introduces a prediction table to select a backup CHG node in case the primary CHG moves or fails. This helps maintain the cluster structure and routing information for increased reliability.
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.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
This document summarizes and categorizes different weight-based clustering algorithms that have been designed for mobile ad hoc networks (MANETs). It discusses:
1) The basic concept of clustering in MANETs and the roles of standard nodes, cluster heads, and cluster gateways.
2) Two categories of clustering algorithms - simple (e.g. lowest ID, connectivity-based) and enhanced (e.g. k-cluster, hierarchical) approaches.
3) Weighted clustering, where each node calculates a weight based on attributes like speed, degree, power, and energy to elect cluster heads.
This document summarizes a research paper on an efficient geographic multicast protocol (EGMP) for mobile ad hoc networks (MANETs). EGMP uses a two-tier virtual zone-based structure to improve scalability. Zones are constructed based on location, and zone leaders manage local group membership and join/leave requests. EGMP builds a network-wide multicast tree through zone interconnections. Packet forwarding relies on geographic routing to determine next hops. Simulation results indicate EGMP's per-node overhead remains relatively constant with increasing network and group size, demonstrating its scalability. The objectives are to design a more scalable and reliable multicast protocol for dynamic MANETs.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
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.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
The document proposes a distributed adaptive opportunistic routing scheme for wireless ad hoc networks. It uses a reinforcement learning framework to route packets opportunistically even without knowledge of channel statistics or network models. This approach jointly addresses learning and routing opportunistically by exploiting transmission successes. Nodes learn to optimally explore and exploit opportunities in the network to minimize the expected average per packet cost of routing from source to destination.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
This document describes a routing protocol designed for reliable and efficient communication in wireless sensor networks (WSNs). It discusses four existing routing protocols - Gradient-Based Routing (GBR), Gradient Broadcast (GRAB), Dynamic Source Routing (DSR), and Adhoc On-demand Distance Vector Routing (AODV) - and analyzes their performance tradeoffs. It then proposes a new light-weight routing protocol called Efficient and Reliable routing (EAR) that aims to achieve reliable and efficient routing in single-hub and multi-hub WSNs while minimizing energy consumption and communication overhead. The protocol design and operation are explained in detail.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
This document describes a proposed opportunistic routing scheme for adaptive clustering in mobile ad-hoc networks. It presents the On-Demand Opportunistic Group mobility based clustering (ODOGMBC) algorithm for forming clusters and predicting cluster mobility. The algorithm uses neighborhood update to maintain routing information as the network topology changes. It also describes cooperative opportunistic routing which provides responsive data transport while managing nodes efficiently under heavy loads. Performance evaluation shows the proposed scheme achieves higher packet delivery ratio, throughput and lower delay compared to non-clustered AODV routing.
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.
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/
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
Routing protocol for delay tolerant network a survey and comparisonPhearin Sok
Routing protocols for delay tolerant networks can be categorized as either flooding or forwarding strategies. Flooding strategies replicate messages to multiple nodes to increase delivery probability but use more resources, while forwarding strategies select a single path using network knowledge to minimize resource usage but have lower delivery probability. The survey compares these routing protocol categories and their advantages for different applications in delay tolerant networks, which must deal with intermittent connectivity and large delays.
Delay tolerant networks allow communication in environments with intermittent connectivity, tolerating delays of days. They are also called intermittently connected mobile networks. Key challenges include unpredictable encounter schedules between nodes, limited network capacity, storage constraints on nodes, and energy efficiency. Routing protocols for DTNs include epidemic routing, where nodes exchange all data on encounter, and schemes that use knowledge of node locations or mobility patterns to move data closer to destinations opportunistically during encounters. Gradient routing uses metrics representing a node's delivery ability to pass messages to nodes moving the message progressively closer to the destination. Spray and wait limits message copies to control overhead. Security risks in DTNs include denial of service attacks due to long latencies enabling resource depletion, and
This document discusses a new approach for clustering in mobile ad hoc networks (MANETs) called the cluster head gateway (CHG) approach. The CHG approach aims to reduce overhead, increase energy efficiency, and improve reliability in MANETs. It removes the election of separate cluster heads and gateway nodes, instead having a single node act as both the cluster head and gateway for its cluster. This node is called the CHG node. The approach also introduces a prediction table to select a backup CHG node in case the primary CHG moves or fails. This helps maintain the cluster structure and routing information for increased reliability.
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.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
This document summarizes and categorizes different weight-based clustering algorithms that have been designed for mobile ad hoc networks (MANETs). It discusses:
1) The basic concept of clustering in MANETs and the roles of standard nodes, cluster heads, and cluster gateways.
2) Two categories of clustering algorithms - simple (e.g. lowest ID, connectivity-based) and enhanced (e.g. k-cluster, hierarchical) approaches.
3) Weighted clustering, where each node calculates a weight based on attributes like speed, degree, power, and energy to elect cluster heads.
This document summarizes a research paper on an efficient geographic multicast protocol (EGMP) for mobile ad hoc networks (MANETs). EGMP uses a two-tier virtual zone-based structure to improve scalability. Zones are constructed based on location, and zone leaders manage local group membership and join/leave requests. EGMP builds a network-wide multicast tree through zone interconnections. Packet forwarding relies on geographic routing to determine next hops. Simulation results indicate EGMP's per-node overhead remains relatively constant with increasing network and group size, demonstrating its scalability. The objectives are to design a more scalable and reliable multicast protocol for dynamic MANETs.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
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.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
The document proposes a distributed adaptive opportunistic routing scheme for wireless ad hoc networks. It uses a reinforcement learning framework to route packets opportunistically even without knowledge of channel statistics or network models. This approach jointly addresses learning and routing opportunistically by exploiting transmission successes. Nodes learn to optimally explore and exploit opportunities in the network to minimize the expected average per packet cost of routing from source to destination.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
This document describes a routing protocol designed for reliable and efficient communication in wireless sensor networks (WSNs). It discusses four existing routing protocols - Gradient-Based Routing (GBR), Gradient Broadcast (GRAB), Dynamic Source Routing (DSR), and Adhoc On-demand Distance Vector Routing (AODV) - and analyzes their performance tradeoffs. It then proposes a new light-weight routing protocol called Efficient and Reliable routing (EAR) that aims to achieve reliable and efficient routing in single-hub and multi-hub WSNs while minimizing energy consumption and communication overhead. The protocol design and operation are explained in detail.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
This document describes a proposed opportunistic routing scheme for adaptive clustering in mobile ad-hoc networks. It presents the On-Demand Opportunistic Group mobility based clustering (ODOGMBC) algorithm for forming clusters and predicting cluster mobility. The algorithm uses neighborhood update to maintain routing information as the network topology changes. It also describes cooperative opportunistic routing which provides responsive data transport while managing nodes efficiently under heavy loads. Performance evaluation shows the proposed scheme achieves higher packet delivery ratio, throughput and lower delay compared to non-clustered AODV routing.
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of packets simultaneously in MANETs that using the slot assignments approach, when additional channels are transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the mobile ad hoc network for collision control and reliable communication. This paper proposes two new broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced performance within the different environments. Evaluation of simulation results with other well-known exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best within the wireless network and channel bandwidths are well utilized within the network.
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like
flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of
packets simultaneously in MANETs that using the slot assignments approach, when additional channels are
transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of
the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and
therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the
mobile ad hoc network for collision control and reliable communication. This paper proposes two new
broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of
efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced
performance within the different environments. Evaluation of simulation results with other well-known
exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best
within the wireless network and channel bandwidths are well utilized within the network.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
This document analyzes the performance of a neighbor knowledge based broadcast protocol called BCAST in mobile ad hoc networks using network simulator NS-2. It varies the number of data senders (multicast group size) and data sending rate to analyze packet delivery ratio, end-to-end delay, packet loss probability, and network control overhead. The simulation results show that BCAST generally performs well and provides robust performance even with high traffic loads.
ADAPTIVE AODV ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKSijasuc
This document proposes techniques to improve the efficiency of route request flooding in mobile ad hoc networks. It presents two new enhancements to the Ad-hoc On-Demand Distance Vector (AODV) routing protocol: EAODV1, which selects neighboring nodes to forward route requests based on mobility and recent usage for moderate node speeds; and EAODV2, which alternates between flooding and selection based on mobility and usage for high speeds. It also introduces Adaptive AODV (AAODV), which automatically switches between EAODV1 and EAODV2 based on measured node mobility. Simulation results show these methods reduce overhead, improve packet delivery ratio, and reduce end-to-end delay compared to standard AODV
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.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
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.
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.
Broadcast is one of the most important approach in distributed memory parallel computers that is used to
find a routing approach from a one source to all nodes in the mesh. Broadcasting is a data communication task in which corresponds to one-to-all communication. Routing schema is the approach that used to determine the road that is used to send a message from a source node to destination nodes. In this paper, we propose an efficient two algorithms for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. In wormhole routing large network packets are broken into small pieces called FLITs (flow control digits). The destination address is kept in the first flit which is called the header flit and sets up the
routing behavior for all subsequent flits associated with the packet. If the packets of the message can’t deliver to their destination and there is a cyclic dependence over the channels in the network, then the deadlock even is occurred. In this paper we introduce an efficient two algorithms, Three-Dimension Hamiltonian Broadcast (3-DHB) and Three-Dimension Six Ports Hamiltonian Broadcast (3-DSPHB) which used broadcast communication facility with deadlock-free wormhole routing in general threedimensional networks. In this paper the behaviors of these algorithms were compared using simulation. The results presented in this paper indicate that the advantage of the proposed algorithms.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
The document proposes a new broadcasting algorithm called Y-Hamiltonian Layers Broadcast (Y-HLB) for wormhole-routed 3D mesh networks. It divides the 3D mesh into layers that are modeled as Hamiltonian paths. The Y-HLB algorithm routes messages along these Hamiltonian paths in an efficient manner to broadcast to all nodes. Previous related work on broadcasting algorithms for wormhole-routed 3D meshes are also discussed, including how they divide the network and route messages. Simulation results show Y-HLB performs better than these previous algorithms in terms of reducing broadcast latency.
The document presents a new broadcasting algorithm called Y-Hamiltonian Layers Broadcast (Y-HLB) for wormhole-routed 3D mesh networks. The algorithm is based on using a Hamiltonian model to divide the 3D mesh into layers. It then introduces an efficient broadcasting approach that routes messages across these layers using the Hamiltonian path labeling. Simulation results show the average performance of the proposed Y-HLB algorithm is better than previous broadcasting algorithms for wormhole-routed 3D meshes in reducing broadcast latency and simplifying the routing approach.
Similar to PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER APPROACH (20)
E-commerce Development Services- Hornet DynamicsHornet Dynamics
For any business hoping to succeed in the digital age, having a strong online presence is crucial. We offer Ecommerce Development Services that are customized according to your business requirements and client preferences, enabling you to create a dynamic, safe, and user-friendly online store.
Malibou Pitch Deck For Its €3M Seed Roundsjcobrien
French start-up Malibou raised a €3 million Seed Round to develop its payroll and human resources
management platform for VSEs and SMEs. The financing round was led by investors Breega, Y Combinator, and FCVC.
E-Invoicing Implementation: A Step-by-Step Guide for Saudi Arabian CompaniesQuickdice ERP
Explore the seamless transition to e-invoicing with this comprehensive guide tailored for Saudi Arabian businesses. Navigate the process effortlessly with step-by-step instructions designed to streamline implementation and enhance efficiency.
Mobile App Development Company In Noida | Drona InfotechDrona Infotech
Drona Infotech is a premier mobile app development company in Noida, providing cutting-edge solutions for businesses.
Visit Us For : https://www.dronainfotech.com/mobile-application-development/
The Rising Future of CPaaS in the Middle East 2024Yara Milbes
Explore "The Rising Future of CPaaS in the Middle East in 2024" with this comprehensive PPT presentation. Discover how Communication Platforms as a Service (CPaaS) is transforming communication across various sectors in the Middle East.
Why Apache Kafka Clusters Are Like Galaxies (And Other Cosmic Kafka Quandarie...Paul Brebner
Closing talk for the Performance Engineering track at Community Over Code EU (Bratislava, Slovakia, June 5 2024) https://eu.communityovercode.org/sessions/2024/why-apache-kafka-clusters-are-like-galaxies-and-other-cosmic-kafka-quandaries-explored/ Instaclustr (now part of NetApp) manages 100s of Apache Kafka clusters of many different sizes, for a variety of use cases and customers. For the last 7 years I’ve been focused outwardly on exploring Kafka application development challenges, but recently I decided to look inward and see what I could discover about the performance, scalability and resource characteristics of the Kafka clusters themselves. Using a suite of Performance Engineering techniques, I will reveal some surprising discoveries about cosmic Kafka mysteries in our data centres, related to: cluster sizes and distribution (using Zipf’s Law), horizontal vs. vertical scalability, and predicting Kafka performance using metrics, modelling and regression techniques. These insights are relevant to Kafka developers and operators.
DECODING JAVA THREAD DUMPS: MASTER THE ART OF ANALYSISTier1 app
Are you ready to unlock the secrets hidden within Java thread dumps? Join us for a hands-on session where we'll delve into effective troubleshooting patterns to swiftly identify the root causes of production problems. Discover the right tools, techniques, and best practices while exploring *real-world case studies of major outages* in Fortune 500 enterprises. Engage in interactive lab exercises where you'll have the opportunity to troubleshoot thread dumps and uncover performance issues firsthand. Join us and become a master of Java thread dump analysis!
How Can Hiring A Mobile App Development Company Help Your Business Grow?ToXSL Technologies
ToXSL Technologies is an award-winning Mobile App Development Company in Dubai that helps businesses reshape their digital possibilities with custom app services. As a top app development company in Dubai, we offer highly engaging iOS & Android app solutions. https://rb.gy/necdnt
What to do when you have a perfect model for your software but you are constrained by an imperfect business model?
This talk explores the challenges of bringing modelling rigour to the business and strategy levels, and talking to your non-technical counterparts in the process.
8 Best Automated Android App Testing Tool and Framework in 2024.pdfkalichargn70th171
Regarding mobile operating systems, two major players dominate our thoughts: Android and iPhone. With Android leading the market, software development companies are focused on delivering apps compatible with this OS. Ensuring an app's functionality across various Android devices, OS versions, and hardware specifications is critical, making Android app testing essential.
Preparing Non - Technical Founders for Engaging a Tech AgencyISH Technologies
Preparing non-technical founders before engaging a tech agency is crucial for the success of their projects. It starts with clearly defining their vision and goals, conducting thorough market research, and gaining a basic understanding of relevant technologies. Setting realistic expectations and preparing a detailed project brief are essential steps. Founders should select a tech agency with a proven track record and establish clear communication channels. Additionally, addressing legal and contractual considerations and planning for post-launch support are vital to ensure a smooth and successful collaboration. This preparation empowers non-technical founders to effectively communicate their needs and work seamlessly with their chosen tech agency.Visit our site to get more details about this. Contact us today www.ishtechnologies.com.au
Using Query Store in Azure PostgreSQL to Understand Query PerformanceGrant Fritchey
Microsoft has added an excellent new extension in PostgreSQL on their Azure Platform. This session, presented at Posette 2024, covers what Query Store is and the types of information you can get out of it.
UI5con 2024 - Bring Your Own Design SystemPeter Muessig
How do you combine the OpenUI5/SAPUI5 programming model with a design system that makes its controls available as Web Components? Since OpenUI5/SAPUI5 1.120, the framework supports the integration of any Web Components. This makes it possible, for example, to natively embed own Web Components of your design system which are created with Stencil. The integration embeds the Web Components in a way that they can be used naturally in XMLViews, like with standard UI5 controls, and can be bound with data binding. Learn how you can also make use of the Web Components base class in OpenUI5/SAPUI5 to also integrate your Web Components and get inspired by the solution to generate a custom UI5 library providing the Web Components control wrappers for the native ones.
Unveiling the Advantages of Agile Software Development.pdfbrainerhub1
Learn about Agile Software Development's advantages. Simplify your workflow to spur quicker innovation. Jump right in! We have also discussed the advantages.
Unveiling the Advantages of Agile Software Development.pdf
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER APPROACH
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
10.5121/ijasuc.2010.1203 22
PERFORMANCE ANALYSIS OF BROADCASTING IN
MOBILE AD HOC NETWORKS USING CLUSTER
APPROACH
D.Sivaganesan1
and Dr.R.Venkatesan2
1
Department of Computer Science and Engineering, Karpagam College of Engineering,
Coimbatore, Tamilnadu, India.
dsg_pol@rediffmail.com
2
Department of Information Technology, PSG College of Technology, Coimbatore,
Tamilnadu, India.
ABSTRACT
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.
KEYWORDS
MANET, Connected Dominating Set, Cluster, Ad Hoc Network
1. INTRODUCTION
A mobile ad hoc network (MANET) is a special type of wireless mobile network which
forms a temporary network without the aid of an established infrastructure or a
centralised administration. Each node in MANET is a router. If a source node is unable to
send a message directly to its destination node due to limited transmission range, the
source node uses intermediate nodes to forward the message towards the destination node.
Broadcasting is the process in which a source node sends a message to all other
nodes in MANET[3]. Broadcasting is important in MANET for routing information
discovery,[1] for instance, protocols such as dynamic source routing (DSR) , ad hoc on
demand distance vector (AODV)[2][9] , and location aided routing use broadcasting to
establish routes. Broadcasting MANET poses more challenges than in wired networks
due to node mobility and scarce system resources. Because of the mobility there is no
single optimal scheme for all scenarios. Mobile ad hoc networks (MANETs) are collections
of autonomous mobile hosts without the help of centre base stations. Applying such networks
into practice brings many challenges to the protocol design, such as routing in highly dynamic
networks [10], allocating shared wireless channels and saving limited bandwidth. Trade offs are
needed in the protocol design to achieve these conflicting goals. The broadcast nature of
wireless transmissions, that all the neighbours of a host will receive the packet when the host
transmits a packet. Extremely limits the scalability of the network. When the size of the network
increases and the network becomes dense, even a simple broadcast operation may trigger a huge
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
23
transmission collision and contention that may lead to the collapse of the whole network [16].
This is referred to as the broadcast storm problem [4]. Therefore, building some type of
backbone infrastructure for a network can enhance the performance of the whole network when
the network becomes dense. Basically, the backbone of a network converts a dense network to a
sparse one to relieve the communication overhead of the whole network. The cluster structure is
a simple backbone infrastructure which has only two levels of hierarchical structure. The
network is partitioned into a group of clusters. Each cluster has one cluster head that dominates
all other members in the cluster. Two cluster heads cannot be neighbours. Gateways are those
non-cluster head nodes that have at least one neighbour that belongs to other clusters. It is easy
to see that cluster heads and gateways form a backbone of the original network. Theoretically,
we can describe a MANET as a unit disk graph G=(V, E), where the node set V represents a set
of wireless mobile hosts and the edge set E represents a set of bi-directional links between the
neighbouring hosts, assuming all hosts have the same transmission range r. Two hosts are
considered neighbours if and only if their geographic distance is less than r. We use Nk
(v) to
represent v’s h-hop neighbour set, including v itself. Generally, a backbone infrastructure of a
network can he considered as a connected dominating set (CDS) [7] of a given graph. A
dominating set (DS) is a subset of nodes such that every node in the graph is either in the set or
has an edge linked to a node in the set. If the sub graph induced from a DS of the graph is
connected, the DS is a CDS. Another concept, an independent set (IS) is defined as a set of
nodes of the network; in which each pair of nodes are not neighbours. In a cluster network, the
set of cluster heads is an IS and the set of the cluster heads and gateways is a CDS [15].
2. RELATED WORK
Flooding is one of the earliest protocols for multicasting and broadcasting in ad hoc networks
[2], [3]. In flooding, every node in the network transmits the message to its neighbours after
receiving it. Flooding can lead to severe contention ,collision and redundant transmissions: a
situation referred to as broadcast storm [1].In a series of papers [4], [5], [6], it was proposed that
a connected dominating set (CDS)[7] can be used as a virtual backbone for routing in ad hoc
networks. Williams and Camp [3] have classified the broadcast protocols into flooding,
probability-based, counter based, distance-based, location-based and neighbour knowledge
schemes. Similarly, neighbour knowledge schemes can be divided into selecting forwarding
neighbours and clustering-based. In counter-based scheme inhibits the rebroadcast if the packet
has already been received for more than a given number of times. In the probabilistic scheme
when receiving a broadcast packet for the first time, a node rebroadcasts the packet with a
probability p; when p=1, this scheme reduces to blind flooding. In the distance-based scheme a
node rebroadcasts the packet only if the distance between the sender and the receiver is larger
than a given threshold. In the location-based scheme, a node rebroadcasts a packet only when
the additional coverage due to the new emission is larger than a certain bound. In the selecting
forwarding neighbours a broadcasting node selects some of its1-hop neighbours as rebroadcast
nodes. Finally, the cluster structure is a simple backbone infrastructure whereby the network is
partitioned into a group of clusters. Each cluster has one cluster head that dominates all other
members in the cluster. A node is called a gateway if it lies within the transmission range of two
or more cluster heads. Gateway nodes are generally used for routing between clusters. The
rebroadcast is performed by cluster heads and gateways.
In this paper, we report results from Glomosim. 2.03 as the simulation platform. Glomosim 2.03
is a popular network simulator which has originally been designed for wireless networks and
has been support simulations in MANET settings in order to characterise neighbourhood’s
information, such as the average number of neighbours of a given node by means of ‘Hello’
packet exchanges. We proposed cluster structure for broadcasting in MANETs for analysing the
performance of network collision, delay for packet transmission, energy consumption and the
throughput.
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
24
3. PRELIMINARIES
3.1. Ad Hoc Broadcasting Approach
In this approach, only nodes selected as gateway nodes and a broadcast message header are
allowed to rebroadcast the message. The approach is described as follow
1. Locate all two hop neighbours that can only be reached by a one hop neighbour.
Select these one hop neighbours as gateways.
2. Calculate the cover set that will receive the message from the current gateway set.
3. For the neighbours not yet in the gateway set, find the one that would cover the most two
hop neighbours not in the cover set. Set this one hop neighbour as a gateway.
4. Repeat process 2 and 3 until all two hop neighbours are covered.
5. When a node receives a message and is a gateway, this node determines which of its
Neighbours already received the message in the same transmission. These neighbours
are considered already covered and are dropped from the neighbour used to select the
next hop gateways.
In Figure 1. node 2 has 1, 5 and 6 nodes as one hop neighbours, 3 and 4 nodes has two hop
neighbours. Node 3 can be reached through node 1 as a one hop neighbour of node 2. Node 4
can be reached through node 1 or node 5 as one hop neighbours of node 2. Node 3 selects node
1 as a gateway to rebroadcast the message to nodes 3 and 4. Upon receiving the message node 5
will not rebroadcast the message as it is not a gateway.
The Limitations are deduced from a detailed comparative study in [12].
1. All methods apart from neighbour based methods require more rebroadcasts,
with respect to the number of retransmitting nodes [15].
2. Because it does not use local information to decide whether to rebroadcast or
not, the Ad hoc broadcasting approaches have difficulties in a very high
mobile MANET.
Figure 1. Ad Hoc Broadcasting Approach
3.2. Cluster Network
The clustering problem can now be defined formally. We are given an undirected graph G
= (V, E) representing a communication network where the vertices are the nodes in the
network and the edges are the communication links. The clustering process first divides V
into a collection of (not necessarily disjoint) subsets {V1 , V2 , . . . , Vk }, such that each
subset Vi induces a connected sub graph of G. Note that these induced sub graphs can
overlap. Each such vertex subset is a cluster [11] [12] [13]. Ideally, the size of the
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
25
clusters falls in a desired range and the induced sub graphs have small diameters. Note
that the clustering approach has been used to address traffic coordination schemes,
routing problems and fault tolerance issues. Note that cluster approach proposed in
[15] was adopted in order to reduce the complexity of the storm broadcasting problem .
Each node in a MANET periodically sends ”Hello” messages to advertise its presence.
Each node has a unique ID. A cluster is a set of nodes formed as follows. A node with a
local minimal ID will elect itself as a cluster head. All surrounding nodes of a head are
members of the cluster identified by the heads ID. Within a cluster, a member that can
communicate with a node in another cluster is a gateway. To take mobility into account,
when two heads meet, the one with a larger ID gives up its head role. This cluster
formation is depicted in Figure 2.
Figure 2.Clustered MANET
In a cluster, the heads rebroadcast can cover all other nodes in its cluster. To rebroadcast
message to nodes in other clusters, gateway nodes are used, hence there is no need for
a non-gateway nodes to rebroadcast the message [17].
3.3. Graph Dominating Set
A dominating set of a graph G = (V, E) is a subset S ⊆ V, such that every vertex v ∈ V is
either in S or adjacent to a vertex of S [5]. The solid black vertices in Figure 3. form a
dominating set of the graph. A vertex of S is said to dominate it self and all adjacent
vertices. We say that an edge is dominated if either of its endpoints is in S and refer to
other edges as free. In general, a vertex subset S is called a distance-k dominating set if
every vertex v is within the closed distance-k neighbourhood of some vertex of S. The
solid black vertices in Figure 3 . Form a dominating set of the graph. A vertex of S is
said to dominate itself and all adjacent vertices. We say that an edge is dominated if
either of its endpoints is in S and refer to other edges as free. In general, a vertex subset S
is called a distance-k dominating set if every vertex v is within the closed distance-k
neighbourhood of some vertex of S. A dominating set is an independent dominating set
if no two vertices in the dominating set are adjacent. An example is shown in Figure 4.
Another important variant is the connected dominating set.
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
26
Figure 3. Dominating Set Figure 4. Connected Dominating Set
4. BROADCASTING IN CLUSTER MANET
4.1. The Cluster Broadcasting
Considering the case that the backbone of the network consists of the fixed cluster heads and
dynamically selected gateways that depend on the source of a broadcast; that is, the gateways
are selected at the time when a cluster head needs to relay the packet. Since this backbone is
constructed step by step as the broadcast traverses the network, some pruning techniques can be
used to reduce the. Broadcast redundancy. Generally, pruning techniques can eliminate some
redundant broadcasting operations between two downstream neighbours of a sender if these two
neighbours know that they have received a broadcast packet from the same upstream sender.
For a simple network with 3 nodes in Fig 5. Suppose node u broadcasts a packet, both nodes v
and w receive the packet, and then they rebroadcast the packet to each other. Apparently, the
last two transmissions are redundant. There is many ways to reduce this kind of transmission
redundancy. When a node receives a broadcast packet, if it can back-off a short period of time
before it relays the packet, it may receive more copies of the same packet from its other
neighbours. If all of its neighbours can be covered by these already received broadcast copies, it
can resign its role of re-broadcast operation. For the network in Fig 5, when both v and w
receive the packet from u, if both v and w have a random delay before they relay the packet, and
w receives the duplicated packet from v before its delay times out, w realizes that all its
neighbours (u and v) have already received the packet. Therefore, it does not relay the packet. In
this case, one redundant transmission is saved. Another way to reduce transmission redundancy
is to piggyback the covered nodes with the broadcast packet when the sender broadcasts a
packet. From the information of the piggybacked packet, each receiver can compute which
subset of its neighbour set has already received the packet.
Figure 5. An illustration of the transmission redundancy in a network with three nodes
u
v
w
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
27
For example, in Figure 5. u broadcasts a packet that piggybacks v and w because they
have received the packet when u broadcasts the packet. At the time that v and w receive
the packet, they know that all of their neighbours (for v they are w and u; for w they are
u and v) have received the broadcast, therefore, none of them will relay the packet
again. In this case, two redundant transmissions are saved. Of course, these methods
will introduce some extra cost, for example, the first one will lead to more delay time
and the second one will increase the message length. By using the pruning technique of
attaching the sender’s coverage set and selected gateways will broadcast the packet.
4.2. Working Principle of the Cluster
1. If the source is not a cluster head, it just sends the broadcast packet to its cluster head.
2. When a cluster head receives the broadcast packet from its upstream cluster head
sender for the first time, it executes the selection process: It chooses some gateways,
called forward nodes, to forward the packet to all the cluster heads in its coverage set.
Its overage set is updated by excluding the cluster head sender and those cluster heads
in the sender’s coverage set that are piggybacked with the broadcast packet. The
coverage set of this cluster head, together with its selected forward nodes, are
piggybacked with the broadcast packet for the forwarding purpose. A Cluster head will
do nothing if it receives a duplicated packet.
3. When a non-cluster head node receive the broadcast packet for the first time and if it is
a forward node, it relays the packet; otherwise, it does nothing.
5. SIMULATION RESULT
The simulation was carried out using Glomosim. 2.03. The parameters used in the following
simulation experiments are listed in Table 1. The MAC layer scheme follows the IEEE 802.11
MAC specification. We have used the broadcast mode with RTS/CTS/ACK mechanisms for all
packet transmissions. The following graph shows the simulation output for ad-hoc networks
with IEEE 802.11 MAC protocol. Figure 6. Shows the reduction of the collision rate. Figure 7.
Shows the reduction of energy consumption. Figure 8.Shows the reduction of delay of
transmission of packets between the clusters heads. Figure 9.Shows throughput for cluster
structure MANET.
Table 1. The parameters used in the simulation
Parameter Value
Simulator Glomosim. 2.03
Network Area 900 x 900 m2
Transmission Range 100~300 meter
MAC Layer IEEE 802.11
Bandwidth 2 M b /s
Data Packet Size 512 bytes
Number of Nodes 20~100
Routing-Protocol AODV
Simulation Time 100 s
Number of Trials 10
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
28
Figure 6. Number of Nodes Vs Collision Rate
Figure 7. Number Nodes Vs Energy Consumption.
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
29
Figure 8. Nodes Vs Delay
Figure 9.Nodes Vs Throughput
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
30
6. CONCLUSIONS
The broadcast nature of wireless transmissions, that all the neighbours of a host will receive the
packet when the host transmits a packet. Extremely limits the scalability of the network. When
the size of the network increases and the network becomes dense, even a simple broadcast
operation may trigger a huge transmission collision and contention that may lead to the collapse
of the whole network [16]. This is referred to as the broadcast storm problem. To reduce this
problem, we proposed cluster structure for broadcasting in MANETs. We describe the
construction of the cluster-based networks. It point out that maintaining a network without
collision at all times for broadcasting is costly and unnecessary rebroadcast will occur.
Therefore, building a Cluster Networks is better choice for collision free transmission in
MANET. Based on our simulation results, we conclude that cluster structure is best to reduce
the network collision, to reduce delay of packet transmission, to reduce the energy consumption
and improves the throughput.
REFERENCES
[1] V. Park and S. Corson,( 1997), A Highly Adaptive Distributed Routing Algorithm for Mobile
Wireless Networks, INFOCOM 97, 1407-1415.
[2] C. Perkins, E. Beldig-Royer and S. Das,( 2003),Ad hoc on Demand Distance Vector(AODV)
Routing. Request for Comments 3561.
[3] B. Williams and T. Camp,( 2002), Comparison of Broadcasting Techniques for Mobile Ad
hoc Networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and
Computing (MOBIHOC), 194–205.
[4] S. Ni, Y. Tseng, Y. Chen and J. Sheu, (1999), The Broadcast Storm Problem in a Mobile Ad
Hoc Network. International Workshop on Mobile Computing and Networks, 151–162.
[5] B. N. Clark, C. J. Colbourn, and D. S. Johnson, (1990), Unit dis k graphs,
Discrete Mathematics, 85 pp. 165–177.
[6] M.Gerla and J.C. Tsai, (1995), Multicluster, mobile, multimedia radio network,
Wireless Networks, pp. 255–265.
[7] W. Peng and X. Lu,(1999),Efficient Broadcast in Mobile Ad hoc Networks using
Connected Dominating Sets. Journal of Software.
[8] W. Peng and X. Lu,( 2002),AHBP: An Efficient Broadcast Protocol for Mobile
Ad Hoc Networks. Journal of Science and Technology.
[9] C. Perkins, E. Royer and S. Das, (2002), Ad hoc On-demand Distance Vector
(AODV) Routing. IETF Internet-Draft, draft-ietf-manet-aodv-11.txt.
[10] D. Johnson, D. Maltz and Y. Hu, (2003), The Dynamic Source Routing Protocol
for Mobile Ad hoc Networks. Internet Draft: draft-ietf-manet-dsr-09.txt.
[11] B.An and S. Papavassiliou, (2001), A mobility-based clustering approach to support
Mobility management and multicast routing in mobile ad-hoc wireless networks,
International Journal of Network Management, pp. 387–395.
[12] S. Banerjee and S. Khuller, (2000), A clustering scheme for hierarchical
Routing in wireless networks, Tech. Report CS-TR-4103, University of Maryland,
College Park.
[13] M.Steenstrup,( 2001), Cluster-based networks, in Ad Hoc Networking, C. Perkins,
ed., Addison- Wesley.
[14] X.-Y. Li, (2003), Topology control in wireless ad hoc networks, in Ad Hoc
Networking, S. Basagni, M. Conti, S. Giordano, and I. Stojmenovic, eds., IEEE
Press.
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing( IJASUC ) Vol.1, No.2, June 2010.
31
[15] K. M. Aizoubi. P. J. Wan and O. Frieder, (2002), Message-Optimal Connected Dominating Sets
In Mobile Ad Hoc Networks. Proc.of ACM Mobihoc’2002. Pages 157-164.
[16] H. Lim and C. Kim, ( 2001), Flooding In Wireless Ad Hoc Networks. Computer
Communications Journal, 24(3-4): 353- 363.
[17] J. Wu and W. Lou, (2003), Forward-Node-Set-Based Broadcast In Clustered Mobile Ad Hoc
Networks, Accepted To Appear In Wireless Networks and Mobile Computing, A Special Issue
On Algorithmic, Geometric, Graph, Combinatorial, And Vector Aspects.
Authors
Mr.D.Sivaganesan received BE degree in Computer Science Engineering in
1999, M.Tech degree in Information Technology in 2004.He is currently working
as an Assistant Professor in the Department of Computer Science and
Engineering, Karpagam College of Engineering, Coimbatore.He is currently
pursuing Ph.D. His research interest includes Mobile Computing, Object
Computing, Simulation and Microprocessors Based Systems. He has published
12 technical papers in International, National Conferences and Journals.
Dr.R.Venkatesan received Ph.D degree in Computer Science and Engineering.
He is currently working as Professor and Head, Department of Information
Technology, PSG College of Technology, Coimbatore. His research interest
includes Simulation and Modeling, Software Engineering, Software, Algorithm
Design, Database Technology, Software Project Management, Software Process
Management. He has published 26 technical papers in International, National
Conferences and Journals.