Abstract
An ad hoc wireless network is a special type of wireless multihop network without infrastructure or centralized administration. As a result of the mobility of their nodes, ad hoc wireless networks are characterized by dynamically changing topologies. A localized algorithm is a special distributed algorithm where each node performs an exceedingly simple task based on local information, with no information sequentially propagated globally in the network. The importance of localized algorithms is their scalability in mobile environments. Decisions made based on localized algorithms are adjustable to the change (such as a topological one) due to the mobile node. We discuss a generic framework that can capture many existing localized broadcast algorithms in ad hoc wireless networks. The framework can easily integrate other objectives such as energy-efficient design and reliability that ensures broadcast coverage. In addition, the framework is extensible to cover other collective communication, which includes one-to-many (multicasting), all-to-one (reduction or aggregation), and all-to-all (gossiping).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. M. Alzoubi, P. J. Wan, and O. Prieder. Distributed heuristics for connected dominating sets in wireless ad hoc networks. Journal of Communications and Networks. 4,(1), Mar. 2002, 22–29.
S. Butenko, X. Cheng, D. Z. Du, and P. Pardalos. On the construction of virtual backbone for ad hoc wireless networks. Proc. of the 2nd Conference on Cooperative Control and Optimization, 2002, 43–54.
B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics. 86, 1990, 165–177.
F. Dai and J. Wu. Distributed dominant pruning in ad hoc wireless networks. Technical report. accepted to appear in Proc. of ICC’03, 2003.
J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks: An Engineering Approach. IEEE Computer Society Press. 1997.
D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. Proc. of ACM MOBICOM’99. 1999, 263–270.
Z. J. Haas, J. Y. Halpern, and L. Li. Gossip-based ad hoc routing. Proc. of IEEE INFOCOM’02. 3, 2002, 1707–1716.
D. B. Johnson and D. A. Malts. Dynamic source routing in ad-hoc wireless networks. In T. Imielinski, H. Korth, editor, Mobile Computing. Kluwer Academic Publishers. 1996, 153–181.
H. Lim and C. Kim. Flooding in wireless ad hoc networks. Computer Communications Journal. 24,(3–4), 2001, 353–363.
W. Lou and J. Wu. On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile Computing. 1,(2), April–June 2002, 111–122.
V. D. Park and M. S. Corson. Temporally-ordered routing algorithm (TORA) version 1: Functional specification. Internet Draft, 1997.
M. R. Pearlman and Z. J. Haas. Determining the optimal configuration of the zone routing protocol. IEEE Journal on Selected Areas in Communications. 17,(8), Feb. 1999, 1395–1414.
W. Peng and X. Lu. On the reduction of broadcast redundancy in mobile ad hoc networks. Proc. of ACM MOBIHOC’00. 2000, 129–130.
C. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. Proc. of the 2nd IEEE WMCSA. 1999, 90–100.
C. E. Perkins. Ad Hoc Networks. Addison Wesley, 2001.
A. Qayyum, L. Viennot, and A. Laouiti. Multipoint relaying for flooding broad cast message in mobile wireless networks. Proc. of the 35th Hawaii International Conference on System Science (HICSS-35). 2002, (CD-ROM).
I. Stojmenovic, S. Seddigh, and J. Zunic. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems. 13,(1), Jan. 2002, 14–25.
J. Sucec and I. Marsic. An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks. CAIP Technical Report 248, Rutgers University, Sept. 2000.
Y. C. Tseng, S. Y. Ni, Y. S. Chen, and J. P. Sheu. The broadcast storm problem in a mobile ad hoc network. Wireless Networks. 8,(2–3), Mar.–May 2002, 153–167.
J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On constructing minimum spanning trees in k-dimensional spaces and related problems. Proc. of IEEE INFOCOM’00. 2000, 585–594.
B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. Proc. of ACM MOBIHOC’02. 2002, 194–205.
J. Wu and F. Dai. Broadcasting in ad hoc networks based on self-pruning. Proc. of IEEE INFOCOM’03, 2003.
J. Wu and F. Dai. A generic distributed broadcast scheme in ad hoc wireless net works. accepted to appear in Proc. of IEEE Int’l Conf. on Distributed Computing Systems (ICDCS), 2003.
J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’99). 1999, 7–14.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J. (2003). Localized Algorithms and Their Applications in Ad Hoc Wireless Networks. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-37619-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40523-8
Online ISBN: 978-3-540-37619-4
eBook Packages: Springer Book Archive