Blockchain is a technology that makes it possible to maintain a single register of information in a distributed and decentralized way. However, to benefit from it, it is necessary to rely on reliable connectivity as provided by the Internet. This is not the case in mesh and mobile ad hoc networks because it is often required to deploy its own infrastructure and its own services where operators are not available. In this thesis, we propose Blockgraph, a blockchain-like technology capable of dealing with network partitions. With mobility, partitions in the network result in forks which are traditionally resolved by choosing the longest chain and ignoring other competing chains. We have developed a new data structure that takes the form of a directed acyclic graph, which inherits all the security properties of the blockchain. In Blockgraph, these concurrent chains created by the effect of network partitions are considered legitimate chains carrying information related to a given network partition. We also proposed C4M, a consensus algorithm inspired by RAFT, able to be tolerant to network partitions by performing node membership changes automatically.