Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In GEDIR algorithm (shown to have close performance to the shortest path algorithm, if successful), sender or each node currently holding the message m forwards m to one of its neighbors which is closest to destination. FACE ...

For a simple graph $G$ with vertex set $V(G)=\{v_1,...,v_n\}$, we define the closed neighborhood of $u$ as \\$N[u]=\{v \in V(G) \; | v \text{is adjacent to} u \text{or} v=u \}$ and matrix $N(G)$ whose $i$th column is characteristic vector $N[v_i]$. We say $S$ odd dominating if $N[u]\cap S$ for all $u\in V(G)$. prove that parity cardinality an equal to rank $G$, where defined dimension space $N(...