A wireless ad hoc network is a notable type of network in which a collection of mobile nodes with wireless network interfaces may form a temporary network, without use of any fixed infrastructure or centralized control. The Dynamic Source Routing protocol (DSR) is a efficient routing protocol explicitly designed for multi-hop wireless ad hoc networks of mobile nodes. A connected dominating set ...

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 ...

In this paper, we design the first polynomial time approximation scheme for d-hop connected dominating set (d-CDS) problem in growth-bounded graphs, which is a general type of graphs including unit disk graph, unit ball graph, etc. Such graphs can represent majority types of existing wireless networks. Our algorithm does not need geometric representation (e.g., specifying the positions of each ...

Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hulls of sensor nodes or vertices. Constructing a virtual backbone in WSNs is an important issue because it red...