메뉴 건너뛰기




Volumn 46, Issue 11, 2008, Pages 55-61

Network science based approaches to design and analyze MANETs for military applications

Author keywords

Algorithm design and analysis; Approximation algorithms; Mobile computing; Network topology; Quality of service; Routing; Topology

Indexed keywords

ALGORITHM DESIGN AND ANALYSIS; DESIGN TRADES; JOINT PROJECTS; MOBILE AD HOC NETWORKINGS; MOBILE AD HOC NETWORKS; NETWORK ENGINEERINGS; NETWORK SCIENCES; NETWORK TOPOLOGY; PERFORMANCE OBJECTIVES; ROUTING; STRINGENT REQUIREMENTS; SYSTEM DESIGNS; SYSTEMATIC DESIGNS; SYSTEMATIC METHODOLOGIES; TELCORDIA TECHNOLOGIES; TOOLSET;

EID: 57449089139     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2008.4689245     Document Type: Article
Times cited : (25)

References (9)
  • 1
    • 78650760157 scopus 로고    scopus 로고
    • NEDAT - A Toolset to Design and Analyze Future Force Networks
    • accepted for publication in, San Diego, CA, Nov. 17-19
    • L. Kant et al., "NEDAT - A Toolset to Design and Analyze Future Force Networks," accepted for publication in MILCOM '08, San Diego, CA, Nov. 17-19, 2008.
    • (2008) MILCOM '08
    • Kant, L.1
  • 2
    • 26444479778 scopus 로고
    • Optimization by Simulated Annealing
    • 13 May
    • S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by Simulated Annealing," Science 220 (13 May 1983), pp. 671-80.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt Jr., C.D.2    Vecchi, M.P.3
  • 3
    • 4143071493 scopus 로고    scopus 로고
    • Applying Simulated Annealing for Domain Generation in Ad Hoc Networks
    • Paris, France
    • K. Manousakis, A. J. McAuley, and R. Morera, "Applying Simulated Annealing for Domain Generation in Ad Hoc Networks," ICC '04, Paris, France, 2004.
    • (2004) ICC '04
    • Manousakis, K.1    McAuley, A.J.2    Morera, R.3
  • 4
    • 34147120474 scopus 로고
    • A Note on Two Problems in Connexion with Graphs
    • E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, 1959, pp. 269-71.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 33947538745 scopus 로고    scopus 로고
    • Finding, a Path Subject to Many Additive QoS Constraints
    • Feb
    • G. Xue et al., "Finding, a Path Subject to Many Additive QoS Constraints," IEEE/ACM Trans. Net., vol. 15, no. 1, Feb. 2007, pp. 201-11.
    • (2007) IEEE/ACM Trans. Net , vol.15 , Issue.1 , pp. 201-211
    • Xue, G.1
  • 6
    • 50649101914 scopus 로고    scopus 로고
    • Flexible QoS Route Selection with Diverse Objectives and Constraints
    • Enschede, The Netherlands, June
    • A. McAuley, K. Manousakis, and L. Kant, "Flexible QoS Route Selection with Diverse Objectives and Constraints," IWQoS '08, Enschede, The Netherlands, June 2008.
    • (2008) IWQoS '08
    • McAuley, A.1    Manousakis, K.2    Kant, L.3
  • 7
    • 0033282571 scopus 로고    scopus 로고
    • USAP Multiple Access: Dynamic Resource Allocation for Mobile Multihop Multichannel Wireless Networking
    • 99, Oct
    • C. D. Young, "USAP Multiple Access: Dynamic Resource Allocation for Mobile Multihop Multichannel Wireless Networking," Proc. IEEE, MILCOM '99, Oct. 1999.
    • (1999) Proc. IEEE, MILCOM
    • Young, C.D.1
  • 8
    • 0034447927 scopus 로고    scopus 로고
    • USAP Multiple Broadcast Access:, Transmitter- and Receiver-Directed Dynamic Resource Allocation for Mobile, Multihop, Multichannel, Wireless Networking
    • C. D. Young, "USAP Multiple Broadcast Access:, Transmitter- and Receiver-Directed Dynamic Resource Allocation for Mobile, Multihop, Multichannel, Wireless Networking," MILCOM 2000.
    • MILCOM 2000
    • Young, C.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.