Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model

Monteiro, J; Goldman, Alfredo; Ferreira, Afonso

doi:10.1109/wimob.2006.1696378

Cited by 40 publications

(37 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In these experiments (in contrast with [22]) we decided to disable the ARP (Address Resolution Protocol) of mobile nodes, agreeing with the arguments in [7] by Carter et al, in that MANETs need to have their own ways of neighbour discovering. This is because, in NS2, the address resolution is an approximation of the BSD Unix ARP, so the resolution is performed on-demand as packets arrive from the application layer, and the buffer size to each neighbor is only one single packet.…”

Section: Simulation Environmentmentioning

confidence: 80%

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

2009

View full text Add to dashboard Cite

International audienceThe assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks' dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model -- the evolving graphs -- was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad-hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience

show abstract

Section: Simulation Environmentmentioning

confidence: 80%

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

2009

View full text Add to dashboard Cite

show abstract

“…The evolving graph theory has been proposed as a formal abstraction of dynamic networks to help capture its behaviour when the mobility patterns are predictable [51], [52], [53]. In definition, the evolving graph is an indexed sequence of λ subgraphs of a given graph, where the subgraph at a given index corresponds to the network connectivity at the time interval indicated by the index number.…”

Section: The Extended Vanet-oriented Evolving Graph (E-voeg) Modelmentioning

confidence: 99%

Secure and Robust Multi-Constrained QoS Aware Routing Algorithm for VANETs

Eiza

Owens

2016

IEEE Trans. Dependable and Secure Comput.

105

View full text Add to dashboard Cite

Abstract-Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In Vehicular Ad hoc Networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the Ant Colony Optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented Evolving Graph (VoEG) model to perform plausibility checks on the routing control messages exchanged among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service.

show abstract

“…In (Tian et al, 2002) the authors propose a graph-based mobility model, which provides a more realistic movement than the random walk model by reflecting the spatial constraints in the real world. Finally, some papers have considered a graph structure called evolving graph to study the behavior of some kinds of SWNs, with the aim of designing new routing protocols; see for example (Ferreira, 2004;Monteiro et al, 2006). …”

Section: Classical Manets Routing Algorithms Can Provide Forwarding Imentioning

confidence: 99%

“…From the definition of possible journey, in absence of any kind of interferences, if we want to know the shortest path followed by a packet sent from a node to another one at a given time, we have to apply a specifically designed modification of the classical Dijkstra's algorithm (Dijkstra, E.W., 1959) to find a shortest path in directed graphs, in a similar way as in (Monteiro et al, 2006).…”

Section: Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation

An algorithm to evaluate routing conditions in smartphones-based wireless networks

Soler

Albiach

Martínez

et al. 2013

Expert Systems with Applications

View full text Add to dashboard Cite

ElsevierSoler Fernández, D.; Albiach Vicent, J.; Martínez Molada, E.; Manzoni, P. (2013) AbstractThe increasing penetration of smartphones, i.e., smart devices with multiple sensing and communication interfaces, creates the possibility to build novel types of networks. Opportunistic networking and Content-Based networking strongly rely on the use of such devices. Smartphones tend to have an ON/OFF status that strongly depends on the user activity, mobility pattern and energy saving approach. Wireless adaptors are, after the terminal screen, the strongest source of power consumption. It is therefore common for a node to occasionally turn off the networking device to save energy. The impact on routing of the presence of nodes in the off-state must therefore be thoroughly evaluated.We propose an analytical model based on evolving graphs, which provides an exhaustive evaluation of routing conditions with the aim to determine the best recurring strategy and parameters when dealing with end-devices that show an ON-OFF behavior. Computational results are given, both on static and dynamic scenarios.

show abstract

Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model

Cited by 40 publications

References 18 publications

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

Secure and Robust Multi-Constrained QoS Aware Routing Algorithm for VANETs

An algorithm to evaluate routing conditions in smartphones-based wireless networks

Contact Info

Product

Resources

About