—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
—In wireless ad-hoc sensor networks, an important issue often faced in geographic greedy forwarding routing is the “local minimum phenomenon” which is caused by deployment ho...
Abstract— Existing random mobility models have their limitations such as speed decay and sharp turn which have been demonstrated by the previous studies. More importantly, mobili...
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...