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 an ad-hoc vehicular protocol to support the logistics of first responders. First responders often travel several kilometers to reach an area impacted by an ...
Jonathan Woodbridge, Mars Lan, Giovanni Pau, Mario...
—Some mobile ad hoc networks (MANETs) such as inter-vehicle communications require a transmission scheme that is robust to mobility and asynchronous reception with low setup over...
Tian Peng Ren, Yong Liang Guan, Chau Yuen, Rong Ju...
—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...