Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Computer networks (3rd ed.)
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Mobile Computing
Mobile IP; Design Principles and Practices
Mobile IP; Design Principles and Practices
A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
Channel access scheduling in Ad Hoc networks with unidirectional links
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
Computer Networks and ISDN Systems
IEEE Transactions on Mobile Computing
A two-phase multicast routing in MANETs using Steiner connected dominating core sets
International Journal of Ad Hoc and Ubiquitous Computing
Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Discrete Applied Mathematics
Vertex domination in dynamic networks
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Formulas and protocols for broadcasting in mobile ad hoc networks
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A coloring based backbone construction algorithm in wireless ad hoc network
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
We consider an efficient distributed algorithm for determining a dominating and absorbent set of vertices (mobile hosts) in a given directed graph that represents an ad-hoc wireless network with unidirectional links. This approach is based on the concept of dominating set in graph theory. A host v is called a dominating neighbor (absorbent neighbor) of another host u if there is a directed edge (v; u) ((u; v)). A subset of vertices is dominating and absorbent if every vertex not in the subset has one dominating neighbor and one absorbent neighbor in the subset. A quick formation process of a dominating and absorbent set is given and this set can be easily updated when the network topology changes dynamically. Ideas for dominating-set-based routing in an ad-hoc wireless network with unidirectional links are also given. The effectiveness of the approach is confirmed through a simulation study.