Self-Configuration and Self-Optimization Process in Heterogeneous Wireless Networks

Guardalben, Lucas; Villalba, Luis Javier García; Buiati, Fábio; Sobral, João Bosco M.; Camponogara, Eduardo

doi:10.3390/s110100425

Cited by 7 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A few works try to autonomically tune the timers in mobile networks. A network cartography approach is used in [9], requiring the knowledge of the position of the nodes, while parameters are changed as a function of the network size in [10]. Protocol parameters have been studied for their obvious impact on the convergence times of routes and energy consumption in heterogeneous networks [11].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Improving Routing Convergence With Centrality: Theory and Implementation of Pop-Routing

Maccari

Cigno

2018

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

One of the key features of a routing protocol is its ability to recover from link or node failures, recomputing routes efficiently without creating temporary loops. Link-State protocols perform better than Distance-Vector ones and they are often presented as ideal from this perspective. Indeed, in real conditions there is always a trade-off between the overhead due to the periodic generation of control messages and route convergence time. This work formalizes the problem of the choice of timers for control message generation as an optimization problem that minimizes the route convergence time constrained to a constant signaling overhead. The solution requires the knowledge of nodes' centrality in the topology and can be obtained with a computational complexity low enough to allow on-line computation of the timers. Results on both synthetic and real topologies show a significant shrinkage of the transient duration with the consequent performance gain in terms of reduced number of unreachable destinations and routing loops that lead to traffic loss. Next, we present the extension of OLSRv2 with our proposal, named Pop-Routing, and discuss its performance and the stability of centrality metrics in three large-scale real wireless mesh networks. This exhaustive analysis on traces of the topology evolution of real networks for one entire week show that Pop-Routing outperforms the non-enhanced protocol in every situation, even when it runs with sub-optimal timers due to centrality computation on stale information. This situation must be taken into account, as, albeit computationally lightweight, the optimization cannot run in real-time on wireless routers.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Remember that Eqs. (10) and (11) include the centrality of all the nodes, so a single modification in the network topology may cause small changes in the timers of all the nodes. In practice this oscillation is negligible, but from one snapshot to the next the timers are likely to fluctuate lightly even in stable conditions.…”

Section: Re-computing Centralitymentioning

confidence: 99%

Improving Routing Convergence With Centrality: Theory and Implementation of Pop-Routing

Maccari

Cigno

2018

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Context awareness refers to the property of a device to passively or actively determine its context, which may not be clearly defined. Self-configuration is based on initial sensor configurations regarding the user specifications and includes methods for generating dynamic configurations that better suit the ongoing situation [8]. And lastly, self-adaptation is bind to the term self-management and refers to the ability of an entity to calibrate its functioning to correspond to the environment where it was deployed [9].…”

Section: Systems Self-organizationmentioning

confidence: 99%

Semantic maps for IoT network reorganization in face of sensor malfunctioning

Lopes

Ferreira

Jardim‐Gonçalves

et al. 2017

2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)

View full text Add to dashboard Cite

-As technology evolves, the Internet of Things (IoT) concept is gaining more importance for constituting a foundation to reach better connectivity between people and things. For this to happen, certain strategies and processes are considered to enhance and grant optimal interoperability between the heterogenous devices of a typical IoT network. Two major key aspects of these networks are autonomous error recovery and network reorganization, which are usually based on physical redundancy and aim to return the network to a similar working state, as it was before the error. This process is of great importance when regarding the amount of data and devices that the ever-growing IoT networks have to manage and the number of situations that are associated with this aspect. This work proposes a solution to integrate the previously mentioned processes in IoT networks with the support of the semantic maps as a mean to accomplish redundancy with the use of network metadata and function-oriented recovery methodology, providing the network with tools to be more autonomous and reliable, without compromising performance.

show abstract

“…A few works try to autonomically tune the timers in mobile networks. A network cartography approach is used in [5], requiring the knowledge of the position of the nodes, while parameters are changed as a function of the network size in [6]. Protocol parameters have been studied for their obvious impact on the convergence times of routes and energy consumption in heterogeneous networks [7].…”

Section: Related Workmentioning

confidence: 99%

Pop-routing: Centrality-based tuning of control messages for faster route convergence

Maccari

Cigno

2016

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Fast and efficient recovery from node failure, with minimal disruption of routes and the consequent traffic loss is of the utmost importance for any routing protocol. Link-state protocols, albeit preferred to distance vector ones because of faster convergence, still suffer from a trade-off between control message overhead and performance. This work formalizes the routes' disruption following a node failure as an optimization problem depending on the nodes' centrality in the topology, constrained to a constant signaling overhead. Next, it shows that the solution can be found using Lagrange Multipliers. The solution complexity is low enough to be computed on-line on the network routers, thus obtaining the optimal setting of control message timers that minimize the traffic loss following a node failure. The gain obtained is quantified in power-law synthetic topologies, and it is also tested on real network topologies extending the OLSR protocol to use the modified timers, showing that the inevitable approximations introduced in the analysis do not hamper the very good results achievable through this novel approach. The technique can be applied to any link state protocol, including OSPF, and improves route convergence not only upon failures but on every topology modification. Index Terms-Multi-hop networks; mesh networks; ad-hoc networks; centrality; signalling overhead; failure recovery.

show abstract

Self-Configuration and Self-Optimization Process in Heterogeneous Wireless Networks

Cited by 7 publications

References 18 publications

Improving Routing Convergence With Centrality: Theory and Implementation of Pop-Routing

Improving Routing Convergence With Centrality: Theory and Implementation of Pop-Routing

Semantic maps for IoT network reorganization in face of sensor malfunctioning

Pop-routing: Centrality-based tuning of control messages for faster route convergence

Contact Info

Product

Resources

About