Stability Oriented Routing in Mobile Ad-Hoc Networks Based on Simple Automatons

International audienceSince wireless ad-hoc networks with mobile nodes have not stable topology, the classical network functions as the routing are difficult to realize. The router nodes and the links between them are not stable and can appear and disappear randomly. So, classic routing algorithms can not be used successfully. New approaches should be used which deals with these dynamic changes. To avoid frequent route requests and volatile routes due to uncertain information, the objective of the routing can correspond to the route stability. The route computation can be based on random variables and becomes probabilistic routing. Our book chapter focuses on modeling the resilience of these information for ad hoc networks where topology information is uncertain. Our model is based on a dynamic graph where the existence of the nodes and the communication capability between them are modeled by simple two state automaton where the transitions are initiated by random events

Cross layer routing and scheduling for multi-channel Wimax mesh networks

Broadband wireless networks are becoming increasingly popular due to their fast and inexpensive deployment and their capabilities of providing flexible and ubiquitous Internet access. Due to the limitation of shared resources in wireless mesh network such as bandwidth, spatial reuse is introduced for concurrent transmissions. The simultaneous transmissions face many challenges regarding interference on the ongoing transmission. To maximize the network performance of mesh networks in terms of spatial reuse, it is essential to consider a cross-layer for resource allocation in different layers such as the routing network layer, the scheduling resource allocation Media Access Control (MAC) layer and physical layer. Therefore, this thesis focuses on improving the spatial reuse for resource allocation mechanism including routing tree construction by taking into consideration the reliable path, channel assignment and scheduling algorithms. Firstly, a Fuzzy based Constructed Routing Tree (FLCRT) is proposed to incorporate fuzzy logic with routing to enable cognitive capability in packet forwarding for uplink or downlink communication. Secondly, the link-aware routing path is proposed to satisfy the connection lifetime and better routing stability for successful requirements of transmission using multi sponsor node technique. Then, a better understanding of reliability analysis is pursued in the context of homogeneous wireless network. Ultimately, heuristic resource allocation including channel assignment and centralized scheduling algorithms are proposed based on the cellular learning automata to enhance the number of concurrent transmissions in the network by efficiently reusing the spectrum spatially. The attempt of heuristic resource allocation algorithms is to find the maximal number of nodes that could transmit data concurrently. The numerical and simulation results show that FLCRT, Learning Automata Heuristic Channel Assignment (LAHCA), and Learning Automata Heuristic Centralized Scheduling (LAHCS) perform better in terms of scheduling length, channel utilization ratio, and average transmission delay as compared with the existing approaches. The proposed FLCRT scheme with respect to the number of subscriber station (SS) nodes performs better in decreasing the scheduling length, average transmission delay, and channel utilization ratio by 38%, 19%, and 38% compared with Interference-Load-Aware routing. LAHCA algorithm improves the number of channels in comparison with random selection algorithm by 8%. LAHCS algorithm using multi channels proposed by LAHCA can reduce the scheduling time, average transmission delay as well as enhance channel utilization ratio versus number of SS nodes by 7%, 8%, and 6% respectively compared with Nearest algorithm in higher traffic demands

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Applied Formal Methods in Wireless Sensor Networks

This work covers the application of formal methods to the world of wireless sensor networks. Mainly two different perspectives are analyzed through mathematical models which can be distinct for example into qualitative statements like "Is the system error free?" From the perspective of quantitative propositions we investigate protocol optimal parameter settings for an energy efficient operation

Recent advances in petri nets and concurrency

CEUR Workshop Proceeding

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets

Computer Aided Verification

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency

Computer Aided Verification

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency