BLR: beacon-less routing algorithm for mobile ad hoc networks

More documents

Recommendations

Info

BLR for static networks, since data packets are delayed at each node in BLR. The advantage of BLR in terms of endto-end delay is that the performance is basically independent of the mobility. Packets are delivered after approximately 30 ms even for high mobility in our simulations. It is worth noting that the end-to-end delay of BLR is even less than the Max_Delay set to 40 ms for one hop. Due to the high node density, the probability is high that there is always a node with a large progress within the forwarding area which computes a DFD much shorter than Max_Delay. 6. Conclusion Conventional position-based routing protocol suffer from several drawbacks caused by the proactive broadcasting of beacon-messages, such as outdated neighbor tables and control packet transmissions which degrade network performance. The BLR routing protocol described in this paper avoids any beaconing mechanism, i.e. nodes do not need knowledge about their neighborhood. Packets are broadcasted and the next hop is chosen in a completely distributed way by introducing a Dynamic Propagation Delay at each receiving node depending on its relative position in the forwarding area. Some limitations and fundamental properties of BLR are derived, which demonstrate that network performance is highly dependent on node density and transmission range. In high node density networks or with large transmission ranges, BLR is capable of operating in greedy mode for a long time. However, since BLR operates on the actual topology and is completely stateless, the performance is almost independent of node mobility. Analytical results are supported by simulations, which show a superior performance of BLR compared to GPSR and LAR1. 7. Outlook In future works, we will extend the current implementation of the BLR protocol with options and variations discussed in this paper (backup mode, unicast packets, different forwarding areas and delay functions, etc.) in order to investigate and demonstrate different scenarios such as low node density and high traffic volume. A further direction of research is the use of directional antennas. Directional antennas seem to be well suited for BLR since only a part of the actual transmission range is used to find a next hop, namely the forwarding area. Currently, 802.11 DCF is the most widely used MAC-protocol for ad hoc networks. The overhead introduced with the RTS-CTS- DATA-ACK dialog renders several advantages provided by BLR useless. Therefore, we plan to investigate MACprotocols adapted to our routing protocol. Multiple access schemes (e.g. CDMA) could be exploited to increase the performance and capacity of the network. M. Heissenbüttel et al. / Computer Communications 27 (2004) 1076–1086 1085 Acknowledgements We would like to thank Hans U. Schmid for his valuable comments and review of the paper. The work presented in this paper was supported (in part) by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322. References [1] Mobile ad-hoc networks (manet) Working Group, Internet Engineering Task Force, September 2003, [Online]. Available: http://www. ietf.org/html.charters/manet-charter.html [2] C.E. Perkins, E. Royer, Ad-hoc on-demand distance vector routing, in: Proceedings of WMCSA ’99, New Orleans, USA, February 1999, pp. 90–100. [3] D.B. Johnson, D.A. Maltz, J. Broch, DSR: the dynamic source routing protocol for multihop wireless ad hoc networks, Ad Hoc Networking, Addison-Wesley, Reading, MA, 2001, ch. 5, pp. 139–172. [4] V.D. Park, M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proceedings of INFO- COM ’97, Kobe, Japan, April 1997, pp. 1405–1413. [5] C. Perkins, P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: Proceedings of ACM/SIGCOMM ’94 Conference on Communications Architecture, Protocols and Applications, London, UK, August 1994, pp. 234–244. [6] B. Bellur, R.G. Ogier, A reliable, efficient topology broadcast protocol for dynamic networks, in: Proceedings of INFOCOM ’99, New York, USA, March 1999, pp. 178–186. [7] T. Clausen, P. Jacquet, P. Muhlethaler, A. Laouiti, A. Qayyum, L. Viennot, Optimized link state routing protocol, in: Proceedings of INMIC ’01, Lahore, Pakistan, December 2001. [8] Z.J. Haas, M.R. Pearlman, A hybrid framework for routing in ad hoc networks, in: Ad Hoc Networking, Addison-Wesley, 2002, pp. 221– 253. [9] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, T. wei Chen, Scalable routing strategies for ad hoc wireless networks, IEEE J. Select. Areas Commun. 17 (8) (1999) 1369–1379. [10] G. Pei, M. Gerla, T.-W. Chen, Fisheye state routing in mobile ad hoc networks, in Proceedings of ICDCS ’00, Taipei, Taiwan, April 2000, pp. 71–78. [11] P. Bose, P. Morin, I. Stojmenovic, J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, ACM/Baltzer Wireless Networks 7 (6) (2001) 609–616. [12] B. Karp, H.T. Kung, GPSR: Greedy perimeter stateless routing for wireless networks, in: Proceedings of MOBICOM ’00, Boston, USA, August 2000, pp. 243–254. [13] Y.-B. Ko, N.H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, ACM/Baltzer Wireless Networks 6 (4) (2000) 307–321. [14] L. Blazevic, S. Giordano, J.-Y. Le Boudec, Self organized terminode routing, Cluster Comput. J. 5 (2) (2002) 205–218. [15] F. Kuhn, R. Wattenhofer, A. Zollinger, Asymptotically optimal geometric mobile ad-hoc routing, in: Proceedings of DIALM ’02, Atlanta, USA, September 2002, pp. 24–33. [16] M. Grossglauser, M. Vetterli, Locating nodes with ease: mobility diffusion of last encounters in ad hoc networks, in: Proceedings INFOCOM ’03, San Francisco, USA, March 2003.
1086 [17] S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A. Woodward, A distance routing effect algorithm for mobility (DREAM), in: Proceedings of MOBICOM ’98, Dallas, Texas, USA, October 1998, pp. 76–84. [18] J.-P. Hubaux, J.-Y. Le Boudec, T. Gross, M. Vetterli, Towards selforganized mobile ad-hoc networks: the terminodes project, IEEE Commun. Mag. 39 (1) (2001) 118–124. [19] P. Gupta, P. Kumar, The capacity of wireless networks, IEEE Trans. Inform. Theory 46 (2) (2000) 388–404. [20] S. Giordano, I. Stojmenovic, L. Blazevic, Position based routing algorithms for ad hoc networks: a taxonomy, Ad Hoc Wireless Networking, Kluwer, Dordecht, 2003. [21] M. Mauve, J. Widmer, H. Hartenstein, A survey on position-based routing in mobile ad-hoc networks, IEEE Network 15 (6) (2001) 30–39. [22] R.E. Christian Maihöfer, Virtual warning signs: a geocast enabled service for ad hoc networks, in: Proceedings of ASWN ’03, Bern, Switzerland, July 2003, pp. 135–147. [23] Y.-B. Ko, N.H. Vaidya, Geocasting in mobile ad hoc networks: location-based multicast algorithms, A&M University, Texas, USA, Technical Report TR-98-018, September 1998. [24] J.C. Navas, T. Imielinski, Geocast—geographic addressing and routing, in: Proceedings of MOBICOM ’97, Budapest, Hungary, September 1997, pp. 66–76. [25] H. Takagi, L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Trans. Commun. 32 (3) (1984) 246–257. [26] T.-C. Hou, V. Li, Transmission range control in multihop packet radio networks, IEEE Trans. Commun. 34 (1) (1986) 38–44. [27] R. Nelson, L. Kleinrock, The spatial capacity of a slotted ALOHA multihop packet radio network with capture, IEEE Trans. Commun. 32 (6) (1984) 684–694. [28] I. Stojmenovic, X. Lin, Power-aware localized routing in wireless networks, IEEE Trans. Parallel Distrib. Syst. 12 (11) (2001) 1122–1133. [29] P. Bose, P. Morin, Online routing in triangulations, in: Proceedings of ISAAC ’99, Chennai, India, December 1999, pp. 113–122. [30] P. Bose, P. Morin, A. Brodnik, S. Carlsson, E.D. Demaine, R. Fleischer, J.I. Munro, A. Lopez-Ortiz, Online routing in convex subdivisions, in: Proceedings of ISAAC ’00, Taipei, Taiwan, December 2000, pp. 47–59. [31] R. Jain, A. Puri, R. Sengupta, Geographical routing using partial information for wireless ad hoc networks, IEEE Personal Commun. Mag. 8 (1) (2001) 48–57. [32] S. Giordano, M. Hamdi, Mobility management: the virtual home region, EPFL, Lausanne, Switzerland, Technical Report SSC/1999/ 037, October 1999. M. Heissenbüttel et al. / Computer Communications 27 (2004) 1076–1086 [33] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris, A scalable location service for geographic ad-hoc routing, in: Proceedings of MOBICOM ’00, Boston, USA, August 2000, pp. 120–130. [34] I. Stojmenovic, B. Vukojevic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, SITE, University of Ottawa, Ottawa, Canada, Technical Report TR-99-09, September 1999. [35] L.M. Feeney, M. Nilsson, Investigating the energy consumption of a wireless network interface in an ad hoc networking environment, in: Proceedings of INFOCOM ’01, Anchorage, USA, April 2001. [36] M. Stemm, R.H. Katz, Measuring and reducing energy consumption of network interfaces in hand-held devices, IEICE Trans. Commun. E80-B (8) (1997) 1125–1131. [37] M. Heissenbüttel, T. Braun, A novel position-based and beacon-less routing algorithm for mobile ad-hoc networks, in: Proceedings of ASWN ’03, Bern, Switzerland, July 2003, pp. 197–210. [38] H. Füssler, J. Widmer, M. Käsemann, M. Mauve, H. Hartenstein, beaconless position-based routing for mobile ad-hoc networks, Department for Mathematics and Computer Science, University of Mannheim, Germany, Technical Report TR-03-001, 2003. [39] B. Blum, T. He, S. Son, J. Stankovic, IGF: a state-free robust communication protocol for wireless sensor networks, Department of Computer Science, University of Virginia, USA, Technical Report CS-2003-11, 2003. [40] S. Capkun, M. Hamdi, J.-P. Hubaux, GPS-free positioning in mobile ad-hoc networks, Cluster Comput. J. 5 (2) (2002) 118–124. [41] J. Jubin, J.D. Tornow, The DARPA packet radio network protocols, Proc. IEEE 75 (1) (1987) 21–32. [42] J. Nonnenmacher, E.W. Biersack, Scalable feedback for large groups, IEEE/ACM Trans. Networking 7 (3) (1999) 375–386. [43] M. Heissenbüttel, T. Braun, Ants-based routing in large-scale mobile ad-hoc networks, in KiVS ’03, Leipzig, Germany, February 2003, pp. 91–99. [44] O. Dousse, P. Thiran, M. Hasler, Connectivity in ad-hoc and hybrid networks, in: Proceedings of INFOCOM ’02, New York, USA, June 2002. [45] M. Heissenbüttel, T. Braun, BLR: a beacon-less routing algorithm for mobile ad-hoc networks, Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland, Technical Report IAM-03-001, March 2003. [46] Qualnet, Scalable Network Technologies (SNT), [Online] Available: http://www.qualnet.com/ [47] J. Yoon, M. Liu, B. Noble, Random waypoint considered harmful, in: Proceedings of INFOCOM ’03, San Francisco, USA, March 2003.
Page 1 and 2: BLR: beacon-less routing algorithm
Page 3 and 4: 1078 nevertheless interrupts sleep
Page 5 and 6: 1080 broadcasted at full transmissi
Page 7 and 8: 1082 Fig. 4. Number of hops vs. nod
Page 9: 1084 at 180 s, after the network ha

BLR: beacon-less routing algorithm for mobile ad hoc networks

Create successful ePaper yourself

Delete template?

Save as template?