This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanisms.
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.
SCALABLE AND ROBUST LOCATION AWARE MULTICAST ALGORITHM (SRLAMA) FOR MANET ijdpsjournal
An ad hoc network is composed of mobile nodes without the intervention of any fixed infrastructure or central administration. Multicasting is intended for group-oriented communication. A lot many applications depend on one-to-many or many-to-many dissemination of the information. However, in ad hoc environment, multicasting protocols are faced with the challenge of producing multihop routes under dynamic topology and bandwidth constraints. Due to the dynamic topology of MANETs it is very difficult to build optimal multicast trees and maintaining group membership, making even more challenging to
implement scalable and robust multicast in Mobile Ad hoc Networks (MANET). A Scalable and Robust
Location Aware Multicast Algorithm, called SRLAMA, for mobile ad hoc networks is presented in the paper that is based on creation of shared tree using the physical location of the nodes for the multicast sessions. It constructs a shared bi-directional multicast tree with an alternate root that avoids the
network partitioning in case of primary root failurte, which results in better performance even than a shared tree. The algorithm uses the concept of small overlapped zones around each node for employing proactive routing with in the smaller zone. Protocol is based on the location information obtained
employing relevant data structure, which effectively reduces the overheads for route searching and shared multicast tree maintenance. It employs a preventive route reconfiguration to avoid the latency in case of link breakages and to prevent the network from splitting.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Security Enhancement in AODV Routing Protocol for MANETsidescitation
Adhoc networks are a new wireless networking paradigm for mobile hosts.
Mobile Ad-hoc Networks (MANETs) are wireless networks with absence of infrastructure
centralized support. Routing in MANETs is challenging task due to mobility of nodes.
Several routing protocols have been developed for Mobile Ad-hoc Networks. This paper
describes concept of security enhancement in AODV routing protocol by detection and
tolerance of attacks using secure message transmission (SMT) protocol. Present AODV
routing protocol is not secure by malicious nodes. One main challenge in design of these
networks is their vulnerability to security attacks. In this paper we study how to make node
malicious and at same we will detect malicious node in AODV protocol using Network
Simulator-2(NS-2) tool.
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.
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.
SCALABLE AND ROBUST LOCATION AWARE MULTICAST ALGORITHM (SRLAMA) FOR MANET ijdpsjournal
An ad hoc network is composed of mobile nodes without the intervention of any fixed infrastructure or central administration. Multicasting is intended for group-oriented communication. A lot many applications depend on one-to-many or many-to-many dissemination of the information. However, in ad hoc environment, multicasting protocols are faced with the challenge of producing multihop routes under dynamic topology and bandwidth constraints. Due to the dynamic topology of MANETs it is very difficult to build optimal multicast trees and maintaining group membership, making even more challenging to
implement scalable and robust multicast in Mobile Ad hoc Networks (MANET). A Scalable and Robust
Location Aware Multicast Algorithm, called SRLAMA, for mobile ad hoc networks is presented in the paper that is based on creation of shared tree using the physical location of the nodes for the multicast sessions. It constructs a shared bi-directional multicast tree with an alternate root that avoids the
network partitioning in case of primary root failurte, which results in better performance even than a shared tree. The algorithm uses the concept of small overlapped zones around each node for employing proactive routing with in the smaller zone. Protocol is based on the location information obtained
employing relevant data structure, which effectively reduces the overheads for route searching and shared multicast tree maintenance. It employs a preventive route reconfiguration to avoid the latency in case of link breakages and to prevent the network from splitting.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Security Enhancement in AODV Routing Protocol for MANETsidescitation
Adhoc networks are a new wireless networking paradigm for mobile hosts.
Mobile Ad-hoc Networks (MANETs) are wireless networks with absence of infrastructure
centralized support. Routing in MANETs is challenging task due to mobility of nodes.
Several routing protocols have been developed for Mobile Ad-hoc Networks. This paper
describes concept of security enhancement in AODV routing protocol by detection and
tolerance of attacks using secure message transmission (SMT) protocol. Present AODV
routing protocol is not secure by malicious nodes. One main challenge in design of these
networks is their vulnerability to security attacks. In this paper we study how to make node
malicious and at same we will detect malicious node in AODV protocol using Network
Simulator-2(NS-2) tool.
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.
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.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
3 a survey analysis on manet routing protocols and mobility models for variou...INFOGAIN PUBLICATION
Ad-hoc network is a collection of wireless mobile nodes which dynamically form a temporary network without the use of any existing network infrastructure. It may connect hundreds to thousands of mobile nodes. The primary goal of such an ad-hoc network is correct and efficient route establishment between a pair of nodes so that message can be delivered easily and in a timely manner. The main objective of this paper is to address different MANET routing protocols and different types of mobility models used in MANETs. This paper also put emphasis on the work done by various researches using routing protocols and mobility models. This paper would be great help for the people who are conducting research for the problems in MANETs.
Analysis of Multicast Routing Protocols: Puma and OdmrpIJMER
ABSTRACT: In general, Wireless communication is defined as sharing of information between one or more systems
through wireless links. Wireless networks can be categorized into two different modes as infrastructure based and
infrastructure less. Infrastructure based mode is the most common use wireless mode for the end user loop. Infrastructure
fewer modes also called as the Ad hoc mode relies on wireless communications without any fixed infrastructure.
Infrastructure based networks are characterized by their use of access points (AP), or base stations. The most known
example of infrastructure based wireless network is GSM and more recently, Wi-Fi. Ad Hoc networks introduce a new way
of communication. An ad hoc network is a collection of wireless mobile nodes that dynamically functions as a network
without the use of any existing infrastructure and centralized administration. Mobile Ad-hoc networking (MANET), an
emerging field of wireless networking is an autonomous system of wireless mobile hosts, connected by wireless links that
dynamically create a temporary network and establish an infrastructure less network. The topology of the network may
change frequently and unpredictably. Multicast routing has been widely applied in mobile ad hoc networks (MANETs), to
support different group oriented applications like video conferencing, interactions with Special interest groups etc.,
efficiently. This paper presents the comparative analysis of two multicast routing protocols, PUMA and ODMRP.
Keywords: MANET, PUMA, ODMRP, AODV, WMN’s.
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
A MANET is an autonomous group of mobile users that communicate over reasonably slow
wireless links. The network topology may vary rapidly and unpredictably over time, because the nodes
are mobile. The network is decentralized, where all network activity, including discovering the topology
and delivering messages must be executed by the nodes themselves. Hence routing functionality will
have to be incorporated into the mobile nodes. MANET is a kind of wireless ad-hoc network and it is a
self-configuring network of mobile routers (and associated hosts) connected by wireless links – the union
of which forms an arbitrary topology. Such a network may operate in a standalone fashion, or may be
connected to the larger Internet Problems in Ad Hoc Networks.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK ijiert bestjournal
There are number of routing protocols proposed for the data transmission in WSN. Initially single path routing schemes with number of variations are proposed. Sti ll there were some drawbacks in single path routing . Single path routing was unable to provide the reliability and h igh throughput. Also security level was not conside red while routing. Recently,to remove the drawbacks of the s ingle path routing new routing technique is propose d called as multipath routing. In this paper we discussed the different multipath routing protocols with number of variants. Initiall y multipath routing was proposed for the purpose of guaranteed delivery of packet to sink in case of link or node failure. There are other protocols which are proposed for the reli ability,energy saving,security and high throughpu t. Some multipath routing protocols have discussed the load balancing and security during packet transmission.
Comparative Review for Routing Protocols in Mobile Ad-Hoc Networksijasuc
Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the
last decade. it surrounded by much challenges that should be solved the improve establishment of such
networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc
Networks (MANETs). As this type of networks does not require any pre-exist hardware. As well as, every
node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the
network internal structure will be unpredictably changed frequently according to continuous activities
between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This
model puts the functionality of routing operation in crucial angle in the area of research under mobile adhoc
network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new
routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed
to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under
different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are
designed for mobile ad-hoc networks by describing their structures, operations, features and then
comparing their various characteristics.
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
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.
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
3 a survey analysis on manet routing protocols and mobility models for variou...INFOGAIN PUBLICATION
Ad-hoc network is a collection of wireless mobile nodes which dynamically form a temporary network without the use of any existing network infrastructure. It may connect hundreds to thousands of mobile nodes. The primary goal of such an ad-hoc network is correct and efficient route establishment between a pair of nodes so that message can be delivered easily and in a timely manner. The main objective of this paper is to address different MANET routing protocols and different types of mobility models used in MANETs. This paper also put emphasis on the work done by various researches using routing protocols and mobility models. This paper would be great help for the people who are conducting research for the problems in MANETs.
Analysis of Multicast Routing Protocols: Puma and OdmrpIJMER
ABSTRACT: In general, Wireless communication is defined as sharing of information between one or more systems
through wireless links. Wireless networks can be categorized into two different modes as infrastructure based and
infrastructure less. Infrastructure based mode is the most common use wireless mode for the end user loop. Infrastructure
fewer modes also called as the Ad hoc mode relies on wireless communications without any fixed infrastructure.
Infrastructure based networks are characterized by their use of access points (AP), or base stations. The most known
example of infrastructure based wireless network is GSM and more recently, Wi-Fi. Ad Hoc networks introduce a new way
of communication. An ad hoc network is a collection of wireless mobile nodes that dynamically functions as a network
without the use of any existing infrastructure and centralized administration. Mobile Ad-hoc networking (MANET), an
emerging field of wireless networking is an autonomous system of wireless mobile hosts, connected by wireless links that
dynamically create a temporary network and establish an infrastructure less network. The topology of the network may
change frequently and unpredictably. Multicast routing has been widely applied in mobile ad hoc networks (MANETs), to
support different group oriented applications like video conferencing, interactions with Special interest groups etc.,
efficiently. This paper presents the comparative analysis of two multicast routing protocols, PUMA and ODMRP.
Keywords: MANET, PUMA, ODMRP, AODV, WMN’s.
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
A MANET is an autonomous group of mobile users that communicate over reasonably slow
wireless links. The network topology may vary rapidly and unpredictably over time, because the nodes
are mobile. The network is decentralized, where all network activity, including discovering the topology
and delivering messages must be executed by the nodes themselves. Hence routing functionality will
have to be incorporated into the mobile nodes. MANET is a kind of wireless ad-hoc network and it is a
self-configuring network of mobile routers (and associated hosts) connected by wireless links – the union
of which forms an arbitrary topology. Such a network may operate in a standalone fashion, or may be
connected to the larger Internet Problems in Ad Hoc Networks.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK ijiert bestjournal
There are number of routing protocols proposed for the data transmission in WSN. Initially single path routing schemes with number of variations are proposed. Sti ll there were some drawbacks in single path routing . Single path routing was unable to provide the reliability and h igh throughput. Also security level was not conside red while routing. Recently,to remove the drawbacks of the s ingle path routing new routing technique is propose d called as multipath routing. In this paper we discussed the different multipath routing protocols with number of variants. Initiall y multipath routing was proposed for the purpose of guaranteed delivery of packet to sink in case of link or node failure. There are other protocols which are proposed for the reli ability,energy saving,security and high throughpu t. Some multipath routing protocols have discussed the load balancing and security during packet transmission.
Comparative Review for Routing Protocols in Mobile Ad-Hoc Networksijasuc
Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the
last decade. it surrounded by much challenges that should be solved the improve establishment of such
networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc
Networks (MANETs). As this type of networks does not require any pre-exist hardware. As well as, every
node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the
network internal structure will be unpredictably changed frequently according to continuous activities
between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This
model puts the functionality of routing operation in crucial angle in the area of research under mobile adhoc
network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new
routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed
to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under
different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are
designed for mobile ad-hoc networks by describing their structures, operations, features and then
comparing their various characteristics.
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
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.
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Performance and statistical analysis of ant colony route in mobile ad-hoc ne...IJECEIAES
Research on mobile ad-hoc networks (MANETs) is increasing in popularity due to its rapid, budget-friendly, and easily altered implementation, and relevance to emergencies such as forest firefighting and health care provisioning. The main concerns that ad-hoc networks face is dynamic topology, energy usage, packet drop rate, and throughput. Routing protocol selection is a critical point to surmount alterations in topology and maintain quality in MANET networks. The effectiveness of any network can be vastly enhanced with a well-designed routing protocol. In recent decades, standard MANET protocols have not been able to keep pace with growing demands for MANET applications. The current study investigates and contrasts ant colony optimization (ACO) with various routing protocols. This paper compares ad-hoc on-demand multi-path distance vector (AOMDV), dynamic source routing protocol (DSR), ad-hoc on-demand distance vector routing (AODV), and AntHocNet protocols regarding the quality of service (QoS) and statistical analysis. The current research aims to study the behavior of the state-of-the-art MANET protocols with the ACO technique. The ACO technique is a hybrid technique, integrating a reactive route maintaining technique with a proactive method. The reason and motivation for including the ACO algorithm in the current study is to improve by using optimization algorithms proved in other domains. The ACO algorithm appears to have substantial use in large-scale MANET simulation.
IRJET-Mobility Aware Refined Counter Based Broadcasting Model of MANETIRJET Journal
Manjusha Deshmukh,Ratnadeep Deshmukh, Sangeeta Kakarwal, "Mobility Aware Refined Counter Based Broadcasting Model of MANET", International Research Journal of Engineering and Technology (IRJET), Vol2,issue-01 March 2015. p-ISSN:2395-0056, e-ISSN:2395-0072. www.irjet.net ,published by Fast Track Publications
Abstract
The MANET is a special type of wireles mobile network in which mobile hosts can communicate without any aid of established infrastructure. Broadcast or flooding is a dissemination technique oparamount importance in mobile ad-hoc networks MANETs are generating lots of interest due to their dynamic topology and decentralized administration Due to the mobility of nodes there are many problem occurred during the packet transmission. Basic routing protocols such as Ad hoc on Demand Distance Vecto(AODV), Dynamic source routing (DSR) could lead toissues such as Broadcast Storm Problem, Large power consumption, link failure due to mobility. Counter based approaches inhibit a node from broadcasting a packet based on number of copies of the broadcaspacket received by the node within a random accessdelay time. It relies on the threshold value to decide whether or not to forward broadcast packet. In this paper, model is proposed which refines the counter based threshold based on network density and the mobility of nodes. The paper refined the sparse threshold as low sparse threshold and high sparse threshold and dense threshold as low dense threshold and high dense threshold.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Similar to A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad Hoc Networks (20)
ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFER...graphhoc
We compare the probability of k-Connectivity of an ad hoc network under Random Way Point (RWP),City Section and Manhattan mobility models. A Network is said to be k Connected if there exists at least k edge disjoint paths between any pair of nodes in that network at any given time and velocity. Initially, for each of the three mobility models, the movement of the each node in the ad hoc network at a given velocity and time are captured and stored in the Node Movement Database (NMDB). Using the movements in the NMDB, the location of the node at a given time is computed and stored in the Node
Location Database (NLDB).
The Impact of Data Replication on Job Scheduling Performance in Hierarchical ...graphhoc
In data-intensive applications data transfer is a primary cause of job execution delay. Data access time depends on bandwidth. The major bottleneck to supporting fast data access in Grids is the high latencies of Wide Area Networks and Internet. Effective scheduling can reduce the amount of data transferred across the internet by dispatching a job to where the needed data are present. Another solution is to use a data replication mechanism. Objective of dynamic replica strategies is reducing file access time which leads to reducing job runtime. In this paper we develop a job scheduling policy and a dynamic data replication strategy, called HRS (Hierarchical Replication Strategy), to improve the data access efficiencies. We study our approach and evaluate it through simulation. The results show that our algorithm has improved 12% over the current strategies
DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHSgraphhoc
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with
max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple
graph are discussed.
Impact of Mobility for Qos Based Secure Manet graphhoc
Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.
A Transmission Range Based Clustering Algorithm for Topology Control Manetgraphhoc
This paper presents a novel algorithm for clustering of nodes by transmission range based clustering (TRBC).This algorithm does topology management by the usage of coverage area of each node and power management based on mean transmission power within the context of wireless ad-hoc networks. By reducing the transmission range of the nodes, energy consumed by each node is decreased and topology is formed. A new algorithm is formulated that helps in reducing the system power consumption and prolonging the battery life of mobile nodes. Formation of cluster and selection of optimal cluster head and thus forming the optimal cluster taking weighted metrics like battery life, distance, position and mobility is done based on the factors such as node density, coverage area, contention index, required and current node degree of the nodes in the clusters
A Battery Power Scheduling Policy with Hardware Support In Mobile Devices graphhoc
A major issue in the ad hoc networks with energy constraints is to find ways that increase their lifetime. The use of multihop radio relaying requires a sufficient number of relaying nodes to maintainnetwork connectivity. Hence, battery power is a precious resource that must be used efficiently in order to avoid early termination of any node. In this paper, a new battery power scheduling policy based on dynamic programming is proposed for mobile devices.This policy makes use of the state information of each cell provided by the smart battery package and uses the strategy of dynamic programming to optimally satisfy a request for power. Using extensive simulation it is proved that dynamic programming based schedulingpolicyimproves the lifetime of the mobile nodes.Also a hardware support is proposed to succeeds in distinguishing between real-time and non-real-time traffic and provides the appropriate grade of service, to meet the time constraints associated with real time traffic.
Case Study On Social Engineering Techniques for Persuasion Full Text graphhoc
There are plenty of security software in market; each claiming the best, still we daily face problem of viruses and other malicious activities. If we know the basic working principal of such malware then we can very easily prevent most of them even without security software. Hackers and crackers are experts in psychology to manipulate people into giving them access or the information necessary to get access. This paper discusses the inner working of such attacks. Case study of Spyware is provided. In this case study, we got 100% success using social engineering techniques for deception on Linux operating system, which is considered as the most secure operating system. Few basic principal of defend, for the individual as well as for the organization, are discussed here, which will prevent most of such attack if followed.
Breaking the Legend: Maxmin Fairness notion is no longer effective graphhoc
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
Fault tolerant wireless sensor mac protocol for efficient collision avoidancegraphhoc
In sensor networks communication by broadcast methods involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collision namely ARBP, where the best achieved success rate is 90%. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage of delivered packets at the source reaching the destination successfully) by reducing the number of collisions, but by trading off the average propagation delay of transmission. Our proposed protocols are also shown to be more energy efficient in terms of energy dissipation per message delivery, compared to the currently existing protocol.
Enhancing qo s and qoe in ims enabled next generation networksgraphhoc
Managing network complexity, accommodating greater numbers of subscribers, improving coverage to support data services (e.g. email, video, and music downloads), keeping up to speed with fast-changing technology, and driving maximum value from existing networks – all while reducing CapEX and OpEX and ensuring Quality of Service (QoS) for the network and Quality of Experience (QoE) for the user. These are just some of the pressing business issues faced by mobileservice providers, summarized by the demand to “achieve more, for less.” The ultimate goal of optimization techniques at the network and application layer is to ensure End-user perceived QoS. The next generation networks (NGN), a composite environment of proven telecommunications and Internet-oriented mechanisms have become generally recognized as the telecommunications environment of the future. However, the nature of the NGN environment presents several complex issues regarding quality assurance that have not existed in the legacy environments (e.g., multi-network, multi-vendor, and multi-operator IP-based telecommunications environment, distributed intelligence, third-party provisioning, fixed-wireless and mobile access, etc.). In this Research Paper, a service aware policy-based approach to NGN quality assurance is presented, taking into account both perceptual quality of experience and technologydependant quality of service issues. The respective procedures, entities, mechanisms, and profiles are discussed. The purpose of the presented approach is in research, development, and discussion of pursuing the end-to-end controllability of the quality of the multimedia NGN-based communications in an environment that is best effort in its nature and promotes end user’s access agnosticism, service agility, and global mobility
Simulated annealing for location area planning in cellular networksgraphhoc
LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time
Secure key exchange and encryption mechanism for group communication in wirel...graphhoc
Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.
Simulation to track 3 d location in gsm through ns2 and real lifegraphhoc
In recent times the cost of mobile communication has dropped significantly leading to a dramatic increase in mobile phone usage. The widespread usage has led mobiles to emerge as a strong alternative for other applications one of which is tracking. This has enabled law-enforcing agencies to detect overspeeding vehicles and organizations to keep track its employees. The 3 major ways of tracking being employed presently are (a) via GPS [1] (b) signal attenuation property of a packet [3] and (c) using GSM Network [2]. The initial cost of GPS is very high resulting in low usage whereas (b) needs a very high precision measuring device. The paper presents a GSM-based tracking technique which eliminates the above mentioned overheads, implements it in NS2 and shows the limitations of the real life simulation. An accuracy of 97% was achieved during NS2 simulation which is comparable to the above mentioned alternate methods of tracking.
Performance Analysis of Ultra Wideband Receivers for High Data Rate Wireless ...graphhoc
For high data rate ultra wideband communication system, performance comparison of Rake, MMSE and Rake-MMSE receivers is attempted in this paper. Further a detail study on Rake-MMSE time domain equalizers is carried out taking into account all the important parameters such as the effect of the number of Rake fingers and equalizer taps on the error rate performance. This receiver combats inter-symbol interference by taking advantages of both the Rake and equalizer structure. The bit error rate performances are investigated using MATLAB simulation on IEEE 802.15.3a defined UWB channel models. Simulation results show that the bit error rate probability of Rake-MMSE receiver is much better than Rake receiver and MMSE equalizer. Study on non-line of sight indoor channel models illustrates that bit error rate performance of Rake-MMSE (both LE and DFE) improves for CM3 model with smaller spread compared to CM4 channel model. It is indicated that for a MMSE equalizer operating at low to medium SNR values, the number of Rake fingers is the dominant factor to improve system performance, while at high SNR values the number of equalizer taps plays a more significant role in reducing the error rate.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applicat...graphhoc
Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with
wireless communications and networking capability that communicate with each other without the aid of
any centralized administrator also the wireless nodes that can dynamically form a network to exchange
information without using any existing fixed network infrastructure. And it’s an autonomous system in
which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at
the same time, and we discuss in this paper the distinct characteristics of traditional wired networks,
including network configuration may change at any time , there is no direction or limit the movement and
so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these
actions communicate with each other path, An ideal choice way the agreement should not only be able to
find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any
time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the
History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and
then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this
paper, the more representative of routing protocols, analysis of individual characteristics and advantages
and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad
Hoc Networks
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles graphhoc
In 1991, Gnanajothi [4] proved that the path graph n
P with n vertex and n −1edge is odd graceful, and
the cycle graph Cm with m vertex and m edges is odd graceful if and only if m even, she proved the
cycle graph is not graceful if m odd. In this paper, firstly, we studied the graphCm∪Pn when m = 4, 6,8,10
and then we proved that the graphCm∪Pn
is odd graceful if m is even. Finally, we described an
algorithm to label the vertices and the edges of the vertex set ( ) m n
V C ∪P and the edge set ( ) m n
E C ∪P .
ACTOR GARBAGE COLLECTION IN DISTRIBUTED SYSTEMS USING GRAPH TRANSFORMATIONgraphhoc
A lot of research work has been done in the area of Garbage collection for both uniprocessor and
distributed systems. Actors are associated with activity (thread) and hence usual garbage collection
algorithms cannot be applied for them. Hence a separate algorithm should be used to collect them. If we
transform the active reference graph into a graph which captures all the features of actors and looks like
passive reference graph then any passive reference graph algorithm can be applied for it. But the cost of
transformation and optimization are the core issues. An attempt has been made to walk through these
issues.
A Proposal Analytical Model and Simulation of the Attacks in Routing Protocol...graphhoc
In this work we have devoted to some proposed analytical methods to simulate these attacks, and node mobility in MANET. The model used to simulate the malicious nodes mobility attacks is based on graphical theory, which is a tool for analyzing the behavior of nodes. The model used to simulate the Blackhole cooperative, Blackmail, Bandwidth Saturation and Overflow attacks is based on malicious nodes and the number of hops. We conducted a simulation of the attacks with a C implementation of the proposed mathematical models.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 4
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad Hoc Networks
1. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
10.5121/jgraphoc.2010.2201 1
A REVIEW OF THE ENERGY EFFICIENT AND
SECURE MULTICAST ROUTING PROTOCOLS FOR
MOBILE AD HOC NETWORKS
Busola S. Olagbegi1
and Natarajan Meghanathan2
1,2
Jackson State University, 1400 Lynch St, Jackson, MS, USA
1
shale_o@yahoo.com, 2
natarajan.meghanathan@jsums.edu
ABSTRACT
This paper presents a thorough survey of recent work addressing energy efficient multicast routing
protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so
many issues and solutions which witness the need of energy management and security in ad hoc wireless
networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data
from a sender to all the receivers of a multicast group while trying to use the available bandwidth
efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of
wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering
energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various
multicast routing protocols have been proposed for MANETs. These protocols have distinguishing
features and use different mechanisms.
KEYWORDS
Mobile Ad hoc Networks, Multicast Routing Protocols, Energy Efficiency, Security, Review Survey
1. INTRODUCTION
An ad hoc network consists of a collection of autonomous mobile nodes formed by means of
multi-hop wireless communication without the use of any existing network infrastructure. Ad
hoc networks have become increasingly relevant in recent years due to their potential
applications in battlefield, emergency disaster relief and etc. In an ad hoc network, each mobile
node can serve as a router. A mobile ad-hoc network (MANET) is characterized by mobile
nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links.
The goal of MANETs is to broaden mobility into the area of autonomous, mobile and wireless
domains, where a set of nodes form the network routing infrastructure in an ad-hoc manner.
This emerging trend has stirred the support of applications which range from highly dynamic
Vehicular ad hoc networks (VANETs) to less dynamic applications such as moderately mobile
peer-to-peer wireless networks.
In ad hoc networks, nodes communicate with each other by way of radio signals, which are
broadcast in nature. Broadcast is a unique case of multicast, wherein all nodes in the network
should get the broadcast message. Multicasting is a communication process in which the
transmission of packets (message) is initiated by a single user and the message is received by
one or more end users of the network. Multicasting in wired and wireless networks has been
advantageous and used as a vital technology in many applications such as audio/ video
conferencing, corporate communications, collaborative and groupware applications, distance
earning, stock quotes, distribution of software, news and etc [1]. Under multicast
communications, a single stream of data can be shared with multiple recipients and data is only
duplicated when required [1].
2. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
2
In the wired settings, there are two popular multicast tree schemes: shortest-path tree and core-
based tree. The procedure to construct shortest-path multicast trees ensures the shortest path
from every source to every destination, but a source node has to construct a tree rooted at itself.
Hence, there would exist too many shortest-path trees existing in the network. In core-based
multicast trees, shortest path from the source node to the destination node cannot be guaranteed,
but only one tree would be needed to connect the set of the source nodes to a set of the receiver
nodes.
Security is a more sensitive issue in MANETs than any other networks due to lack of
infrastructure and the broadcast nature of the network. While MANETs can be quickly set up as
needed, they also need secure routing protocols to add the security feature to normal routing
protocols. The need for more effective security measures arises as many passive and active
security attacks can be launched from the outside by malicious hosts or from the inside by
compromised nodes [2]. Key management is a fundamental part of secure routing protocols;
existence of an effective key management framework is also paramount for secure routing
protocols. Several security protocols have been proposed for MANETs, there is no approach
fitting all networks, because the nodes can vary between any devices.
However, it would be a difficult and challenging task to offer energy efficient and reliable
multicast routing in MANETs. It might not be possible to recharge / replace a mobile node that
is powered by batteries during a mission. The inadequate battery lifetime imposes a limitation
on the network performance. To take full advantage of the lifetime of nodes, traffic should be
routed in a way that energy consumption is minimized. In recent years, various energy efficient
multicast routing protocols have been proposed. These protocols have unique attributes and
utilize different recovery mechanisms on energy consumption. This project will provide a
comprehensive understanding of these multicast routing protocols and better organize existing
ideas and work to make it easy to design multicast routing in MANETs. The goal of this paper
is to help researchers to gain a better understanding of energy-efficient and secure routing
protocols available and assist them in the selection of the right protocol for their work. The rest
of the paper is organized as follows: Section 2 presents related work on comparisons and
surveys of multicast routing protocols for MANETs. Section 3 describes the energy-efficient
multicast routing protocols and Section 4 describes the security-based multicast routing
protocols surveyed for MANETs. Section 5 concludes the paper.
2. RELATED WORK
MANETs are gaining tremendous focus from researchers and application developers because of
the great potential of its network type. Some research has been made in the field of multicast
routing protocols; the taxonomy, performance and capacity of multicast routing protocols over
MANETs have been studied ([3], [4]). Omari et al summarized traffic models for multicast
routing protocols in MANETs ([5], [6]). They also evaluated the performance of the existing
multicast protocols in MANET using similar traffic models to justify their proposal. Multicast
routing protocols were categorized into tree-based mesh-based, stateless, hybrid-based and
flooding protocols.
Four distinctive multicast routing protocols were discussed in detail, with a focus on how to rise
above the constraints present in the previously proposed multicast protocols. The four multicast
routing protocols discussed in [6] are: On-Demand Multicast Routing Protocol (ODMRP),
Multicast Ad Hoc On-Demand Distance Vector Routing Protocol (MAODV), Forwarding
Group Multicast Protocol (FGMP) and Core-Assisted Mesh Protocol. Chen et al gave a general
survey of multicast routing protocols in MANETs [1] and called attention to the constraints,
including Quality of Service (QoS) and reliability, faced in the design of these protocols when
they are applied in highly dynamic environments, characteristics of MANETs.
3. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
3
QoS is difficult to guarantee in MANETs, due to lack of resources from sharing wireless
bandwidth among nodes and topology changes as the nodes move. Protocols such as Location
guided Tree (LGT) [7], Ad hoc Multicast Routing protocol utilizing Increasing id-numberS
(AMRIS) [8], [9] and Core-Assisted Mesh Protocol (CAMP) [10] may not be realistic to use,
because QoS was not considered in the design as it requires finding a route from a source to a
destination and satisfying the end-to-end QoS requirement which is usually given in terms of
bandwidth or delay. Proper QoS cost metrics such as bandwidth, delay, packet loss rate should
be used in the design of multicast routing protocols [6].
The MAODV protocol constructs multicast trees to reduce end-to-end latency while ODMRP
constructs a multicast mesh to guarantee robustness. The Position Based Multicast (PBM)
protocol neither constructs a tree nor a mesh; it uses the geographic position of the nodes to
make forwarding decisions. The Progressively Adapted Sub-Tree in Dynamic Mesh (PAST-
DM) protocol builds a virtual mesh spanning all the members of a multicast group. In order to
transmit and deliver packets, it depends on the underlying unicast routing protocol, leading to
longer delays and lower on packet delivery [11]. Dewan also introduced a new protocol;
Lifetime – Refining Energy Efficient of Multicast Trees (LREMiT) [12] that aims to maximize
the lifetime of the multicast tree through refinement operation. This operation continues in
rounds coordinated by the source node. The Protocol for Unified Multicasting through
Announcement (PUMA) [13] uses a set of core nodes for multicasting by creating and
maintaining a shared mesh for each multicast group without depending upon a unicast routing
protocol. PUMA delivers data at a higher efficiency, while also provides a tight bound for
control overhead in a wide range of network scenarios.
The Sequence and Topology encoding for Multicast Protocol (STMP) [14] represents multicast
routing a using fuzzy Petri-net model in wireless ad hoc networks wherein all nodes are
equipped with GPS units [15]. It uses a structured representation of network topology and
applies a fuzzy reasoning algorithm in order to construct multicast tree and improves the
efficiency of the routing protocol. Its main objective is to reduce the size of the multicast tree.
In Adaptive Demand Driven Multicast Routing (ADMR) [16], senders and receivers cooperate
to establish and maintain forwarding states in the network to allow multicast communication
[17]. ADMR adaptively monitors the proper execution of forwarding states and maintains
connectivity when one or more forwarding nodes or receivers become disconnected. The
Lifetime-aware Multicast Tree (LMT) [18] routing algorithm maximizes multicast lifetime by
finding routing solutions that minimizes the variance of the available energy levels in the
network [8].
Prioritized Overlay Multicast (POM) [19] aims to improve the efficiency and robustness of the
overlay multicast in MANETs by building multiple role-based prioritized trees [20]. Usually it
takes the benefits of location information. Cordeiro et al. provide information about the current
state-of-the art in multicast protocols for MANETs, and compares them with respect to several
performance metrics. In [21] and [22], the authors classify the multicast protocols into four
categories based on the creation of the routes by the members of the group: tree-based
approaches, meshed-based approaches, stateless multicast and hybrid approaches.
3. SURVEY OF ENERGY EFFICIENT MULTICAST ROUTING PROTOCOLS
MANETs lack fixed infrastructure and nodes are typically powered by batteries with a limited
energy supply wherein each node stops functioning when the battery drains. Energy efficiency
is an important consideration in such an environment. Since nodes in MANETs rely on limited
battery power for their energy, energy-saving techniques aimed at minimizing the total power
consumption of all nodes in the multicast group (minimize the number of nodes used to
4. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
4
establish multicast connectivity, minimize the control overhead and so on) and at maximizing
the multicast life span should be considered. As a result of the energy constraints placed on the
network’s nodes, designing energy efficient multicast routing protocols is a crucial concern for
MANETs, to maximize the lifetime of its nodes and thus of the network itself [23], [24].
Energy-efficient broadcast routing algorithms called Minimum Longest Edge (MLE) and
Minimum Weight Incremental Arborescence (MWIA) are introduced in [5][20]. MLE is able to
achieve a longer network lifetime by reducing the maximum transmission power of nodes. With
MLE, the likelihood that a node is overused is reduced significantly. This scheme was expanded
by considering a scenario where we introduce edge weights on the basis of the remaining energy
of the sending nodes and receiving nodes. MWIA was derived from this idea, which is the best
possible solution for broadcast routing with the minimum largest edge-weight.
Cheng et al. proposed the Minimum Incremental Power (MIP) algorithm and it is known as the
most energy-efficient heuristic in terms of the total energy consumption among all the
topologies [17]. MIP is developed based on the Broadcast Incremental Power (BIP) algorithm.
The MIP algorithm is used as a comparison for the solution to the Energy-balanced topology
control problem, which instead of minimizing the total energy, minimizes the maximum energy
consumption at each node.
3.1 Energy-Efficient Location Aided Routing (EELAR)
Energy Efficient Location Aided Routing (EELAR) Protocol [3] was developed on the basis of
the Location Aided Routing (LAR) [25]. EELAR makes significant reduction in the energy
consumption of the mobile node batteries by limiting the area of discovering a new route to a
smaller zone. Thus, control packet overhead is significantly reduced. In EELAR, a reference
wireless base station is used and the network’s circular area centered at the base station is
divided into six equal sub-areas. During route discovery, instead of flooding control packets to
the whole network area, they are flooded to only the sub-area of the destination mobile node.
The base station stores locations of the mobile nodes in a position table. Simulations results
using NS-2 [26][27] showed that EELAR protocol makes an improvement in control packet
overhead and delivery ratio compared to AODV [28], LAR [29], and DSR [30][31] protocols.
3.2 Online Max-Min Routing Protocol (OMM)
Li et al proposed the Online Max-Min (OMM) power-aware routing protocol [21] for wireless
ad-hoc networks dispersed over large geographical areas to support applications where the
message sequence is not known. This protocol optimizes the lifetime of the network as well as
the lifetime of individual nodes by maximizing the minimal residual power, which helps to
prevent the occurrence of overloaded nodes. In most applications that involve MANETs, power
management is a real issue and can be done at two complementary levels (1) during
communication and (2) during idle time. The OMM protocol maximizes the lifetime of the
network without knowing the data generation rate in advance. The metrics developed showed
that OMM had a good empirical competitive ratio to the optimal online algorithm [21] that
knows the message sequence and the max-min achieves over 80% of the optimal node lifetime
(where the sender knows all the messages ahead of time) for most instances and over 90% of the
optimal node lifetime for many problem instances [5].
3.3 Power-aware Localized Routing (PLR)
The Power-aware Localized Routing (PLR) protocol [32] is a localized, fully distributed
energy-aware routing algorithm but it assumes that a source node has the location information
of its neighbors and the destination. PLR is equivalent to knowing the link costs from the source
node to its neighbors, all the way to the destination. Based on this information, the source
5. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
5
cannot find the optimal path but selects the next hop through which the overall transmission
power to the destination is minimized [5].
3.4 Power-aware Routing (PAR) Protocol
Power-aware routing (PAR) [33] maximizes the network lifetime and minimizes the power
consumption by selecting less congested and more stable route, during the source to destination
route establishment process, to transfer real-time and non real-time traffic, hence providing
energy efficient routes. PAR focuses on 3 parameters: Accumulated energy of a path, Status of
battery lifetime and Type of data to be transferred. At the time route selection, PAR focuses on
its core metrics like traffic level on the path, battery status of the path, and type of request from
user side. With these factors in consideration, PAR always selects less congested and more
stable routes for data delivery and can provide different routes for different type of data transfer
and ultimately increases the network lifetime. Simulation results shows that PAR outperforms
similar protocols such as DSR and AODV, with respects to different energy-related
performance metrics even in high mobility scenarios. Although, PAR can somewhat incur
increased latency during data transfer, it discover routed that can last for a long time and
encounter significant power saving.
3.5 Minimum Energy Routing (MER) Protocol
Minimum Energy Routing (MER) can be described as the routing of a data-packet on a route
that consumes the minimum amount of energy to get the packet to the destination which
requires the knowledge of the cost of a link in terms of the energy expanded to successfully
transfer and receive data packet over the link, the energy to discover routes and the energy lost
to maintain routes [22]. MER incurs higher routing overhead, but lower total energy and can
bring down the energy consumed of the simulated network within range of the theoretical
minimum the case of static and low mobility networks. However as the mobility increases, the
minimum energy routing protocol’s performance degrades although it still yields impressive
reductions in energy as compared performance of minimum hop routing protocol [34].
3.6 Lifetime-aware Multicast Tree (LMT) Protocol
The Lifetime-aware multicast tree routing algorithm [18] maximizes the ad hoc network lifetime
by finding routes that minimize the variance of the remaining energies of the nodes in the
network. LMT maximizes the lifetime of a source based multicast tree, assuming that the energy
required to transmit a packet is directly proportional to the forwarding distance. Hence, LMT is
said to be biased towards the bottleneck node. Extensive simulation results were provided to
evaluate the performance of LMT with respect to a number of different metrics (i.e., two
definitions of the network lifetime, the root mean square value of remaining energy, the packet
delivery ratio, and the energy consumption per transmitted packet) in comparison to a variety of
existing multicast routing algorithms and Least-cost Path Tree (LPT) [35][36]. These results
clearly demonstrate the effectiveness of LMT over a wide range of simulated scenarios.
3.7 Lifetime-aware Refining Energy Efficiency of Multicast Trees (L-REMIT)
Lifetime of a multicast tree in terms of energy is the duration of the existence of the multicast
service until a node dies due its lack of energy. L-REMIT [12] is a distributed protocol and is
part of a group of protocols called REMIT (Refining Energy efficiency of Multicast Trees). It
uses a minimum-weight spanning tree (MST) as the initial tree and improves its lifetime by
switching children of a bottleneck node to another node in the tree. A multicast tree is obtained
from the “refined” MST (after all possible refinements have been done) by pruning the tree to
reach only multicast group nodes. L-REMiT is a distributed algorithm in the sense that each
node gets only a local view of the tree and each node can independently switch its parent as long
as the multicast tree remains connected that utilizes an energy consumption model for wireless
6. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
6
communication. L-REMiT takes into account the energy losses due to radio transmission as
well as transceiver electronics. L-REMiT adapts a given multicast tree to a wide range of
wireless networks irrespective of whether they use long-range radios or short-range radios [1],
[12].
3.8 Localized Energy-aware Routing (LEAR) Protocol
Local Energy-Aware Routing (LEAR) [37] simultaneously optimizes trade-off between
balanced energy consumption and minimum routing delay and also avoids the blocking and
route cache problems. LEAR accomplishes balanced energy consumption based only on local
information, thus removes the blocking property. Based on the simplicity of LEAR, it can be
easily be integrated into existing ad hoc routing algorithms without affecting other layers of
communication protocols. Simulation results show that energy usage is better distributed with
the LEAR algorithm as much as 35% better compared to the DSR algorithm. LEAR is the first
protocol to explore balanced energy consumption in a pragmatic environment where routing
algorithms, mobility and radio propagation models are all considered [5], [12].
3.9 Conditional Max-Min Battery Capacity Routing (CMMBCR) Protocol
The Conditional Max-Min battery capacity routing (CMMBCR) [38] protocol utilizes the idea
of a threshold to maximize the lifetime of each node and to fairly use the battery fairly. If all
nodes in some possible routes between a source-destination pair have larger remaining battery
energy than the threshold, the min-power route among those routes is chosen [5]. If all possible
routes have nodes with lower battery capacity than the threshold, the max-min route is chosen.
CMMBCR protocol selects the shortest path if all nodes in all possible routes have adequate
battery capacity (i.e. the greater threshold). When the battery capacity for some nodes goes
below a predefined threshold, routes going through these nodes will be avoided, and therefore
the time until the first node failure, due to the exhaustion of battery capacity is extended. By
adjusting the value of the threshold, we can maximize either the time when the first node
powers down or the lifetime of most nodes in the network [39].
3.10 SPAN: An Energy Efficient Coordination Algorithm for Topology Maintenance
SPAN: An energy-efficient coordination algorithm for topology maintenance [40] is a
distributed synchronization technique for multi hop ad hoc wireless networks that minimizes
energy consumption without notably diminishing the connectivity of the network. SPAN
coordinates the “stay-awake and sleep” cycle of the nodes and also performs multi-hop packet
routing within the ad hoc network, while other nodes remain in power saving mode and
periodically check if they should remain awaken and become a coordinator. SPAN adaptively
elects coordinators by allowing each node to use a random back-off delay to decide whether to
become a coordinator in the network and rotates them in time. The back-off delay for a node is a
function of the number of other nodes in the neighbourhood and the amount of energy left in
these nodes. This technique not only preserves network connectivity, it also preserves capacity,
decreases latency and provides significant energy savings. The amount of energy saving
provided by SPAN increases only slightly as density decreases. Current implementation of span
uses the power saving features, since the nodes practically wake up and listen for traffic
advertisements [5].
3.11 Power-aware Multiple Access (PAMAS) Protocol
PAMAS [41] is an extension to the AODV protocol; it uses a new routing cost model to
discourage the use of nodes running low on battery power. PAMAS also saves energy by
turning off radios when the nodes are not in use. Results show that the lifetime of the network is
improved significantly. There is a trivial negative effect on packet delivery fraction and delay,
except at high traffic scenarios, where both actually improve due to reduced congestion.
7. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
7
Routing load, however, is consistently high, more at low traffic scenarios. For the most part,
PAMAS demonstrates significant benefits at high traffic and not-so-high mobility scenarios.
Although, it was implemented on the AODV protocol, the technique used is very standard and
can be used with any on-demand protocol. The energy-aware protocol works only in the routing
layer and exploits only routing-specific information [13].
3.12 Geographic Adaptive Fidelity (GAF) Protocol
Geographical adaptive fidelity (GAF) protocol [34], [42] reduces energy consumption in ad hoc
wireless networks; it is used for extending the lifetime of self-configuring systems by exploiting
redundancy to conserve energy while maintaining application fidelity. By identifying nodes that
are equivalent from a routing perspective and then turning off unnecessary nodes, maintaining a
constant level of routing fidelity, this protocol is able to conserve energy. GAF also uses
application-and system-level information; nodes that source or sink data remain on and
intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad
hoc routing protocol; simulation studies of GAF show that it can consume 40% to 60% less
energy than other ad hoc routing protocol. Also, network lifetime increases proportionally to
node density [5].
3.13 Prototype Embedded Network (PEN) Protocol
The Prototype Embedded Network (PEN) protocol [23] exploits the low duty cycle of
communication activities and powers down the radio device when it is idle. Nodes interact
asynchronously without master nodes and thus, the costly master selection procedure as well as
the master overloading problem can be avoided. But in order for nodes to communicate without
a central coordinator, each node has to periodically wake up, make its presence by broadcasting
beacons, and listens a moment for any communication request before powering down again. A
transmitting source node waits until it hears a beacon signal from the intended receiver or server
node. Then, it informs its intention of communication during the listening period of the server
and starts the communication. Due to its asynchronous operation, the PEN protocol minimizes
the amount of active time and thus saves substantial energy. However, the PEN protocol is
effective only when the rate of interaction is fairly low, thus more suited for applications
involving simple command traffic rather than large data traffic [5].
3.14 Protocol for Unified Multicast through Announcements (PUMA)
PUMA [13] is a protocol that uses simple multicast announcements to elect a core for the group
and inform all routers of their distance and next-hops to the core, join, and leave the multicast
group. PUMA provides the lowest and a very tight bound for the control overhead compared to
ODMRP and MAODV. In other words, the control overhead of PUMA is almost constant node
when mobility, number of senders, multicast group size or traffic load is changed. It also
provides the highest packet delivery ratio for all scenarios [5]. The mesh constructed by PUMA
provides redundancy to the region containing receivers, thus reducing unnecessary
transmissions of multicast data packets. PUMA does not depend on the existence of any specific
pre-assigned unicast protocol [1].
3.15 Predictive Energy-efficient Multicast Algorithm (PEMA)
The Predictive Energy-efficient Multicast Algorithm (PEMA) [43] exploits statistical properties
of the network to solve scalability and overhead issues caused by large scale MANETs as
opposed to relying on route details or network topology. The running time of PEMA depends on
the multicast group size, not network size; this makes PEMA fast enough even for MANETs
consisting of 1000 or more nodes. Simulation results show that PEMA not only results in
significant energy savings compared to other existing algorithms, but also attains good packet
delivery ratio in mobile environments. A distinct feature in PEMA is its speed; it is extremely
8. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
8
fast because its running time is independent of its network size and the routing decision does not
rely on the information about network topology or route details [33].
4. SURVEY OF SECURITY MULTICAST ROUTING PROTOCOLS
Secure communication is a major concern in wireless ad hoc networks due to the broadcast
nature of this type of network, the existence of a wireless medium, and the lack of any
centralized infrastructure. This makes MANETs vulnerable to eavesdropping, interference,
spoofing, and etc. Multicast routing protocols should take this into account, especially because
some of these protocols are applied in areas such as military (battlefield) operations, national
crises, and emergency operations. The unique characteristics of MANETs, combined with
security threats, demand solutions for securing ad hoc networks prior to their use in commercial
and military applications. Some of the unique characteristics of MANETs that pose a strong
challenge to the design of the secure multicast routing protocols include: open peer-to-peer
network architecture, shared wireless medium, demanding resource constraints, and dynamic
network topology. These challenges clearly make a case for designing and developing strong
secure routing protocols that achieve extensive protection as well as provide desirable network
performance [44].
Routing is a challenging aspect of moving packets around in a network. It is a significant
problem because any node can perform the role of the router in MANET and security concepts
were not included into the routing protocols when they were designed. It is important because
the routing table forms the basis of the network operations and any corruption of routing table
may lead to significant consequences. Routing attacks in mobile ad hoc network are more
challenging since routing relies on the trustworthiness of all the nodes involved. Also it is
difficult to differentiate between a compromised node from a selfish node, the latter of the nodes
do not cooperate during packet forwarding mainly due to reduce availability of critical resources
such as residual energy and available bandwidth [45].
Secure multicast routing protocols are complex to design, due to the fact that they operate with
limited resources as well as due to the highly dynamic nature of the network. Existing routing
protocols that are not secure are likely to spread routing information quickly as scenarios
change, which causes more recurrent communication between the nodes in a conventional
network. To avoid possible Denial of Service Attacks, resource-intensive and complicated
security mechanisms to have to be deployed; but this can delay or prevent the network from
exchanging information. Routing protocols for ad hoc networks generally can be divided into
three main categories: Proactive protocols, Reactive protocols and Hybrid protocols.
In a proactive routing protocol, nodes from time to time exchange routing information with
other nodes so that each node always knows a currently available route to all destinations.
Maintenance of such an updated routing table requires each node to periodically broadcast
control packets throughout the entire network. This means that the routes to destination nodes
are calculated at regular time instants, before ascertaining the connection from source to
destination. When a source node wants to send data to a destination node, it searches the routing
table to find a route to the destination node. With the proactive routing approach, the control
overhead is significantly large because control packets are sent periodically to maintain all
routes even though some of the routes might not be used. An example of proactive routing
protocol is Dynamic Sequenced Destination Vector (DSDV) routing protocol [46].
In contrast, in a reactive routing protocol, nodes exchange routing information only as needed; a
node will only try to find out a route to some destination only when it has data packets to
transmit to that destination (e.g., [Error! Reference source not found.]). These protocols
usually have to go through two phases: route discovery (establish routes to destination) and
9. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
9
route maintenance. The route to the destination could break, due to the dynamically changing
topology, leading to frequent execution of route discovery and route maintenance procedures.
This leads to an appreciable route acquisition latency that significantly contributes to the end-to-
end delay per transmitted data packet. An example of a reactive routing protocol is Dynamic
Source Routing Protocol (DSR) [47].
Hybrid routing protocols [48] is a combination of both proactive and reactive protocols. They
use distance-vectors to precisely keep track of the routing metrics and to determine the best
route to destination networks, and will broadcast routing table updates only when there is a
change in the network topology. This allows for rapid convergence, and also requires reduced
processing power and lower memory. An example of Hybrid routing protocols is the Zone
Routing Protocol (ZRP) [49].
4.1 Security-aware Ad hoc Routing (SAR) Protocol
Security-aware Ad hoc Routing (SAR) [50] is a technique that incorporates security attributes as
parameters into ad hoc route discovery. SAR uses of security as a metric to tradeoff and
improve the applicability of the routes uncovered by ad hoc routing protocols. Ad hoc routing
protocols enable nodes to mutually exchange information. Intermediate nodes receive data
packets at a particular security level and process these packets or forward the packets relying on
the security level of the intermediate node. If the required security level cannot be guaranteed,
Route Request (RREQ) packets are dropped. Otherwise Route Reply (RREP) packets are sent
back to the source from destination or intermediate nodes. This approach is resource demanding
but it is a useful mechanism for prevention of attacks.
4.2 Security Efficient Ad hoc Distance Vector Routing Protocol (SEAD)
The Secure Efficient Ad Hoc Distance (SEAD) [24] routing protocol is a secure robust routing
protocol that protects against multiple attackers creating incorrect routing state in any other
node, even when active attackers are present in the network. The design of SEAD, in part, was
based on the DSDV ad hoc network routing protocol, and especially, on the DSDV-SQ (for
sequence number) version of the protocol. DSDV-SQ, is known to do better than other DSDV
versions in terms of packet delivery ratio, although it does create more overhead in the network,
due to an increase in the number and size of routing advertisements. The increase in the size of
each advertisement is attributed to the addition of the hash value on each entry for
authentication [44]. As a result, SEAD is efficient and can be used in energy and bandwidth-
constrained nodes.
4.3 Security Grid Location Service Forwarding (SGLSF)
The SGLSF [51] mechanism was proposed after combining Secure Geographic Forwarding
(SGF) [52] and Grid Location Service (GLS) [53]. The SGF mechanism uses the shared key and
the Timed Efficient Stream Loss-tolerant Authentication (TIK) [54] protocol to provide source
authentication, neighbor authentication, and message integrity by incorporating hashed message
authentication code (MAC1). By combining these SGF and GLS, SGLSF, enhances the security
to the original protocol to ensure that any receiver can authenticate the accuracy of location
messages. SGLS has the ability to message tampering, dropping, falsified injection, and replay
attacks. The authors in [51] also came up with another mechanism, called the Local Reputation
System (LRS), and its aim is to discover compromised and selfish users and isolate messages by
dropping attackers from the network. Both mechanisms combined; continue to maintain a larger
message delivery ratio at the expense of a slightly higher average end-to-end delay and routing
overhead compared to when they are not combined. After a performance analysis was done on
both SGLS and LRS, and comparing them with the original GLS, results show that SGLS can
operate efficiently by using effective cryptographic mechanisms.
10. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
10
4.4 Ariadne
Ariadne [55] is a secure on-demand routing protocol that prevents attackers or compromised
nodes from interfering with uncompromised routes consisting of uncompromised nodes, and
also prevents different of types of Denial-of-Service attacks. Araidne uses only highly efficient
symmetric cryptographic primitives, which helps the secure protocol to effectively defend
against node compromise. Araidne does not require any trusted hardware powerful processors.
It can authenticate routing messages using one of three schemes: shared secrets between each
pair of nodes, shared secrets between communicating nodes combined with broadcast
authentication, or digital signatures [56], [57]. When Ariadne is paired with Timed Efficient
Stream Loss-tolerant Authentication (TESLA) [58], [59], it provides an efficient broadcast
authentication scheme that requires loose time synchronization. Use of pair-wise shared keys
avoids the need for synchronization, but at the cost of higher key setup overhead; broadcast
authentication such as TESLA also allows additional protocol optimizations.
4.5 EndairALoc
Secure routing protocols add security features to the normal routing protocols, leading to secure
communication at the cost of increased energy consumption. Verification of the message
authentication code and location information increases the computation consumption of the
initiator and the latency of route discovery. The propagation of Route Request (RREQ)
messages, each node takes a few actions. Intermediate nodes only need to generate message
authentication codes during the propagation of Route Reply (RREP) messages. The EndairALoc
protocol (an adaptation of Ariadne) provides the security of Araidne; but, also could resist the
man-in-the-middle attack and even the wormhole attack. Furthermore, EndairALoc uses
symmetric key mechanism instead of the public key mechanism, so energy consumption during
route discovery decreases significantly.
4.6 Secure Routing Protocol (SRP)
Secure Routing Protocol (SRP) [60] is a secure route discovery protocol that mitigates the
detrimental effects of malicious behavior and guarantees correct route discovery, so that altered,
or replayed route replies are refused and will never get to the route requesting node. SRP only
deduces a security association between the end-points of a path and so the nodes in between do
not have to be trusted for route discovery. This is done by insisting that the Route Request
(RREQ) along with a unique random query identifier reach the destination, where a route reply
is built and a message authentication code is calculated over the path and returned to the source.
The authors in [60] confirm the accuracy of the protocol analytically. SRP’s responsiveness is
safeguarded under different types of attacks that exploit the routing protocol itself. The sole
requirement of this scheme is the existence of a security association between the node initiating
the query and the sought destination; any two nodes that wish to communicate securely can
simply establish a shared secret, to be used by their routing protocol modules.
4.7 Secure Link State Routing Protocol (SLSP)
Secure Link State Routing Protocol (SLSP) [61] is a proactive MANET protocol that secures
the discovery and the distribution of link state information across mobile ad hoc domains. It
provides accurate and authentic link state information, robustness against Byzantine behavior
and failures of individual nodes. Byzantine Behavior can be described as any behavior in an ad
hoc or wireless network where one or more devices work in collusion to disrupt the network.
Examples are Denial of service behavior, dropping or altering packets, topology distortion,
impersonation, wormholes, and a host of other security challenges. The scope of SLSP may
range from a secure neighborhood discovery to a network-wide secure link state protocol. SLSP
nodes disseminate their link state updates and maintain topological information for a zone of
network nodes within R hops. More specifically, SLSP is capable of adjusting its scope between
11. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
11
local and network-wide topology discovery and operating in networks of frequently changing
topology and group membership.
4.8 Security-aware Adaptive DSR (SADSR) Protocol
The Security-aware Adaptive DSR (SADSR) [62] is a secure on-demand routing protocol for
mobile ad hoc wireless networks in which every node maintains routes only with the nodes that
it communicates with. SADSR authenticates the routing protocol messages using digital
signatures based on asymmetric cryptography. The fundamental scheme behind SADSR is to
manage multiple routes to each destination and store a local trust value for each node in the
network. The trust value for a path is computed and assigned to each path based on trust values
of the nodes which occur on the path. The paths with higher trust values are preferred for
routing. When the performance of SADSR and DSR are compared, results show that in the
presence of malicious nodes in the network SADSR outperforms DSR with respects to packet
delivery ratio under an acceptable network load. In the presence of malicious nodes SADSR
outperforms DSR with respect to throughput. In both cases, SADSR introduces a reasonable
network load to establish high packet delivery ratio.
4.9 Authenticated Routing for Ad hoc Networks (ARAN)
Authenticated Routing for Ad hoc Networks (ARAN) [63] is a simple protocol that does not
require significant additional work from nodes within the group by providing secure routing for
the managed-open and open environments using public-key cryptographic mechanisms to defeat
all identified attacks. Results show that ARAN is as effective as AODV in discovering and
maintaining routes. The overhead with ARAN is large size routing packets, which result in a
higher overall routing load, and higher latency in route discovery because of the cryptographic
computation that must occur. ARAN can effectively and efficiently discover secure route in
environments where nodes are authorized to participate but not trusted to cooperate, as well as
environments where participants do not need to be authorized to participate. This scheme
introduces authentication, message integrity, and non-repudiation to routing in an ad hoc
environment as part of a minimal security policy. Results show that although there is a greater
performance cost to ARAN as compared to DSR or AODV, the minimal increase in cost is
outweighed by the increased security.
4.10 Secure Ad hoc On-Demand Distance Vector (SAODV) Routing Protocol
The Secure Ad hoc On-Demand Distance Vector (SAODV) [55] routing protocol is an efficient
secure routing protocol for mobile ad hoc networks that guarantees the discovery of correct
connectivity information over an unknown network, in the presence of malicious nodes.
SAODV is capable of operating without the existence of an on-line certification authority or the
complete knowledge of keys of all network nodes. Its sole requirement is that any two nodes
that wish to communicate securely can simply establish a shared secret, to be used by their
routing protocol modules. Moreover, the correctness of the protocol is retained irrespective of
any permanent binding of nodes to IP addresses, a feature of increased importance for open,
dynamic, and cooperative MANET environments.
5. CONCLUSIONS
A mobile ad hoc network (MANET) consists of autonomous mobile nodes, each of which
communicates directly with the nodes within its wireless range or indirectly with other nodes in
a network. In order to facilitate secure and reliable communication within a MANET, an
efficient routing protocol is required to discover routes between mobile nodes. The field of
MNAETs is rapidly growing due to the many advantages and different application areas.
Energy efficiency and security are some challenges faced in MANETs, especially in designing a
routing protocol. In this paper, we surveyed a number of energy efficient multicast routing
12. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
12
protocols and secure multicast routing protocols. In many cases, it is difficult to compare these
protocols with each other directly since each protocol has a different goal with different
assumptions and employs mechanisms to achieve the goal. According to the study, these
protocols have different strengths and drawbacks. A multicast protocol can hardly satisfy all
requirements. In other words, one routing protocol cannot be a solution for all energy efficient
and security issues that are faced in MANETs, but rather each protocol is designed to provide
the maximum possible requirements, according to certain required scenarios.
In future years, as mobile computing keeps growing, MANETs will continue to flourish, and
even if a multicast protocol meeting all the requirements it is designed for, it will be very
complicated and will need a tremendous amount of routing information to be maintained.
Moreover, it will not be suitable for environments with limited resources. Satisfying most of the
requirements would provide support for secure communication, minimize storage and resource
consumption, ensure optimal paths and minimize network load.
REFERENCES
[1] X. Chen, J. Wu, Multicasting Techniques in Mobile Ad-hoc Networks, Computer Science
Department, SouthWest Texas State University, San Marcos, The Handbook of Ad-hoc Wireless
Networks (2003) pp. 25–40.
[2] W. Luo and Y. Fang, A Survey of Wireless Security in Mobile Ad hoc Networks: Challenges and
Available Solutions, Ad hoc wireless networking. Dordrecht: Kluwer Academic Publishers; 2003. pp.
319–64.
[3] M. Mohammed, Energy Efficient Location Aided Routing Protocol for Wireless MANETs,
International Journal of Computer Science and Information Security, vol. 4, no. 1 & 2, 2009.
[4] M. Cheng, J. Shun, M. Min ,Y. Li and W. Wu, Energy-Efficient Broadcast and Multicast Routing in
Multihop Ad Hoc Wireless Networks, Wireless Communications and Mobile Computing, vol. 6, no.
2, pp. 213–223, 2006.
[5] O. Tariq, F. Greg, W. Murray, On the Effect of Traffic Model to the Performance Evaluation of
Multicast Protocols in MANET, Proceedings of the Canadian Conference on Electrical and Computer
Engineering, pp. 404–407, 2005.
[6] L Junhai, X Liu, Y Danxia, Research on Multicast Routing Protocols for Mobile Ad-Hoc Networks
Computer Networks – Elsevier, 2008.
[7] K. Chen and K. Nahrstedt, Effective Location-Guided Tree Construction Algorithms for Small Group
Multicast in MANETs, Proceedings of the IEEE INFOCOM Conference, pp. 1180–89, 2002.
[8] C.W. Wu, Y.C. Tay, C.K. Toh, Ad-hoc Multicast Routing Protocol Utilizing Increasing Id-numbers
(AMRIS) Functional Specification, Internet draft, November 1998.
[9] C. Wu, Y. Tay, and C. Toh, Ad hoc Multicast Routing protocol utilizing Increasing id-numberS
(AMRIS) Functional Specification, Internet Draft (work in progress), November 1998,
http://www.ietf.org/internet-drafts/draft-ietf-manet-amris-spec-00.txt
[10] J.J. Garcia-Luna-Aceves and E.L. Madruga, The Core Assisted Mesh Protocol, IEEE Journal on
Selected Areas in Communications, vol. 17, no. 8, pp. 1380-1394, August 1999.
[11] T.A. Dewan, Multicasting in Ad-hoc Networks, University of Ottawa, 2005, pp. 1–9.
[12] B. Wang and S. K. S. Gupta, On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc
Networks, Proceedings of the IEEE International Conference on Parallel Processing, 2003.
13. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
13
[13] R. Vaishampayan, J.J. Garcia-Luna-Aceves, Energy Efficient and Robust Multicast Routing in
Mobile Ad Hoc Networks, Proceedings of the IEEE International Conference on Mobile Ad-hoc and
Sensor Systems, 2004.
[14] C. T. Chiang and Y. M. Huang, A Sequence and Topology Encoding for Multicast Protocol (STMP)
in Wireless Ad hoc Networks, Proceedings of the IEEE international conference on parallel and
distributed computing, applications and technologies pp. 351-355, 2003.
[15] M.C.C. De, H. Gossain, D.P. Agrawal, Multicast over Wireless Mobile Ad-hoc Networks: Present
and Future Directions, IEEE Network, 52–59, 2003.
[16] J. G. Jetcheva and D. B. Johnson: Adaptive Demand-Driven Multicast Routing in Multi-Hop
Wireless Ad Hoc Networks, Proceedings of the 2nd ACM International Symposium on Mobile and
Ad-hoc Networking & Computing (MobiHOC), pages 33 - 44, Long Beach, CA, October 2001.
[17] Y. Lia, X. Chengb and W. Wuc, Optimal Topology Control for Balanced Energy Consumption in
Wireless Networks. J. Parallel and Distributed Computing, vol. 65, no. 2, pp. 124 – 131, February
2005.
[18] M. Maleki and M. Pedram, Lifetime-Aware Multicast Routing in Wireless Ad hoc Networks,
Proceedings of IEEE Wireless Communications and Networking Conference, 2004.
[19] L. Xiao, L. Ni, A. Esfahania, Prioritized Overlay Multicast in Mobile Ad hoc Environments, IEEE
Computer, vol. 37, no. 2, pp. 67–74, 2004.
[20] M. Gerla, S.J. Lee, W. Su, On-Demand Multicast Routing Protocol (ODMRP) for Ad-hoc Networks,
Internet draft, draft-ietf-manet-odmrp-02.txt, 2000.
[21] Q. Li, J. Aslam, D. Rus, Online Power Aware Routing, Proceedings of International Conference on
Mobile Computing and Networking (MobiCom’2001), 2001.
[22] S. Doshi, T. X. Brown, Minimum Energy Routing schemes in Wireless Ad hoc networks, IEEE
INFOCOM 2002
[23] G. Girling, J. Li Kam Wa, P. Osborn, R. Stefanova, The Design and Implementation of a Low Power
Ad Hoc Protocol Stack, IEEE Personal Communications, 2000.
[24] Y. Hu, D. Johnson, A. Perrig, SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless
Ad hoc Networks, vol. 1, no. 1, pp. 175-192, July 2003.
[25] Y. B. Ko, and N. H. Vaidya, Location-Aided Routing (LAR) in Mobile Ad hoc Networks,
Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and
networking, 1998.
[26] The CMU Monarch Project, The CMU Monarch Extensions to the NS Simulator, URL:
http://www.monarch.cs.cmu.edu/. Page accessed on February 20th, 2010.
[27] E. Altman and T. Jimenez, Lecture Notes on NS Simulator for Beginners, December 03, 2003.
[28] C.E. Perkins and E.M. Royer, Ad hoc On Demand Distance Vector (AODV) Routing (Internet-
draft), in: Mobile Ad-hoc Network (MANET) Working Group, IETF (1998).
[29] T. Camp, J. Boleng, B. Williams, L. Wilcox, and W. Navidi, Performance Comparison of Two
Location-based Routing Protocols for Ad hoc Networks, Proceedings of the IEEE INFOCOM
Conference, pp. 1678-1687, 2002.
[30] D. B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks (Kluwer
Academic, 1996).
14. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
14
[31] D. Johnson, D.A. Maltz and J. Broch, The Dynamic Source Routing Protocol for Mobile Ad hoc
Networks (Internet-draft), in: Mobile Ad hoc Network (MANET) Working Group, IETF (1998).
[32] I. Stojmenovic and X. Lin, Power Aware Localized Routing in Wireless Networks, IEEE
Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, November 2001.
[33] V. Rishiwal, M. Yadav, S. Verma, S. K. Bajapai, Power Aware Routing in Ad Hoc Wireless
Networks, Journal of Computer Science and Technology, vol. 9, no. 2, pp. 101-109, October 2009.
[34] C. Yu, B. Lee and H. Y. Youn, Energy Efficient Routing Protocols for Mobile Ad Hoc Networks,
Cleveland State University, EFFRD Grant No. 0210-0630-10.
[35] E. Wieselthier, G. D. Nguyen, and A. Ephremides, Energy-Efficient Broadcast and Multicast Trees
in Wireless Networks, Mobile Networks and Applications (MONET), vol. 7, no. 6, pp. 481-492,
December 2002.
[36] J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Resource Management in Energy-limited,
Bandwidth-limited, Transceiver-limited Wireless Networks for Session-based Multicasting,
International Journal of Computer and Telecommunications Networking, vol. 39, no. 2, pp. 113-131,
June 2002.
[37] K. Woo, C. Yu, D. Lee, H. Yong, Y. B. Lee, Non-Blocking, Localized Routing Algorithm for
Balanced Energy Consumption in Mobile Ad Hoc Networks, Proceedings of the 9th
IEEE
MASCOTS’01, 1526-7639/01, 2001.
[38] C. K. Toh, Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad
Hoc Networks, IEEE Communications Magazine, June 2001.
[39] D. T. Ahmed and S. Shirmohammadi, Architectural Analysis of Multicast Routing Protocols for
Wireless Ad Hoc Networks, Proceedings of the 6th
International Conference on Networking, p. 21,
2007.
[40] B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, SPAN: An Energy-efficient Coordination
Algorithm for Topology Maintenance in Ad Hoc Wireless Networks, ACM Wireless Networks, vol.
8, no. 5, pp. 481-494, September 2002.
[41] M. Maleki, K. Dantu and M. Pedram, Power-Aware On-Demand Routing Protocols for Mobile Ad
Hoc Networks, Proceedings of the International Symposium on Low Power Electronics and Design,
pp. 72-75, 2002.
[42] Y. Xu, J. Heidemann and D. Estrin, Geography Informed Energy Conservation for Ad Hoc Routing,
Proceedings of the 7th
Annual ACM Conference on Mobile computing and Networking, 2001.
[43] J. Kao, R. Marculescu, Predictive Energy-efficient Multicast for Large Scale Mobile Ad Hoc
Networks, Proceedings of the Consumer Communications and Networking Conference, pp. 709-713,
January 2008.
[44] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, J.G. Jetcheva, A Performance Comparison of Multi-
hop Wireless Ad hoc Network Routing Protocols, Proceedings of the Fourth Annual ACM/IEEE
International Conference on Mobile Computing and Networking, pp. 85–97, October 1998.
[45] S. Alampalayam, A. Kumar, and S. Srinivasan, Mobile ad hoc network security – A Taxonomy,
Proceedings of the 7th International Conference on Advanced Communication Technology, vol. 2,
pp. 1123–1127, May 2005.
[46] S-Y. Oh, J-S. Park and M. Gerla, E-ODMRP: Enhanced ODMRP with Motion Adaptive Refresh,
Journal of Parallel and Distributed Computing, vol. 68, no. 8, pp. 1044-1053, August 2008.
15. International journal on applications of graph theory in wireless ad hoc networks and sensor networks
(GRAPH-HOC) Vol.2, No.2, June 2010
15
[47] D. B. Johnson, D. A. Maltz, and J. Broch. The Dynamic Source Routing Protocol for Multi-hop
Wireless Ad Hoc Networks. In Ad Hoc Networking, edited by Charles E. Perkins, chapter 5, pp.
139–172. Addison-Wesley, 2001.
[48] F. Roy, K. Gabriel, Location Services in Wireless Ad-hoc and Hybrid Networks: A Survey,
Technical Report, Department of Computer Science, Technion, CS-2006-10, Haifa, Israel, 2006.
[49] M. Abolhasan, T. Wysocki, and E. Dutkiewicz. A Review of Routing Protocols for Mobile Ad hoc
Networks, vol. 2, no. 1, pp. 1-22, Ad Hoc Networks, January 2004.
[50] S. Yi, P. Naldurg, R. Kravets, Security Aware Ad Hoc Routing in Wireless Networks, Proceedings
of the ACM MobiHOC Conference, 2001.
[51] J. Song, V. Wong, V. Leung, Secure Position Based Routing Protocols for Mobile Ad hoc Networks,
vol. 5, no. 1, pp. 76-86, January 2007.
[52] H. Krawczyk, M. Bellare, R. Canetti, HMAC: Keyed Hashing for Message Authentication, IETF
RFC 2104, February 1997.
[53] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris, A Scalable Location Service for
Geographic Ad hoc Routing, Proceedings of the ACM Mobile Computing and Networking
Conference, August 2000.
[54] A. Perrig, R. Canetti, D. Song, D. Tygar, B. Briscoe, TESLA: Multicast Source Authentication
Transform Introduction, IETF Internet Draft of Multicast Security Working Group (work in
progress), August 2004.
[55] Y. Hu, A. Perrig, D. Johnson, Ariadne: A Secure On Demand Routing Protocol for Ad Hoc
Networks, Proceedings of the ACM Mobile Computing and Networking Conference, 2002.
[56] Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF
MANET Mailing List, Available at ftp://manet.itd.nrl.navy.mil/pub/manet/2001-10.mail, October 8,
2001.
[57] K. Zhang, Efficient Protocols for Signing Routing Messages, Proceedings of the Symposium on
Network and Distributed Systems Security (NDSS ’98), March 1998.
[58] A. Perrig, R. Canetti, J.D. Tygar, and D. Song, Efficient Authentication and Signing of Multicast
Streams over Lossy Channels, Proceedings of the IEEE Symposium on Security and Privacy, pp. 56–
73, May 2000.
[59] A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar. SPINS: Security Protocols for Sensor
Networks, Proceedings of the Seventh Annual International Conference on Mobile Computing and
Networking (MobiCom 2001), pp. 189–199, July 2001.
[60] P. Papadimitratos and Z. J. Haas, Secure Routing for Mobile Ad hoc Networks, Proceedings of the
SCS Communication Networks and Distributed Systems Modeling and Simulation Conference,
January 2002.
[61] P. Papadimitratos and Z. J. Haas, Secure Link State Routing for Mobile Ad Hoc Networks,
Proceedings of the IEEE International Symposium on Applications and the Internet, 2003.
[62] S. Ghazizadeh, O. Ilghami and E. Sirin, Security-Aware Adaptive Dynamic Source Routing
Protocol, Proceedings of the 27th
IEEE Conference on Local Computer Networks, 2002.
[63] K. Sanzgiri, D. LaFlamme and B. Dahill, Authenticated Routing for Ad hoc Networks, Proceedings
of the IEEE International Conference on Network Protocols, 2002.