The document discusses issues related to selecting optimal paths in mobile ad hoc networks. It proposes using a random direction mobility model to detect neighborhoods and trace paths between source and destination nodes. The model represents nodes moving in random directions for periods of time before pausing. The paper also discusses calculating the probability of link availability over time between two moving nodes based on their movements and developing a link maintenance probability model. An implementation of detecting neighborhoods using this low probability mobility model in Java is also described.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
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.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
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.
A Modified Diagonal Mesh Shuffle Exchange Interconnection Network IJECEIAES
Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.
Haqr the hierarchical ant based qos aware on demand routing for manetscsandit
A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre
existing infrastructure or centralized control. Supporting QoS during routing is a very
challenging task. Clustering is an effective method for resource management regarding network
performance, routing protocol design, QoS etc. In real time various types of nodes with different
computing and transmission power, different rolls and different mobility pattern may exist.
Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper,
HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster
based topology in MANET which will be more scalable and efficient compared to flat
architecture and will give better throughput.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
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
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...cscpconf
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
Abstract The aim of this paper is to investigate the transmission of data between client and server through different IEEE 802.11 wireless LAN multi- HOP network. To improve this issue, the transmission opportunity (TXOP) mechanism is defined in the IEEE 802.11e standard, with which a wireless node can transmit multiple frames consecutively for a maximum channel occupancy time, called TXOP limit. This paper considers the performance of the TXOP mechanism for multi-hop wireless networks. Focusing on a three-node chain topology, we model it as a tandem queuing network with two nodes. The E2ET is derived and the analysis is validated by simulation. Numerical results show that the TXOP mechanism works well for multi-hop wireless networks. It is also shown that adjusting TXOP limit is significantly important in order to increase the overall throughput. In terms of multi-hop wireless networks, there is little analytical work with regard to the E2ET performance. One of the rationales for the analytical difficulty for multi-hop wireless networks is that IEEE 802.11 MAC protocol is too complex to model the behavior of multi-hop frame transmissions. Keywords: IEEE 802.11e, multi-hop wireless LAN, TXOP, E2ET
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.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
A Modified Diagonal Mesh Shuffle Exchange Interconnection Network IJECEIAES
Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.
Haqr the hierarchical ant based qos aware on demand routing for manetscsandit
A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre
existing infrastructure or centralized control. Supporting QoS during routing is a very
challenging task. Clustering is an effective method for resource management regarding network
performance, routing protocol design, QoS etc. In real time various types of nodes with different
computing and transmission power, different rolls and different mobility pattern may exist.
Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper,
HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster
based topology in MANET which will be more scalable and efficient compared to flat
architecture and will give better throughput.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
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
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...cscpconf
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
Abstract The aim of this paper is to investigate the transmission of data between client and server through different IEEE 802.11 wireless LAN multi- HOP network. To improve this issue, the transmission opportunity (TXOP) mechanism is defined in the IEEE 802.11e standard, with which a wireless node can transmit multiple frames consecutively for a maximum channel occupancy time, called TXOP limit. This paper considers the performance of the TXOP mechanism for multi-hop wireless networks. Focusing on a three-node chain topology, we model it as a tandem queuing network with two nodes. The E2ET is derived and the analysis is validated by simulation. Numerical results show that the TXOP mechanism works well for multi-hop wireless networks. It is also shown that adjusting TXOP limit is significantly important in order to increase the overall throughput. In terms of multi-hop wireless networks, there is little analytical work with regard to the E2ET performance. One of the rationales for the analytical difficulty for multi-hop wireless networks is that IEEE 802.11 MAC protocol is too complex to model the behavior of multi-hop frame transmissions. Keywords: IEEE 802.11e, multi-hop wireless LAN, TXOP, E2ET
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.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
Route Stability in Mobile Ad-Hoc Networksarpublication
A Mobile Ad Hoc Network (MANET) is a wireless network consisting of mobile nodes, which can communicate with each other without any infrastructure support. In these networks, nodes typically cooperate with each other, by forwarding packets for nodes which are not in the communication range of the source node. A fundamental issue arising in mobile ad-hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. In this work we study the stability of a routing path, which is subject to link failures caused by node mobility, and we consider as metrics of interest the duration and the availability of a path. Moreover, using the results on path duration and availability, we show how to determine the optimal path in terms of route stability, under the Random Direction mobility models.
EBCD: A ROUTING ALGORITHM BASED ON BEE COLONY FOR ENERGY CONSUMPTION REDUCTIO...ijasuc
One of the important issues in wireless networks is the Routing problem that is effective on system
performance, in this article the attempt is made to propose a routing algorithm using the bee colony in
order to reduce energy consumption in wireless relay networks. In EBCD algorithm, through combined of
energy, distance and traffic parameters a routing algorithm for wireless networks is presented with more
efficiency than its predecessor. Applying the bee colony method would allow the placement of the
parameters under conventional conditions and to get closer to a mechanism with a better adaptability
than that of the existing algorithm. According to the parameters considered, the proposed algorithm
provides a fitness function that can be applied as a multi-hop. Unlike other algorithms of its kind this can
increase service quality based on environmental conditions through its multiple services. This new
method can store the energy accumulated in the nodes and reduce the hop restrictions.
EBCD: A ROUTING ALGORITHM BASED ON BEE COLONY FOR ENERGY CONSUMPTION REDUCTIO...ijasuc
One of the important issues in wireless networks is the Routing problem that is effective on system
performance, in this article the attempt is made to propose a routing algorithm using the bee colony in
order to reduce energy consumption in wireless relay networks. In EBCD algorithm, through combined of
energy, distance and traffic parameters a routing algorithm for wireless networks is presented with more
efficiency than its predecessor. Applying the bee colony method would allow the placement of the
parameters under conventional conditions and to get closer to a mechanism with a better adaptability
than that of the existing algorithm. According to the parameters considered, the proposed algorithm
provides a fitness function that can be applied as a multi-hop. Unlike other algorithms of its kind this can
increase service quality based on environmental conditions through its multiple services. This new
method can store the energy accumulated in the nodes and reduce the hop restrictions.
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.
Performance Comparison and Analysis of Mobile Ad Hoc Routing ProtocolsCSEIJJournal
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead
of static network infrastructure to provide network connectivity. MANETs have applications in rapidly
deployed and dynamic military and civilian systems. The network topology in a MANET usually changes
with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing
protocols may not be suitable for MANETs. Researchers are designing new MANET routing protocols
and comparing and improving existing MANET routing protocols before any routing protocols are
standardized using simulations. However, the simulation results from different research groups are not
consistent with each other. This is because of a lack of consistency in MANET routing protocol models
and application environments, including networking and user traffic profiles. Therefore, the simulation
scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is
difficult for one to choose a proper routing protocol for a given MANET application. According to the
aforementioned issues, this paper focuses on MANET routing protocols. Specifically, my contribution
includes the characterization of different routing protocols and compare and analyze the performance of
different routing protocols.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
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.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Vitality productivity Multipath Routing for Wireless Sensor Networks: A Genet...dbpublications
Abstract-The two factors included for deployment of any Wireless Sensor Network, those factors are efficient energy and fault tolerance. An efficient solution for fault tolerance is the Multipath routing in WSNs. Genetic Algorithm is based on the meta-heuristic search technique. Base station (BS) already prepared routing schedule in its routing table, all the nodes share it with the entire network. In proposed algorithm various parameters are used for efficient fitness function such as distance between sender and receiver nodes, distance between BS to hop node and on the number of hop to send data from next hop node to the BS. Simulation and evaluation are tested with various performance metrics in the proposed algorithm.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Throughput and Delay Analysis of Next-HOP Forwarding Method for Non-Linear Eh...pijans
Position based routing plays a significant role in multi-hop Vehicular Ad hoc Networks (VANETs), due to
high mobility of nodes. Selection of next-hop node is crucial to improve the performance of routing. In this
paper, we have proposed a method for selecting next-hop forwarding node based on the distance between
the source and next-hop node and link quality. Next-hop node is selected based on Expected Progress
Distance (EPD) criteria. The EPD is estimated in terms of expected distance between the source and nexthop node. The expected delay (ED) and throughput (Th) are also estimated for the proposed method. The
mathematical model derived for calculating EPD, delay, and throughput are simulated in MATLAB and
evaluated the performance of the proposed method.
Performance evaluation of diff routing protocols in wsn using difft network p...Dr Sandeep Kumar Poonia
In the recent past, wireless sensor networks have been introduced to use in many applications. To design the networks, the factors needed to be considered are the coverage area, mobility, power consumption, communication capabilities etc. The challenging goal of our project is to create a simulator to support the wireless sensor network simulation. The network simulator (NS-2) which supports both wire and wireless networks is implemented to be used with the wireless sensor network.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
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.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
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.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
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/
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.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Mobile ad hoc networks – dangling issues of optimal path strategy
1. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
Mobile Ad hoc Networks – Dangling issues of optimal path
strategy
R.V.S.Lalitha,M.Tech(Ph.D)
Asst.Professor
Sri Sai Aditya Institute of Science and Technology, Surampalem.
E-mail:rvslalitha@gmail.com
D. Ramya Krishna (M.Tech)
Sri Sai Aditya Institute of Science and Technology,Surampalem.
E-mail:rvslalitha@gmail.com
Abstract: Ad Hoc network is a collection of wireless mobile hosts forming a temporary network without
the aid of any centralized administration, in which individual nodes cooperate by forwarding packets to each
other to allow nodes to communicate beyond direct wireless transmission range. Routing is a process of
exchanging information from one station to other stations of the network. Routing protocols of mobile ad-hoc
network tend to need different approaches from existing Internet protocols because of dynamic topology,
mobile host, distributed environment, less bandwidth, less battery power. The key concern is to analyze the
ability of moving nodes in the network using Random Direction Mobility model based on the path
availability.
Key Words: Mobile ad hoc networks, Routing, Path stability
Introduction: Mobile ad hoc networks (MANETs) enable users to maintain connectivity to the fixed
network or exchange information when no infrastructure, such as a base station or an access point, is
available. This is achieved through multihop communications, which allow a node to reach far away
destinations by using intermediate nodes as relays. The selection and maintenance of a multihop path,
however, is a fundamental problem in MANETs Node mobility, signal interference[1], and power outages
make the network topology frequently changes as a consequence, the links along a path may fail and an
alternate path must be found. To avoid the degradation of the system performance, several solutions have
been proposed in the literature, taking into account various metrics of interest. A method that has been
advocated to improve routing efficiency is to select the most stable path, so as to avoid packet losses and limit
the latency and overhead due to path reconstruction (routing instability).
Issues in forwarding packets: A fundamental issue arising in mobile ad-hoc networks (MANETs) is the
selection of the optimal path between any two nodes. While general approaches are available in literature
that can’t work better for MANET where node life time is much smaller. A method that has been advocated
to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due
to route reconstruction. This paper focuses on how to find the optimal path solution using Random Direction
Mobility model based on the neighborhoods detected.
Related Work: We first highlight the path selection using Random Direction Mobility Model.
10
2. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
In the previous work parameters of the underlying mobility model of the nodes are given (e.g.,
obtained through measurements) and that all nodes have a fixed, common radio range R. To introduce the
problem of path selection, suppose node A wants to communicate with node B, possibly using intermediate
nodes as relays[2]. To maximize the stability of the route in response to node mobility, one can think of two
different strategies: (i) a few long hops; (ii) many short hops. On the one hand, considering that the entire
path fails if just a single link fails, and nodes move independently of each other, it seems better to minimize
the number of hops. On the other hand, short links are much more stable than long links.
Neighborhood Detection using Low Probability Model:
The main challenge in mobile ad hoc networks is mobility. Due to the moving node in the mobile ad
hoc network, the route breaks frequently. In most of algorithms in the mobile ad hoc network, when
constituting a route to destination node, the previous relay node will select as furthest node as possible to
construct shortest path[3]. The furthest node the previous node selects as the next hop relay node, the more
possibly the link of the route will break in a short time. Researches need to be done in order to study the
relation between the link and route maintenance probability and factors that affect the link and route
maintenance probability. In this paper, we suggested the link maintenance probability model. And based on
the link maintenance probability, route maintenance probability model was provided for mobile ad hoc
networks.
We can write an exact expression for the probability of link availability at time t, by using the spatial
PDF of nodes moving according to the RD model. Two nodes A and B be the spatial distributions of A at time
t in the move and pause phases, respectively, the spatial distributions of B at time t in the move and pause
phases, respectively. The probability of link availability between the two nodes. First to numerically evaluate
the spatial distribution of nodes A and B at time t through a tri-dimensional inverse transform (two spatial
dimensions and one temporal dimension), then to numerically compute the integral in over a
four-dimensional domain.
Link Maintenance
The link maintenance probability model[3] is derived according to problem statement definition.
Under the considerations of the problem statement, we make the following as the conclusion that the
probability p that the two nodes, node a and node b can communicate after t seconds is equal to equation as,
P=(AA BB )
In this link maintenance probability model, p is the link maintenance probability, AA is the area of circle A,
which has its center located at A and has a radius of R. AB is the area of circle B which has its center located
at B and has a radius of vt.
11
3. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
b
a
vt
Fig.1. Link Maintenance
Link Maintenance: The probability that node a can communicate with node b is the ratio of the overlapping
area of circle A and circle B to the area of circle B.Fig.1 illustrates the scenario.
MANET Research Approach: The proposed approach projects a refined solution to the overheads caused
due to flooding, delay in propagation, difficulty in tracing the optimal path solution. We propose a solution
based on an iterative procedure of four steps: (1) Detection of Neighborhoods, (2) Tracing of paths between
Source and Destination nodes,(3) a means of augmenting the path set, and finally, (4) a simple discussion
on the selection criteria, so that the path search may temporarily use edges of paths already included in the
set. Fig.2 shows the proposed analogy.
Fig.2
Neighborhoods Detection using Low probability model: This has been implemented in JAVA.The code and
the output is as follows.
12
4. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
Snippets of Implementaion:
Enumeration<Object> em = properties.keys();
while (em.hasMoreElements()) {
String key = (String) em.nextElement();
int dis = Integer.parseInt(properties.getProperty(key));
int min = mydis - 10;
int max = mydis + 10;
if ((!key.equals(source)) && dis >= min && dis <= max) {
neigh.add(key);
Tracing all possible paths ( routes )between source and destination nodes:
Each node alternates periods of movement (move phase) to periods during which it
pauses (pause phase); at the beginning of each move phase, a node independently selects its new direction
and speed of movement. Speed and direction are kept constant for the whole duration of the node move
phase; the durations of move and pause phases are, in general, distributed according to independent random
variables.
Properties:
Stationary properties of node distribution and speed distribution are Firstly; geometric probability
was applied to analyze stationary node distribution. A closed form probability density function for circular
regions was obtained which indicated that mobile nodes tended to disperse with simulation advancing.
Secondly, we applied palm calculus to calculate probability density function of stationary speed distribution
and proved that there was speed decay phenomenon in this model. RD's mobile moves by a zigzag way. We
apply geometric probability to analyze node distribution of RD model. In the case of circular regions, a closed
form node distribution is obtained.
13
5. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
Fig:3.RD Mobility Model
RD – Random direction
We analyze the speed distribution of RD by the method of palm calculus[1] and give a general
explanation to the hypostasis of speed decay phenomenon. At last, it should be noted that the appellation
"random direction model" is also used for RW model.
Example:
RD Mobility Model – Travelling Pattern (route)
RD nodes will appear near the region border with much higher probabilities and the average speed will decay
as time goes by. Theoretical analysis and simulations show that RD is an entity mobility model neither
stationary in time nor homogeneous in space. The code and the output is as follows.
Snipptes of Implementation:
str=String.valueOf(rr.nextInt(10))+String.valueOf(rr.nextInt(10))+String.valueOf(rr.nextInt(10))
+String.valueOf(rr.nextInt(10));
soc = serSoc.accept();
ois = new ObjectInputStream(soc.getInputStream());
String str = (String) ois.readObject();
checkStatus(str);
Finding optimal paths:
The parameters of the underlying mobility model[3] of the nodes are given (e.g., obtained through
measurements) and that all nodes have a fixed, common radio range R. To introduce the problem of path
selection, suppose node A wants to communicate with node B, possibly using intermediate nodes as relays.
14
6. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
To maximize the stability of the route in response to node mobility, one can think of two different strategies:
1) Few long hops and 2) Many short hops.
On the one hand, considering that the entire path fails if just a single link fails and that nodes move
independently of each other, it seems better to minimize the number of hops. On the other hand, short links
are much more stable than long links.
Path selection
• To maximize the stability of the route in response to node mobility, one can think of two different
strategies:
• Few long hops
• Many short hops.
• On the one hand if entire path fails or else just a single link fails and that nodes move independently
of each other, it seems better to minimize the number of hops. On the other hand, short links are
much more stable than long links.
We make the following assumptions that if the distance between source node and destination node
is l and distance between two intermediate relay nodes is d, then for the convenience of this study, we
assume that the hop count of the route h is h=l/d. In this circumstance, the link maintenance probability
between two intermediate relay nodes is already derived to be p as described in the previous section. But the
route was consisted of h hops, which means that there are h links between source and destination.
Under these assumptions, the route maintenance probability model is derived as follow.
PR=Ph
PR denotes the route maintenance probability, p denotes the link maintenance probability and h is the hop
count. The code and the output is as follows.
Snippets of Code
for (int i = 0; i < neigh.size(); i++) {
String nei=neigh.get(i);
if (getAvailable(path,nei)) {
int nPort = getPort(nei);
Socket socket = new Socket("localhost", nPort);
ObjectOutputStream oos = new ObjectOutputStream(socket.getOutputStream());
oos.writeObject("RTS");
oos.writeObject(path);
oos.writeObject(dest);
15
7. Network and Complex Systems www.iiste.org
ISSN 2224-610X (Paper) ISSN 2225-0603 (Online)
Vol 2, No.3, 2012
Conclusions
Analytical theory about the parameterization of mobility nodes is discussed.Route maintenance probability
model performs well as the link maintenance probability is considered. The performance of an ad hoc
network protocol vary significantly with different mobility models.
References:
1. K.Sreenivasulu “Improving Routing Efficiency Based on Random Direction Mobility Model in
Manets” is published in “International Journal of Smart Sensors and Ad-Hoc Networks
(IJSSAN-2011), Volume-1, Issue-1.
2. Yan-tao Liu “Stationary Properties of Random Direction Models”, 2010 Second International
Conference on Networks Security, Wireless Communications and Trusted Computing.
3. Giovanna Carofiglio, Member, “Route Stability in MANETs under the Random Direction Mobility
Model”, IEEE transactions on mobile computing, vol. 8, no. 9, September 2009.
4 Kamal Kant,“Stable Link Based Multicast Routing Scheme for MANET”, 2010 International Conference
on Computational Intelligence and Communication Networks.
5. S.S.Tyagi, “Performance Analysis of Proactive and Reactive Routing Protocols for Ad hoc Networks”,
2010 International Journal of Computer Applications (0975 – 8887).
6. Bernd Gloss, Michael Scharf, Daniel Neubauer,”A More Realistic Random Direction Mobility
Model”,Institute of Communication Networks and Computer Engineering.
16
8. This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.
More information about the publisher can be found in the IISTE’s homepage:
http://www.iiste.org
The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. Prospective authors of
IISTE journals can find the submission instruction on the following page:
http://www.iiste.org/Journals/
The IISTE editorial team promises to the review and publish all the qualified
submissions in a fast manner. All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than
those inseparable from gaining access to the internet itself. Printed version of the
journals is also available upon request of readers and authors.
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar