The document discusses efficient routing techniques for intermittently connected mobile networks (ICMNs). It begins by introducing ICMNs and the challenges of routing in such networks where end-to-end paths may not always exist. It then summarizes various routing approaches including flooding-based epidemic routing and single-copy schemes. The document proposes two spray-based routing techniques: (1) Spray and Wait, which sprays a fixed number of message copies and waits for a copy to reach the destination, and (2) Spray and Focus, which uses utility-based routing to focus copies towards the destination after the spray phase. Expected delays are analyzed for Spray and Wait. Different mobility models for analysis are also discussed.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Data Aggregation Routing Protocols in Wireless Sensor Networks : A TaxonomyIJCNCJournal
Routing in Wireless Sensor Network (WSN) aims to interconnect sensor nodes via single or multi-hop
paths. The routes are established to forward data packets from sensor nodes to the sink. Establishing a
single path to report each data packet results in increasing energy consumption in WSN, hence, data
aggregation routing is used to combine data packets and consequently reduce the number of transmissions.
This reduces the routing overhead by eliminating redundant and meaningless data. There are two models
for data aggregation routing in WSN: mobile agent and client/server. This paper describes data
aggregation routing and classifies then the routing protocols according to the network architecture and
routing models. The key issues of the data aggregation routing models (client/server and mobile agent) are
highlighted and discussed.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Data Aggregation Routing Protocols in Wireless Sensor Networks : A TaxonomyIJCNCJournal
Routing in Wireless Sensor Network (WSN) aims to interconnect sensor nodes via single or multi-hop
paths. The routes are established to forward data packets from sensor nodes to the sink. Establishing a
single path to report each data packet results in increasing energy consumption in WSN, hence, data
aggregation routing is used to combine data packets and consequently reduce the number of transmissions.
This reduces the routing overhead by eliminating redundant and meaningless data. There are two models
for data aggregation routing in WSN: mobile agent and client/server. This paper describes data
aggregation routing and classifies then the routing protocols according to the network architecture and
routing models. The key issues of the data aggregation routing models (client/server and mobile agent) are
highlighted and discussed.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Exploiting Wireless Networks, through creation of Opportunity Network – Wirel...ijasuc
Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless
communication network regime is one such environment that offers such a platform for many working
scientific, academic and engineering experts. Henceforth, “Opportunistic-network” is a recent evolution
of the above said phenomena in the wireless community. They function by spontaneous cooperation &
coordination giving birth to a special type network called wireless-mobile-adhoc-network (W-MAN). As
said, these networks are formed instantaneously in a random manner – breaking the conventional
mathematically evolved algorithms’, and provided the quintessential of a network(s) that exist in
neighbourhood(s) or approachable limits. Is more of situational based, exploited for specialized purpose
or advantage, which mimics all the characteristic of a well evolved network. Such networks, lack an endto-end path, contact, cooperation and coordination; which is mainly opportunity based, and break or
even disintegrate soon after discovery, thus the challenge lay in integration, construction and probable
sustenance or even mid-way reconstruction till purpose. One can cite many realistic scenarios fitting to
this situation. For example, wildlife tracking sensor networks, military networks, vehicular ad hoc
networks to mention a few. To transmit information under such circumstances/scenarios researchers have
proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In
this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and
present the findings of the said scheme by consolidating critical parameters and issues and towards the
end of this paper, algorithms, possible solutions to deal with such complex and dynamic situations
through W-MAN scheme suggested by us.
Security Enhancement in AODV Routing Protocol for MANETsidescitation
Adhoc networks are a new wireless networking paradigm for mobile hosts.
Mobile Ad-hoc Networks (MANETs) are wireless networks with absence of infrastructure
centralized support. Routing in MANETs is challenging task due to mobility of nodes.
Several routing protocols have been developed for Mobile Ad-hoc Networks. This paper
describes concept of security enhancement in AODV routing protocol by detection and
tolerance of attacks using secure message transmission (SMT) protocol. Present AODV
routing protocol is not secure by malicious nodes. One main challenge in design of these
networks is their vulnerability to security attacks. In this paper we study how to make node
malicious and at same we will detect malicious node in AODV protocol using Network
Simulator-2(NS-2) tool.
Black-Hole and Wormhole Attack in Routing Protocol AODV in MANETIJCSEA Journal
Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “BlackvHole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find
out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Opportunistic Networking: Extending Internet Communications Through Spontaneo...Waldir Moreira
The increasing number of personal devices with wireless communication capabilities makes it possible the creation of spontaneous networks in which devices communicate occasionally depending on contact opportunities. This intermittent communication may be due to mobility and power-limitations of devices, physical obstacles and distance, resulting in the possible nonexistence of end-to-end paths toward a destination. In summary, spontaneous networks are characterized by being highly dynamic, composed of mobile and static nodes that are able to take advantage of opportunistic time-varying contacts.
This tutorial aims to give an introduction to the challenges and research issues behind the development of
opportunistic networking solutions able to boost the deployment of spontaneous networks. Special attention will be
given to the fundamental building block: routing over opportunistic networks. Since the effciency of spontaneous
networks depends upon the way contacts occur between carriers of communication devices, special attention will
also be given to the analysis of method to detect social structures based on opportunistic contacts. To emphasize
the impact that opportunistic networking technology may have, this tutorial ends up with the description of major
aspects of future forwarding schemes: interest-based and information-centric forwardings.
This presentation was given as a tutorial in the IEEE 3rd Latin-American Conference on Communications (LATINCOM), on Oct 26th, 2011, in Belém/PA, Brazil.
http://www.ieee-latincom.ufpa.br/
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Exploiting Wireless Networks, through creation of Opportunity Network – Wirel...ijasuc
Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless
communication network regime is one such environment that offers such a platform for many working
scientific, academic and engineering experts. Henceforth, “Opportunistic-network” is a recent evolution
of the above said phenomena in the wireless community. They function by spontaneous cooperation &
coordination giving birth to a special type network called wireless-mobile-adhoc-network (W-MAN). As
said, these networks are formed instantaneously in a random manner – breaking the conventional
mathematically evolved algorithms’, and provided the quintessential of a network(s) that exist in
neighbourhood(s) or approachable limits. Is more of situational based, exploited for specialized purpose
or advantage, which mimics all the characteristic of a well evolved network. Such networks, lack an endto-end path, contact, cooperation and coordination; which is mainly opportunity based, and break or
even disintegrate soon after discovery, thus the challenge lay in integration, construction and probable
sustenance or even mid-way reconstruction till purpose. One can cite many realistic scenarios fitting to
this situation. For example, wildlife tracking sensor networks, military networks, vehicular ad hoc
networks to mention a few. To transmit information under such circumstances/scenarios researchers have
proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In
this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and
present the findings of the said scheme by consolidating critical parameters and issues and towards the
end of this paper, algorithms, possible solutions to deal with such complex and dynamic situations
through W-MAN scheme suggested by us.
Security Enhancement in AODV Routing Protocol for MANETsidescitation
Adhoc networks are a new wireless networking paradigm for mobile hosts.
Mobile Ad-hoc Networks (MANETs) are wireless networks with absence of infrastructure
centralized support. Routing in MANETs is challenging task due to mobility of nodes.
Several routing protocols have been developed for Mobile Ad-hoc Networks. This paper
describes concept of security enhancement in AODV routing protocol by detection and
tolerance of attacks using secure message transmission (SMT) protocol. Present AODV
routing protocol is not secure by malicious nodes. One main challenge in design of these
networks is their vulnerability to security attacks. In this paper we study how to make node
malicious and at same we will detect malicious node in AODV protocol using Network
Simulator-2(NS-2) tool.
Black-Hole and Wormhole Attack in Routing Protocol AODV in MANETIJCSEA Journal
Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “BlackvHole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find
out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Opportunistic Networking: Extending Internet Communications Through Spontaneo...Waldir Moreira
The increasing number of personal devices with wireless communication capabilities makes it possible the creation of spontaneous networks in which devices communicate occasionally depending on contact opportunities. This intermittent communication may be due to mobility and power-limitations of devices, physical obstacles and distance, resulting in the possible nonexistence of end-to-end paths toward a destination. In summary, spontaneous networks are characterized by being highly dynamic, composed of mobile and static nodes that are able to take advantage of opportunistic time-varying contacts.
This tutorial aims to give an introduction to the challenges and research issues behind the development of
opportunistic networking solutions able to boost the deployment of spontaneous networks. Special attention will be
given to the fundamental building block: routing over opportunistic networks. Since the effciency of spontaneous
networks depends upon the way contacts occur between carriers of communication devices, special attention will
also be given to the analysis of method to detect social structures based on opportunistic contacts. To emphasize
the impact that opportunistic networking technology may have, this tutorial ends up with the description of major
aspects of future forwarding schemes: interest-based and information-centric forwardings.
This presentation was given as a tutorial in the IEEE 3rd Latin-American Conference on Communications (LATINCOM), on Oct 26th, 2011, in Belém/PA, Brazil.
http://www.ieee-latincom.ufpa.br/
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNsijsrd.com
The multi-hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in Tiny OS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networksijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
Wireless networking has been an active research focus since the early days of the packet radio
network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent
developments in wireless devices have made laptop computers, personal digital assistants (PDA),
pagers, and cellular telephones portable. Now, users can carry these devices to any place at any
time. Hence, there is a need for a network that can be deployed at any place at any time without
any infrastructure support. In some cases, an infrastructure-based network is hard to build.
Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases,
infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados.
Hence, there is always a need for setting up a temporary network among a group of users without
any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks
(MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs
consist of a group of mobile nodes, which have limited battery and limited processing power.
MANETs are self-organizing and self-configuring networks and they can be deployed without any
infrastructure support. Numerous groundbreaking applications have been proposed based on
MANETs. These applications include disaster management, search and recovery, remote
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.12, No.2, April 2021
2
healthcare, tele-geoprocessing, education, traffic management, process control, and security [2].
These applications impose diversified design and performance constraints on the MANETs.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node D...IJERA Editor
Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis work consist a systematic comparative evaluation of a new multipath routing protocol for MANETS. The new protocol, called Multipath Destination Sequenced Distance Vector (MDSDV) is based on the well known single path Destination Sequenced Distance Vector (DSDV) is compared with known protocol DSDV. This work containing evaluates the protocols on a range of MANETS with between 50, 75 and 100 nodes, which are static nodes. The protocol comparison metrics are Throughput and Residual Energy.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
Multipath Fault Tolerant Routing Protocol in MANET
Ns2422412247
1. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
Icmn: Efficient Routing Using Spray Mechanisms
*Phani Sridhar A, **Samuel Susan V, ***Srinivasa Rao D,
****Mallikarjun Reddy D
*Assistant Professor, SVP Engineering College Affiliated to Andhra University Visakhapatnam, India
**Assistant Professor, SVP Engineering College Affiliated to Andhra UniversityVisakhapatnam, India
***Assistant Professor, SVP Engineering College Affiliated to Andhra University Visakhapatnam, India
****MTECH Student, Andhra University Visakhapatnam, India
Abstract
while routing is being carried out from Identified. The reason for these failures is that many
source to destination, at times there might not be of the assumptions made in the wired world, and
the path between source and destination. These which are largely responsible for the success of the
networks are called intermittent networks. These Internet, do not hold in the wireless environment. The
occasions will occur mostly in mobile networks concept of a connected, stable network over which
which are called intermittently Connected Mobile data can be routed reliably rarely holds there.
Networks(ICMN).Intermittently connected mobile Wireless signals are subject to multi-path
networks are wireless networks where most of the propagation, fading, and interference making wireless
time there does not exist a complete path from the links unstable and lossy. Additionally, frequent node
source to the destination. There are many real mobility (e.g. VANETs [1]) significantly reduces the
networks that follow this model, for example, time a “good” link exists, and constantly changes the
wildlife tracking sensor networks, military network connectivity graph. As a result, wireless
networks, vehicular ad hoc networks, Habitat connectivity is volatile and usually intermittent, as
monitoring sensor networks etc. Even though nodes move in and out of range from access points or
conventional routing schemes can be used but they from each other, and as signal quality fluctuates. In
fail because these will try to establish a continuous addition to the cases of wireless Internet access and
path between source and destination before data is ad hoc networks, the need to depart from the
sent. While flooding-based schemes have a high traditional networking practices has been recognized
probability of delivery, they waste a lot of energy for a number of emerging wireless applications.
and suffer from severe contention which can Sensor networks can significantly increase their
significantly degrade their performance, hence lifetime by powering down nodes often, or by using
they cannot be used. Also flooding based schemes very low power radios. This implies that many links
are available, but due to large delays they are not will be down frequently, and complete end-to end
adopted. So a different routing technique called paths often won‟t exist. Tactical networks may also
“Spray routing” has been proposed which can choose to operate in an intermittent fashion for
provide efficient data routing with the help of LPI/LPD reasons (low probability of interception and
mobility models. low probability of detection) [2]. Finally, deep space
networks and underwater networks often have to deal
Index terms: Mobility Model, Routing, with long propagation delays and/or intermittent
Conventional Routing, Flooding. connectivity, as well. These new networks are often
referred to collectively as Delay Tolerant Networks
1. INTRODUCTION (DTN [3]). What they all share in common is that
Wireless networks have been proposed for they can neither make any assumptions about the
applications where setting up a supporting, wired existence of a contemporaneous path to the
infrastructure might be too costly (e.g. sensor destination nor assume accurate knowledge of the
networks) or simply not an option (e.g. disaster relief, destination‟s location or even address, beforehand
deep space networks). Despite these ongoing efforts, Under such intermittent connectivity many traditional
wireless access currently seems to give rise to protocols fail (e.g. TCP, DNS, etc.). It is for this
inconvenience and frustration more often than reason that novel networking architectures are being
providing the envisioned flexibility to the user. pursued that could provide mobile nodes with better
Cellular access is low bandwidth and expensive, service under such intermittent characteristics.
while WiFi access is typically only available at a few Arguably though, the biggest challenge to enable
“hotspots” that the user has to locate and move to, networking in intermittently connected environments
without real “mobile computing”. Further, ad hoc is that of routing. Conventional Internet routing 2
networks have yet to find much application outside protocols (e.g. RIP and OSPF), as well as routing
the research or military community, while some dire schemes for mobile ad-hoc networks such as DSR,
issues regarding their scalability properties have been AODV, etc assume that a complete path exists
between a source and a destination, and try to
2241 | P a g e
2. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
discover these paths before any useful data is sent. reduction in transmissions compared to flooding-
Thus, if no end-to-end paths exist most of the time, based schemes, and even fewer transmissions than
these protocols fail to deliver any data to all but the some single-copy schemes; (ii) can at the same time
few connected nodes. However, this does not mean achieve better delays than all existing schemes in
that packets can never be delivered in these networks. most scenarios, if carefully designed; and (iii) has
Over time, different links come up and down due to very desirable scalability characteristics, with its
node mobility. If the sequence of connectivity graphs relative performance improving as the network size
over a time interval is overlapped, then an end to- end increases. Additionally performance depends upon
path might exist. This implies that a message could the mobility model used for analysis. Specifically, we
be sent over an existing link, get buffered at the next provide an efficient algorithm that each node can use
hop until the next link in the path comes up (e.g. a to locally choose the number of copies to generate in
new node moves in range or an existing one wakes- a given scenario, and also show how to optimally
up), and so on and so forth, until it reaches its distribute these copies.
destination. This model of routing constitutes a
significant departure from existing routing practices. 2. PROBLEM FORMULATION
It is usually referred to as “mobility-assisted” [4] In this project we are establishing a problem
routing, because node mobility often needs to be setup that consists of a number of nodes moving
exploited to deliver a message to its destination inside a bounded area according to a specific
(other names include “encounter-based forwarding” mobility model, where the network is disconnected at
or “store-carry-and-forward”). Routing here consists most times, and the data is to be routed among the
of independent, local forwarding decisions, based on nodes in the network through a routing mechanism so
current connectivity information and predictions of as to achieve Scalable, Efficient and Reliable results
future connectivity information, and made in an over “Flooding mechanisms” (like Epidemic
opportunistic fashion. The crucial question any Routing). Also the routing mechanism opted here is
routing algorithm has to answer in this context is Spray Routing with a multiple copy case where the
“who makes a good next hop when no path to the comparisons of routing between Spray routing and
destination currently exists and/or no other Epidemic routing; in between the spray routing
information about this destination might be techniques is also calculated.
available?” Despite a number of existing proposals
for opportunistic routing the answer to the previous
question has usually been “everyone” or “almost
everyone”. The majority of existing protocols are 3. MODULES
flooding-based that distribute duplicate copies to all We proposed the following modules for the
nodes in the network or a subset of them (e.g. analysis of efficient node utilization and time delays
gossiping and utility-based flooding). We call based on the mobility model.
schemes like these, which use more than one copy A. Epidemic Routing
per message, “multi-copy” schemes. Single copy B. Spray and wait
schemes [5] that only route one copy per message can C. Spray and focus
considerably reduce resource waste. Yet, they can
often be orders of magnitude slower than multi-copy 3A.Epidemic routing
algorithms and are inherently less reliable. These It is flooding-based in nature, as nodes
latter characteristics might make single-copy schemes continuously replicate and transmit messages to
very undesirable for some applications (e.g. in newly discovered contacts that do not already possess
disaster recovery networks or tactical networks a copy of the message. In the simplest case, epidemic
beyond enemy lines; even if communication must be routing is flooding; however, more sophisticated
intermittent, minimizing delay or message loss is a techniques can be used to limit the number of
priority). Summarizing, no routing scheme for message transfers. Epidemic routing has its roots in
intermittently connected environments currently ensuring distributed databases remain synchronized,
exists that can achieve both small delays and prudent and many of these techniques, such as rumor
usage of the network and node resources. For this mongering, can be directly applied to routing.
reason, a family of multi-copy protocols called Spray
routing, which can achieve both good delays and low 3B Spray and Wait Routing
transmissions. Spray routing algorithms generate Since too many transmissions are
only a small, carefully chosen number of copies to detrimental on performance, especially as the
ensure that the total number of transmissions is small network size increases. Our first protocol, Spray and
and controlled. From the perspective of functionality, Wait, distributes only a small number of copies each
spray routing can be viewed as a tradeoff between to a different relay. Each copy is then “carried” all
single and multiple copy techniques. the way to the destination by the designated relay.
Despite this, theory and simulations show Spray and Wait routing consists of the following two
that spray routing: (i) achieves an order of magnitude phases:
2242 | P a g e
3. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
to the age of last encounter in, and are useful,
Spray phase: For every message originating at a because they contain indirect (relative) location
source node, L message copies are initially spread – information. Specifically, for a large number of
forwarded by the source and possibly other nodes mobility models, it can be shown that a smaller timer
receiving a copy to L distinct relays. value on average implies a smaller distance from the
Wait phase: If the destination is not found node in question. Further, we use a “transitivity
in the spraying phase, each of the L nodes carrying a function” for timer values (see details in), in order to
message copy performs “Direct Transmission” (i.e. diffuse this indirect location information much faster
will forward the message only to its destination). than regular last encounter based schemes . The basic
Spray and Wait decouples the number of intuition behind this is the following: in most
transmissions per message from the total number of situations, if node B has a small timer value for node
nodes. Thus, transmissions can be kept small and D, and another node A (with no info about D)
essentially fixed for a large range of scenarios. encounters node B, then A could safely assume that
Additionally, its mechanism combines the speed of it‟s also probably close to node D. We assume that
epidemic routing with the simplicity and thriftiness of these timers are the only information available to a
direct transmission. Initially, it “jump-starts” node regarding the network (i.e. no location info,
spreading message copies quickly in a manner similar etc.). We have seen in that appropriately designed
to epidemic routing. However, it stops when enough utility based schemes, based on these timer values,
copies have been sprayed to guarantee that at least have very good performance in scenarios were
one of them will reach the destination, with high mobility is low and localized. This is the exact
probability. If nodes move quickly enough around the situation were Spray and Wait loses its performance
network or “cover” a sizeable part of the network advantage. Therefore, we propose a scheme were a
area in a given trip, we will show that only a small fixed number of copies are spread initially exactly as
number of copies can create enough diversity to in Spray and Wait, but then each copy is routed
achieve close-to-optimal delays. Some examples of independently according to the single-copy utility-
applications with such favorable mobility based scheme with transitivity. We call our second
characteristics would be Vehicular Ad hoc Networks scheme Spray and Focus.
[6] for real-time traffic reports and accident Spray and Focus: Spray and Focus routing consists
prevention, or a wireless mesh network over city of the following two phases:
buses equipped with radios.
Spray Phase: for every message originating at a
3C Spray and Focus Routing source node, L message copies are initially spread –
Although Spray and Wait combines forwarded by the source and possibly other nodes
simplicity and efficiency, there are some situations receiving a copy – to L distinct “relays”.
where it might fall short. As, it requires the existence Focus Phase: let UX(Y ) denote the utility of node X
of enough nodes that roam around the network often, for destination Y; a node A, carrying a copy for
which could potentially carry a message to a destination D, forwards its copy to a new node B it
destination that lies far. Usually, Spray and Wait encounters, if and only if UB(D) > UA(D) + Uth,
spreads all its copies quickly to the node‟s immediate where Uth (utility threshold) is a parameter of the
neighborhood. Hence, if the mobility of each node is algorithm.
restricted to a small local area, then none of the nodes
carrying a copy might ever see the destination. An 4. Delay of Spray Routing
example where such localized mobility might arise We will first calculate the expected end-to-
could be, for example, a university campus, where end delay of our simpler scheme, Spray and Wait.
most people tend to stay or move locally within their After all copies are distributed, each of the L relays
buildings for long stretches of time. In such will independently look for the destination (if the
situations, partial paths may exist over which a latter has not been found yet). In other words, the
message copy could be quickly transmitted closer to delay of the wait phase is independent of the spraying
the destination. Yet, in Spray and Wait a relay with a method. We compute this delay in the following
copy will naively wait until it moves within range of Lemma:
the destination itself. This problem could be solved if Lemma4.1: Let EW denote the expected duration of
some other single-copy scheme is used to route a the “wait” phase, if needed, and let EMmm denote the
copy after it‟s handed over to a relay, a scheme that expected meeting time under the given mobility
takes advantage of transmissions (unlike Direct model. Then, EW is independent of the spraying
Transmission). We propose the use of the single-copy method used, and given by
utility-based scheme from for this purpose. Each
node maintains a timer for every other node in the EW = EMmm/L. (1)
network, which records the time elapsed since the
two nodes last encountered each other 2 (i.e. came Proof: The time until one of the relays finds the
within transmission range). These timers are similar destination is the minimum of L independent and
2243 | P a g e
4. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
exponentially distributed random variables, with Temporal Dependency mobility model
average EMmm. Random-based mobility model
Unlike the expected duration of the wait Geographic restriction mobility model
phase, the duration of the spray phase largely
depends on the way the L copies are spread. The Spatial Dependency Mobility Model
following theorem calculates the expected delivery Mobility of mobile node could be influenced
time of Binary Spray and Wait. It defines a system of by other neighboring nodes. Since the velocities of
recursive equations that calculates the (expected) different nodes are 'correlated' in space, thus we call
residual time after i copies have been spread, in terms this characteristic as the Spatial Dependency of
of the time until the next copy(i + 1) is distributed, velocity.
plus the remaining time thereafter. It is important to
note that the following result is generic. By plugging Temporal Dependency Mobility Model
into the equations the appropriate meeting time value Mobility of a node may be constrained and
EMmm, we can calculate the expected delay of Spray limited by the physical laws of acceleration, velocity
and Wait for the respective mobility model. and rate of change of direction. Hence, the current
velocity of a mobile node may depend on its previous
Theorem 4.2: Let EDsw(L) denote the expected velocity. Thus the velocities of single node at
delay of the Binary Spray and Wait algorithm, when different time slots are „correlated'. We call this
L copies are spread per message. Let further ED(i) mobility characteristic the Temporal Dependency of
denote the expected remaining delay after i message velocity.
copies have been spread. Then, ED(1) ≈ EDsw(L),
where ED(1) can be calculated by the following Random Based Mobility Model
system of recursive equations: In this model the mobile nodes move
randomly and freely without restrictions. To be more
ED(i) =[EMmm/i(M − i)]+[M − i – 1/M – i]ED(i + 1) specific, the destination, speed and direction are all
ED(L) = EW =EMmm/L chosen randomly and independently of other nodes.
.
Proof: Let us look into the case, when there are I Geographical Restriction Mobility Model
nodes (i < L) that have one or more copies. Further, Nodes may move in a pseudo-random way
let‟s assume that, among the i nodes with copies, Xi on predefined pathways because of geographic
of them have more than one (i.e. are “active”), and obstacles, this type of mobility is called mobility
thus are allowed to forward copies further to other model with geographic restriction.
relays. Since all hitting times are independent and
exponentially distributed, the time until any of the
nodes with a message copy (i) encounters any of the
nodes without one (M−i) is equal to EMmm/i(M−i) .
Now, if the node encountered is the destination (with
probability 1/M−i) the message gets delivered.
Otherwise (with probability M−i−1/M−i) the
algorithm continues, performing one of the
following:
a) with probability Xi/i it is one of the active nodes
that encountered this other node, and therefore hands
it over half its copies; i + 1 nodes have copies now,
and an expected time ED(i + 1) remains until
delivery; b) with probability i−Xi/i it was one of the
other nodes carrying a message copy that
encountered a new node. Since these relays only
forward their message copy to its destination, nothing
happens, and the remaining time is still ED(i).
Putting it altogether
ED(i) =[[EMmm/i(M − i)]+[M − i – 1/M − i
]]/ 5A. Random Waypoint Model
[i – X/iED(i) +Xi/iED(i + 1)] In this model the mobile nodes move
5 Mobility Models randomly and freely without restrictions. To be more
Mobility model represents the movement of specific, the destination, speed and direction are all
the mobile users, and how their location, velocity and chosen randomly and independently of other nodes.
acceleration change over time. In the Random Waypoint model, each node moves as
Mobility models are of four types. They are: follows
Spatial Dependency mobility model
2244 | P a g e
5. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
– Choose a point X in the network
uniformly at random.
– Choose a speed v uniformly in 5C Random Direction Model
[vmin, vmax] with vmin > 0 and This model is able to overcome the non-
vmax < ∞. Let v denote the average uniform spatial distribution and density wave
speed of a node. problems.
– Move towards X with speed v along Instead of selecting a random destination
the shortest path to X. within the simulation field, in the Random Direction
– When at X, pause for Tstop time model the node randomly and uniformly chooses a
slots where Tstop is chosen from a direction by which to move along until it reaches the
geometric distribution with mean boundary.
Tstop. After the node reaches the boundary of the
– After this duration it again chooses simulation field and stops with a pause time Tpause,
another random destination in the it then randomly and uniformly chooses another
simulation field and moves towards direction to travel. This way, the nodes are uniformly
it. The whole process is repeated distributed within the simulation field.
again and again until the simulation In the Random Direction model, each node moves as
ends. follows
– If Tstop=0, it leads to continuous – Choose a direction θ uniformly in [0, 2π).
mobility . – Choose a speed v uniformly in [vmin, vmax]
with vmin > 0 and vmax < ∞. Let v denote the
average speed of a node.
– Choose a duration T of movement from a
geometric distribution with mean T. The
average distance traveled in a duration L is
equal to Tv. We assume that L =O _√N_ to
ensure fast mixing 1.
– Move towards θ with speed v for T time slots.
After T time slots, pause for Tstop time slots
where Tstop is chosen from a geometric
distribution with mean Tstop.
– The process continues until the simulation ends.
5D Reference Point Group
5B Random Walk Model In the RPGM model, each group has a
The Random Walk model was originally centre, which is either a logical centre or a group
proposed to emulate the unpredictable movement of leader node. For the sake of simplicity, we assume
particles in physics. Because some mobile nodes are that the centre is the group leader.
believed to move in an unexpected way, Random Thus, each group is composed of one leader
Walk mobility model is proposed to mimic their and a number of members. The movement of the
movement behaviour. group leader determines the mobility behaviour of the
The Random Walk model has similarities entire group. The respective functions of group
with the Random Waypoint model because the node leaders and group members are described as follows.
movement has strong randomness in both models.
We can think the Random Walk model as the specific The Group Leader
Random Waypoint model with zero pause time. The movement of group leader at time t can
The Random Walk model is a memory less be represented by motion vector Vtgroup. Not only
mobility process where the information about the does it define the motion of group leader itself, but
previous status is not used for the future decision. also it provides the general motion trend of the whole
That is to say, the current velocity is independent group.
with its previous velocity and the future velocity is Each member of this group deviates from
also independent with its current velocity. this general motion vector Vt group by some degree.
In the Random Walk mobility model, each node The motion vector Vtgroup can be randomly chosen or
moves as follows carefully designed based on certain predefined paths.
– Choose one of the four neighboring
grid points uniformly at random. The Group Members
– Move towards the chosen grid The movement of group members is
point during that time slot. significantly affected by the movement of its group
– Continue the process until the leader. For each node, mobility is assigned with a
simulation ends. reference point that follows the group movement.
2245 | P a g e
6. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
Upon this predefined reference point, each mobile
node could be randomly placed in the
neighbourhood.
6 Results
The mobility models are selected for routing
either it can be Epidemic or Spray wait. So the
mobility model specifies the way the data is carried
out; say Random way point shown in the figure1.
Fig3 Node movement in Spray wait
Fig1: Node movement in random way point
A node selection for the source and
destination through which data is sent initially by
Epidemic routing where flooding of data is data to
the nodes is efficiently done shown in fig2.
Similarly spray and wait is effectively shown in fig3
where source bits are sprayed to nodes in the vicinity
of source by which data can be routed to the Fig: Node movement and data routing in
destination. So, the data is not flooded but after some Spray wait
waiting it is sent by any way through the other nodes
so as to actively use most of the nodes in the network
model as shown in fig4.
Finally the comparison between the flooding
and spray routing has been shown in two values like
Network resource utilization and Delay time(fig5).
Also the same is shown in both spray wait and spray
focus mechanisms.
Fig 5 Performance analysis of spray waits
Fig2: Flooding of data in Epidemic routing
2246 | P a g e
7. Phani Sridhar A, Samuel Susan V, Srinivasa Rao D, Mallikarjun Reddy D / International
Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.comVol. 2, Issue4, July-august 2012, pp.2241-2247
Fig 6 Performance analysis of spray waits and sprays
focus
7 Conclusion and Future work
This work has been conducted a
comparative study on data routing for Flooding
mechanism(say Epidemic Routing) and Spray wait,
also spray wait and spray focus based on two factors
network resource utilization and delay time.
In future, work can be extended to
implement spray mechanisms in reducing delay time
(especially in spray wait) with respect to single copy
and multiple copies of data that are sprayed.
References
1. H. Wu, R. Fujimoto, R. Guensler, and M.
Hunter, “Mddv:Mobility- centric data
dissemination algorithm for vehicular
networks,” in Proceedings of ACM
SIGCOMM workshop on Vehicular Ad Hoc
Networks (VANET), 2004.
2. “Disruption tolerant networking,”
http://www.darpa.mil/ato/solicit/DTN/.
3. “Delay tolerant networking research group,”
http://www.dtnrg.org.
4. “Mobility Models” http://www.cise.ufl.edu/.
5. T. Spyropoulos, K. Psounis, and C. S.
Raghavendra, “Efficient routing in
intermittently connected mobile networks:
The single- copy case,” USC, Tech. Rep.
CENG-2005-10 (available at www-
scf.usc.edu/˜spyropou/ton-single-tech.pdf),
2005.
6. “Vehicular adhoc networks”
http://google.com
2247 | P a g e