Opportunistic information dissemination in mobile ad-hoc networks: The profit of global synchrony

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6343 LNCS, Issue , 2010, Pages 374-388

  Anta, Antonio Fernández ^a,b   Milani, Alessia ^c   Mosteiro, Miguel A ^b,d   Zaks, Shmuel ^e  

^a IMDEA NETWORKS INSTITUTE   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^d RUTGERS UNIVERSITY   (United States)

^e TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC PROTOCOLS; GLOBAL TIME; LOWER AND UPPER BOUNDS; LOWER BOUNDS; TIME COMPLEXITY; TIME SLOTS;

INFORMATION DISSEMINATION; MOBILE AD HOC NETWORKS; NETWORK PROTOCOLS; PROFITABILITY;

AD HOC NETWORKS;

EID: 78649807457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15763-9_34     Document Type: Conference Paper

References (25)

1. Baldoni, R., Ioannidou, K., Milani, A.: Mobility versus the cost of geocasting in mobile ad-hoc networks. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 48-62. Springer, Heidelberg (2007)
2. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104-126 (1992)
3. Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10(3), 129-135 (1997)
4. Chlebus, B., Ga̧sieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: Proc. of 5th Intl. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 44-51 (2001)
5. Chlebus, B.S., Kowalski, D.R., Radzik, T.: On many-to-many communication in packet radio networks. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 260-274. Springer, Heidelberg (2006)
6. Clementi, A.E.F., Pasquale, F., Monti, A., Silvestri, R.: Communication in dynamic radio networks. In: Proc. 26th Ann. ACMSymp. on Principles of Distributed Computing, pp. 205-214 (2007)
7. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5, 187-201 (2007)
8. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 27-34 (2003)
9. Farach-Colton, M., Mosteiro, M.A.: Sensor network gossiping or how to break the broadcast lower bound. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 232-243. Springer, Heidelberg (2007)
10. Fernández Anta, A., Milani, A.: Bounds for deterministic reliable geocast in mobile ad-hoc networks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 164-183. Springer, Heidelberg (2008)
11. Fernández Anta, A., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic information dissemination in mobile ad-hoc networks: The profit of global synchrony. Technical Report RoSaC-2010-1, GSyC, Universidad Rey Juan Carlos (2010)
12. Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic communication in the weak sensor model. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 119-131. Springer, Heidelberg (2007)
13. Gasieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic m2m multicast in radio networks. In: Proc. of 31st Intl. Colloquium on Automata Languages and Programming, pp. 670-682 (2004)
14. Gupta, S.K.S., Srimani, P.K.: An adaptive protocol for reliable multicast in mobile multi-hop radio networks. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999)
15. Jinag, X., Camp, T.: A review of geocasting protocols for a mobile ad hoc network. In: Proceedings of Grace Hopper Celebration (2002)
16. Kowalski, D.R.: On selection problem in radio networks. In: Proc. 24th Ann. ACM Symp. on Principles of Distributed Computing, pp. 158-166 (2005)
17. Kowalski, D.R., Pelc, A.: Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, 355-371 (2005)
18. Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27(3), 702-712 (1998)
19. Mohsin, M., Cavin, D., Sasson, Y., Prakash, R., Schiper, A.: Reliable broadcast in wireless mobile ad hoc networks. In: Proceedings of the 39th Hawaii International Conference on System Sciences, p. 233 (2006)
20. Pagani, E., Rossi, G.P.: Reliable broadcast in mobile multihop packet networks. In: Proc. of the 3rd ACM Ann. Intl. Conference on Mobile Computing and Networking, pp. 34-42 (1997)
21. Peleg, D., Radzik, T.: Time-efficient broadcast in radio networks. In: Koster, A.M.C.A., Muñoz, X. (eds.) Graphs and Algorithms in Communication Networks, ch, 12, pp. 315-339. Springer, Heidelberg (2009)
22. Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine 44(11), 134-141 (2006) (Pubitemid 46405650)
23. Prakash, R., Schiper, A., Mohsin, M., Cavin, D., Sasson, Y.: A lower bound for broadcasting in mobile ad hoc networks. Technical report, Ecole Polytechnique Federale de Lausanne (2004)
24. Roberts, L.G.: Aloha packet system with and without slots and capture. Computer Communication Review 5(2), 28-42 (1975)
25. Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics 6(1), 64-94 (1962)