Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

MOTOROLA: MObility TOlerable ROute seLection Algorithm in wireless networks

MOTOROLA: MObility TOlerable ROute seLection Algorithm in wireless networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

In wireless networks, routing algorithms need to be tolerable to network dynamics. Existing route selection mechanisms suffer from a lack of considerations of stability and its induced routing overhead. Stabilities on route selection, traffic engineering and transmission schedule are fundamental issues in achieving a mobility-tolerable wireless network. In this study, the authors propose a mobility-tolerable paradigm (named ‘MOTOROLA’) in building a stable route level coordination algorithm for dynamic routing and scheduling. In MOTOROLA, mobility-awareness modules explore the mobility parameters and the link duration time, purely by adaptive beacon messages. Transitory links are mitigated based on threshold value of link duration. The route level resource allocation algorithm is also tolerable to network topology changes and the rescheduling costs are minimised in time scale. Analytical and simulation results show that because of mobility-awareness ability and route stability, MOTOROLA could improve network efficiency by transitory links' mitigation and coordinative route restoration.

Inspec keywords: radio networks; telecommunication network reliability; telecommunication network routing; scheduling; mobile radio

Other keywords: mobility-awareness; MOTOROLA; traffic engineering; transitory links; transmission schedule; rescheduling costs; wireless networks; mobility tolerable route selection algorithm; stable route level coordination algorithm; dynamic routing; dynamic scheduling; adaptive beacon messages

Subjects: Communication network design, planning and routing; Mobile radio systems

References

    1. 1)
      • Y.-J. Suh , W.-I. Kim , D.-H. Kwon . GPS-based reliable routing algorithms for ad hoc networks. ‘The handbook of ad hoc wireless networks’ , 361 - 374
    2. 2)
      • Key, P., Massouli, L., Towsley, D.: `Path selection and multipath congestion control', IEEE Infocom 2007, May 2007, Alaska.
    3. 3)
      • Kyasanur, P., Vaidya, N.H.: `Capacity of multi-channel wireless networks: impact of number of channels and interfaces', Proc. ACM Mobicom, 2005.
    4. 4)
      • T.S. Rappaport . (1995) Wireless communication: principles & practice.
    5. 5)
      • Pei, G., Gerla, M., Hong, X.: `LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility', Proc. First ACM Int. Symp. Mobile Ad Hoc Networking and Computing, 2000.
    6. 6)
    7. 7)
      • D. Hochbaum . (1997) Approximation algorithms for NP-hard problems.
    8. 8)
      • Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: `Strongly stable matchings in time ', Proc. 21st Int. Symp. on Theoretical Aspects of Computer Science, STACS 2004, p. 222–233, Springer-Verlag, 2004 (LNCS, 2996).
    9. 9)
      • Royer, E.M., Melliar-Smith, P.M., Moser, L.E.: `An analysis of the optimum node density for ad hoc mobile networks', Proc. IEEE Int. Conf. Communications, June 2001, Helsinki, Finland.
    10. 10)
      • M. Patel , R. Chandrasekaran , S. Venkatesan . Improved quasi-path restoration in mesh networks. IEEE/ACM Transactions on Networking , 1 , 144 - 156
    11. 11)
      • T.H. Cormen , C.E. Leiserson , R.L. Rivest , C. Stein . (2009) Introduction to algorithms.
    12. 12)
      • X. Huang , J. Wang , Y. Fang . (2007) Achieving maximum flow in interference-aware wireless sensor networks with smart antennas, Ad hoc networks.
    13. 13)
      • Perkins, C.E., Royer, E.M.: `Ad hoc on-demand distance vector routing', Proc. second IEEE Workshop on Mobile Computing Systems and Applications, February 1999, New Orleans, LA, p. 90–100.
    14. 14)
      • Kodialam, M., Nandagopal, T.: `Characterizing the capacity region in multi-radio multi-channel wireless mesh networks', Proc. ACM (Mobicom'05), 2005.
    15. 15)
      • T.M. Cover , J.A. Thomas . (2006) Elements of information theory.
    16. 16)
      • D.B. Johnson , D.A. Maltz , J. Broch , E.P. Charles . (2001) DSR: the dynamic source routing protocol for multi-hop wireless ad hoc networks, Ad hoc networking.
    17. 17)
      • Samar, P., Wicker, S.B.: `On the behavior of communication links of a node in a multi-hop mobile environment', MobiHoc04, 24C26 May 2004, Roppongi, Japan.
    18. 18)
      • Wang, W., Wang, Y., Li, X-Y., Song, W-Z., Frider, O.: `Efficient interference-aware TDMA link scheduling for static wireless networks', Proc. ACM (Mobicom'06), 2006.
    19. 19)
      • Alicherry, M., Bhatia, R., Li, L.E.: `Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks', Proc. ACM (Mobicom'05), 2005.
    20. 20)
      • H. Cai , D.Y. Eun . Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET. ACM Mobicom
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2009.0141
Loading

Related content

content/journals/10.1049/iet-com.2009.0141
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address