This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
September 2002 (vol. 13 no. 9)
pp. 866-881

Abstract—Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we extend dominating-set-based routing to networks with unidirectional links. Specifically, an efficient localized algorithm for determining a dominating and absorbant set of vertices (mobile hosts) is given and this set can be easily updated when the network topology changes dynamically. A host \big. v\bigr. is called a dominating neighbor (absorbant neighbor) of another host \big. u\bigr. if there is a directed edge from \big. v\bigr. to \big. u\bigr. (from \big. u\bigr. to \big. v\bigr.). A subset of vertices is dominating and absorbant if every vertex not in the subset has one dominating neighbor and one absorbant neighbor in the subset. The derived dominating and absorbant set exhibits good locality properties; that is, the change of a node status (dominating/dominated) affects only the status of nodes in the neighborhood. The notion of dominating and absorbant set can also be applied iteratively on the dominating and absorbant set itself, forming a hierarchy of dominating and absorbant sets. The effectiveness of our approach is confirmed and the locality of node status update is verified through simulation.

[1] K.M. Alzoubi, P.J. Wan, and O. Frieder, “New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks.” Proc. 35th Hawaii Int'l Conf. System Sciences, pp. 1-7, Jan. 2002.
[2] A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh, “Max-MinD-Cluster Formation in Wireless Ad Hoc Networks,” Proc. INFORCOM, pp. 32-41, 2001.
[3] D.J. Baker and A. Ephremides, “The Architectureal Organization of a Mobile Radio Network via a Distributed Algorithm,” IEEE Trans. Comm., vol. 29, no. 11, pp. 1694-1701, Nov. 1981.
[4] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[5] J. Broch, D. Johnson, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF, Internet Draft, draft-ietf-manet-dsr-00.txt, Mar. 1998.
[6] A.T. Campbell, J. Gomez, and A.G. Valko, “An Overview of Cellular IP,” Proc. Wireless Comm. and Networking Conf., vol. 2, pp. 606-610, 1999.
[7] B. Das, E. Sivakumar, and V. Bhargavan, “Routing in Ad Hoc Networks Using a Virtual Backbone,” Proc. Sixth Int'l Conf. Computer Comm. and Networks (IC3N '97), pp. 1-20, Sept. 1997.
[8] S. Datta, I. Stojmenovic, and J. Wu, “Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks,” Cluster Computing, Special issue on, Mobile Ad Hoc Networks, vol. 5, no. 2, pp. 169-178, Apr. 2002.
[9] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263-270, 1999.
[10] R. Jacquet et al. “Optimized Link State Routing Protocol (OLSR),” IETF Internet Draft, org/internet-draftsdraft-ietf-olsr-01.txt , 2000.
[11] K.R. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, pp. 259-278, 1969.
[12] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, Apr. 1998.
[13] Z.J. Haas and M.R. Peralman, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks,” IETF Internet Draft, http://www.ietf.org/internet-draftsdraft-ietf-zone-zrp-00.txt , 1997.
[14] C. Hedrick, “Routing Information Protocol,” Internet Request for Comments (RFC) 1058, June 1988.
[15] Y.D. Liang, “Dominations in Trapezoid Graphs,” Information Processing Letters, vol. 52, pp. 309-315, 1994.
[16] W.K. Liao, Y.C. Tseng, and J.P. Sheu, “GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks,” Telecommunication Systems, A Special Issue on Wireless Networks, vol. 18, no. 1-3, pp. 37-60, 2001.
[17] C.R. Lin and M. Gerla, “Adaptive Clustering in Mobile Wireless Networks,” IEEE J. Selected Areas in Communications, vol. 16, pp. 1,265–1,275, 1997.
[18] J.M. McQuillan, I. Richer, and E.C. Rosen, "The New Routing Algorithm for the Arpanet," IEEE Trans. Comm., vol. 28, no. 5, pp. 711-719, May 1980.
[19] J.M. McQuillan and D.C. Walden, “The ARPA Network Design Decisions,” Computer Networks, vol. 1, no. 5, pp. 243-289, Aug. 1977.
[20] J. Moy, “OSPF,” version 2, Internet Request For Comments RFC 1247, July 1991.
[21] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[22] V. Park and S. Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Proc. 18th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), pp. 1405-1414, Apr. 1997.
[23] C.E. Perkins, Mobile IP: Design Principles and Practices, Addison-Wesley, 1997.
[24] C.E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," Proc. SIGCOMM, ACM Press, New York, 1994, pp. 234-244.
[25] E.M. Royer and C.K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm., pp. 46-55, Apr. 1999.
[26] T. Shepard, “A Channel Access Scheme for Large Dense Packet Radio Networks,” Proc. ACM Speical Interest Group on Comm. (SIGCOMM) Conf. Comm., Architectures, Protocols, and Applications, 1996.
[27] R. Sivakumar, B. Das, and V. Bharghavan, “An Improved Spine-Based Infrastructure for Routing in Ad Hoc Networks,” Proc. Int'l Symp. Computers and Comm. (ISCC '98), 1998.
[28] M. Steenstrup, Cluster-Based Networks in Ad Hoc Networks, C.E. Perkins, ed. Addison Wesley, 2001.
[29] M. Steenstrup, Routing in Comm. Networks. Prentice Hall, 1995.
[30] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall, 1996.
[31] G. Toussaint, “The Relative Neighbourhood Graph of a Finite Planar Set,” Pattern Recognition, pp. 261-268, vol. 12, no. 4, 1980.
[32] J. Wu and F. Dai, “On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations,” Proc. Int'l Symp. Parallel Architetures, Algorithms and Networks (I-SPAN '02), pp. 85-90, 2002.
[33] J. Wu and H. Li, “A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks,” Telecomm. Systems, A special issue on Wireless Networks, vol. 18, no. 1-3, pp. 13-36, 2001.
[34] A.C.C. Yao, “On Constructing Minimum Spanning Trees ink-Dimensional Spaces and Related Problems,” SIAM J. Computing, vol. 11, pp. 721-736, 1982.

Index Terms:
Ad hoc wireless networks, dominating sets, hierarchical structures, mobility management, routing, simulation.
Citation:
Jie Wu, "Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 866-881, Sept. 2002, doi:10.1109/TPDS.2002.1036062
Usage of this product signifies your acceptance of the Terms of Use.