Time-space opportunistic routing in wireless Ad hoc networks: Algorithms and performance optimization by stochastic geometry

Computer Journal

Volumn 53, Issue 5, 2010, Pages 592-609

  Baccelli, François ^a   Błaszczyszyn, Bartłomiej ^b   Mühlethaler, Paul ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF WROC AW   (Poland)

^c INRIA   (France)

Author keywords

Routing; Stochastic geometry; Wireless networks

Indexed keywords

ANALYTICAL MODEL; APRIORI; CLASSICAL MECHANISM; DISTRIBUTED ALGORITHM; GEOGRAPHICAL POSITIONS; MEDIUM ACCESS PROTOCOL; OPPORTUNISTIC ROUTING; PERFORMANCE EVALUATION; PERFORMANCE OPTIMIZATIONS; RELAY NODE; ROUTING; ROUTING SCHEME; ROUTING STRATEGIES; ROUTING TECHNIQUES; SELECTION PROCEDURES; SHORTEST PATH ROUTING; STOCHASTIC GEOMETRY; TIME-SPACE;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; MESH NETWORKING; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMIZATION; ROUTING PROTOCOLS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TRANSMITTERS; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 77952961543     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxp049     Document Type: Article

References (28)

1. Baccelli, F., Blaszczyszyn, B. and Mühlethaler, P. (2008) On the Performance of Time-Space Opportunistic Routing in Multihop Mobile Ad hoc Networks. Proc. of WiOpt, Berlin.
2. Baccelli, F., Błeaszczyszyn, B., Ermel, E. and Mühlethaler, P. (2008) An optimized relay self selection technique for opportunistic routing in mobile ad hoc networks. Proc. of European Wireless Conference, Prague.
3. Adjih, C., Clausen, T., Jacquet, P., Laouiti, A., Minet, P., Muhlethaler, P., Qayyum, A. andViennot, L. (2003). Optimized Link-State Routing Protocol. RFC 3626, October. http://www.ietf.org/ rfc/rfc3626.txt.
4. Dijkstra, E.W. (1959)A note on two problems in connexion with graphs. Numer. Math. 1, 269-271.
5. Perkins, C., Belding-Royer, E. and Das, S. (2003). Ad hoc Ondemand Distance Vector (AODV) Routing. RFC 3561, July. www.ietf.org/rfc/rfc3561.txt.
6. Karp, B. (2000) Geographic routing for wireless networks. PhD Thesis, Harvard University.
7. Finn, G.G. (1987) Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. Technical Report ISI/RR-87-180, Information Sciences Institute.
8. Stojmenovic, I. and Lin, X. (2001) Loop-free hybrid singlepath/ flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans. Parallel Distrib. Syst. 12, 1023-1032.
9. Stojmenovic, I. and Lin, X. (2001) Power-aware localized routing in wireless networks. IEEE Trans. Parallel Distrib. Syst. 12, 1122-1133. (Pubitemid 33137923)
10. Karp, B. and Kung, H.T. (2000) GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. 6th Annual Int. Conf. Mobile Computing and Networking, MobiCom 2000, Boston, MA, USA, August 6-11, pp. 243-254. ACM/IEEE.
11. Blum, B., He, T., Son, S. and Stankovic, J. (2003) IGF: A State-free Robust Communication Protocol for Wireless Sensor Networks. Technical Report CS-2003-2011, Department of Computer Science, University of Virginia, USA.
12. Baccelli, F., Blaszczyszyn, B. and Mühlethaler, P. (2003) An Aloha Protocol for Multihop Mobile Wireless Networks. Proc. Allerton Conf., University of Illinois, Urbana Champaign, November.
13. Biswas, S. and Morris, R. Exor: Opportunistic Multi-hop Routing for Wireless Networks. SIGCOMM'05, New York, NY, USA, pp. 133-144. ACM Press.
14. Baccelli, F., Blaszczyszyn, B. and Muhlethaler, P. (2006) An aloha protocol for multihop mobile wireless networks. IEEE Trans. Inf. Theory, 52, 421-436.
15. Jacquet, P., Minet, P., Mühlethaler, P. and Rivierre, N. (1997) Priority and collision detection with active signalling: The channel access mechanism of HIPERLAN. Wirel. Pers. Commun., January, 11-25.
16. European Telecommunications Standards Institute (ETSI) (1996), High PERformance Radio LAN HIPERLAN functional specifications, ETS 300-654, June.
17. Bharghavan, V., Demers, A., Shenker, S. and Zhang, L. (1994) Macaw: A Media Access Protocol for Wireless LAN's. SIGCOMM'94: Proc. Conf. Communications Architectures, Protocols and Applications, London, September, pp. 212-225.
18. Lin, C. and Gerla, M. (2002) Maca/pr: An Asynchronous Multimedia Multihop Wireless Network. Proc. IEEE INFOCOM'97, Kobe, Japan, pp. 975-985.
19. Deng J. and Haas Z. (1998) Dual Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks. Proceedings IEEE ICUPC'98, Florence, Italy, October 5-9. citeseer.nj.nec.com/deng98dual.html.
20. Bertsekas, D. and Gallager, R. (1988) Data Networks. Prentice-Hall.
21. Tse, D. and Viswanath, P. (2005) Fundamentals of Wireless Communication. Cambridge University Press.
22. Muhlethaler, P. and Najid, A. (2003) Optimization of CSMA Multihop Ad hoc Network. RR 4928, INRIA. Also published in EuropeanWireless 2003.
23. Ermel, E., Fladenmuller, A., Pujolle, G. and Cotton, A. (2004) Improved Position Estimation in Wireless Heterogeneous Networks. Third International IFIP-TC 6 Networking Conference, Athens, May.
24. Gupta, P. and Kumar, P.R. (2000) The capacity of wireless networks. IEEE Trans. Inf. Theory, 46, 388-404.
25. Baccelli, F. and Blaszczyszyn, B. (2001) On a coverage process ranging from the Boolean model to the Poisson Voronoi tessellation, with applications to wireless communications. Adv. Appl. Probab. 33, 293-323.
26. Stoyan, D., Kendall, W. and Mecke, J. (1995) Stochastic Geometry and Its Applications.Wiley, Chichester.
27. Bordenave, C. (2006) Navigation on a Poisson Point Process. Technical Report RR-5790, INRIA.
28. David, J.A. and Michael, J.S. (2004) The objective method: probabilistic combinatorial optimization and local weak convergence. In Kesten, H. (ed.), Probability on discrete structures, Springer, pp. 1-72.