A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
With the continued increase of speed and capacities of computing devices and the growing needs of people for mobile computing capabilities, Mobile ad hoc networks (MANETs) have gai...
—We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level...
The basic networking unit in Bluetooth is piconet, and a larger-area Bluetooth network can be formed by multiple piconets, called scatternet. However, the structure of scatternets...
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...