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...
—The presence of heterogeneous nodes (i.e., nodes with an enhanced energy capacity or communication capability) in a sensor network is known to increase network reliability and l...
Mark D. Yarvis, Nandakishore Kushalnagar, Harkirat...
In this paper we explore the "interface" between Identity-based Public Key Cryptography (ID-PKC) and Mobile Ad-hoc Networks (MANETs). In particular we examine the problem...
Shane Balfe, Andrew D. McDonald, Kenneth G. Paters...
— The medium-access control (MAC) protocols for wireless networks proposed or implemented to date based on collision-avoidance handshakes between sender and receiver either requi...
Due to the growing interest in mobile wireless Ad-Hoc networks’ (MANETs) applications, researchers have proposed many routing protocols that differ in their objective. Energy ef...
Wasim El-Hajj, Dionysios Kountanis, Ala I. Al-Fuqa...