The lack of static infrastructure causes several issues in mobile Ad Hoc network , such as energy utilization, node authentication and secure routing. In this paper we propose a new scheme for energy efficient secure routing of data packets in MANET. This approach will reduce the computational overhead to make it more energy efficient than existing schemes. As there is no stationary infrastructure,each node in MANET acts a router that forwards data packets to other nodes. Therefore selection of effective, suitable, adaptive and robust routing scheme is of utmost importance. We have reduced the amount of network activity for each node required to route a data packet. This leads to lesser wastage of energy and increases security.Our simulation results will show how this is energy efficient and
secure. Finally we have discussed how this scheme prevents various attacks which may jeopardize any wireless network.
A survey on trust based secure routing in manetcsandit
A mobile ad hoc network is a wireless network in which no infrastructure is available. MANET is a selfconfiguring
network. Due to dynamic nature of MANET it is very challenging work to employ a secure
route. The intermediate nodes cooperate with each other as there is no such base station or access point.
The routing protocols play important role in transferring data. Cryptographic mechanisms are used in
routing protocols to secure data packets while transmitted in the network. But cryptographic techniques
incur a high computational cost and can’t identify the nodes with malicious intention. So, employing
cryptographic techniques in MANET are quite impractical as MANETs have limited resource and
vulnerable to several security attacks. Trust mechanism is used as an alternative to cryptographic
technique. Trust mechanism secures data forwarding by isolating nodes with malicious intention using trust
value on the nodes. In this paper we survey different trust based protocols of MANET and compare their
performances.
Discovering adaptive wireless sensor network using β synchronizereSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Discovering adaptive wireless sensor network using eSAT Journals
Abstract When we consider the standard Bellman-Ford algorithm, it uses static values of link cost function and distance function. These static values are stored in sink node so that the sink node requires memory to keep data safe. Therefore the space, message and time complexity of a network and node increases. To overcome this we discover Fast Time Dependent Shortest Path algorithm with message and used in network with β synchronizer. The FTSP algorithm uses dynamic values of link cost function and distance function and to store these values we are using vector compression method so that there is no need to store the data into the sink node. Because of this the message, time and space complexity of node will be decreases. Keywords- Duty cycle, Time dependent, β synchronizer
This document discusses internetworking and the key concepts involved. It explains that an internetwork allows different networks to communicate by connecting them through intermediate systems like routers and bridges. There are two main architectural approaches for building an internetwork - connection-oriented which establishes virtual circuits, and connectionless which treats each packet independently. Connectionless is preferred and uses the Internet Protocol (IP). The document outlines the requirements, components, and operation of a connectionless internetwork. It also discusses important design issues like routing, datagram lifetime, fragmentation, error control, and flow control.
The document outlines a final project to design and implement a basic node-based networking system without internet service providers. It proposes using GPS coordinates to assign addresses and simulating data transfer between nodes to test performance. The key steps are:
1) Assign each node a unique address based on its GPS coordinates.
2) Specify node properties like transfer rate and range.
3) Simulate data transfer between random node pairs to determine latency and throughput.
4) Analyze the results to find worst-case performance and compare to typical internet speeds.
The goal is to evaluate if a decentralized mesh network could feasibly replace traditional internet infrastructure. The document describes addressing schemes, node specifications, and the process
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...cscpconf
In this paper, we have taken out the concern of security on a Medium Access Control layer
implementing Assured Neighbor based Security Protocol to provide the authentication,
confidentiality and taking in consideration High speed transmission by providing security in
parallel manner in both Routing and Link Layer of Mobile Ad hoc Networks. We basically
divide the protocol into two different segments as the first portion concentrates, based on
Routing layer information; we implement the scheme for the detection and isolation of the
malicious nodes. The trust counter for each node is maintained which actively increased and
decreased considering the trust value for the packet forwarding. The threshold level is defined differencing the malicious and non malicious nodes. If the value of the node in trust counter lacks below the threshold value then the node is considered as malicious. The second part focus on providing the security in the link layer, the security is provided using CTR (Counter) approach for authentication and encryption. Hence simulating the results in NS-2, we come to conclude that the proposed protocol can attain high packet delivery over various intruders while attaining low delays and overheads.
Lab Seminar 2009 12 01 Message Drop Reduction And Movementtharindanv
The document describes a proposed cluster-based ad hoc network for a home environment using description-based addressing and routing. Key points:
- Nodes are clustered based on their physical locations in the home. Cluster heads route messages between clusters.
- Descriptions like "kitchen television" are used for addressing instead of IP addresses. Routing uses partial name matches to route in the general direction of the destination.
- A directional routing cache stores partial names of other clusters to route between clusters not directly connected. It is divided proportionally between outgoing links.
- Simulations show this approach achieves 100% delivery success rate with low message misdirection compared to a single non-directional cache. Introdu
A survey on trust based secure routing in manetcsandit
A mobile ad hoc network is a wireless network in which no infrastructure is available. MANET is a selfconfiguring
network. Due to dynamic nature of MANET it is very challenging work to employ a secure
route. The intermediate nodes cooperate with each other as there is no such base station or access point.
The routing protocols play important role in transferring data. Cryptographic mechanisms are used in
routing protocols to secure data packets while transmitted in the network. But cryptographic techniques
incur a high computational cost and can’t identify the nodes with malicious intention. So, employing
cryptographic techniques in MANET are quite impractical as MANETs have limited resource and
vulnerable to several security attacks. Trust mechanism is used as an alternative to cryptographic
technique. Trust mechanism secures data forwarding by isolating nodes with malicious intention using trust
value on the nodes. In this paper we survey different trust based protocols of MANET and compare their
performances.
Discovering adaptive wireless sensor network using β synchronizereSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Discovering adaptive wireless sensor network using eSAT Journals
Abstract When we consider the standard Bellman-Ford algorithm, it uses static values of link cost function and distance function. These static values are stored in sink node so that the sink node requires memory to keep data safe. Therefore the space, message and time complexity of a network and node increases. To overcome this we discover Fast Time Dependent Shortest Path algorithm with message and used in network with β synchronizer. The FTSP algorithm uses dynamic values of link cost function and distance function and to store these values we are using vector compression method so that there is no need to store the data into the sink node. Because of this the message, time and space complexity of node will be decreases. Keywords- Duty cycle, Time dependent, β synchronizer
This document discusses internetworking and the key concepts involved. It explains that an internetwork allows different networks to communicate by connecting them through intermediate systems like routers and bridges. There are two main architectural approaches for building an internetwork - connection-oriented which establishes virtual circuits, and connectionless which treats each packet independently. Connectionless is preferred and uses the Internet Protocol (IP). The document outlines the requirements, components, and operation of a connectionless internetwork. It also discusses important design issues like routing, datagram lifetime, fragmentation, error control, and flow control.
The document outlines a final project to design and implement a basic node-based networking system without internet service providers. It proposes using GPS coordinates to assign addresses and simulating data transfer between nodes to test performance. The key steps are:
1) Assign each node a unique address based on its GPS coordinates.
2) Specify node properties like transfer rate and range.
3) Simulate data transfer between random node pairs to determine latency and throughput.
4) Analyze the results to find worst-case performance and compare to typical internet speeds.
The goal is to evaluate if a decentralized mesh network could feasibly replace traditional internet infrastructure. The document describes addressing schemes, node specifications, and the process
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...cscpconf
In this paper, we have taken out the concern of security on a Medium Access Control layer
implementing Assured Neighbor based Security Protocol to provide the authentication,
confidentiality and taking in consideration High speed transmission by providing security in
parallel manner in both Routing and Link Layer of Mobile Ad hoc Networks. We basically
divide the protocol into two different segments as the first portion concentrates, based on
Routing layer information; we implement the scheme for the detection and isolation of the
malicious nodes. The trust counter for each node is maintained which actively increased and
decreased considering the trust value for the packet forwarding. The threshold level is defined differencing the malicious and non malicious nodes. If the value of the node in trust counter lacks below the threshold value then the node is considered as malicious. The second part focus on providing the security in the link layer, the security is provided using CTR (Counter) approach for authentication and encryption. Hence simulating the results in NS-2, we come to conclude that the proposed protocol can attain high packet delivery over various intruders while attaining low delays and overheads.
Lab Seminar 2009 12 01 Message Drop Reduction And Movementtharindanv
The document describes a proposed cluster-based ad hoc network for a home environment using description-based addressing and routing. Key points:
- Nodes are clustered based on their physical locations in the home. Cluster heads route messages between clusters.
- Descriptions like "kitchen television" are used for addressing instead of IP addresses. Routing uses partial name matches to route in the general direction of the destination.
- A directional routing cache stores partial names of other clusters to route between clusters not directly connected. It is divided proportionally between outgoing links.
- Simulations show this approach achieves 100% delivery success rate with low message misdirection compared to a single non-directional cache. Introdu
The document compares layer 3 switches and routers. It discusses their differences in performance, cost, port density, flexibility and supported protocols. Layer 3 switches are faster than routers for routing within a LAN but routers can connect LANs, MANs and WANs. They both support static and dynamic routing protocols, though layer 3 switches have limitations. While routers have more capabilities, layer 3 switches are more cost effective for high-speed inter-VLAN routing within a LAN. Both devices are needed to build a fully functional network.
Link Disconnection Entropy Disorder in Mobile Adhoc Networkspaperpublications3
Abstract: In Mobile Ad-hoc Networks, nodes move freely causing an interruption in communications. This communication interruption can be accounted in a time lapse to an entropy to connection or disconnection; the combined entropy disorder of a node’s links describe how suitable a node is to communicate to neighbors. This entropy disorder is tightly coupled to mobility and communications factors such as node’s speed or data traffic saturation. In this paper, we analyze the relationship between speed and traffic saturation into a disorder in link entropy with a focus on disconnection, namely Link Disconnection Entropy Disorder (LDED). The findings indicate a high LDED value to nodes with high speed.
The network layer is responsible for host-to-host delivery of data packets. It provides packetizing, routing, and forwarding services. Packetizing involves encapsulating the transport layer payload with a network header at the source host and decapsulating it at the destination host. Routing determines the best path between source and destination hosts using routing protocols. Forwarding involves routers inspecting packet headers and sending packets to the next network along the path.
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document summarizes a research paper on finding alternate paths in wireless networks using fast rerouting. It discusses how wireless ad hoc networks are self-configuring and nodes can join networks anywhere. Existing routing techniques have delays when links fail. The paper proposes calculating alternate paths instantly when a node fails to reduce packet loss. It would find a new path from the source to destination much faster than existing systems. When a node fails or does not respond, it would choose the next closest responding node and reroute packets along the new path immediately, without waiting for routing tables to update. This provides faster rerouting and recovery from link failures in wireless networks.
The document discusses the network layer in computer networking. It describes how the network layer is responsible for routing packets from their source to destination. It covers different routing algorithms like distance vector routing and link state routing. It also compares connectionless and connection-oriented services, as well as datagram and virtual circuit subnets. Key aspects of routing algorithms like optimality, stability, and fairness are defined.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
This document provides an overview of different types of switches and their structures used in computer networks. It discusses circuit switches, packet switches, and message switches. For structures, it covers space division switches like crossbar and multistage switches. It also discusses time division and time-space-time switches. Specific switch designs covered include Banyan switches, which route packets based on header bits, and Batcher-Banyan switches, which combine a Banyan network with a Batcher network to sort packets and reduce blocking.
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
This document is an assignment report for a course on data communication and networks. It contains an acknowledgement section thanking the course teacher and others for their support. The content section lists 12 topics that will be covered in the report, including introductions to packet switching, datagram and virtual circuit networks, encryption, and approaches to encryption across packet switching networks like link encryption and end-to-end encryption. Figures and tables are included to illustrate key concepts.
Administrator&trust based routing protocolNinad Samel
This document proposes a new routing scheme called Administrator and Trust Based Secure Routing (ATSR) for mobile ad hoc networks (MANETs). ATSR selects administrator nodes to route packets based on parameters like battery power, node coverage, reliability, and trust. It uses digital signatures and asymmetric cryptography to provide message confidentiality and integrity. Simulation results show ATSR is efficient, robust, and trustworthy. The document describes the working methodology of ATSR, related work, the proposed algorithms for administrator selection and trust/willingness calculation, packet formats, and security analysis.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
This document proposes a virtual force geometric routing protocol for non-planar graphs. It first constructs a virtual small-world network using virtual long links to reduce the number of local minima encountered in greedy routing. It then uses a virtual force method to recover from local minima without relying on face routing. Specifically, when a message reaches a local minimum, a new repulsive virtual force is added to expel the message from the minimum. This allows the protocol to iteratively route around local minima using only greedy forwarding. The protocol is implemented in Java and experiments show it can effectively route in non-planar networks.
Performance evaluation of least disruptive topology repair algorithm (ledir) ...ijwmn
In wireless sensor networks, sensor nodes fail either when some critical event occurs at the node or when
the battery of the nodes is completely drained. If the remaining nodes in the sensor network are not aware
of the node failure, the network might under undergo significant broadcast delay and path loss. An alarm
packet has to be broadcast throughout the network when any critical event occurs and the transmission
path must be recovered to achieve better quality of service in the sensor network. This paper utilizes least
disruptive topology repair (LeDir) algorithm to minimize the power consumption and to handle such
critical events. LeDir algorithm is used to recover the transmission path and to ensure that the quality of
service issues in the network is met. The variations in the throughput, roundtrip time, broadcast delays and
packet delivery ratio of the network are observed by performing multiple NS-2 simulations. It is observed
that the throughput of the network could be quickly regained when the transmission path is recovered by
node replacement.
Packet switching approaches include datagram and virtual-circuit approaches. The virtual-circuit approach involves three phases: setup, data transfer, and teardown. During setup, routers create entries for a virtual circuit based on request and acknowledgment packets exchanged. This establishes a defined path for network-layer packets to follow, identified by a flow label. Once the virtual circuit is set up, packets can be forwarded independently based only on the flow label. Finally, teardown packets remove the entries from router tables once transfer is complete.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
This document summarizes a research paper that analyzes delay performance in multi-hop wireless networks. The paper proposes using a queue grouping technique and interference model to derive a lower bound on average delay. It describes modeling a wireless network as nodes and links, with fixed routes between source-destination pairs. The paper then presents algorithms to partition the network into single-queue systems and greedily compute a delay lower bound. Simulation results are shown for various topologies. The paper also discusses using a back-pressure scheduling policy to improve delay performance close to the derived lower bounds.
Directed diffusion for wireless sensor networkingHabibur Rahman
This document summarizes the key ideas of the "Directed Diffusion for Wireless Sensor Networking" paper. It introduces directed diffusion as a data-centric paradigm for wireless sensor networks that is designed for robustness, scalability, and energy efficiency. The core concepts of directed diffusion are interests, data, gradients, and reinforcement, which work together to efficiently route queries to sensor data in the network. Through localized interactions and data aggregation, directed diffusion is shown to significantly reduce energy consumption compared to flooding-based approaches in wireless sensor networks.
Placate packet dropping attack using secure routing protocol and incentive ba...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
misrouting attack in wireless sensor networks under replication attack. agent based security schemes in Security schemes for wireless sensor networks. International journal paper on wireless sensor networks.
The document compares layer 3 switches and routers. It discusses their differences in performance, cost, port density, flexibility and supported protocols. Layer 3 switches are faster than routers for routing within a LAN but routers can connect LANs, MANs and WANs. They both support static and dynamic routing protocols, though layer 3 switches have limitations. While routers have more capabilities, layer 3 switches are more cost effective for high-speed inter-VLAN routing within a LAN. Both devices are needed to build a fully functional network.
Link Disconnection Entropy Disorder in Mobile Adhoc Networkspaperpublications3
Abstract: In Mobile Ad-hoc Networks, nodes move freely causing an interruption in communications. This communication interruption can be accounted in a time lapse to an entropy to connection or disconnection; the combined entropy disorder of a node’s links describe how suitable a node is to communicate to neighbors. This entropy disorder is tightly coupled to mobility and communications factors such as node’s speed or data traffic saturation. In this paper, we analyze the relationship between speed and traffic saturation into a disorder in link entropy with a focus on disconnection, namely Link Disconnection Entropy Disorder (LDED). The findings indicate a high LDED value to nodes with high speed.
The network layer is responsible for host-to-host delivery of data packets. It provides packetizing, routing, and forwarding services. Packetizing involves encapsulating the transport layer payload with a network header at the source host and decapsulating it at the destination host. Routing determines the best path between source and destination hosts using routing protocols. Forwarding involves routers inspecting packet headers and sending packets to the next network along the path.
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document summarizes a research paper on finding alternate paths in wireless networks using fast rerouting. It discusses how wireless ad hoc networks are self-configuring and nodes can join networks anywhere. Existing routing techniques have delays when links fail. The paper proposes calculating alternate paths instantly when a node fails to reduce packet loss. It would find a new path from the source to destination much faster than existing systems. When a node fails or does not respond, it would choose the next closest responding node and reroute packets along the new path immediately, without waiting for routing tables to update. This provides faster rerouting and recovery from link failures in wireless networks.
The document discusses the network layer in computer networking. It describes how the network layer is responsible for routing packets from their source to destination. It covers different routing algorithms like distance vector routing and link state routing. It also compares connectionless and connection-oriented services, as well as datagram and virtual circuit subnets. Key aspects of routing algorithms like optimality, stability, and fairness are defined.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
This document provides an overview of different types of switches and their structures used in computer networks. It discusses circuit switches, packet switches, and message switches. For structures, it covers space division switches like crossbar and multistage switches. It also discusses time division and time-space-time switches. Specific switch designs covered include Banyan switches, which route packets based on header bits, and Batcher-Banyan switches, which combine a Banyan network with a Batcher network to sort packets and reduce blocking.
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
This document is an assignment report for a course on data communication and networks. It contains an acknowledgement section thanking the course teacher and others for their support. The content section lists 12 topics that will be covered in the report, including introductions to packet switching, datagram and virtual circuit networks, encryption, and approaches to encryption across packet switching networks like link encryption and end-to-end encryption. Figures and tables are included to illustrate key concepts.
Administrator&trust based routing protocolNinad Samel
This document proposes a new routing scheme called Administrator and Trust Based Secure Routing (ATSR) for mobile ad hoc networks (MANETs). ATSR selects administrator nodes to route packets based on parameters like battery power, node coverage, reliability, and trust. It uses digital signatures and asymmetric cryptography to provide message confidentiality and integrity. Simulation results show ATSR is efficient, robust, and trustworthy. The document describes the working methodology of ATSR, related work, the proposed algorithms for administrator selection and trust/willingness calculation, packet formats, and security analysis.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
This document proposes a virtual force geometric routing protocol for non-planar graphs. It first constructs a virtual small-world network using virtual long links to reduce the number of local minima encountered in greedy routing. It then uses a virtual force method to recover from local minima without relying on face routing. Specifically, when a message reaches a local minimum, a new repulsive virtual force is added to expel the message from the minimum. This allows the protocol to iteratively route around local minima using only greedy forwarding. The protocol is implemented in Java and experiments show it can effectively route in non-planar networks.
Performance evaluation of least disruptive topology repair algorithm (ledir) ...ijwmn
In wireless sensor networks, sensor nodes fail either when some critical event occurs at the node or when
the battery of the nodes is completely drained. If the remaining nodes in the sensor network are not aware
of the node failure, the network might under undergo significant broadcast delay and path loss. An alarm
packet has to be broadcast throughout the network when any critical event occurs and the transmission
path must be recovered to achieve better quality of service in the sensor network. This paper utilizes least
disruptive topology repair (LeDir) algorithm to minimize the power consumption and to handle such
critical events. LeDir algorithm is used to recover the transmission path and to ensure that the quality of
service issues in the network is met. The variations in the throughput, roundtrip time, broadcast delays and
packet delivery ratio of the network are observed by performing multiple NS-2 simulations. It is observed
that the throughput of the network could be quickly regained when the transmission path is recovered by
node replacement.
Packet switching approaches include datagram and virtual-circuit approaches. The virtual-circuit approach involves three phases: setup, data transfer, and teardown. During setup, routers create entries for a virtual circuit based on request and acknowledgment packets exchanged. This establishes a defined path for network-layer packets to follow, identified by a flow label. Once the virtual circuit is set up, packets can be forwarded independently based only on the flow label. Finally, teardown packets remove the entries from router tables once transfer is complete.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
This document summarizes a research paper that analyzes delay performance in multi-hop wireless networks. The paper proposes using a queue grouping technique and interference model to derive a lower bound on average delay. It describes modeling a wireless network as nodes and links, with fixed routes between source-destination pairs. The paper then presents algorithms to partition the network into single-queue systems and greedily compute a delay lower bound. Simulation results are shown for various topologies. The paper also discusses using a back-pressure scheduling policy to improve delay performance close to the derived lower bounds.
Directed diffusion for wireless sensor networkingHabibur Rahman
This document summarizes the key ideas of the "Directed Diffusion for Wireless Sensor Networking" paper. It introduces directed diffusion as a data-centric paradigm for wireless sensor networks that is designed for robustness, scalability, and energy efficiency. The core concepts of directed diffusion are interests, data, gradients, and reinforcement, which work together to efficiently route queries to sensor data in the network. Through localized interactions and data aggregation, directed diffusion is shown to significantly reduce energy consumption compared to flooding-based approaches in wireless sensor networks.
Placate packet dropping attack using secure routing protocol and incentive ba...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
misrouting attack in wireless sensor networks under replication attack. agent based security schemes in Security schemes for wireless sensor networks. International journal paper on wireless sensor networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Selfish Node Isolation & Incentivation using Progressive ThresholdsIDES Editor
The problems associated with selfish nodes in
MANET are addressed by a collaborative watchdog approach
which reduces the detection time for selfish nodes thereby
improves the performance and accuracy of watchdogs[1]. In
the related works they make use of credit based systems, reputation
based mechanisms, pathrater and watchdog mechanism
to detect such selfish nodes. In this paper we follow an approach
of collaborative watchdog which reduces the detection
time for selfish nodes and also involves the removal of such
selfish nodes based on some progressively assessed thresholds.
The threshold gives the nodes a chance to stop misbehaving
before it is permanently deleted from the network.
The node passes through several isolation processes before it
is permanently removed. Another version of AODV protocol
is used here which allows the simulation of selfish nodes in
NS2 by adding or modifying log files in the protocol.
A Survey of Techniques Used To Detect Selfish Nodes in MANETijsrd.com
This document summarizes various techniques that have been used to detect selfish nodes in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the problem of selfish nodes. It then describes several common approaches for detecting selfish nodes, including reputation-based schemes, credit-based schemes, and acknowledgement-based schemes. Specific techniques are discussed like watchdog, pathrater, CONFIDANT, CORE, OCEAN, 2ACK scheme, SORI, LARS, and others. Their advantages and disadvantages are summarized. Finally, the document proposes a combined approach using collaborative watchdog and credit risk to more quickly detect selfish nodes in a decentralized way while reducing overhead.
1) The document proposes implementing an efficient K-means clustering algorithm to enhance connectivity and lifetime in wireless sensor networks.
2) It compares the proposed K-means algorithm to an existing Jumper Firefly algorithm based on energy consumption, network lifetime, and end-to-end delay.
3) Simulation results show the proposed K-means algorithm improves performance by reducing energy consumption from 16 to 12 Joules, increasing network lifetime by 96% compared to 83% for the existing algorithm, and lowering end-to-end delay from 3.7 to 2.7 seconds.
This document discusses mobile ad-hoc networks (MANETs) and wireless sensor networks (WSNs). It defines a MANET as a network formed spontaneously by wireless mobile nodes without any preexisting infrastructure. Key characteristics of MANETs include dynamic topologies, energy-constrained operation, limited bandwidth, and security threats. Applications include collaborative work, crisis management, and personal area networks. The document also describes different routing protocols for MANETs including table-driven, source-initiated, and hybrid protocols. It then discusses challenges in WSNs such as ad-hoc deployment, limited resources, scalability, and fault tolerance and how these influence routing protocol design.
A novel defence scheme against selfish Node attack in manetijcsa
This document proposes a new intrusion detection system (IDS) algorithm to defend against selfish node attacks in mobile ad hoc networks (MANETs). Selfish nodes flood the network with false information and drop packets from other nodes. The proposed IDS identifies selfish node behavior and blocks their activities. Simulation results show the IDS enhances network performance from negligible to 92% and prevents infection from attacks. The IDS is integrated with the AODV routing protocol to detect and eliminate selfish nodes within its transmission range.
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...Editor IJCATR
In this paper, we design and formulate a trust-based routing protocol for secure transactions, such as military and disaster
relief operations, banking in mobile ad hoc networks (MANETs). The proposed approach is showing the idea of a trust model in the
network layer of MANET.AODV is ad hoc on demand distance vector, this protocol starts the route specially when some node claims
to send data. In AODV whenever a link breaks an error message is sent indicating the link and packet sending is dropped. In our
proposed scheme a packet is sent through alternative path. In this approach a trust node is made with neighbors. Simulation results
shows that proposed scheme has less packet loss and packet ratio delivered is more.
Detecting Various Black Hole Attacks by Using Preventor Node in Wireless Sens...IRJET Journal
This document discusses detecting black hole attacks in wireless sensor networks. It begins with an abstract that introduces black hole attacks as a security threat in mobile ad hoc networks (MANETs) where malicious nodes drop packets. The document then reviews previous work on defending against black hole attacks, including using trust values, dummy nodes, and sequence number verification. It proposes using a "preventor node" to create a secure environment and detect black hole attacks in MANETs to improve network performance and security.
Security Enhancement using Trust Management in MANETsIJTET Journal
Abstract— The distinctive options of mobile ad hoc networks (MANETs), victimization recent advances in unsure reasoning originated from AI community, we tend to projected a unified trust management schemes Mobile Ad-hoc networks area unit self-organizing and self re-configuring multi hop wireless networks wherever, the structure of the network changes dynamically the safety of the OLSR protocol is rib by a selected variety of attack known as ‗Black Hole‘ attack. During this attack a malicious node advertises itself as having the shortest path to the destination node. To combat with region attack, it\'s projected to attend and check the replies from all the neighboring nodes to search out a secure route with protection to our data, however this approach suffers from high delay. Associate in Nursing approach is projected to combat the region attack by victimization Trust management schemes with neighbors WHO claim to possess a route to destination. during this project we tend to area unit victimization NS2.34 software system for our projected model testing. and that we got the simplest result against the safety attack.
This document summarizes a research paper that proposes a hybrid routing protocol for mobile ad hoc networks (MANETs) that combines proactive and reactive routing approaches. The goal is to provide fast and secure routing in MANETs. The key aspects are:
1) A traffic monitor node manages network traffic and checks if new nodes are malicious. Reactive routing finds paths through new nodes, while proactive routing is used otherwise.
2) The traffic monitor periodically checks node responses to identify malicious nodes and informs the network.
3) Nodes maintain a trust list from the traffic monitor to identify paths that avoid malicious nodes during route discovery.
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
Improve a Network Life Time by Least Troublesome Topology Repair Algorithm in...IJTET Journal
In wireless sensor network, node reform and restoration is an active area for research. Each sensor node fails either when some critical event occurs at the node or when the battery of the node is completely drained. The Wireless sensor actor network (WSAN) is an enhances the wireless sensor networks by providing more power and recovering a energy consumption. In the WSAN, sensors sense the environment and sent back their data to an actor node. Actors have to coordinate their operations, keep up a firmly associated system topology at all times and achieve the predefined application mission. The Defect Node Reformation Algorithm (DNR) reform a defect node using genetic and the grade diffusion algorithms. A category of solutions for this problem is Least Troublesome Topology Repair Algorithm (LTTR). LTTR is a limited and circulated calculation that influences existing course revelation exercises in the system. LTTR algorithm is used to minimize the power consumption and reform a transmission path. Our results show that achieves performance in terms of packet delivery ratio, packet loss ratio and end to end latency suitable for real network deployments.
MANET (Mobile Ad-hoc Network) is hot spot for research due to its various advantages and
disadvantages. Providing safe communication between mobile nodes, recognization the position of
nodes, reducing overhead, handling misbehavior and location updates are such a difficult issues in
ad-hoc network, so providing trust schemes is an important in this network. MANET provides some
basic functions like routing, communication, network management and packet forwarding etc over
self organized network. Because MANET has not a fixed topology, in which mobile nodes comes and
leaves the network within a random period of time. It effects energy, bandwidth and memory
computations of network. Providing trust in MANET is such a crucial task because it doesn’t having
centralized infrastructure. In this paper, we survey the different trust model schemes of MANET with
their unique features, merits and demerits & findings.
A Framework for Routing Misbehavior Recognition in MANETSEECJOURNAL
Mobile Ad-hoc Networks (MANETs) operate on the basic underlying assumption that all participating nodes fully collaborate in self-organizing functions. However, performing network functions consumes energy and other resources. Therefore, some network nodes may decide against cooperating with others. These nodes are called selfish / misbehaving nodes. Misbehavior of suspicious nodes in MANETs is detected, and the information is propagated throughout the network, so that the misbehaving node will be cut off from the rest of the network. We propose a network-layer acknowledgment-based scheme, termed the 2ACK scheme, which can be simply added-on to any source routing protocol. The proposed scheme detects misbehaving nodes, and then seeks to alleviate the problem by notifying the routing protocol to avoid them in future routes. Our results show that proposed scheme reasonably improves the packet delivery ratio, with some additional routing overhead.
Energy Efficinet Intrusion Detection System in mobile ad-hoc networksIJARIIE JOURNAL
This document summarizes a proposed energy efficient intrusion detection system for mobile ad-hoc networks. It begins with an introduction to intrusion detection systems and mobile ad-hoc networks. It then discusses related work on intrusion detection in mobile ad-hoc networks. The proposed system uses an "impact factor" calculation to select cluster heads in an energy-efficient manner while preventing selfish behavior. Cluster heads run the intrusion detection system using a watchdog method to detect misbehaving nodes. Simulation results show that forming clusters reduces energy consumption compared to all nodes running intrusion detection independently.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
This document summarizes a research paper that proposes an enhancement to the Improved Balanced LEACH (IB-LEACH) routing protocol for heterogeneous wireless sensor networks. The proposed enhancement stores residual energy from each routing round in an "energy bank" to increase network lifetime. It also enhances the ACTIVE_ROUTE_TIMEOUT parameter in the underlying AODV routing protocol. Simulation results using MATLAB show the proposed approach improves network lifetime compared to previous methods. The document provides background on wireless sensor networks, routing protocols, LEACH clustering, and IB-LEACH before detailing the proposed enhancement and simulation results.
A FUZZY-BASED CONGESTION CONTROLLER FOR CONTROL AND BALANCE CONGESTION IN GRI...cscpconf
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited power supply in a wide geographically area. These sensors collect information depending on application. The sensors transmit the data towards a base station called sink. Due to the relatively high node density and source-to-sink communication pattern, congestion is a critical issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the Monitor Node. Simulation results show that our approach has higher packet delivery ratio and lower packet loss than existing approaches.
A fuzzy based congestion controller for control and balance congestion in gri...csandit
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited
power supply in a wide geographically area. These sensors collect information depending on
application. The sensors transmit the data towards a base station called sink. Due to the
relatively high node density and source-to-sink communication pattern, congestion is a critical
issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy
logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid
increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the
Monitor Node. Simulation results show that our approach has higher packet delivery ratio and
lower packet loss than existing approaches.
Similar to A Novel Energy Efficient and Administrator Based Secured Routing in MANET (20)
We have designed & manufacture the Lubi Valves LBF series type of Butterfly Valves for General Utility Water applications as well as for HVAC applications.
Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...Transcat
Join us for this solutions-based webinar on the tools and techniques for commissioning and maintaining PV Systems. In this session, we'll review the process of building and maintaining a solar array, starting with installation and commissioning, then reviewing operations and maintenance of the system. This course will review insulation resistance testing, I-V curve testing, earth-bond continuity, ground resistance testing, performance tests, visual inspections, ground and arc fault testing procedures, and power quality analysis.
Fluke Solar Application Specialist Will White is presenting on this engaging topic:
Will has worked in the renewable energy industry since 2005, first as an installer for a small east coast solar integrator before adding sales, design, and project management to his skillset. In 2022, Will joined Fluke as a solar application specialist, where he supports their renewable energy testing equipment like IV-curve tracers, electrical meters, and thermal imaging cameras. Experienced in wind power, solar thermal, energy storage, and all scales of PV, Will has primarily focused on residential and small commercial systems. He is passionate about implementing high-quality, code-compliant installation techniques.
Accident detection system project report.pdfKamal Acharya
The Rapid growth of technology and infrastructure has made our lives easier. The
advent of technology has also increased the traffic hazards and the road accidents take place
frequently which causes huge loss of life and property because of the poor emergency facilities.
Many lives could have been saved if emergency service could get accident information and
reach in time. Our project will provide an optimum solution to this draw back. A piezo electric
sensor can be used as a crash or rollover detector of the vehicle during and after a crash. With
signals from a piezo electric sensor, a severe accident can be recognized. According to this
project when a vehicle meets with an accident immediately piezo electric sensor will detect the
signal or if a car rolls over. Then with the help of GSM module and GPS module, the location
will be sent to the emergency contact. Then after conforming the location necessary action will
be taken. If the person meets with a small accident or if there is no serious threat to anyone’s
life, then the alert message can be terminated by the driver by a switch provided in order to
avoid wasting the valuable time of the medical rescue team.
Sri Guru Hargobind Ji - Bandi Chor Guru.pdfBalvir Singh
Sri Guru Hargobind Ji (19 June 1595 - 3 March 1644) is revered as the Sixth Nanak.
• On 25 May 1606 Guru Arjan nominated his son Sri Hargobind Ji as his successor. Shortly
afterwards, Guru Arjan was arrested, tortured and killed by order of the Mogul Emperor
Jahangir.
• Guru Hargobind's succession ceremony took place on 24 June 1606. He was barely
eleven years old when he became 6th Guru.
• As ordered by Guru Arjan Dev Ji, he put on two swords, one indicated his spiritual
authority (PIRI) and the other, his temporal authority (MIRI). He thus for the first time
initiated military tradition in the Sikh faith to resist religious persecution, protect
people’s freedom and independence to practice religion by choice. He transformed
Sikhs to be Saints and Soldier.
• He had a long tenure as Guru, lasting 37 years, 9 months and 3 days
Levelised Cost of Hydrogen (LCOH) Calculator ManualMassimo Talia
The aim of this manual is to explain the
methodology behind the Levelized Cost of
Hydrogen (LCOH) calculator. Moreover, this
manual also demonstrates how the calculator
can be used for estimating the expenses associated with hydrogen production in Europe
using low-temperature electrolysis considering different sources of electricity
This study Examines the Effectiveness of Talent Procurement through the Imple...DharmaBanothu
In the world with high technology and fast
forward mindset recruiters are walking/showing interest
towards E-Recruitment. Present most of the HRs of
many companies are choosing E-Recruitment as the best
choice for recruitment. E-Recruitment is being done
through many online platforms like Linkedin, Naukri,
Instagram , Facebook etc. Now with high technology E-
Recruitment has gone through next level by using
Artificial Intelligence too.
Key Words : Talent Management, Talent Acquisition , E-
Recruitment , Artificial Intelligence Introduction
Effectiveness of Talent Acquisition through E-
Recruitment in this topic we will discuss about 4important
and interlinked topics which are
Determination of Equivalent Circuit parameters and performance characteristic...pvpriya2
Includes the testing of induction motor to draw the circle diagram of induction motor with step wise procedure and calculation for the same. Also explains the working and application of Induction generator
Height and depth gauge linear metrology.pdfq30122000
Height gauges may also be used to measure the height of an object by using the underside of the scriber as the datum. The datum may be permanently fixed or the height gauge may have provision to adjust the scale, this is done by sliding the scale vertically along the body of the height gauge by turning a fine feed screw at the top of the gauge; then with the scriber set to the same level as the base, the scale can be matched to it. This adjustment allows different scribers or probes to be used, as well as adjusting for any errors in a damaged or resharpened probe.
Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
FULL STACK PROGRAMMING - Both Front End and Back End
A Novel Energy Efficient and Administrator Based Secured Routing in MANET
1. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
DOI : 10.5121/ijnsa.2012.4405 73
A Novel Energy Efficient and Administrator
Based
Secured Routing in MANET
Himadri Nath Saha # 1
, Dr. Debika Bhattacharyya # 2
, Dr. P. K.Banerjee *3
Assistant Professor # 1
, Professor # 2
, Professor *3
Department of Computer Science and Engineering, Institute of Engineering and
Management, West Bengal, India # 1, # 2
Department of Electronics and Telecommunication Engineering, Jadavpur university,
West Bengal, India *3
Abstract:
The lack of static infrastructure causes several issues in mobile Ad Hoc network , such as energy
utilization, node authentication and secure routing. In this paper we propose a new scheme for energy
efficient secure routing of data packets in MANET. This approach will reduce the computational
overhead to make it more energy efficient than existing schemes. As there is no stationary
infrastructure,each node in MANET acts a router that forwards data packets to other nodes. Therefore
selection of effective, suitable, adaptive and robust routing scheme is of utmost importance. We have
reduced the amount of network activity for each node required to route a data packet. This leads to lesser
wastage of energy and increases security.Our simulation results will show how this is energy efficient and
secure. Finally we have discussed how this scheme prevents various attacks which may jeopardize any
wireless network.
Keywords:
Administrator; associative node; traversed Administrator field; watch nodes; backtracking
bit,MANET.
I. INTRODUCTION
A major role to globally reduce energy consumption will be played by Ad hoc routing
technologies.The communication in case of mobile Ad hoc network, MANET, is mainly based
on the radio signals transmitted by the node. Again MANET, being a wireless network, is quite
different from the common mobile communication. In mobile[1] communication bridge
networks within its own range are used by the nodes to communicate with other nodes. The
bridge networks act mainly as base stations which the source node needs to contact while
sending a data packet to its destination. We need to remember that the nodes are constantly
moving and thus when a node goes out of the range of a base station it must contact its new base
station which it finds in its range. But in MANET[2] there is no base station or any other
infrastructure, helping to setup or perform the network activity required. Thus in this case the
nodes are the routers transferring the data packets themselves. Hence a robust and good routing
protocol that will perform all the functions but with an optimized network activity to decrease
2. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
74
the network traffic as well as make the transmission fast is very essential. Thus while building
our routing protocol we kept in mind these three factors – making the transmission fast,
decreasing the network traffic and properly utilizing the energy consumed by each router.
This paper deals with how the entire network needs to be setup from the start, algorithms
required to implement the protocol and finally implementation of the entire network using
snapshots of a network showing how the algorithm works when a data packet is sent from one
node to another. Section I gives a brief introduction to our protocol; in section II we mention
some previous work related to our scheme. In the next section we elaborate the entire scheme
and explain the algorithm of our protocol. Section V and VI illustrates the simulation results of
our protocol. The following sections explains the security aspects of our protocol and compares
its performance with existing protocols. We name our protocol as Energy efficient and
administrator based secured routing protocol, abbreviated as EEABSR, in MANET.
Figure 1: A mobile Ad Hoc Network
II. RELATED WORK
S. Matri[3] proposed to trace malicious nodes by using watchdog. According to this system,
whenever a node forwards a data packet, the watch dog of the node checks whether the next node
which receives the packet also sends the packet by listening to the broadcast signal of the next
node. If the next node does not forward the packet within a predefined threshold time, the
watchdog detects malicious behavior and accuses the node for aberration. This proposal has two
shortcomings:
1. To monitor the behavior of nodes two or more hops away, the watch node has to trust the
information from other nodes, which introduces the vulnerability of malicious activity.
2. The watchdog cannot differentiate between misbehavior and ambiguous collisions, receiver
collisions, controlled transmission power and other such false alarms that might be generated
3. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
75
during the data sending through the network.
We have used this concept in the form of a watch node in this protocol and have tried to eliminate
the difficulties plaguing the watchdog by associating two watch nodes to each admin node.
Gonzalez [4] presents a methodology, for detecting packet forwarding misbehavior, which is
based on the principle of flow conservation in a network. That states that if all neighbors of a
node vj are queried for
i. The amount of packets sent to vj to forward and
ii. The amount of packets forwarded by vj to them,
The total amount of packets sent to and received from vj must be equal. They assume a threshold
value for non malicious packet drop. A node vi maintains a table with two metrics Tij and Rij,
which contains an entry for each node vj to which vi has respectively transmitted packets to or
received packets from. Node vi increments Tij on successful transmission of a packet to vj for vj to
forward to another node, and increments Rij on successful receipt of a packet forwarded by vj that
did not originate at vj. All nodes in the network continuously monitor their neighbors and update
the list of those they have heard recently. The algorithm requires fewer nodes to overhear each
others’ received and transmitted packets since it uses statistics accumulated by each node as it
transmits to and receives data from its neighbors. Since there is no collaborative consensus
mechanism, such an algorithm may lead to false accusations against correctly behaving nodes.
III. THE SCHEME
Every node in a MANET has a range of itself i.e. no node is capable of transmitting a data
packet to an infinite distance. The nodes which fall in the range of a particular node are called its
Neighboring nodes. In our algorithm we have alternatively used friend nodes for neighbor nodes,
both of them being the same. In the network, three types of nodes have been used:
1. Common nodes
2. Associative nodes
3. Administrator nodes
4. Watch Nodes
The classification is based on the range and the position of the nodes in the network. But to
understand classification we firstly need to understand how the entire network is set up. After a
stipulated time period each node checks for its neighboring nodes, i.e. which nodes are present
within its range. From this friend list, a list is prepared which contains all the neighboring nodes
for all the nodes in the network.
Next, the node compares its previous and present list to check for network change and reports
any difference to its administrator. The administrator node always lies in the range of the node in
question.
We will describe how an Administrator node is chosen later. If there is no change in the
topology of the network, there is no need to choose an administrator node; however for any
change in the network, the previous Administrator nodes will choose a new Admin node which
leads us to the discussion on what an Admin node is and how it is selected.
ADMINISTRATOR NODES
Now the topic of selecting a new Admin arises. If there is a need to elect a new Admin, all the
nodes send their neighbor’s list to their Admins(old admin) which all the Admins exchange
among themselves thereby giving each Admin the knowledge of the neighbors of each and every
4. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
76
node in the entire network. A list with the names of all the nodes and their corresponding
neighbors written beside them is prepared and sorted according to the highest number of
neighbors each node has and all the possible nodes are selected in a top-down sequence. If the
list of names of all the nodes is a subset of the neighbor list of that node we will designate it as
the Admin node else we have to take any two nodes from the comprehensive sorted list in a top-
down sequence. Next the union of the neighbors of the two selected nodes is considered, if the
entire list results as a subset of the union those two nodes are considered as the Admin nodes.
However for a negative result we take any three nodes from the sorted comprehensive list in a
top-down sequence and continue the process. We continue this process increasing the number of
nodes considered by unity until the subset criteria is satisfied after which the Admins are
selected as those nodes whose friend list covers the complete network.
ASSOCIATIVE AND COMMON NODES
The Associative nodes are nodes lying in the region common to multiple Admin nodes. If any
Admin node does not have an Admin node or an associative node attached to it, then an
associative node pair is selected. It is a pair of nodes through which Admin can communicate
with the next Admin node. All the nodes in the network excepting the Admin nodes and the
associative nodes are the common nodes.
Let us consider the following network:
Figure 2: A snapshot of an Ad-Hoc network
For the above network in fig. 1 the neighbor list has to be prepared first and only then can we
assign the admin nodes. The neighbor list is as follows:
The list in top down sequence is as follows:
5. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
77
As we choose the admin nodes, it is clearly visible that node B alone does not cover the whole
network, its neighbor nodes A, B, C, D, H are not all the nodes of the network. Hence we choose
a pair of nodes and their union is considered. Hence F along with B is chosen and the resultant
union gives us the nodes A, B, C, D, E, F, G, H and I. However still some nodes are missing, so
we need to take a third node for union. We take L and get all the nodes. Now we can see node D
is neighbor of both admin nodes B and F. Hence D acts as the associative node for admin nodes
B and F. It is clear that there is no associative node attached to admin node L. So we choose A,
M pair by which admin L can communicate with admin node B. So A, M pair is called the
special associative node pair.
Hence in our example,
Admin nodes: B, F, L
Associative node: D
Common nodes: A, C, E, G, H, I, J, K, M
Associative node pair: A, M
WATCH NODES
Watch nodes have been used basically to promote security in the network. As is the case with
our protocol, if we are able to implement security in the admin and the associative nodes, we can
guarantee that the total network is secured from any attacks since the common nodes do not have
any role to play in transmission of data apart from sending or receiving of data packets. Hence
we have added two watch nodes to each admin and Associative node which checks after every
time interval if any data packet entering into an Admin or Associative node goes out of the node
within a stipulated time period, failing which it issues a warning to its previous admin that the
node maybe a malicious node and the node is not used for transmission of data through the
network. We have used the two neighboring nodes of each admin as the watch nodes in our
protocol.
In the network in fig.1 if a data packet is sent from node A to node I then the path followed will
be
A-B-D-F-I
When the data packet is at admin B, any two nodes from A, C, D and H will be selected as
watch nodes and will keep an eye on the admin node B for any aberrant behavior.
6. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
78
This protocol also has certain aspects such as battery life, admin reselection and back tracking.
BATTERY LIFE
We realize that the nodes in an Ad-hoc network are constantly in motion and hence will run out
of battery power sooner or later. However for our protocol, the battery life is particularly
important for the Admin nodes since they perform the maximum amount of work. Hence when
the power of a certain admin decreases below a certain level we need to get that battery to re-
charge before it can take part in any re-transmission. We have developed our protocol in such a
way that for every admin, there is a special field for the battery life and if the threshold value of
the battery of an admin is reached, it immediately withdraws itself from the network and
recharges and admin reselection takes place. After recharging it can be again reconsidered in the
network.
ADMIN RESELECTION
There may be a few cases when admin reselection is required. If an admin node is found to be
malicious it is blocked from the network immediately and the network chooses a new admin
again in the same way as described above. Again if the battery power of an admin gets drained
off completely then it is suspended temporarily from the network for recharging and admin
reselection takes place.
BACK TRACKING
In many cases it may so happen that when a data packet reaches an admin, it has multiple paths
to move to. The data packet may choose one path, but the destination may very well be on the
other path. In such cases a back tracking is required. We have added two bits along with the data
packet which records the last traversed admin and then forwards the data packet, if the data
packet does not find its destination on the traversed path then it backtracks to the admin where it
finds a multiple path and then moves to the other alternative path. In this way we re-transmit the
data from an admin with multiple paths to reach the destination.
IV. ALGORITHM
• Select_admin
Step 1: Every node which enters the network broadcasts hello packets //new node insertion
Step2: If there is no response then
There is no need to flood the neighbor list
The node itself is the admin
Step 3: If there is any response then
Update the friend list
The nodes flood their neighbor list across the network
Send a special request for presence of admin in the network //Admin_present = 1 or
Admin_present = 0
Step 4: If there is no admin // Admin_present = 0
The node with the least ID number calls Compute()
The result is flooded across the network
Step 5: Else if there are previous admins
7. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
79
//Admin_present = 1
Then the previous admin with the least ID number will call Compute()
The result is flooded across the network
Step 6: After a certain time period every node in the network broadcasts hello packets
//check for deletion or relocation of nodes
Step 7: Continue from Step 2
• Compute()
Step 1: Sort the friend list in descending order of number of friends
Step 2: union_result = 0
Step 3: While (union_result is a subset of entire_list)
Check neighbor list
Take next highest entry of list in descending order
Union_result = Union_result + neighbor_of_node[i]
if (union_result = entire_friend_list)
Set the nodes as admins
End If
End While
Step 4: Nodes common to multiple admins are associative nodes
Step 5: Other nodes are common nodes
• Packet_sending
Step 1: If sender = receiver
Sender is same as receiver, so packet will always be successfully sent
Else Step 2
Step 2:Packet is sent to the admin of the node
Set sender=admin
Traversed_admin_field =sender
If multiple path possible from current admin
Then
Set Bactracking_bit = 1 for current admin
/* Backtracking_bit is a bit field for every admin node whose value indicates whether
backtracking is possible or not from that node onwards */
End If
/* Traversed_admin_field is a one dimensional array which stores the id of the admin nodes
which have already been traversed by the data packet. This is used to prevent loopback.
When a packet reaches a node, it checks the Traversed_admin_field for the next admin’s entry.
If it finds the admin in the array, then it checks for the value of the Backtracking_bit. If
Backtracking_bit=1, only then it allows the packet to move to the next admin */
Step 3: While (packet is not sent to the receiver)
If sender = receiver
Packet is sent successfully
Generate and Send Ack
Else
If receiver is neighbor of admin
8. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
80
Packet sent
Generate and Send Ack
Else if receiver is not neighbor of admin
Packet sent to the next admin /* if current admin is within the range of the next
admin */
Sender=next admin
Traversed_admin_field =sender
If multiple path possible from current admin Then
Set Backtracking_bit = 1 for current admin
/* Bactracking_bit is a bit field for every admin node whose
value indicates whether backtracking is possible or not from
that node onwards */
End If
Else if current admin is not within next admin’s range
Packet sent to associative node to send it to next admin
Traversed_admin_field =sender
If multiple path possible from current admin Then
Set Backtracking_bit = 1
End If
Else
Packet sent to special associative
pair nodes to send it to next admin
Traversed_admin_field =sender
If multiple path possible from current admin Then
Set Bactracking_bit = 1
End If
If (next admin is not in traversed_admin field)OR (admin is in
traversed_admin_field and Backtracking_bit=1)
Send packet to the next admin
Sender=admin
Traversed_admin_field =sender
If multiple path possible from current admin Then
Set Bactracking_bit = 1 for current admin
End If
ElseIf Bactracking_bit = 1 for current node
Try alternative path
Set Bactracking_bit = 0 for current node /* if all alternative
paths have been exhausted */
End if
End if
End if
If all admins have been traversed atleast once but receiver not found /* receiver left the
network or failed or no such receiver id exists*/
Then
Drop packet
Break while
End If
9. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
81
/* In this case, Sender does not get Ack and it assumes that either the packet was
lost in transit and did not reach the receiver OR the receiver is not present in the network,
hence retransmits the packet once more */
End While
End if
• Watch_node
Step 1: While(data_packet is at an admin[j])
Set friend_node[i] and friend_node[i+1] of admin[j] as watch nodes
End While
Step 2: Set count = 0
Step 3: If packet_sending(admin[j] ) == false
/* Watch_node monitors the admin network traffic pattern */
Watch_node detects malicious activity
Report activity
count = count +1;
If count == 3 /* if the watch_nodes detect malicious activity more than 3times
*/
remove admin from network
Select_admin();
End If
End If
• Battery_Life
Step 1: Set threshold_value for battery life of each admin
Step 2: While battery_life > threshold_value
perform network activity
battery_life = battery_life – 1;
End While
Step 3: If Admin( battery_life < threshold_value) then
Remove admin from network
Recharge admin
Select_admin(if allowed by network topology)
Else
Remove admin from network
Recharge admin
Insert the recharged admin into the network
End If
• Admin_Failure
If current admin crashes
admin reselection takes place
/*Only if network does not gets disconnected due to admin failure*/
Else
disconnected part of the network stalls until network topology changes or admin
recovers, whichever is earlier
End If
10. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
82
V. SIMULATION RESULTS (using Java)
We have given the pictorial simulated results of our protocol. Before we check the simulation
results of the protocol, we need to understand a few concepts.
A green colored ellipse signifies that it currently holds the data and will forward the data
to the next node.
A red ellipse means it does not have a data and is free, i.e., it has either passed on the
data, or is going to receive the data sometime in the future or will not receive a data
during the data transfer.
A black node indicates that it has been chosen as the administrator node for the network.
A black line broadcasts the administrator nodes information to the common nodes by
which it lets them know that it is the admin node for those nodes in the network.
A green line will be drawn whenever there is a transfer of data from one node to
another.
A yellow line indicates transit of the final ACK.
A red outer ellipse shows the range of the node.
Time instance I: When the first node enters the network
Time instance II: Entry of the second node
Figure 3: The first node on entering the network broadcasts a
hello packet within its range. But as it gets no response it does
not flood its neighbor list. It is its own admin
Figure 5: In this case, either of nodes 1 or 2 can be selected as
the admin. Here, Node 1 is selected as the admin. The
previous admin, i.e., node 1, selects the new admin
Figure 4: New node on entering the network broadcasts a hello packet to
update its friend list
Time instance III: A third node enters the network
as shown
11. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
83
0 1 2 3 4 5 6 7
1 1 1 0 0 0 0 0
2 1 1 1 1 0 0 0
3 0 1 1 0 0 0 0
4 0 1 0 1 1 0 0
5 0 0 0 1 1 1 1
6 0 0 0 0 1 1 0
7 0 0 0 0 1 0 1
Alloted Admin is:
1 2 0 0 0 0 0 0
2 2 0 0 0 0 0 0
3 2 0 0 0 0 0 0
4 2 5 0 0 0 0 0
5 0 5 0 0 0 0 0
6 0 5 0 0 0 0 0
7 0 5 0 0 0 0 0
Time instance ‘N’: After a certain time interval, say n,
let the network have the following configuration
Figure 6: The third node on entering the network broadcasts a hello
packet within its range to update its friend list
Figure 9: Network with 7 nodes
Figure 7: Node 2 is selected as the admin. The previous admin, i.e.,
node 1, selects the new admin
The Admin Nodes of the network are: 2, 5
The Associative Node in the network is: 4
The friend list is:
This is an adjacency list where
1 represents that node i is in
the range of node j
Figure 8: The fourth node on entering the network broadcasts a
hello packet within its range to update its friend list
1st
column represents node number
& the following columns represent admin for the
corresponding node. 0 indicates sentinel value.
12. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
84
Figure 10: Node 2 is chosen as an Admin Node. It broadcasts
this information to its neighboring common nodes
Figure 12: Node 1 is chosen as the sender Node
Figure 11: Node 5 is chosen as an Admin Node. It broadcasts
this information to its neighboring common nodes
Figure 13: Node 7 is chosen as the receiver Node
13. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
85
Figure 14: Packet sending starts from Node 1
Figure 15: Packet is sent from Node 1 to its admin Node 2
Figure 16: As Receiver 7 is not in the friend list of the admin hence
he Packet is sent from Node 2 to the associate Node 4
Figure 17: Associative node 4 sends the packet to the next
Admin node 5
Figure 18: Receiver Node 7 is the neighbor of Admin Node 5;
Node 5 sends the data packet to Node 7
Figure 19: Final ACK generated by receiver 7 & send in
reverse direction
14. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
86
Figure 20: ACK send from node 5 to node 4
Figure 21: ACK send from node 4 to node 2
VI. ATTACK SIMULATION
We have simulated the possibility of an attack on our network and shown how this protocol can detect
malicious nodes and also prevent attacks. Now the nature of this protocol is such that if we can make sure
that the admin nodes are secured, then we are certain that the network will perform perfectly without any
network attacks since any common node only takes part in either sending or receiving data packets. We
will now provide the pictorial representations of the attack simulation using watch-nodes.
Figure 22: ACK send from node 2 to sender node 1
Figures 3-22 show the actual simulation of the
protocol in a network and how the data packet
moves in the network from the sender to the
receiver node.
Figure 23: Node 1 is chosen as the sender node
15. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
87
Figure 24: Node 1 sends the data packet to its admin Node 2
Figure 25: Node 2 sends the data packet to the next admin Node 3,
which does not forward the data packet
VII. MAINTENANCE OF SECURITY
For any protocol, maintaining security[5] is absolutely necessary. If it does not secure data
transmission among, then there is no point in using the protocol simply because it does not
guarantee the proper delivery of correct data to correct receiver. There are many security attacks
possible on a network. The ones this protocol guards against are:
1. Hello Flooding[6]: In this attack a dishonest node sends a repeating message through the
network causing network congestion. Our protocol deals with this attack by associating a
timestamp with every data packet; if a data packet, having the same timestamp[7] value and
same source node number containing the same data, is repeated then the receiving node will
simply discard the data packet.
2. Co-operative Black Hole attack [8]: In this attack a group of dishonest nodes act as a black
hole, i.e., when a node receives a data packet it circulates the packet among them without
sending it out of the loop, hence the data packet never reaches the destination. This protocol
deals with re-transmission in such a way so as to stop this attack. If there is a requirement of
a data packet to be sent back along the path it had come, then a it is noted that the previous
path does not have the receiver and the data packet can no longer go in that direction. In
other words, our protocol avoids data being sent through loops in the network. Hence this
attack is avoided.
Figure 26: The watch nodes for Node 4 are Nodes 2 and 5,
they detect malicious behavior and Node 3 suspected as a
malicious node
16. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
88
3. Black Hole attack [9]: Black holes are those nodes in a network where incoming traffic is
silently discarded but the source has no information that the data did not reach the intended
recipient. This is one of the biggest security attacks that occur in a MANET.
We have used the concept of watch nodes in our network. Watch nodes act as guardians and
check if an Admin node is correctly forwarding a data packet or not. If it finds out that on
multiple occasions a data packet is not being forwarded by an Admin node, it assumes that
the Admin may be malicious and will simply discard[10] the Admin node from the network.
Since this protocol is very lightweight and the computations depend solely on the admin
nodes, hence the security of the admin nodes ensures that the network is secured.
4. Gray Hole Attack:[11] A gray hole is similar to a black hole but it starts its action after it has
been the part of a network for some time. It will behave as normally when the network starts
its functioning but after a certain amount of time it will either consume all or some of the
data packets that come its way.
Like the previous attack, the watch nodes once again detect if any Admin node does not
successfully forward a data packet and if a node tries to act as a gray hole; it will suspend
the node for aberration.
5. Sleep Deprivation[12]: The attacker attempts to consume batteries of other nodes by
requesting routes, or by forwarding unnecessary packets.
This protocol has no route request mechanism, the entire route is based on the dynamic
nature and it is decided during the packet sending. Hence this stops sleep deprivation.
However if unnecessary packets are sent, hello flooding attack is stopped by checking the
time stamp value. If packets having different time stamps are sent, then it is very difficult to
distinguish a real data packet from an unnecessary one, in such a case, the battery life is
drained. This protocol is designed in such a way that if the battery life of an Admin node is
below a threshold level, it simply disconnects itself from the network until it can recharge
itself. Hence although the battery power is drained off, the network activity does not stop.
VIII. COMPARISON WITH EXISTING PROTOCOLS
a. Comparison with AODV[13]:
AODV has a lot of network activity associated with it since there are routing packets transmitted
all over the network to know the desired route. In this protocol however, the admin nodes take
the duty of network transmission and so the overall load on the network decreases many folds.
The network traffic depends on the dynamic nature of the network, lower the amount of changes
in the network, lower will be the network traffic.
b. Comparison with DSDV[14],[15]:
For DSDV each node connects to all other nodes in order to maintain their routing table[16].
However in this case, the admin nodes do this work and so there is a very low routing
maintenance required for the networks.
17. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
89
Figure 27: Graphical comparison of EEABSR with existing protocols
The algorithmic complexity of O(n2
) gives the parabolic nature[17] of the graph. As the number
of nodes increases, the network congestion increases, gradually increasing the delay. But the
delay is much stable compared to the other protocols.
Figure 28: Packets Dropped by EEABSR, AODV & DSR
In our protocol packets will be dropped only when the admin battery gets exhausted below a
threshold[18]. In the meantime a new admin will be selected & the previous admin will be
recharged. It performs consistently well.
We investigated the amount of energy consumed by participating[19] nodes according to the
network card activities. We observed that overhearing consumed most of the energy. Idle power
and overhearing effects dominate the energy consumption in the simulation of a dense network.
18. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
90
Figure 29: Average consumed power by EEABSR, AODV & DSR
In our protocol, the network traffic is mostly restricted in between the admins and hence the
overall overhead is reduced, thus reducing the overall energy consumption.
IX. CONCLUSION
The algorithm actually is a basic design built to reduce network overhead[20] and computations
and also to ensure absolute security[21] of the data packet transmitting through the network and
it performs very efficiently in that respect. The rate of topology [22]change must remain less or
medium. If the topology changes constantly the protocol may be vulnerable. This protocol will
be much more optimal[23] compared to the existing protocols such as DSDV[24] and also
AODV[25] unless a small network is considered. There are various protocols which can send
data very fast but then they have a lot of overhead attached to them. This protocol leads to a
decent solution as it sends data at an optimal speed while taking care of the computational
overhead.
REFERENCES:
1) Izhak Rubin, Arshad Behzad, Ruhne Zhang, Huiyo Luo and Eric Caballero.”TBONE: A Mobile-
Backbone Protocol for Ad Hoc Wireless Networks”. In Proceedings of IEEE Aerospace Conference,
2002, vol. 6, pp. 2727-2740.
2) Kejun Liu, Jing Deng, Member, IEEE, Pramod K. Varshney, Fellow, IEEE, and Kashyap
Balakrishnan, Member, IEEE, “An Acknowledgment-Based Approach for the Detection of
Routing Misbehavior in MANETs” IEEE Transaction on Mobile Computing, VOL. 6, NO. 5,
May 2007.
3) S. Matri, T. J. Giuli, K. Lai and M. Baker. ”Mitigating Routing Misbehaviour in Mobile Ad Hoc
Networks”. In Proceedings of Mobicom 2000, pp. 255-265.
4) Gonzalez- Computers & Security, Vol 25, No. 18, pp 736-744, 2000.
19. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
91
5) Panagiotis Papadimitratos , Zygmunt J. Haas , “Secure message transmission in mobile ad hoc
networks, Ad Hoc Networks” IEEE 2003, 193–209 .
6) Y.-C. Hu, A. Perrig, D.B. Johnson, Ariadne: a secure on-demand routing protocol for ad hoc
networks, in: ACM MobiCom’02, 2002, pp. 12–23.
7) Y.-C. Hu, D.B. Johnson, A. Perrig, SEAD: Secure efficient distance vector routing for mobile
wireless ad hoc networks, in: Proceedings of the 4th IEEE Workshop on Mobile Computing Systems
and Applications (WMCSA 2002), 2002, pp. 3–13.
8) Komala CR, Srinivas Shetty, Padmashree S., Elevarasi E., “Wireless Ad hoc Mobile Networks”,
National Conference on Computing, Communication and Technology, pp. 168-174, 2010
9) L. Zhou and Z. Hass. ”Securing Ad Hoc Networks”, IEEE Network Magazine, vol.13, pp. 24-30,
1999.
10) Yih-Chun Hu, Adrian Perrig and David B. Johnson, “Wormhole Attacks in Wireless Networks”,
IEEE Journal on Selected Areas in Communication, pp.370-380,2006
11) [Johnson99] David B. Johnson, Davis A. Maltz, "The Dynamic Source Routing Protocol for Mobile
Ad Hoc Networks" October 1999 IETF Draft, 49 pages.
12) K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, E.M. Royer, A secure routing protocol for ad hoc
networks, in: Proceedings of the 10th IEEE International Conference on NetworkProtocols, 2002, pp.
78–87.
13) [Perkins99] Charles E. Perkins, Elizabeth M. Royer, Samir R.Das, "Ad Hoc On-demand Distance
Vector Routing", October 99 IETF Draft.
14) [Perkins94] C.E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector
Routing (DSDV) for Mobile Computers”, Comp. Comm. Rev., Oct. 1994, pp.234-244.
15) Samir R. Das, Charles E. Perkins and Elizabeth M. Royer, “Performance Comparison of Two On-
demand Routing Protocols for Ad Hoc Networks”
16) C. Perkins, E. Belding-Royer and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing”,
2003
17) Avoiding Black Hole and Cooperative Black Hole Attacks in Wireless Ad hoc Networks
http://www.scribd.com/doc/26788447/Avoiding-Black-Hole-and-Cooperative-Black-Hole-Attacks-
in-Wireless-Ad-hoc-Networks
18) Shukor Abdul Razak, Steven Furnell, Nathan Clarke, Phillip Brooke: A Two-Tier Intrusion Detection
System for Mobile Ad Hoc Networks- A Friend Approach, Springer-Verlag Berlin Heidelberg 2006.
19) Jung-San Lee, Chin-Chen Chang, “Secure communications for cluster-based ad hoc networks
using node identities” Journal of Network and Computer Applications 22 October 2006
International Journal of Computer Science and Security, Volume (1): Issue (1) 67.
20) David B. Johnson, David A. Maltz and Josh Broch, “DSR: The Dynamic Source Routing Protocol
for Multi-Hop Wireless Ad Hoc Networks”
21) Y. Zhang and W. Lee. ”Intrusion Detection in Wireless Ad Hoc Networks”. In Proceedings of
Mobicom 2000, pp. 275-283.
22) Rashid Hafeez Khokhar, Md Asri Ngadi and Satira Mandala, “A Review of Current Routing Attacks
in Mobile Ad Hoc Networks”, International Journal of Computer Science and Security, pp. 18-29,
Volume-2 Issue-3 International Conference on Wireless Networks (ICWN’03), Las Vegas, Nevada,
USA, pp. 570-575
20. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.4, July 2012
92
23) Jeremy J. Blum, Member, IEEE, and Azim Es kandarian, Member, IEEE, “A Reliable Link-
Layer Protocol for Robust and Scalable Intervehicle Communications” IEEE Transactions On
Intelligent Transportation Systems, vol. 8, no. 1, March 2007.
24) N.Shanthi, Dr.Lganesan and Dr.K.Ramar,”Study of Different Attacks on Multicast Mobile Ad-hoc
Network”, Journal of Theoretical and Applied Information Technology, pp.45
25) Luke Klein-Berndt, “A Quick Guide to AODV Routing”