We study deterministic gossiping in ad-hoc radio networks, where labels of the nodes are large, i.e., they are polynomially large in the size n of the network. A label-free model was introduced in the context of randomized broadcasting in ad-hoc radio networks, see . Most of the work on deterministic communication in ad-hoc networks was done for the model with labels of size O(n), with few exceptions; Peleg  raised the problem of deterministic communication in ad-hoc radio networks with large labels and proposed the first deterministic O(n2 logn)-time broadcasting algorithm. In  Chrobak et al. proved that deterministic radio broadcasting can be performed in time O(n log2 n); their result holds for large labels. Here we propose two new deterministic gossiping algorithms for ad-hoc radio networks with large labels. In particular: - a communication procedure giving an O(n5/3 log3 n)-time deterministic gossiping algorithm for directed networks and an O(n4/3 log3 n)-time algorithm for undirected networks; -a gossiping procedure designed particularly for undirected networks resulting in an almost linear O(n log3 n)-time algorithm.