Delay Tolerant Networks have been (DTN) have been developed to support the irregular connectivity often
separate networks. The main routing problem in this type of network is embarrassed by time that is
extremely long, since connections are intermittent and opportunistic. Routing protocols must take into
account the maximum constraint encountered in this type of environment , use effective strategies
regarding the choice of relay nodes and buffer management nodes to improve the delivery of messages and
the time of their delivery . This article proposes a new strategy that optimizes the routing Spray and wait.
The proposed method uses the information contained in the messages delivered mostly paths traversed by
the messages before arriving at their destination and the time when nodes have receive these messages.
Simulation results show that the proposed strategy can increase the probability of delivery and minimizing
overhead unlike FIFO technology used with the default routing ' sprat and wait'
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
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.
Delay Tolerant Network (DTN) is a promising technology which aims to provide efficient
communication between devices in a network with no guaranteed continuous connectivity. Most
of the existing routing schemes for DTNs achieve message delivery through message replication
and forwarding. However, due to the lack of contemporaneous end-to-end communication path,
designing routing protocols that can achieve high delivery rate with low communication
overhead is a challenging problem. Some routing protocols appear with high similarity, but
their performance are significantly different. In this paper, we evaluate several popular routing
protocols in DTNs, including Epidemic, Spray and Wait, PRoPHET, and 3R through extensive
trace-driven simulations. The objective is to evaluate the performance of different routing
schemes using different data traces and investigate the optimal configuration setting for each
routing scheme. This paper provides important guidances on the design and selection of routing
protocols for given delay tolerant networks.
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.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
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.
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
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.
Delay Tolerant Network (DTN) is a promising technology which aims to provide efficient
communication between devices in a network with no guaranteed continuous connectivity. Most
of the existing routing schemes for DTNs achieve message delivery through message replication
and forwarding. However, due to the lack of contemporaneous end-to-end communication path,
designing routing protocols that can achieve high delivery rate with low communication
overhead is a challenging problem. Some routing protocols appear with high similarity, but
their performance are significantly different. In this paper, we evaluate several popular routing
protocols in DTNs, including Epidemic, Spray and Wait, PRoPHET, and 3R through extensive
trace-driven simulations. The objective is to evaluate the performance of different routing
schemes using different data traces and investigate the optimal configuration setting for each
routing scheme. This paper provides important guidances on the design and selection of routing
protocols for given delay tolerant networks.
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.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
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.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Improving the selection of MPRs in OLSR protocol: a survey of methods and tec...IJECEIAES
Multi Point Relays (MPRs) are those nodes that are calculated and determined by the Optimized Link State Routing protocol (OLSR) in order to minimize and avoid overload inside the Mobile Ad hoc Network (MANET). In this paper, we will present a synthetic study of many techniques and methods for calculating and selecting the MPR nodes using a set of criteria namely energy, mobility, bandwidth, the quality of links, etc. The result of this study shows that most techniques consider a limited number of metrics for selecting the MPR nodes and therefore they are insufficient to allow the OLSR protocol to be quite complete and efficient because several metrics can occur at the same time in the real execution environment.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
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
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
Supporting efficient and scalable multicastingingenioustech
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/
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/
SCTP-MANET NEW EXTENSION OF SCTP PROTOCOL FOR THE OPTIMIZATION OF MANET PERFO...ijwmn
Ad Hoc mobile networks are constituted of nodes that move freely without a centralized administration.
These nodes contribute in the routing of data packets that are sent by a source. This happens when the
latter is not capable of reaching its destination. On the other hand, their mobility causes recurrent
breakdowns of the routing paths notably with sparse MANET. In order to optimize the performance of such
networks, we suggest a new extension of protocols: Stream Control Transmission Protocols (SCTP) named
SCTP-MANET. Their main function is therefore to improve the availability of the links in sparse MANET
protocols. This could be achieved by a better integration of Multihoming. With this aim in mind, this new
extension is based on a cross-layer interface between transport and routing layers as well as the use of
specific messages.
Due to the rapidly increasing data speed requirement, it has become essential to smartly utilize the available frequency spectrum. In wireless communications systems, channel quality parameters are often used to enable resource allocation techniques that improve system capacity and user quality. The uncoded bit or symbol error rate (SER) is specified as an important parameter in the second and third generation partnership project (3GPP). Nonetheless, techniques to estimate the uncoded SER are usually not much published. This paper introduces a novel uncoded bit error rate (BER) estimation method using the
accurate-bits sequence of the new channel codes over the AWGN channel. Here, we have used the new channel codes as a forward error correction coding scheme for our communication system. This paper also presents the simulation results to demonstrate and compare the estimation accuracy of the proposed method over the AWGN channel.
A novel resource efficient dmms approach for network monitoring and controlli...ijwmn
In this paper, we propose a novel Distributed MANET Management System (DMMS) approach to use cross layer models to demonstrate a simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for different applications. In the proposed DMMS architecture, each network resource maintains a set of Management Information Base (MIB) elements and stores resource activities in their abstraction in terms of counters, timer, flag and threshold values. The abstract data is exchanged between different management agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. However, in traditional network management systems, they collect statistical data such as resource usage and performance by spoofing of resources. The amount of data that is exchanged with other resources through management protocols that can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for management functions increases and become inefficient as it increases the power usage for processing. Our proposed scheme targets at solving the problems.
In ad hoc networks, routing plays a pertinent role. Deploying the appropriate routing protocol is very important in order to achieve best routing performance and reliability. Equally important is the mobility model that is used in the routing protocol. Various mobility models are available and each can have different impact on the performance of the routing protocol. In this paper, we focus on this issue by examining how the routing protocol, Optimized Link State Routing protocol, behaves as the mobility model is varied. For this, three random mobility models, viz., random waypoint, random walk and random direction are considered. The performance metrics used for assessment of Optimized Link State Routing protocol are Optimized Link State Routing protocol, end-to-end delay and packet delivery ratio.
Intelligent transportation system (ITS) is an application which provides intelligence to the transportation
and traffic management systems. Although the word ITS applies to all systems in the transportation but as
per the European union directive it is the application of Information and communication technology in the
field of transportation is defined as ITS. The communication technology has evolved greatly today from
2G/3G to long term evolution (LTE). In this paper we focus on the LTE and its application in the ITS. Since
LTE offers excellent QoS, wide area coverage and high availability it is a preferred choice for vehicle to
infrastructure (V2I) service. At the same time the LTE customer base is increasing day by day which results
in congestion and accessing the network to send or request resources becomes difficult. In this paper we
have proposed a group based node selection algorithm to reduce the preamble ID collision otherwise this
uncoordinated preamble ID transmission by vehicle node (VN) will eventually clog the network and there
will be a massive congestion and re-transmissions attempts by VNs to obtain the random access channel
(RACH).
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Improving the selection of MPRs in OLSR protocol: a survey of methods and tec...IJECEIAES
Multi Point Relays (MPRs) are those nodes that are calculated and determined by the Optimized Link State Routing protocol (OLSR) in order to minimize and avoid overload inside the Mobile Ad hoc Network (MANET). In this paper, we will present a synthetic study of many techniques and methods for calculating and selecting the MPR nodes using a set of criteria namely energy, mobility, bandwidth, the quality of links, etc. The result of this study shows that most techniques consider a limited number of metrics for selecting the MPR nodes and therefore they are insufficient to allow the OLSR protocol to be quite complete and efficient because several metrics can occur at the same time in the real execution environment.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
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
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
Supporting efficient and scalable multicastingingenioustech
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/
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/
SCTP-MANET NEW EXTENSION OF SCTP PROTOCOL FOR THE OPTIMIZATION OF MANET PERFO...ijwmn
Ad Hoc mobile networks are constituted of nodes that move freely without a centralized administration.
These nodes contribute in the routing of data packets that are sent by a source. This happens when the
latter is not capable of reaching its destination. On the other hand, their mobility causes recurrent
breakdowns of the routing paths notably with sparse MANET. In order to optimize the performance of such
networks, we suggest a new extension of protocols: Stream Control Transmission Protocols (SCTP) named
SCTP-MANET. Their main function is therefore to improve the availability of the links in sparse MANET
protocols. This could be achieved by a better integration of Multihoming. With this aim in mind, this new
extension is based on a cross-layer interface between transport and routing layers as well as the use of
specific messages.
Due to the rapidly increasing data speed requirement, it has become essential to smartly utilize the available frequency spectrum. In wireless communications systems, channel quality parameters are often used to enable resource allocation techniques that improve system capacity and user quality. The uncoded bit or symbol error rate (SER) is specified as an important parameter in the second and third generation partnership project (3GPP). Nonetheless, techniques to estimate the uncoded SER are usually not much published. This paper introduces a novel uncoded bit error rate (BER) estimation method using the
accurate-bits sequence of the new channel codes over the AWGN channel. Here, we have used the new channel codes as a forward error correction coding scheme for our communication system. This paper also presents the simulation results to demonstrate and compare the estimation accuracy of the proposed method over the AWGN channel.
A novel resource efficient dmms approach for network monitoring and controlli...ijwmn
In this paper, we propose a novel Distributed MANET Management System (DMMS) approach to use cross layer models to demonstrate a simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for different applications. In the proposed DMMS architecture, each network resource maintains a set of Management Information Base (MIB) elements and stores resource activities in their abstraction in terms of counters, timer, flag and threshold values. The abstract data is exchanged between different management agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. However, in traditional network management systems, they collect statistical data such as resource usage and performance by spoofing of resources. The amount of data that is exchanged with other resources through management protocols that can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for management functions increases and become inefficient as it increases the power usage for processing. Our proposed scheme targets at solving the problems.
In ad hoc networks, routing plays a pertinent role. Deploying the appropriate routing protocol is very important in order to achieve best routing performance and reliability. Equally important is the mobility model that is used in the routing protocol. Various mobility models are available and each can have different impact on the performance of the routing protocol. In this paper, we focus on this issue by examining how the routing protocol, Optimized Link State Routing protocol, behaves as the mobility model is varied. For this, three random mobility models, viz., random waypoint, random walk and random direction are considered. The performance metrics used for assessment of Optimized Link State Routing protocol are Optimized Link State Routing protocol, end-to-end delay and packet delivery ratio.
Intelligent transportation system (ITS) is an application which provides intelligence to the transportation
and traffic management systems. Although the word ITS applies to all systems in the transportation but as
per the European union directive it is the application of Information and communication technology in the
field of transportation is defined as ITS. The communication technology has evolved greatly today from
2G/3G to long term evolution (LTE). In this paper we focus on the LTE and its application in the ITS. Since
LTE offers excellent QoS, wide area coverage and high availability it is a preferred choice for vehicle to
infrastructure (V2I) service. At the same time the LTE customer base is increasing day by day which results
in congestion and accessing the network to send or request resources becomes difficult. In this paper we
have proposed a group based node selection algorithm to reduce the preamble ID collision otherwise this
uncoordinated preamble ID transmission by vehicle node (VN) will eventually clog the network and there
will be a massive congestion and re-transmissions attempts by VNs to obtain the random access channel
(RACH).
Performance analysis of voip traffic over integrating wireless lan and wan us...ijwmn
A simulation model is presented to analyze and evaluate the performance of VoIP based integrated
wireless LAN/WAN with taking into account various voice encoding schemes. The network model was
simulated using OPNET Modeler software. Different parameters that indicate the QoS like MOS, jitter,
end to end delay, traffic send and traffic received are calculated and analyzed in Wireless LAN/WAN
scenarios. Depending on this evaluation, Selection codecs G.729A consider the best choice for VoIP.
Virtual 2 d positioning system by using wireless sensors in indoor environmentijwmn
A 2D location detection system is constructed by using Wireless Sensor Nodes (WSN) to create aVirtual
Fingerprint map, specifically designed for use in an indoor environment. WSN technologies and
programmable ZigBee wireless network protocols are employed. This system is based on radio-location
fingerprinting technique. Both Linear taper functions and exponential taper functions are utilized with the
received signal strength distributions between the fingerprint nodes to generate virtual fingerprint maps.
Thus, areal and virtual combined fingerprint map is generated across the test area. K-nearest
neighborhood algorithm has been implemented on virtual fingerprint maps, in conjunction with weight
functions used to find the coordinates of the unknown objects. The system Localization accuracies of less
than a grid space areproved in calculations.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
ENHANCED THREE TIER SECURITY ARCHITECTURE FOR WSN AGAINST MOBILE SINK REPLI...ijwmn
Recent developments on Wireless Sensor Networks have made their application in a wide range
such as military sensing and tracking, health monitoring, traffic monitoring, video surveillance and so on.
Wireless sensor nodes are restricted to computational resources, and are always deployed in a harsh,
unattended or unfriendly environment. Therefore, network security becomes a tough task and it involves
the authorization of admittance to data in a network. The problem of authentication and pair wise key
establishment in sensor networks with mobile sink is still not solved in the mobile sink replication attacks.
In q-composite key pre distribution scheme, a large number of keys are compromised by capturing a
small fraction of sensor nodes by the attacker. The attacker can easily take a control of the entire network
by deploying a replicated mobile sinks. Those mobile sinks which are preloaded with compromised keys
are used authenticate and initiate data communication with sensor node. To determine the above problem
the system adduces the three-tier security framework for authentication and pair wise key establishment
between mobile sinks and sensor nodes. The previous system used the polynomial key pre distribution
scheme for the sensor networks which handles sink mobility and continuous data delivery to the
neighbouring nodes and sinks, but this scheme makes high computational cost and reduces the life time of
sensors. In order to overcome this problem a random pair wise key pre distribution scheme is suggested
and further it helps to improve the network resilience. In addition to this an Identity Based Encryption is
used to encrypt the data and Mutual authentication scheme is proposed for the identification and
isolation of replicated mobile sink from the network.
An approach to dsr routing qos by fuzzy genetic algorithmsijwmn
Although, all prior works improved routing on MANETs, there is no strong advancement on QoS. One of
the newest challenges to improve quality of routing in MANETs is combining the Genetic and Fuzzy
algorithms into routing protocols. The improvements on routing QoS are approached by using Genetic and
Fuzzy algorithms in this project. In cause of storing route information during route discovery, the DSR
routing protocol is chosen by this project. First of all, the suggested protocol in this project added Current
Time into DSR header. So, next intermediate node can obtain its previous link’s cost by this attachment and
adds the Link Cost to route discovery packet. Then, when the route discovery packet received to destination
node, it will expect for other packets till end of packet TTL. Next, the destination node will use collected
packets in Genetic Algorithm to find the two optimum routes. Finally, the destination node sends these
routes to source node. Next improvement is using Fuzzy Triangle Numbers to change route update. In this
case, the suggested protocol uses route error packets’ count and also Triangle Numbers to change route
update period time.
Mobility models for delay tolerant network a surveyijwmn
Delay Tolerant Network (DTN) is an emerging networking technology that is widely used in the
environment where end-to-end paths do not exist. DTN follows store-carry-forward mechanism to route
data. This mechanism exploits the mobility of nodes and hence the performances of DTN routing and
application protocols are highly dependent on the underlying mobility of nodes and its characteristics.
Therefore, suitable mobility models are required to be incorporated in the simulation tools to evaluate DTN
protocols across many scenarios. In DTN mobility modelling literature, a number of mobility models have
been developed based on synthetic theory and real world mobility traces. Furthermore, many researchers
have developed specific application oriented mobility models. All these models do not provide accurate
evaluation in the all scenarios. Therefore, model selection is an important issue in DTN protocol
simulation. In this study, we have summarized various widely used mobility models and made a comparison
of their performances. Finally, we have concluded with future research directions in mobility modelling for
DTN simulation.
A review of security attacks and intrusion detection schemes in wireless sens...ijwmn
Wireless sensor networks are currently the greatest innovation in the field of telecommunications. WSNs
have a wide range of potential applications, including security and surveillance, control, actuation and
maintenance of complex systems and fine-grain monitoring of indoor and outdoor environments. However
security is one of the major aspects of Wireless sensor networks due to the resource limitations of sensor
nodes. Those networks are facing several threats that affect their functioning and their life. In this paper we
present security attacks in wireless sensor networks, and we focus on comparison and analysis of recent
Intrusion Detection schemes in WSNs.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
Analysis of security threats in wireless sensor networkijwmn
Wireless Sensor Network(WSN) is an emerging technology and explored field of researchers worldwide
in the past few years, so does the need for effective security mechanisms. The sensing technology
combined with processing power and wireless communication makes it lucrative for being exploited in
abundance in future. The inclusion of wireless communication technology also incurs various types of
security threats due to unattended installation of sensor nodes as sensor networks may interact with
sensitive data and /or operate in hostile unattended environments. These security concerns be addressed
from the beginning of the system design. The intent of this paper is to investigate the security related
issues in wireless sensor networks. In this paper we have explored general security threats in wireless
sensor network with extensive study.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
A major role is played in the layout and evaluation of any empirical wireless structure to manifest is the goal of this paper that counterfeit mode architectures affect counterfeit conduct, regarding structure accomplishment metrics, essentially and therefore, the excellent architecture should be explored in order to accomplish the most accurate and reliable results. It is found that the most analytical factors it is found that that actuate counterfeit mode accomplishment are counterfeit time, structure event organizing and
grade of adequate. It is, also, found that counterfeit time in relation to event existence in the real structure
along with the usage of modern architectural concepts such as multi-interweave technology complement
analytical issues too in the advancement of an adequate counterfeit organization for wireless communications. In order to evaluate the above findings an extensive empirical review has been
demeanored analysising several distinct events counterfeitorganizations towards presenting the relation
between channel designing collections, counterfeit time and structure accomplishment.
Path constrained data gathering scheme for wireless sensor networks with mobi...ijwmn
Wireless Sensor Networks (WSNs) have emerged as a promising solution for variety of applications.
Recently, in order to increase the lifetime of the network, many proposals have introduced the use of
Mobile Elements (MEs) as a mechanical carrier to collect data. In this paper, we investigate the problem of
designing the mobile element tour to visit subset of the nodes, termed as caching points, where the length of
the mobile element tour is bounded by pre-determined length. Caching can be implemented at various
points on the network such that any node in the network is at most k-hops away from one of these caching
points. To address this problem, we present heuristic-based solution. Our solution works by partitioning
the network such that the depth of each partition is bounded by k. Then, in each partition, the minimum
number of required caching points is identified. We compare the resulting performance of our algorithm
with the best known comparable schemes in the literature.
Impact of client antenna’s rotation angle and height of 5g wi fi access point...ijwmn
This paper investigates the impact of antenna rotation’s angle at the receiver side and antenna height at
transmitter side on radio channel’s amount of fading. Amount of fading is considered as a measure of
severity of fading conditions in radio channels. It indicates how severe the fading level relative to Rayleigh
fading channel. The results give an input to optimize height of 5G Wi-Fi access point for better link
performance for different antenna’s rotation angles at receiver side. The investigation covers three
different indoor environments with different multipath dispersion levels in delay and direction domains;
lecture hall, corridor, and banquet hall.
Stochastic analysis of random ad hoc networks with maximum entropy deploymentsijwmn
In this paper, we present the first stochastic analysis of the link performance of an ad hoc network modelled
by a single homogeneous Poisson point process (HPPP). According to the maximum entropy principle, the
single HPPP model is mathematically the best model for random deployments with a given node density.
However, previous works in the literature only consider a modified model which shows a discrepancy in the
interference distribution with the more suitable single HPPP model. The main contributions of this paper
are as follows. 1) It presents a new mathematical framework leading to closed form expressions of the
probability of success of both one-way transmissions and handshakes for a deployment modelled by a
single HPPP. Our approach, based on stochastic geometry, can be extended to complex protocols. 2) From
the obtained results, all confirmed by comparison to simulated data, optimal PHY and MAC layer
parameters are determined and the relations between them is described in details. 3) The influence of the
routing protocol on handshake performance is taken into account in a realistic manner, leading to the
confirmation of the intuitive result that the effect of imperfect feedback on the probability of success of a
handshake is only negligible for transmissions to the first neighbour node.
Data mining is important process to extract the useful information and pattern from huge amount of data.
NS-2 is an efficient tool to build the environment of network. The results from simulate these environment
in NS-2 is trace file that contains several columns and lines represent the network events. This trace file
can be used to analyse the network according to performance metrics but it has redundant columns and
rows. So, this paper is to perform the data mining in order to find only the necessary information in
analysis operation to reduce the execution time and the storage size of the trace file.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
Improving QoS-based Routing by Limiting Interference in Lossy Wireless Sensor...ijwmn
Many new routing protocols have been proposed for wireless sensor networks to maximize throughput, minimize delay or improve other QoS metrics in order to solve the problems of resource-constrained sensor nodes in large networks. However, many of them are based on flooding or its variants. Many routing messages are propagated unnecessarily and may cause different interference characteristics during route discovery phase and in the actual application data transmission phase. As a result, incorrect routes may be selected. Epidemic algorithms have been used to limit flooding in the field of wireless sensor networks. Directed diffusion has been commonly used in wireless sensor networks because it is designed to improve energy efficiency and scalability. However, the intrinsic flooding scheme for interest subscriptions prevents it from achieving the maximal potential of these two goals. We propose a routing
protocol that uses ID-free epidemic flooding to limit interference in conjunction with metrics for increasing throughput and reducing delay. Simulation results in ns2 show that there is an optimal number of neighbors to achieve the best throughput and delay performance. For a fixed topology of a certain size, there exists an optimal percentage of neighbors that forward the flooding message to achieve the best throughput and delay performance.
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.
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
Improving QoS-based Routing by Limiting Interference in Lossy Wireless Sensor...ijwmn
Many new routing protocols have been proposed for wireless sensor networks to maximize throughput, minimize delay or improve other QoS metrics in order to solve the problems of resource-constrained sensor nodes in large networks. However, many of them are based on flooding or its variants. Many routing messages are propagated unnecessarily and may cause different interference characteristics during route discovery phase and in the actual application data transmission phase. As a result, incorrect routes may be selected. Epidemic algorithms have been used to limit flooding in the field of wireless sensor networks. Directed diffusion has been commonly used in wireless sensor networks because it is designed to improve energy efficiency and scalability. However, the intrinsic flooding scheme for interest subscriptions prevents it from achieving the maximal potential of these two goals. We propose a routing protocol that uses ID-free epidemic flooding to limit interference in conjunction with metrics for increasing throughput and reducing delay. Simulation results in ns2 show that there is an optimal number of neighbors to achieve the best throughput and delay performance. For a fixed topology of a certain size, there exists an optimal percentage of neighbors that forward the flooding message to achieve the best throughput and delay performance.
Performance Evaluation of DSDV & OLSR Proactive Protocols in MANETijsrd.com
MANETS are working in distributed environment and dynamically changing the network topology. MANET protocols can be table driven or on demand as per requirement. DSDV (Destination Sequenced Distance Vector) and OLSR (Optimized Link State Routing protocol) both are table driven (proactive) protocol. Performances of both proactive protocols are evaluated using NS-2 simulator under various metrics and no. of mobile nodes is 10 in the network.
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel Multi-
Radios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel MultiRadios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM) ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel MultiRadios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
Similar to New strategy to optimize the performance of spray and wait routing protocol (20)
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
New strategy to optimize the performance of spray and wait routing protocol
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
DOI : 10.5121/ijwmn.2014.6205 47
NEW STRATEGY TO OPTIMIZE THE PERFORMANCE
OF SPRAY AND WAIT ROUTING PROTOCOL
Mohamed Ababou1
, Rachid Elkouch 2
, Mostafa Bellafkih3
and Nabil Ababou4
1
National Institute of Posts and Telecommunications - INPT, Rabat, Morocco
University of sciences Mohamed 1 -FSO, Oujda, Maroc
ABSTRACT
Delay Tolerant Networks have been (DTN) have been developed to support the irregular connectivity often
separate networks. The main routing problem in this type of network is embarrassed by time that is
extremely long, since connections are intermittent and opportunistic. Routing protocols must take into
account the maximum constraint encountered in this type of environment , use effective strategies
regarding the choice of relay nodes and buffer management nodes to improve the delivery of messages and
the time of their delivery . This article proposes a new strategy that optimizes the routing Spray and wait.
The proposed method uses the information contained in the messages delivered mostly paths traversed by
the messages before arriving at their destination and the time when nodes have receive these messages.
Simulation results show that the proposed strategy can increase the probability of delivery and minimizing
overhead unlike FIFO technology used with the default routing ' sprat and wait'
KEYWORDS
DTN, Store and forward, networks, forwarding strategies, buffer management, routing, epidemic, spray
and wait, Queue modes, FIFO.
1. INTRODUCTION
The objective of DTN networks [1] is to allow subnet that they know the weak communications
in environments where the connection is intermittent, to routes messages between nodes using the
principle of store and forward. In this type of network, nodes can forward messages to others
nodes when they enter their transmission range. Due to the mobility of nodes, there is no
guarantee to find at path between source and destination. To overcome this problem, DTN
network uses the mechanism of messages replication to increase the chance that one of the
message copies reaches its destination and uses information flowing through the network to
choose the . The epidemic routing [2] and spray Wait [3] are among several which sent messages
in DTN network using the replication mechanism and PROPHET [4] that uses the network
information to choose the relay node .To evaluate the performance of these routing protocols in
the absence of real traces, several simulator was developed as the network simulator (NS) and the
opportunistic network environment simulator (the one) [5] . The evaluation is based on several
metrics, such as the delivery probability, overhead ratio, the delivery rate and the number of hops
that have carried messages.
This article proposes a strategy called ‘Supp - copiesleft -Tran’ to improve the performance of
spray and wait routing protocol in terms of delivery probability, overhead ratio and Hop count
average. The remaining paper is prearranged as follows .Section 2 elaborates existing forwarding
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
48
strategies. Section 3 is about routing protocol in DTN networks, Section 4 About mobility models
used, Section 5 develops performance metrics, Section 6 the new forwarding strategy, Simulation
and results simulates in section 7 by a conclusion at section 8.
2. FORWARDING STRATEGIES
2.1. GRTR
In this strategy the encounters nodes try to calculate the delivery predictability between them and
the destination of message P(A,D ) and P(B,D ) which denotes respectively the delivery
predictability [6] that a node A and B have for a destination message . the nodes that has the
greater delivery predictability carries a message
2.4. MOFO
This strategy use the number of how many times that message has been sent to others hops and
order it according to a descending order, the more the number of the sent message is low, the
more the message has a chance of being transmitted [7]. If the buffer is full the strategy deletes
messages that have been sent many times. Messages that were sent several times are not sent and
the ones that have not been sent or transmitted many times are sent because this increases their
chances of reaching their destination.
2.5. Location Based Routing
This strategy uses the coordinates of nodes such as GPS coordinates, to determine the distance
between its locations and hops location, and then the message will be forwarded to the one that is
closer in the coordinate space than the current custodian to destination.
2.6. First in First out (FIFO)
In FIFO queue mode all messages are arranged according to arrival time and the message which
has oldest arrival time will be transmitted first [8].
3. PROTOCOL UNDER OBSERVATION
3.1 Spray and Wait Routing Protocol
Spray and Wait [3] routing protocol has been proposed to reduce the total number of copies sent
across the network as is the case of epidemic routing. It uses the principle of epidemic routing but
with a different strategy, in the spray phase, the nodes sent L copies to neighboring nodes and in
the wait phase each relay nodes carrying the message until they meet the destination. in binary
spray and wait version ,each node sends half number of message copies to each node
encountered in its path until that they have only one copies where they will wait until they meet
destination of the messages.
4. ABOUT MOBILITY MODELS USED
4.1 SPMBM
SPMBM (Shortest Path Map Based Movement Model) [4] is a more realistic model it manages
the movement of nodes in the simulation map scenario. It will offer destination coordinates,
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
49
speeds, wait times, and uses Dijkstra's algorithm to find the shortest path to the destination. It
places the nodes in random places but selects a certain destination in the map for all nodes.
4.2. Map Route Movement
Map Route Movement MBM [4], is based on a map of a given region, where nodes can
randomly choose their future destination, provided they follow the predefined routes on
the map.
5. THE PERFOMANCE METRICES MEASURED
As it was stated in many researches, in order to compare routing strategies, some parameters need
to be defined to evaluate their performance. The number of the selected metrics depends on
several factors. it will be in relative terms.
5.1. Overhead ratio
Overhead ratio [4] can be defined as the subtraction of delivered (BD) from the bundle carried
(BC) over bundles carried ((BC-BD)/BC).The overhead ratio reflects how many unnecessary
messages are relayed to deliver one message. It reflects transmission cost in a network. The more
the value of overhead is low the more the strategy used is efficient; this leads to a minimization of
consumption of the network resources.
5.2. Delivery probability
This metric can be defined as ratio of the messages delivered over messages relayed. The higher
values of probability mean that the performance of the algorithm is better.
5.3. Hop count average
It is the mean of the number of hops which participate to relayed message from its source to its
destination successfully; higher values mean that the message has consumed many network
resources before reaching its destination
6. THE STRATEGY SUPP-COPIESLEFT-TRAN
All nodes are mobile with a low density. There is no connection from end to end, and the
movement of nodes affects the delivery of the message. When two nodes meet each other, they
exchange the messages that they carry.
6.1. Cleaning the buffer
6.1.1.Phase gathering information.
When two nodes A and B meet, they exchange their two lists namely the list of neighbors and the
list of unnecessary messages:
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
50
•List of neighbors
VA = { VAi = Ai , i = 1, ..., n}with n: number of neighbors of A.
VB = { VBi = Bi , i = 1, ... , m} with m: number of neighbors of B.
VAi and VBi are neighbors respectively of A and B.
• List of unnecessary messages.
ListeMAN: List of messages that a node must not accept, it contains messages already arrived at
their destinations.
ListeMAN (VAi): The list of messages that the neighbor (Ai) of Node (A) shall not accept.
ListeMAN ( A) = { ListeMAN ( VAi ),i = 1,..., n } where n : the number of neighbors of A.
ListeMAN (B) = {ListeMAN (VBi), i = 1... m} with m: the number of neighbors of B.
•Creation of ListeMAN (AB)
Creation of a new list that contains the messages to remove, by the union of the two previous lists
- that is to say those that emanate from multiple nodes - in order to increase the removal rate of
unnecessary messages circulating in the network even if a copy has already arrived successfully
to its final destination, so their elimination minimizes the consumption of network resources due
to the continuity of their dispersion in the network.
ListeMAN (AB) = {ListeMAN (VAi)} ∪ {ListeMAN (VBi)}
•Creating a list of common neighbours
Each node compares the list of neighbours it receives with its own list to find the common
neighbor nodes.
VA = {VAi = Ai, i = 1... n} where n is the number of neighbors of A.
VB = {VBi = Bi, i = 1... m} with m: number of neighbors of B.
VA ∩ VB = {Ni, 1 ... n}
n: number of neighbors shared between A and B.
if the number of neighbors “n“ is even:
VAB = {Ni ∈ (VA ∩ VB) 1 ...n / 2}.
VBA = {Ni (∩ VA VB) (2 +n) / 2} ... n.}
if the number of neighbors “n“ is odd.
VAB = {Ni ∈ (VA ∩ VB)1....(n+1)/2}.
VBA = {Ni (∩ VA VB), (n +3)/2 ... n}. 6.1.2. Updating the buffer
After creating the list of messages that nodes should not accept in their future contacts and list of
common neighbors (VA ∩ VB), the two nodes A and B function like the following:
• They clean their buffers by eliminating unnecessary messages in the list ListeMAN (AB).
• Node A send a list ListeMAN (AB) to its neighbors except those in the list VBA that will be
supported by node B.
• Node B send a list ListeMAN (AB) to its neighbors except those in the list VAB that will be
dealt by node A.
This implies that the neighbors of two nodes clean their buffers by eliminating unnecessary
messages in the ListeMAN list (AB).
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
51
With this technique it was possible to increase the rate of messages to eliminate to release buffers
of neighboring nodes and increase the probability that a Message previously received by its
destination stops circulating in the network.
6.1.3. Transmission of messages
6.1.3.1 Form of messages
S: Source D: destination,(hop, ti) :hop involved in transport of the message.
ti: the time when the message has been transmitted to Ni , Size: the size of the message.Copies
left: the number of copies remaining to be transmitted.
(Ki, ti) hop who participated in the transport of acknowledgement messages.
{(S, t0) {(Ni, ti)} (D, tn +1)} the path that the message took to go from the source to the destination.
6.1.3.2 The Priority List Creation .
Each node classifies messages in its buffer; example node A searches for messages that have as
destination node B, it range them in descending order based on their injection in the network and
in ascending order based on their size and it is at this level that starts transmission.
• Method for creating the priority list:
Node A consults at the buffer messages before deciding:
- If B is the source: it ignores the message.
- If B is the destination: it added to the priority list.
- If B belongs to the hop list who participated in the transport of the message to the moment of
contact: it ignores the message.
6.1.3.3 Transmission of Priority List
Once the priority list is created the node classifies the messages in its buffers ordering to the
number of copies left before forwarding the messages in this list to node B.
6.1.3.4 Transmission or Non-Transmission of Other Messages.
In the case where the node B is not in the set of hops {(S, D, {(Ni, Ti)}} that is to say, it is neither
a source nor a destination, nor the one of the nodes that participated in the transfer of messages,
TABLE 2 Information Contained In Acknowledgement Message.
Ack D S (Ki, ti)=(k1, t1) ... (Kn, tn) (S, t0) {(Ni, ti)} (D, tn+1)
Table 1 Information Contained In Message.
Message S D (hop, ti) = (N1, t1) ... (Nn, tn) Copies left
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
52
node A uses the information contained in the list of paths supplied by the set of paths extracted
from the list ListeMAN (AB):
{(Sj, t0) {(Ni, ti)} (Dj, tn +1)}: list of paths of messages successfully transmitted to their destination.
{(Dj, tn +1) {(Ki, ti)} (Nj, tn)}: list of acknowledgments paths.
Node A, creates a list of pairs of nodes (Ni, D) called:
Listech (D, Ni) ={vector(frequency, hops average number )} which means that it extracts from all
messages paths in list ListeMAN (AB), the number of times(frequency) when the two nodes are
involved with delivering messages to their success destination and the average number of hops
that separate in each path, then classifies messages in ascending order based on the number of
occurrence of nodes Ni and D (frequency) and in descending order of hop number between them,
thereafter, it selects from its neighbors which must carry the message. The nodes Ni and D are
very close if the number of hops between them is minimal, in this case there is a strong chance
that the message reaches its destination without any problems.
Once the secondary list is created the node classifies the messages in its buffers ordering to the
number of copies left before forwarding the messages in this list to appropriate node.
7. EXAMPLE
Assume A, B ,C,E,F and D are five intermittently connected mobile nodes and {B,C,F,E} are
neighbors of A see Figure 1 and Table 3represents the messages buffered at node A and node B,
previous to the transmission and Table 4 shows the lists of messages delivered successfully to
their destination by each nodes. It is assumed that each message transmission time is 1 second
while total DTN transmission time is 4 seconds.
Figure 1 snapshot of encounters nodes before communication between A and B
ListeMAN(A) ListeMAN(B) ListeMAN(C) ListeMAN(E)
M6 M1 M3 M4
M17 M11 M12
M81 M12 M13
M19 M13
M12
Buffer of
B
M2
M4
B
D
E
C
F
Buffer of node A
M3M2 M1 M4
A
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
53
M11
M12
M13
Figure 3 List of messages already deleted by node A , B ,C and E
Buffer of Node A Buffer of Node B
Msg Destination Copies Left Arrival Time Msg Destination Copies Left Arrival Time
M1 D 5 150 M17 D 4 224
M2 D 5 123 M2 D 2 224
M3 D 4 60 M5 D 4 204
M4 D 4 15 M6 D 5 99
Figure 4 snapshot of messages buffered in node A and B before communication
Case 01: Forwarding Sequence with FIFO strategy
Table 4 represents the array of messages at node A and B before the transmission. With FIFO
strategy, node A transmits the messages:
Node A forward the message:
{M3,M4} to node B except {M1,M2}, which was already transported them
{M1, M2, M4} to node C except M3 and {M1, M2, M3} to node E except M4
Figure 2 shows the messages buffered at neighbor’s node A after transmission. The result shows
that the messages M1, M3 and M4 continue to circulate in the network, even if one of its copies
was delivered to its final destination. This causes an unnecessary consumption of network
resources.
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
54
Figure2. Messages buffered in neighbors’ node A after transmission with FIFO strategy
Case 02: Forwarding sequence with “Supp-copiesleft-Tran” strategy
Table 5 depicts the organization of messages at node A by Supp-copiesleft-Tran previous to
transmission.
With sup-copiesleft-tran strategy, node A follows the following steps before messages
forwarding:
Step 1: Node A exchanges first, the list ‘LISTMANT’ [Table 3], with its neighbors and thereafter,
forms the global list that will contain the messages’ identifiers of already delivered messages.
ListeMAN(A)
M6 M17 M81 M19 M12 M11 M12 M13
M1 M11 M12 M13 M3 M12 M13 M4
Table 5. List ‘LISTMANT’ created by node A in Tran phase
Step 2: Node A updates its buffer and sends the list ‘LISTMANT’ [Table 5] formed to its
neighbors for update their buffer.
Step 3: The node A sends messages that remain in the buffer based on the list of paths
‘LISTECH’[Table 6] which means, that after it updated its buffer, node A removes messages that
are successfully delivered, that is to say, the messages M1,M3 and M4 , it still has only M2 which
will forward it to node C, the more likely to meet node D. Figure 3 shows that the technique
avoids the transmission of unnecessary messages if one of its copies arrived at its destination.
D
F
Buffer of node A
M3M2 M1 M4
A
Buffer of node E
M3M2 M1
Buffer of node B
M3M2 M4
B
Buffer of node C
M2 M1 M4
CE
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
55
Figure 3 Messages buffered in neighbors’ node A after transmission
with ’SUP-COPIESLEFT-TRAN’ strategy
8. SIMULATION AND RESULTS
8.1 Simulation Environments
This section presents the results of the comparison between the forwarding strategies FIFO and
Sup-Tran presented in Section 6, regarding their effectiveness under spray and wait routing
protocols. All simulations are done with the ONE (The Opportunistic Network Environment
Simulator) [1] written in Java to evaluate the performance of the two methods. The ONE was
created by Helsinki University and provided the map of the Helsinki area.
In the simulation, there are two different nodes that may generate and receive a message. One is a
pedestrian and the other is a vehicle. The number of two different nodes is 40 and 6 respectively
for pedestrian and vehicle. These two types of nodes are moving with different mobility along
the map of Helsinki area.
For the pedestrian, the walking speed (i.e., 0.5m/s~1.5m/s) is applied. The moderate speed
Table 6. LISTECH(D,Ni) of node a Created By “Supp-copiesleft-Tran” in Section 6.
pair of nodes frequency
Average
hops
D:C 11,7 0
D:B 5,87 3
D:H 3 3
D:F 3 5
D:E 2 7
D:A 1 1
D
F
E
Buffer of node C
C
Buffer of node A
M2
A
Buffer of node E
M2
Buffer of node B
M2
B
M2
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
56
(i.e., 6m/s~12m/s) is applied to the vehicle. The details of the simulation parameters are
shown in Table 7.
8.2. Performance Analysis
To evaluate the proposed method compared with FIFO under spray and wait routing protocol, the
simulation has to consider performance metrics such as delivery rate, communication overhead,
and number of hops. It is evident that the higher delivery rate means better performance on
successful data delivery. However, the effort to get the higher delivery rate, a routing protocol has
to send the more data into the networks, these additional data packets may result in
communication overhead. Therefore, both delivery rate and communication overhead are
analyzed simultaneously.
Finally, average number of hops is compared to demonstrate consumption of resources. Clearly,
DTNs accept a tolerable delay for message delivery. On the other hand, some applications do not
accept higher number of hops to deliver messages from the source to the destination.
8.3. Simulation Results
All the results got from the simulation are shown below in form of graph representation and
observations are discussed.
8.3.1. By Varying Time Intervals
Spray and wait
strategy FIFO
SUP-
copiesleft-tran strategy FIFO
SUP-
copiesleft-tran
created 336 336 delivered 120 133
started 6700 6647 Delivery probability 0.3571 0.3958
relayed 2617 2561 Overhead ratio 20.8083 18.2556
aborted 4081 4084 Latency average 2182.3867 2403.303
dropped 1993 1286 Hop count average 2.8 2111.8
removed 0 759 Hop count average 2.8 2111.8
Table 8. Example of result of simulation with 10000 seconds
Table 7. Simulation parameters
Simulation Parameters Simulation values
Number of nodes 200 nodes (P: 100, V: 100)
Simulation time 10k-80K for simulation w.r.t time
10K for simulation w.r.t
Transmission range
Node movement Shortest path map based movement,
Map Route Movement
Transmission range 10m for simulation w.r.t time
10m-120m for simulation w.r.t
Transmission range
Packet transmission speed 250Kbyte/s
Buffer size 10M,50M
11. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
57
Figure 4 shows that increasing the simulation time from 10K to 80K increases the probability of
deliverance for both method, which can be explained as more nodes are traveling for a long time,
the more they encounter another nodes so they may exchange more messages, but for each time
interval, the results show that the strategy Supp-copiesleft-Tran has better performance than the
FIFO strategy in terms of messages that can be delivered to their destination.
Figure 5 shows the results of the evaluation in terms of the overhead ratio of FIFO and Supp-
copiesleft-Tran by varying the time interval from 10K-80K under spray and wait routing
protocol. As shown, the overhead generated by the proposed method is lower than the FIFO
strategy in all interval time, which means that with Supp-copiesleft-Tran strategy, the number of
messages that continue traveling in the network without reaching their destination. Unlike, with
FIFO strategy where this number is higher which means that the messages moving around the
network for a long time which causes that the messages consume the network resource.
Figure 5. Overhead ratio w.r.t Time
Figure 4. Delivery Probability w.r.t
12. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
58
Figure 6 explains the average hops number of the proposed strategy compared to FIFO technique,
as the result show, the proposed approach has a smaller pattern of the average hops number. It can
see clearly that at various time intervals the hop-count average of “Supp-copiesleft-Tran” is lower
than FIFO. The proposed method uses a number of hops slightly greater than the strategy FIFO
which is evident because the Supp-copiesleft-Tran method tries to choose the best hops having a
higher probability or greater chance to deliver messages, unlike the FIFO technique that transmits
the messages based on their arrival time without checking if the relay nodes will encounter
destination or not which causes that some nodes carry the messages even if it will never meet the
destination, even if it has a small number of hops, it does not mean that is better because the
delivery probability is low as its shown above in Figure5.
Figure . Hop count average w.r.t Time
8.3.2. By Varying Transmission range
Figure 7 compares FIFO and Supp-copiesleft-Tran strategy in terms of delivery probability by
increasing the transmission range. The Supp-copiesleft-Tran strategy proves better delivery
probability than FIFO, since increasing the transmission range increases the number of neighbors,
which allows nodes using Supp-copiesleft-Tran to deliver the message as close as possible to
their destination by choosing the most appropriate hop.
Figure 7. Delivery probability w.r.t Transmission range
13. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
59
Figure 8 shows that in all transmission ranges the overhead of “Supp-copiesleft-Tran” is lower
than FIFO strategies. This means that the strategy Supp-copiesleft-Tran is able to choose the best
relay to transport messages to the right destination that is reflected in the low value of overhead.
Figure 6. Overhead ration w.r.t Transmission range
Fig 7 presents the impact of transmission range on hop count. It shows that the hops count with
FIFO strategy is lower than Supp-copiesleft-Tran. The sup-Tran, especially in the delivery
probability and overhead ratio, is more efficient than FIFO.
Figure 7. hop count Average w.r.t Transmission range.
CONCLUSIONS
This article proposes a strategy called " Supp-copiesleft -Tran " , which aims to optimize spray
and wait routing protocol in delay tolerant networks, to use the network resources in an efficient
manner contrary to the FIFO technique, as its name indicates, the proposed technique consists of
three phases, the ‘ Supp’ which means that the encountered nodes start to clean their buffer before
deciding to transmit messages that are in their buffer. They exchange the list of messages that are
14. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 2, April 2014
60
successfully delivered to delete the remaining copies that still circulate in the network to release
their buffers as well as those of their neighbors. The phase ‘copies left’ the nodes organize the
messages in their buffer in order to the number of messages copies that remaining ,the ones that
have not been sent or transmitted many times which increase their chances of reaching their
destination.The phase ‘Tran’ starts with the transmission of the messages selected in phase
‘copies left’ based on the list of neighbors and the list formed by the paths of messages delivered
to calculate the frequency of meeting between destination and neighboring nodes of the two nodes
that are in communication as well as the number of hops between them. During the phase "Supp",
a proposed strategy optimizes routing sprat and wait by increasing the rate of the removed copies
of messages that have been delivered to their destination. Indeed, the list formed by considering
the list of the deleted messages of the encountered nodes and their neighbors will be forwarded to
the neighbors to clean their buffer. During the phase ‘copies lift’ the technique give priority or
chance to the message that not been sent or transmitted many times, During the " Tran" Phase, the
proposed technique optimizes routing sprat and wait in terms of selecting relay nodes that will be
carrying the messages. In fact, it uses the paths contained in the deleting messages’ list to
calculate the number of times the relay nodes have met the final destination of messages. This
technique enables the reduction of the overhead and increases the delivery probability of
messages compared to FIFO strategy.
REFERENCES
[1] V. Cerf and al. 2001. Interplanetary internet (IPN): Architectural definition.
[2] A. Vahdat and D. Becker, (2000) Epidemic routing for partially-connected ad hoc networks, Tech. Rep.
[3] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, (2005). Spray and wait: Efficient routing in
intermittently connected mobile networks,” in Proc.ACM SIGCOMM Workshop on Delay Tolerant
Networking (WDTN).2005
[4] Phearin Sok, Keecheon Kim, (2013) Distance-based PRoPHET Routing Protocol in Disruption Tolerant
Network.
[5] Ari Keränen, Jörg Ott and Teemu Kärkkäinen (2009) The ONE Simulator for DTN Protocol Evaluation.
[6] A. Lindgren and A. Doria ,(2012) Probabilistic Routing Protocol for Intermittently Connected Networks.
[7] Ashraf, Al-Fagih, Hossam and S.Hassanein; (2012) Routing Schemes for Delay-Tolerant Networks : An
Applications Perspective Technical Report .
[8] J. Crowcroft, E. Yoneki, P. Hui, and T. Henderson,( 2008) Promoting tolerance for delay tolerant network
research, SIGCOMM.
Authors
Mohamed ababou: PhD student at the doctoral studies center, National Institute of Posts
and Telecommunications Rabat, Morocco.His research interests are computer science, DTN
Network. Master Course in Informatics Telecommunications && Multimedia at Faculty of
Science , Mohammed V- University, Rabat, Morocco.
Rachid Elkouch :The INPT prepares and coach engineers in networks Telecoms,
Computer sc ience and Multimedia. These engineers could be future companies
responsible, in a world open to the dynamic of the networks and information systems , PHD
in Maths/Telecommunications - National Institute of Posts and Telecommunications.
Nabil ababou: PhD student at the doctoral studies center, Faculty Mohamed I oujda ,
Morocco.His research interests are computer science, research in programming language.
Master Course in Informatics at Faculty of Science Mohamed 1, Oujda, Morocco