1. Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks.
- Author
-
VEERARAGHAVAN, PRAKASH
- Subjects
- *
CONVEX functions , *CENTROID , *AD hoc computer networks , *DATA packeting , *NP-hard problems - Abstract
Mobile ad hoc networks (MANET) are continuously self-configuring, infrastructureless network of mobile devices connected wirelessly. They found their application everywhere from a military tactical application to a casual video gaming. In MANET, every mobile node is expected to route packets on-behalf of other nodes. Depending on the position in the network, some nodes are expected to route more packets than other nodes. This process will deplete more of their battery power than other nodes. In this paper, we model this problem through the classical g-convexity in graphs. We also prove that the g-centroid location problem for any arbitrary connected graph is NP-hard. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF