|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Wei Lou, Jie Wu, "On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks," IEEE Transactions on Mobile Computing, vol. 1, no. 2, pp. 111-123, April-June, 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/TMC.2002.1038347, author = {Wei Lou and Jie Wu}, title = {On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {1}, number = {2}, issn = {1536-1233}, year = {2002}, pages = {111-123}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2002.1038347}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Mobile Computing TI - On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks IS - 2 SN - 1536-1233 SP111 EP123 EPD - 111-123 A1 - Wei Lou, A1 - Jie Wu, PY - 2002 KW - Ad hoc wireless networks KW - broadcast KW - dominant pruning KW - flooding. VL - 1 JA - IEEE Transactions on Mobile Computing ER - | |||
Abstract—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. Among various approximation approaches, dominant pruning utilizes 2-hop neighborhood information to reduce redundant transmissions. In this paper, we analyze some deficiencies of the dominant pruning algorithm and propose two better approximation algorithms: total dominant pruning and partial dominant pruning. Both algorithms utilize 2-hop neighborhood information more effectively to reduce redundant transmissions. Simulation results of applying these two algorithms show performance improvements compared with the original dominant pruning. In addition, two termination criteria are discussed and compared through simulation under both the static and dynamic environments.
[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] G. Calinescu, I. Mandoiu, P.J. Wan, and A. Zelikovsky, “Selecting Forwarding Neighbors in Wireless Ad Hoc Networks,” Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL M), 2001.
[3] B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1990.
[4] B. Das, R. Sivakumar, and V. Bharghavan, “Routing in Ad-Hoc Networks Using a Virtual Backbone,” Proc. Int'l Conf. Computer Comm. and Networks '97, pp. 1-20, Sept. 1997.
[5] C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, “Flooding for Reliable Multicast in Multihop Ad Hoc Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL M), Aug. 1999.
[6] D.B. Johnson and D.A. Maltz, Mobile Computing, chapter“Dynamic Source Routing in Ad-Hoc Wireless Networks,” pp. 153-181, Kluwer Academic, 1996.
[7] H. Lim and C. Kim, “Flooding in Wireless Ad Hoc Networks,” Computer Comm. J., vol. 24, no. 3-4, pp. 353-363, 2001.
[8] L. Lovasz, “On the Ratio of Optimal Integral and Fractional Covers,” Discrete Math., vol. 13, pp. 383-390, 1975.
[9] S-Y. Ni et al., "The Broadcast Storm Problem in a Mobile Ad Hoc Network," Proc. 5th Ann. ACM/ IEEE Int'l Conf. Mobile Computing and Networking (Mobicom 99), ACM Press, 1999, pp. 151-162.
[10] V.D. Park and M. S. Corson, “Temporally-Ordered Routing Algorithm (TORA) Version 1: Functional Specification,” Internet Draft, 1997.
[11] M.R. Pearlman and Z.J. Haas, Determining the Optimal Configuration for the Zone Routing Protocol IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1395-1414, Aug. 1999.
[12] W. Peng and X.-C. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. First Ann. Workshop Mobile and Ad Hoc Networking and Computing, pp. 129-130, Aug. 2000.
[13] C. Perkins and E. Royer, Ad Hoc on Demand Distance Vector (AODV) Routing Proc. Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
[14] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences '35, Jan. 2002.
[15] 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.
[16] I. Stojmenovic, S. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[17] J. Wu and H. Li, “On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” Proc. ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing '99, pp. 7-14, Aug. 1999.
[18] J. Wu and W. Lou, “Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks.” Technical Report CSE-02-15, June 2002.