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...
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...
—Vehicular ad hoc network protocol with hybrid relay architecture is proposed for improving the success ratio. Access gateway estimation and a probability table based on the rout...
In this paper, we consider transmission in relatively wide-stretched power line communication (PLC) networks, where repeaters are required to bridge the source-to-destination dista...
Structured peer-to-peer overlay network is an efficient solution for querying and retrieving resources spread between the peers. Unfortunately, key based routing of Distributed Ha...