Dynamic initialization protocols for mobile Ad Hoc networks

IEEE International Conference on Networks, ICON

Volumn , Issue , 2003, Pages 149-154

  Myoupo, Jean Frédéric ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Initialization problem; Mobile Ad Hoc networks; Mobile computing; Wireless networks

Indexed keywords

DYNAMICAL SYSTEMS; MICROCOMPUTERS; PACKET NETWORKS; TRANSPUTERS;

INITIALIZATION PROBLEM; LOCAL MEMORY; MOBILE AD HOC WIRELESS NETWORKS; MOBILE AD-HOC NETWORKS; MOBILE-COMPUTING; NEW STATIONS; RECONFIGURABLE NETWORK; SMALL COMPONENTS; STARTUP TIME; WIRED NETWORKS;

MOBILE AD HOC NETWORKS;

EID: 15544379037     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. U. Black, Mobile and Wireless Networks, Prentice-Hall, Upper Saddle River, NJ, 1996.
2. J. I. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Trans. Inform. Theory, IT-25, 505-515, 1979.
3. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter. Deterministic broadcasting in Ad Hoc Networks. Distributed Computing, vol. 15, 2002, pp. 27-38.
4. R. Dechter and L. Kleinrock, Broadcast communication and distributed algorithms, IEEE Trans. Comput., C-35, 210-219, 1986.
5. K. Feher, Wireless digital communications, Prentice-Hall PTR, Upper Saddle River, NJ, 1995.
6. W. Feller. An Introduction to Probability Theory and Its Applications. John Wiley, New-York, 1957.
7. P. Flajolet and R. Sedgewick. Introduction to the Analysis of Algorithms. Addison-Wesley, 1996.
8. V. K. Garg and J. E. Wilkes, Wireless and personal communications systems, Prentice-Hall PTR, Upper Saddle River, NJ, 1996.
9. T. Hayashi, K. Nakano and S. Olariu. Randomized Initialization Protocols for Ad Hoc Networks. IEEE Trans. Parallel Distr. Syst. vol 11, pp.749-759, 2000.
10. T. Hayashi, K. Nakano and S. Olariu. Randomized Initialization Protocols for Packet Radio Networks. IPPS/SPDP'99
11. J. Jaja. Introduction to Parallel Algorithms. Addison-Wesley, 1992.
12. D. E. Knuth. The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
13. th Intern. Conf. Networks Protocols (ICNP), 2001.
14. N. Malpani, J. L. Welch, N. Vaidya. Leader Election Algorithms for Mobile Ad Hoc Networks. In DIALM for Mobility 2000, pp. 96-103
15. J. M. Marberg and E. Gafni, Sorting and selection in multichannel broadcast network. (ICPP), St Charles, Illinois, August 1995, 846-850.
16. J.F. Myoupo, Efficient Algorithms on the Coarse-Grain Broadcast Communication model with few Channels. IASTED PDCSs, Las Vegas, 1998
17. K. Nakano. Optimal Initializing Algorithms for reconfigurable mesh. Parallel Distr. Comput. Vol 24, pp. 218-223, 1995.
18. K. Nakano, S. Olariu and J. L. Schwing, Broadcast-Efficient Protocols for Mobile Radio Networks. IEEE T.P.DS., vol. 10, pp. 12, 1276-1289, 1999.
19. J. E. Walter, J. L. Welch, N. H. Vaidya. A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. To appear in Wireless Networks.
20. L. Comtet. Advanced Combinatorics. Reidel Dodrecht, 1974.
21. J.F. Myoupo, V. Ravelomanana, L. Thimonier. Average Case Analysis Based-Protocols to Initialize Packet Radio Networks. To appear in Wireless Communication and Mobile.