http://iet.metastore.ingenta.com
1887

access icon openaccess Context aware routing management architecture for airborne networks

Loading full text...

Full text loading...

/deliver/fulltext/iet-net/5/4/IET-NET.2015.0064.html;jsessionid=2dijqsv0b4juf.x-iet-live-01?itemId=%2fcontent%2fjournals%2f10.1049%2fiet-net.2015.0064&mimeType=html&fmt=ahah

References

    1. 1)
      • 1. Willard, D.: ‘Network management architecture for the objective airborne network’. IEEE Military Communications Conf., October 2004, vol. 1, pp. 388393.
    2. 2)
      • 2. Naveen, K., Karuppanan, K.: ‘Mobile cluster assisted routing for urban vanet’. Int. Conf. on Recent Trends in Information Technology (ICRTIT), June 2011, pp. 296300.
    3. 3)
      • 3. Pathak, S., Jain, S.: ‘A survey: on unicast routing protocols for mobile ad hoc network’, Int. J. Emerging Technol. Adv. Eng., 2013, 3, (1), pp. 22502459.
    4. 4)
      • 4. Tiwari, A.: ‘Context aware routing and management architecture (carma) for airborne networks’. Technical report, Utopia Compression, 2010.
    5. 5)
      • 5. JCS: ‘Joint publication 3–30. Command and control for joint air operations’. Technical report, Joint Chiefs of Staff, 2014.
    6. 6)
      • 6. DoD: ‘Department of defense directive (DODD) 8100.1’. Technical report, Department of Defense, 2002.
    7. 7)
      • 7. Sang, A., qi Li, S.: ‘A predictability analysis of network traffic’. INFOCOM 2000. Proc. IEEE 19th Annual Joint Conf. of the Computer and Communications Societies, 2000, vol. 1, pp. 342351.
    8. 8)
    9. 9)
      • 9. Haught, J., Hopkinson, K., Hemmes, J.: ‘The modeling and simulation of a network controller based on a router queue-size predictions’, J. Def. Model. Simul., Appl. Methodol. Technol., 2013, 10, (2), pp. 105115.
    10. 10)
      • 10. Murray, M., Quigley, J.: ‘Automatically generating a distributed 3D battlespace using USMTF and XML-MTF air tasking order, extensible markup language (XML) and virtual reality modeling language (VRML)’. Master's thesis, Naval Postgraduate School, 2000.
    11. 11)
      • 11. Wang, Z., Crowcroft, J.: ‘Analysis of shortest-path routing algorithms in a dynamic network environment’, ACM SIGCOMM Comput. Commun. Rev., 1992, 22, (2), p. 71.
    12. 12)
      • 12. Scheideler, C.: ‘Johns Hopkins University CS 600.348-Lecture Notes in Theory of Network Communication: Network Flows III – Multicommodity Flows, Fall 2003. Available at http://www.cs.jhu.edu/_scheideler/courses/600.348F03/.
    13. 13)
      • 13. Even, S., Itai, A., Shamir, A.: ‘On the complexity of time table and multi-commodity flow problems’. 16th Annual Symp. on Foundations of Computer Science, 1975, October 1975, pp. 184193.
    14. 14)
      • 14. Goldberg, A., Oldham, J., Plotkin, S., Stein, C.: ‘An implementation of a combinatorial approximation algorithm for minimum cost multicommodity flow’, in Bixby, R.E., Boyd, E.A., Rios-Mercado, R.Z. (Eds.): ‘Integer programming and Combinatorial Optimization’ (Springer, vol. 1412, 1998), pp. 338–352.
    15. 15)
      • 15. Kolliopoulos, S.G.: ‘Edge-disjoint paths and unsplittable flow’ inGonzalez, T. (Ed.), ‘Handbook of approximation algorithms and metaheurististics’ (Chapman & Hall, Boca Raton, FL, USA, 2007), pp. 711, ch. 57.
    16. 16)
    17. 17)
      • 17. Betances, J.: ‘Context aware routing management architecture for airborne networks’, Master's thesis, Air Force Institute of Technology, 2012.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-net.2015.0064
Loading

Related content

content/journals/10.1049/iet-net.2015.0064
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address