This document summarizes a research paper that proposes using two-hop relay with erasure coding to increase message delivery probability in mobile ad hoc networks (MANETs). It develops a finite-state absorbing Markov chain framework to model the message delivery process. Based on this, it derives closed-form expressions for message delivery probability under different message lifetimes and sizes. The key findings are that two-hop relay with erasure coding can improve delivery probability compared to traditional routing, and the probability varies based on message parameters and node density.
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
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
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...CSCJournals
In this paper, we address the problem of routing in “delay tolerant networks” (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and the destination at any time, especially when the destination is not in the same region of the source, what makes the traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol Prophet and the model of \"transfer by delegation\" (custody transfer) to improve the routing in DTN network and to exploit the nodes as a common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.
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
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
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
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...CSCJournals
In this paper, we address the problem of routing in “delay tolerant networks” (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and the destination at any time, especially when the destination is not in the same region of the source, what makes the traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol Prophet and the model of \"transfer by delegation\" (custody transfer) to improve the routing in DTN network and to exploit the nodes as a common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.
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
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
A New Analysis for Wavelength Translation in Regular WDM NetworksVishal Sharma, Ph.D.
We present a new analysis of wavelength translation in
regular, all-optical WDM networks, that is simple, computationally
inexpensive, and accurate for both low and high
network loads. In a network with
k
wavelengths per link,
we model the output link by an auxiliary
M/M/k/k
queueing
system. We then obtain a closed-form expression for
the probability
P succ
that a session arriving at a node at a
random time successfully establishes a connection from its
source node to its destination node. Unlike previous analyses,
which use the link independence blocking assumption,
we account for the dependence between the acquisition of
wavelengths on successive links of the session’s path. Based
on the success probability, we show that the throughput per
wavelength increases superlinearly (as expected) as we increase
the number of wavelengths per link; however, the
extent of this superlinear increase in throughput saturates
rather quickly. This suggests some interesting possibilities
for network provisioning in an all-optical network. We verify the accuracy of our analysis via simulations for the torus
and hypercube networks.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
Connectivity aware and adaptive multipath routing algorithm for mobile adhoc ...ijwmn
We propose in this paper a connectivity-aware routing algorithm and a set of related theorems. This algorithm allows nodes in Mobile Adhoc and Sensor Networks (MASNets) to provide the highest connectivity life time to a specific destination since the issuance of data becomes a necessity for MASNets. In the proposed Solution, nodes in MASNets are able to specify the disjointness degree of the available paths allowing the discovery of the optimal set of backup routes and consequently enhance the survivability of the connectivity. These nodes perform an on-demand discovery and a generation of a set of routes, by specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of k established paths. The proposed multipath routing algorithm, is adaptive, secure, and uses labels to carry the disjointness-threshold between nodes during the route discovery. A set of security mechanisms, based on the Watchdog and the digital signature concepts, is used to protect the route discovery process.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Fault tolerant routing scheme based onIJCNCJournal
Most routing protocols designed for wireless sensor networks used the unit disk graph model (UGD) to
represent the physical layer. This model does not take into account fluctuations of the radio signal. Therefore, these protocols must be improved to be adapted to a non-ideal environment. In this paper, we used the lognormal shadowing (LNS) model to represent a non-ideal environment. In this model, the probability of successful reception is calculated according to the link quality. We evaluated LEACH’s performance with LNS model to illustrate the effects of radio signal. Unfortunately, our findings showed that the fluctuations of signal radio have a significant impact on protocol performance. Thereby, we
proposed a Fault-Tolerant LEACH-based Routing scheme (FTLR scheme) to improve the performance of LEACH in a non-ideal environment. Simulation results proved that our contribution provides good performance over the ideal model in terms packet loss rate and energy consumption.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
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.
In this paper, we consider the joint optimal sensing
and distributed MAC protocol design for cognitive radio
networks. Specifically, we design a synchronized MAC protocol
for dynamic spectrum sharing among multiple secondary
users, which incorporates spectrum sensing for protecting active
primary users. We perform saturation throughput analysis for
the proposed MAC protocol that explicitly captures spectrum
sensing performance. Then, we find its optimal configuration
by formulating a throughput maximization problem subject to
detection probability constraints for primary users. In particular,
the optimal solution of this optimization problem returns the
required sensing time for primary users’ protection and optimal
contention window for maximizing total throughput of the
secondary network. Finally, numerical results are presented to
illustrate a significant performance gain of the optimal sensing
and protocol configuration.
A New Analysis for Wavelength Translation in Regular WDM NetworksVishal Sharma, Ph.D.
We present a new analysis of wavelength translation in
regular, all-optical WDM networks, that is simple, computationally
inexpensive, and accurate for both low and high
network loads. In a network with
k
wavelengths per link,
we model the output link by an auxiliary
M/M/k/k
queueing
system. We then obtain a closed-form expression for
the probability
P succ
that a session arriving at a node at a
random time successfully establishes a connection from its
source node to its destination node. Unlike previous analyses,
which use the link independence blocking assumption,
we account for the dependence between the acquisition of
wavelengths on successive links of the session’s path. Based
on the success probability, we show that the throughput per
wavelength increases superlinearly (as expected) as we increase
the number of wavelengths per link; however, the
extent of this superlinear increase in throughput saturates
rather quickly. This suggests some interesting possibilities
for network provisioning in an all-optical network. We verify the accuracy of our analysis via simulations for the torus
and hypercube networks.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
Connectivity aware and adaptive multipath routing algorithm for mobile adhoc ...ijwmn
We propose in this paper a connectivity-aware routing algorithm and a set of related theorems. This algorithm allows nodes in Mobile Adhoc and Sensor Networks (MASNets) to provide the highest connectivity life time to a specific destination since the issuance of data becomes a necessity for MASNets. In the proposed Solution, nodes in MASNets are able to specify the disjointness degree of the available paths allowing the discovery of the optimal set of backup routes and consequently enhance the survivability of the connectivity. These nodes perform an on-demand discovery and a generation of a set of routes, by specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of k established paths. The proposed multipath routing algorithm, is adaptive, secure, and uses labels to carry the disjointness-threshold between nodes during the route discovery. A set of security mechanisms, based on the Watchdog and the digital signature concepts, is used to protect the route discovery process.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Fault tolerant routing scheme based onIJCNCJournal
Most routing protocols designed for wireless sensor networks used the unit disk graph model (UGD) to
represent the physical layer. This model does not take into account fluctuations of the radio signal. Therefore, these protocols must be improved to be adapted to a non-ideal environment. In this paper, we used the lognormal shadowing (LNS) model to represent a non-ideal environment. In this model, the probability of successful reception is calculated according to the link quality. We evaluated LEACH’s performance with LNS model to illustrate the effects of radio signal. Unfortunately, our findings showed that the fluctuations of signal radio have a significant impact on protocol performance. Thereby, we
proposed a Fault-Tolerant LEACH-based Routing scheme (FTLR scheme) to improve the performance of LEACH in a non-ideal environment. Simulation results proved that our contribution provides good performance over the ideal model in terms packet loss rate and energy consumption.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
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.
In this paper, we consider the joint optimal sensing
and distributed MAC protocol design for cognitive radio
networks. Specifically, we design a synchronized MAC protocol
for dynamic spectrum sharing among multiple secondary
users, which incorporates spectrum sensing for protecting active
primary users. We perform saturation throughput analysis for
the proposed MAC protocol that explicitly captures spectrum
sensing performance. Then, we find its optimal configuration
by formulating a throughput maximization problem subject to
detection probability constraints for primary users. In particular,
the optimal solution of this optimization problem returns the
required sensing time for primary users’ protection and optimal
contention window for maximizing total throughput of the
secondary network. Finally, numerical results are presented to
illustrate a significant performance gain of the optimal sensing
and protocol configuration.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Investigating Multilayer Omega-Type Networks Operating with the Cut-Through T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
Optimize the Network Coding Paths to Enhance the Coding Protection in Wireles...IJCNCJournal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Broadcast is one of the most important approach in distributed memory parallel computers that is used to
find a routing approach from a one source to all nodes in the mesh. Broadcasting is a data communication task in which corresponds to one-to-all communication. Routing schema is the approach that used to determine the road that is used to send a message from a source node to destination nodes. In this paper, we propose an efficient two algorithms for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. In wormhole routing large network packets are broken into small pieces called FLITs (flow control digits). The destination address is kept in the first flit which is called the header flit and sets up the
routing behavior for all subsequent flits associated with the packet. If the packets of the message can’t deliver to their destination and there is a cyclic dependence over the channels in the network, then the deadlock even is occurred. In this paper we introduce an efficient two algorithms, Three-Dimension Hamiltonian Broadcast (3-DHB) and Three-Dimension Six Ports Hamiltonian Broadcast (3-DSPHB) which used broadcast communication facility with deadlock-free wormhole routing in general threedimensional networks. In this paper the behaviors of these algorithms were compared using simulation. The results presented in this paper indicate that the advantage of the proposed algorithms.
Adapting Mac 802.11 For Performance Optmization Of Manet Using Cross Layer In...ijwmn
In this research, we study the optimization challenges of MANET and cross-layer technique to improve its performance. We propose an adaptive retransmission limits algorithm for IEEE 802.11 MAC to reduce the false link failures and predict the node mobility. We implemented cross layer interaction between physical and MAC layers. The MAC layer utilizes the physical layer information for differentiating false link failure from true link failure. The MAC layer adaptively selects a retransmission limit (short and long) based on the neighbour signal strength and sender node speed information from the physical layer. The proposed approach tracks the signal strength of each node in network and, while transmitting to a neighbour node, if it’s received signal strength is high and is received recently then Adaptive MAC persists in its retransmission attempts. As there is high probability that neighbour node is still in transmission range and may be not responding due to some problems other then mobility. In this paper, we evaluate the performance of MANET and show that how our Adaptive MAC greatly improves it. The simulation is done using Network Simulator NS-2.
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED ...IJCNCJournal
Medium Access control (MAC) is one of the fundamental problems in wireless sensor networks. The performance of wireless sensor network depends on it. The main objective of a medium access control method is to provide high throughput, minimize the delay, and conservers the energy consumption by avoiding the collisions. In this paper, a general model for MAC protocol to reduce the delay, maximize throughput and conserve the energy consumption in channel accessing in high density randomly distributed wireless sensor network is presented. The proposed model is simulated using MATLAB. The simulation results show that the average delay for sensors with sufficient memory is lower than sensors without
memory. Further, the throughput of the channel access method with memory is better than without memory.
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.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
1. International Journal of Computational Engineering Research||Vol, 04||Issue, 3||
||Issn 2250-3005 || || March || 2014 || Page 13
Manets: Increasing N-Messages Delivery Probability Using Two-
Hop Relay with Erasure Coding
A.Vijayalakshmi1
, J.Praveena2
1
P.G Student, Tagore Engineering College, Chennai
2
Asst. Professors, Tagore Engineering College, Chennai
I. INTRODUCTION:
A mobile ad hoc network (MANET) is a peer-to-peer network without any pre-existing infrastructure or cen-
tralized administration, which consists of fully self-organized mobile nodes. As it can be rapidly deployed and flexibly
reconfigured, the MANET has found many promising appli-cations, such as the disaster relief, emergency response, daily
information exchange, etc., and thus becomes an indispensable component among the next generation networks [1],
[2].Since their seminal work in [3], a significant amount of work has been done for a thorough understanding of the delivery
delay performance of various routing protocols in MANETs. Zhang et al. in [4] developed an ODE (ordinary differential
equations) based framework to analyze the delivery delay of epidemic routing and its variants. Later, Hanbali et al. focused
on a multicopy two-hop relay algorithm and explored the impact of packet lifetime (time-to-live TTL) on the packet delivery
delay in [5], [6]. Recently, Liu et al. derived closed-form expressions for the packet delivery delay of erasure coding
enhanced two-hop relay in [7] and that of group-based two-hop relay in [8].The delivery delay study [3]–[8], although
important and meaningful, can only tell the expected time it takes a routing protocol to deliver a message (or packet) from
the source to the destination, i.e., the mean time required to achieve the delivery probability 1, which is actually a simple
extreme case of the delivery probability study. Obviously, it is of more interest for network designers to know the
corresponding delivery probability under any given message lifetime (or permitted delivery delay). Further notice that in the
challenging MANET environment, multiple message replicas are often propagated to improve the delivery performance,
where a relay node receiving a message may forward it or carry it for long periods of time, even after its arrival at the
destination. Such combination of message replication and long-term storage imposes a severe overhead on the mobile nodes
which are usually not only power energy-constrained but also buffer storage-limited. Thus, the message lifetime should be
carefully tuned so as to reduce the network resource consumption in terms of buffer occupation and power consumption
while simultaneously satisfy the specified delivery performance requirement.
It is noticed that there have been some efforts in literature focusing on the delivery probability study. Panagakis et
al. in [9] analytically derived the message delivery probability of two-hop relay under a given time limit by approximating
the cumulative distributed function (CDF) of message delivery delay, with the assumption that for any node pair the message
can be successfully transmitted whenever they meet each other. In [10], Whitbeck et al. explored the impact of message size,
message lifetime and link lifetime on the message delivery ratio (probability) of epidemic routing by treating the
intermittently connected mobile networks (ICMNs) as edge-Markovian graphs, where each link (edge) is considered
independent and has the same transition probabilities between “up" and “down" status. Later, Krifa et al. in [11] explored the
impact of message scheduling and drop policies on the delivery probability performance of epidemic routing, and proposed a
distributed scheduling and drop policy based on statistical learning to approximate the optimal performance.
ABSTRACT:
The lack of a thorough understanding of the fundamental performance limits in mobile ad hoc networks
(MANETs) remains a challenging barrier stunting the commercialization and application of such
networks. The proposed system is using a method such as two-hop relay algorithm with erasure coding
to increase the message delivery probability of a MANETs. The two-hop relay algorithm with erasure
coding used for the message that is erasure coded into multiple frames (coded blocks) at each source
node. And also, a finite-state absorbing Markov chain framework is developed to characterize the
complicated message delivery process in the challenging MANETs. Based on the developed framework,
closed-form expressions are further derived for the message delivery probability under any given
message lifetime and message size by adopting the blocking matrix technique where the important
issues of interference, medium contention and traffic contention are carefully integrated. To further
improve our proposed systems a delivery of n-distinct message is simultaneously send from source to
destination.
KEYWORDS: Mobile ad hoc networks, delivery probability, two-hop relay, erasure coding.
2. Manets: Increasing N-Messages Delivery Probability …
||Issn 2250-3005 || || March || 2014 || Page 14
More recently, the optimization issue of message delivery probability under specific energy constraints and
message lifetime requirement has also been intensively addressed in the context of delay tolerant networks (DTNs) in which
the basic two-hop relay was adopted for packet routing and a wireless link becomes available whenever two nodes meet each
other.A common limitation of the available models is that, all these works assumed a single flow (source-
destination pair) in their analysis such that all other nodes act as pure relays for this flow. Such models, although
simple and easy to use, may neglect an important fact that for the general MANET scenarios, multiple traffic
flows may co-exist and a relay node may simultaneously carry messages belonging to multiple flows. Moreover,
all these models (no matter for the ICMNs or for the DTNs) focus on a very special MANET scenario, i.e., the
sparsely distributed MANET, by assuming that whenever two nodes meet together they can transmit with each
other. Obviously, the available models cannot be applied for delivery probability analysis in the gen-eral
MANETs where the interference and medium contention issues are of significant importance. In this paper, we
study the delivery probability performance of two-hop relay MANETs with a careful consideration of the above
important issues. The main contributions of this paper are summarized as follows.We focus on the two-hop
relay algorithm in MANETs with erasure coding and more general traffic pattern, where the message at each
source node is erasure coded into multiple frames (coded blocks). We develop a general finite-state absorbing
Markov chain theoretical framework to model the complicated message spreading process in the challenging
MANETs, which can also be used to analyze the delivery probability performances under other popular routing
protocols, like the epidemic Routing. Based on the Markov chain framework, we further derive closed-form
expressions for the corresponding message delivery probability under any given message lifetime and message
size by adopting the blocking matrix technique, where the important issues of interference, medium contention
and traffic contention in MANETs are carefully incorporated into the analysis. Extensive simulation studies
are conducted to validate our theoretical framework, which indicates that the new framework can be used to
accurately predict the message delivery probability in MANETs with two-hop relay and erasure coding, and
characterizes how the delivery probability varies with the parameters of message size, replication factor and
node density there. The rest of this paper is outlined as follows. Section II introduces the system models, the
routing protocol and the scheduling scheme considered in the paper. In Section III, we develop a Markov chain
theoretical model for the delivery probability analysis under any given message lifetime and message size.
II. PRELIMINARIES
2.1. System Models
The considered mobile ad hoc network is a unit torus with n mobile nodes. The torus is evenly divided
into m × m equal cells (or squares), each cell of side length 1/m as shown in Fig. 1(a). Time is slotted and nodes
randomly roam from cell to cell according to the i.i.d. mobility model , which is defined as follows: at time slot t
= 0, a node is initially placed in one of the m2 cells according to the uniform distribution. The node randomly
selects a cell from the m2 cells with equal probability of 1/m2 independent of other nodes, and moves tothe
selected cell at time slot t = 1. The node then repeats this process in every subsequent time slot. One can see that
at each time slot, the n nodes are uniformly and randomly distributed in the m2 cells. Since the node movements
are also independent from time slot to time slot, the nodes are totally reshuffled at each time slot. We employ
the protocol model in [25] to address the interference among simultaneous link transmissions. Similar to [23],
we assume that each time slot will be allocated only for data transmissions in one hop range. The data
transmission model is defined as follows: suppose node Ti is transmitting to node Ri at time slot t as shown in
Fig. 1(a), and denote by Tit and Rit the positions of Ti and Ri, respectively. According to the protocol model,
the data transmission from Ti to Ri can be successful if and only if the following two conditions hold for any
other simultaneous transmitting node Tj :
|Tit − Rit| ≤ r (1)
|Tjt − Rit| ≥ (1 + Δ)|Tit − Rit| (2)
Here r is the transmission range adopted by each node, and ∆> 0 is a protocol specified factor to represent the guardzone
around each receiver.In order to fully characterize the traffic contention issue in MANETs, we consider here the permutation
traffic pattern , where each node has a locally generated traffic flow to deliver to its destination and also needs to receive a
traffic flow originated from another node. Since there are n mobile nodes in the network, it is easy to see that there exist in
total n distinct traffic flows. we assume that the local traffic flow at each node has only a single message. Without loss of
generality, we focus on a tagged flow hereafter and denote its source and destination by S and D, respectively.For the tagged
flow, the message generated at the source S is assumed to have in total ω blocks (ω ≥ 1), where a single block can be
successfully transmitted during a time slot (or meeting duration). We further assume that the message is relevant during τ
time slots, i.e., the message is labeled with a lifetime of τ time slots, and will be dropped from the network if it fails to make
itself to the destination D within τ time slots.Remark 1: Note that the node mobility is homogeneous under the i.i.d. model,
where during each time slot all node pairs have the same probability to encounter and the n nodes are uniformly and
randomly distributed in the m2 cells. Such features of homogeneous node meeting and uniform node dis-tribution, although
simple and easy to use, are different from other more practical node distributions, like the correlated distribution, the
clustered distribution, the home-point distri-bution, etc.,
3. Manets: Increasing N-Messages Delivery Probability …
||Issn 2250-3005 || || March || 2014 || Page 15
where nodes exhibit significant inhomogeneities in spatial distribution over the network area. Remark 2: The main
difficulties in extending the i.i.d. model to take into account more complex mobility, such as the random walk
model, random waypoint model, random direction model, correlated mobility model, reference point group
mobility, etc., are two folds: the first difficulty is to characterize the node meeting process which depends solely
on the node mobility, and the second one is to derive the data transmission probability during each node meeting
which is related to both the spatial distribution and data transmissions of other nodes.
(a) Illustration of the transmission model.
(b) Cells in a transmission-group with α = 4.
Figure. 1. Illustration of a cell-partitioned network with m = 16.
It is notable that in MANETs, even though a node pair meet together in a time slot they may fail to
transmit data due to the interference caused by other simultaneous data transmissions in the network. These two
difficulties combined together make the analytical modeling of delivery performance in MANETs much more
challenging. Actually, the main reason behind adopting the simple i.i.d. model is that it is very helpful to keep
the theoretical analysis tractable and thus enables closed-form analytical results to be developed for the message
delivery probability in the challenging MANETs.
2.2. Two-Hop Relay with Erasure Coding
The two-hop relay, since first proposed by Grossglauser and Tse (2001) in [11], has been extensively
explored in literature and proved to be a popular and efficient routing protocol for DTNs. However, its delivery
performance remains largely unknown in the general MANET environment, where the interference may create
extra delay in the delivery of packets. It is further noticed that extensive simulation delay performance of two-
hop relay in DTNs can be improved via incorporating the erasure coding technique.
4. Manets: Increasing N-Messages Delivery Probability …
||Issn 2250-3005 || || March || 2014 || Page 16
Therefore, we focus on the two-hop relay with erasure coding in this paper and develop a theoretical framework
to analytically study its delivery performance. According to the two-hop relay algorithm with erasure coding [7],
[10], for the tagged flow, the message is first erasure coded into ω · β equal sized frames (or code blocks) after it
is locally generated at S, where β is the replication factor. Since each frame is almost the same size as the
original block, we assume that it can also be successfully transmitted during a time slot. Any (1 + Ɛ) · ω frames
can be used to successfully reconstruct the message, where _ is a small constant and it varies with the adopted
erasure coding algorithm. Similar to [7], we ignore the constant Ɛ here and thus the message can be
successfully recovered at the destination D with no less than ω frames collected before it expires (i.e., within τ
time slots).After erasure coding the message into ω · β frames, the source node S starts to deliver out these
frames according to the two-hop relay algorithm [8]. Every time S is selected as the transmitter via the
transmission scheduling scheme, it operates as follows:
Step 1: S first checks whether D is in the transmission range. If so, S conducts with D the “source-to-
destination" transmission, where a frame is sent directly to D.
Step 2: For the case that D is not in the transmission range of S, if there is no other node in the one-hop
neighborhood of S, S remains idle for the time slot;otherwise, S randomly selects a node, say R, from the one-
hop neighborhood as the receiver, and flips an unbiased coin;If it is the head, S chooses to perform the “source-
to-relay" transmission with R. S initiates a handshake with R to check whether R is carrying a frame received
from S. If so, S remains idle for the time slot; otherwise, S sends to R a frame destined for D. Otherwise, S
chooses to perform with R the “relay-to-destination" transmission. S first checks whether it is carrying a frame
destined for R. If so, S forwards the frame to R; otherwise, S stays idle for the time slot.It is noticed that
distinguished from available works which assumed a simple scenario of single traffic flow, we consider in this
paper the permutation traffic pattern to fully characterize the traffic contention issue in MANETs. Under such
traffic pattern , node may not only carry the frames of its own message ,but also simultaneously carry multiple
frames originated from other nodes in the network. To simplify the analysis and thus keep the theoretical
framework tractable, we assume that each frame will be delivered to at most one relay node and each relay node
will carry at most one frame from in S.We consider a single-copy version of the two-hop relay with erasure
coding, where S either delivers a frame to D or sends it to a relay node. After sending a frame to a relay node, S
retains a copy of the frame as backup; while the relay node will delete the frame from the buffer after
forwarding it to D. Therefore, before arriving at D, each frame may have at most two copies in the network, one
in the relay node and the other one in S.
2.3. Transmission Scheduling
Similar to previous studies we consider a local transmission scenario [7], [8], [9], where a transmitter
in a cell can only transmit to receivers in the same cell or other eight adjacent cells (two cells are called adjacent
cells if they share a common point). Thus, the transmission range can be accordingly determined as r =√ 8/m. It
is easy to see that two links can transmit simultaneously if and only if they are sufficiently far away from each
other. To avoid collisions among simultaneous transmitting links and support as many simultaneous link
transmissions as possible, we adopt here the transmission-group based scheduling scheme [7], [8], [9]. With
such a transmission-group definition, all m2 cells are actually divided into α2 distinct transmission-groups. If
each transmission-group becomes active (i.e., has link transmis-sions) alternatively, then each cell will also
become active every α2 time slots. As illustrated in Fig. 1(b) for the case α = 4, there are in total 16
transmission-groups, and all shaded cells belong to the same transmission-group.Setting of Parameter α: As
shown in Fig. 1(b), suppose node S in an active cell is transmitting to node V in a time slot. It is easy to see that
another transmitter, say K, in another active cell is at least α−2 cells away from V . According to the protocol
interference model , we should have (α−2)· 1/m ≥ (1+Δ)·r to ensure the successful data reception at V . Notice
that α ≤ m and r = √8/m, then the parameter α can be determined as
α = min{[(1 + Δ) √ 8 + 2] m} (3)
It is noticed that with the setting of α = m, all network cells are divided into m2 distinct transmission-
groups, with each transmission-group containing a single cell. Therefore, the network can support only one
active transmitter-receiver pair during each time slot. For the transmission-group based scheduling scheme, a
node is assumed to be able to obtain the cell id where it resides at the beginning of each time slot. Actually, for a
given network cell partition, such hypotheses can be satisfied by adopting the global positioning system (GPS)
or some node localization schemes . Therefore, after obtaining the cell id, a node can easily judge whether it is
inside an active cell or not for the current time slot, and then the nodes in an active cell can compete to become
the transmitter via a distributed coordination function (DCF)-style mechanism.
5. Manets: Increasing N-Messages Delivery Probability …
||Issn 2250-3005 || || March || 2014 || Page 17
Remark 3: The transmission-group based scheduling scheme has the following two advantageous features:
firstly, it is fully distributed and thus it can be implemented without any centralized management; secondly, it
enables closed-form expressions to be derived for the transmission probability under the two-hop relay during
each time slot. It is also noticed that in (1) we derive√α according to the possible maximum distance (i.e., r =
√8/m) between a transmitter-receiver pair in two adjacent cells. However, one can see that the distance between
a transmitter-receiver pair selected for each active cell may be less than √8/m with high probability during each
time slot. Consequently, the scheduling scheme may unavoidably result in an inefficient spatial reuse due to the
fixed setting of α.
III. MESSAGE DELIVERY PROBABILITY
In this section ,we first introduce some basic probabilities under the two hop relay with erasure coding ,
develop the Markov chain theoretical framework ,and then proceed to derive the message delivery probability.
3.1. Markov Chain Framework
For the tagged flow, as the message generated at the source node S is erasure coded into ω · β frames and is
relevant only in τ time slots, the destination node D needs to collect at least ω frames within τ time slots so as to
successfully recover the message. If we denote by (j, k) a general transient state during the message delivery
process that S is delivering the jth frame and D has already received k distinct frames, and further denote by (∗ ,
k) a transient state that S has already finished dispatching all ω · β frames while D has only received k of them,
1 ≤ j ≤ ω · β, 0 ≤ k < ω, then we can characterize the message delivery process with a finite-state absorbing
Markov chain. Specifically, if the tagged flow is in state (j, k) at the current time slot, only one of the following
four transition cases illustrated in Fig. 2 may happen in the next time slot.
SR Case : “source-to-relay” transmission only, i.e., S successfully delivers the jth frame to a new relay node
while none of the relays delivers a frame to D. As shown in Fig. 2(a) that under such a transition case, the state
(j, k) may transit to two different neighboring states depending on the current frame index j.
Figure 3.1 SR Case
RD Case : “relay-to-destination” transmission only, i.e., some relay node successfully delivers a frame to D
while S fails to deliver out the jth frame to a new relay node. As shown in Fig. 2(b) that there is only one target
state (j, k + 1) under the RD case.
Figure 3.1 RD Case
SR+RD Case: both “source-to-relay” and “relay-to-destination” transmissions, i.e., these two transmissions
happen simultaneously. We can see from Fig. 2(c) that depending on the value of j there are two possible target
states under the SR+RD case.
Figure 3.1SR+RD case
6. Manets: Increasing N-Messages Delivery Probability …
||Issn 2250-3005 || || March || 2014 || Page 18
SD Case : “source-to-destination” transmission only, i.e., S successfully delivers a frame to D. As shown in Fig.
2(d) that under the SD case, the state (j, k) may transit to (j +1, k +1) or (∗ , k +1), similar to that under the
SR+RD case.
Figure 3.1 SD case
3.2. Derivations of delivery probability ᵩ(ω,β,τ)
Before deriving the message delivery probability ,we first node S which is further erasure coded into
ω.β frames ,the delivery delay of the message and the timeslot when the destination node D receives ω distinct
frames of the message.For the tagged flow, if we denote by Td the message delivery delay and denote by
ϕ(ω,β,τ) the message delivery probability under the message lifetime constraint τ, then we have
ϕ(ω, β,τ ) = Pr(Td ≤τ ) = Pr(Td = t). (4)
Based on the Markov chain framework, now we are ready to derive ᵩ(ω,β,τ) .All δ transient states in the Markov
chain are arranged into ω rows. We number these transient states sequentially 1,2,…,δ in a left to right and top
to bottom way. For these transient states , if we let qij denote the transition probability from state i to state j,
then we can define a matrix Q = (qij )δ×δ of transition probabilities among δ transient states there. Similarly, if
we let bi denote the one step transition probability from state i to the absorbing state A, then we can also define
a vector B = (bi)δ×1 representing the transition probabilities from δ transient states to state A.Notice that Pr(Td
= t) in denotes the probability that the ωth frame arrives at the destination D by the end of the tth time slot, i.e.,
the probability that the Markov chain gets absorbed by the end of the tth time slot. Given that the Markov chain
starts from the first state, i.e., state (1, 0), according to the Markov chain theory , then we have
Pr(Td =t ) = . bi (5)
Then combining with the fact of previous equation is actually the ij –entry of the matrix can be further
transformed as
Pr(Td = t) = e · Qt−1 · B (6)
where e = (1, 0, . . . , 0).
Substituting (14) into (12), then we have
ϕ(ω, β, τ) =e · Qt−1 · B
= e · (I − Q)−1 · (I − Qτ ) · B
= e · N · (I − Qτ ) · B (7)
where I is the identity matrix, and N = (I − Q)−1 is the fundamental matrix of the Markov chain.
IV. RESULTS AND DISCUSSION
In this paper, we have investigated the message delivery probability in two-hop relay MANETs with
erasure coding. A general Markov chain theoretical framework was developed to characterize the message
delivery process, which can also be used to analyze the delivery probability performances under other popular
routing protocols. Based on the new theoretical framework, closed-form expressions were further derived for the
delivery probability under any given message lifetime and message size. As verified by extensive simulation
studies, our framework can be used to efficiently model the message delivery process and thus accurately
characterize the delivery probability performance there. Our results indicate that for a two-hop relay MANET
with erasure coding, there exists a limiting performance for the delivery probability, which is determined only
by the control parameters of message size ω and message lifetime τ . Another interesting finding of ourwork is
that the considered MANETs actually exhibit very similar behaviors in terms of delivery probability under
different node mobility models, like the i.i.d., random walk and random waypoint.
7. Manets: Increasing N-Messages Delivery Probability …
||Issn 2250-3005 || || March || 2014 || Page 19
V. CONCLUSION
This project can be design a future network in terms of determining a suitable message lifetime, so as
to minimize the per node buffer occupation and power consumption while simultaneously meet the specified
delivery performance requirement.Note that the theoretical framework and closed-form results developed in this
paper only hold for the simple scenario that each node has only a single message to deliver to its destination, and
it chooses to conduct a “source-to-relay" or “relay-to-destination" transmission in a probabilistic fashion.
Therefore, one future work is to further explore the delivery probability of two-hop relay with erasure coding in
a more general scenario, where each node may need to simultaneously deliver k distinct messages, and it
conducts the “source-to-relay" or “relay-to-destination" transmission in the best-effort fashion so as to take the
full advantage of each transmission opportunity. Another interesting future direction is to extend the
theoretical models in this paper to analytically derive the optimum setting of n (i.e., n∗ ) to achieve the
maximum message delivery probability for a given relay scheme setting of (ω, β, τ ), or to formally determine
the asymptotic (limiting) delivery probability for any specified control parameters of ω and τ .This project
implemented a Mobile Ad-hoc Network model for the compute message delivery probability. The network is
functioned based on effective transmission group scheduling scheme, two-hop relay mechanism and Tornado
encoding scheme. The proposed network model sends the multiple selected messages in effective way. Also, a
dynamic memory management mechanism is utilized to manage the sending messages. Finally, a modified
Markov chain model is utilized to compute the message delivery probability of whole selected message. In
future , This project can be design a future network in terms of determining a suitable message lifetime, so as
to minimize the per node buffer occupation and power consumption while simultaneously meet the specified
delivery performance requirement.
REFERENCES
[1] Beyond Shannon: The Quest for Fundamental Performance Limits of Wireless Ad Hoc Networks”, Andrea Goldsmith, Stanford
University, Michelle Effros, Caltech Ralf Koetter, Technical University of Munich Muriel Médard, Asu Ozdaglar, and Lizhong
Zheng, MIT may 2011.
[2] Optimal Delay-Throughput Trade-Offs in Mobile Ad Hoc Networks”, Lei Ying, Sichao Yang, and R. Srikant Coordinated Science
Lab and Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign, 2007.
[3] Optimal Control in Two-Hop Relay Routing”, Eitan Altman, Tamer Basar, and Francesco De Pellegrini, 2004.
[4] Rethinking Information Theory for Mobile Ad Hoc Networks”, Jeff Andrews, Nihar Jindal, Martin Haenggi, Randy Berry, Syed
Jafar, Dongning Guo, Sanjay Shakkottai, Robert Heath, Michael Neely, Steven Weber, Aylin Yener, 2007.
[5] Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges”, Yue Cao and Zhili Sun, Member, IEEE,
2012
[6] Annotating Structured Data of the Deep Web”, Hai He1, Weiyi Meng1, Hongkun Zhao1, and Clement Yu Department of Computer
Science SUNY at Binghamton, NY 13902, USA
[7] A. A. Hanbali, A. A. Kherani, and P. Nain, “Simple models for the performance evaluation of a class of two-hop relay protocols,”
in Proc. 2007 IFIP Netw. Conf.
[8] J. Liu, X. Jiang, H. Nishiyama, and N. Kato, “Delay and capacity in ad hoc mobile networks with f -cast relay algorithms,” IEEE
Trans. Wireless Commun., vol. 10, no. 8, pp. 2738–2751, Aug. 2011.
[9] S. R. Kulkarni and P. Viswanath, “A deterministic approach to through-put scaling in wireless networks,” IEEE Trans. Inf. Theory,
vol. 50, no. 6, pp. 1041–1049, June 2004.
[10] Y. Wang, S. Jain, M. Martonosi, and K. Fall, “Erasure-coding based routing for opportunistic networks,” in Proc. 2005 WDTN
Conf.
[11] M. Grossglauser and D. N. Tse, “Mobility increases the capacity of ad hoc wireless networks,” in Proc. 2001 IEEE INFOCOM.