Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal

Koushik Sinha, Pradip K Srimani

Abstract

Two deterministic broadcast algorithms are presented for mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The first algorithm, based on a depth-first traversal of the nodes, accomplishes broadcast in O(n log n) time in the worst case. The second algorithm is mobility resilient even when the topology changes very frequently, with O(∆•n log n+n•|M |) time to broadcast in the worst case, where |M | is the length of the message to be broadcasted and ∆ is the maximum node degree.

References

  1. R. Bar-Yehuda, O. Goldreich and A. Itai, "On the time-complexity of broadcast in multi-hop radio networks : an exponential gap between determinism and randomization", J. computer and System Sci., Vol. 45, pp. 104-126, Aug. 1992.
  2. S. Basagni, D. Bruschi and I. Chlamtac, "A mobility transparent deterministic broadcast mechanism for ad hoc networks", IEEE Trans. Networking, Vol. 7, pp. 799-807, Dec. 1999.
  3. I. Chlamtac and O. Weinstein, "The wave expansion approach to broadcasting in multihop radio networks", IEEE Trans. Communications, Vol. 39, pp. 426-433, March 1999.
  4. B. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter, "Deterministic broadcasting in unknown radio networks", Proc. of SODA 2000, pp. 861-870, 2000.
  5. M. Chrobak, L. Gasieniec and W. Rytter, "Fast broadcasting and gossiping in radio networks", Proc. 41st IEEE Symp. Found. of Computer Science (FOCS'2000), pp. 575-581, 2000
  6. A. E. F. Clementi, A. Monti and R. Silvestri, "Distributed multi-broadcast in unknown radio networks", Proc. 20th ACM Symp. on Principles of Distributed Computing (PODC'2001), pp. 255-263, 2001.
  7. A. E. F. Clementi, A. Monti and R. Silvestri, "Selective families, superimposed codes, and broadcasting in unknown radio networks", Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA'2001), pp. 709-718, 2001.
  8. I. Gaber and Y. Mansour, "Broadcast in radio networks", Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms, pp. 577-585, 1995.
  9. S. K. S. Gupta and P. K. Srimani, " Adaptive core selection and migration method for multicast routing in mobile ad hoc networks", IEEE Trans. Parallel and Distributed Systems, pp. 27-38, January 2003.
  10. E. Kushilevitz and Y. Mansour, "An ­(D log n=D) lower bound for broadcast in radio networks", SIAM J. Computing, Vol. 27, pp. 707-712, June 1998.
  11. K. Nakano and S. Olariu, "Randomized Initialization Protocols for Ad-hoc Networks", IEEE Trans. Parallel and Distributed Systems, Vol. 11, pp. 749-759, 2000.
  12. K. Sinha, "Deterministic Broadcast and Gossiping in Ad hoc Networks", MS Thesis, Clemson University, South Carolina, USA, August 2003.
Download


Paper Citation


in Harvard Style

Sinha K. and K Srimani P. (2004). Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal . In Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 1: WIS, (ICEIS 2004) ISBN 972-8865-02-3, pages 170-177. DOI: 10.5220/0002662401700177


in Bibtex Style

@conference{wis04,
author={Koushik Sinha and Pradip K Srimani},
title={Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal},
booktitle={Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 1: WIS, (ICEIS 2004)},
year={2004},
pages={170-177},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002662401700177},
isbn={972-8865-02-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 1: WIS, (ICEIS 2004)
TI - Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal
SN - 972-8865-02-3
AU - Sinha K.
AU - K Srimani P.
PY - 2004
SP - 170
EP - 177
DO - 10.5220/0002662401700177