Building a reference combinatorial model for MANETs

IEEE Network

Volumn 18, Issue 5, 2004, Pages 24-29

  Ferreira, Afonso ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; MOBILE COMPUTING; NETWORK PROTOCOLS; POLYNOMIALS; TELECOMMUNICATION SERVICES; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

COMBINATORIAL MODEL; COMPLEX AD HOC NETWORKS; DYNAMIC NETWORKS; MOBILE AD HOC NETWORKS (MANETS);

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 6444221582     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/MNET.2004.1337732     Document Type: Article

References (14)

1. I. Stojmenovic, Ed., Handbook of Wireless Networks and Mobile Computing, John Wiley & Sons, Feb. 2002.
2. National Science Foundation, USA, Report of the National Science Foundation Workshop on Fundamental Research in Networking, 2003.
3. L. R. Ford and D. R. Fulkerson, "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, vol 6, 1958, pp 419-33.
4. A. Faragò and V. R. Syrotiuk, "MERIT: A Unified Framework for Routing Protocol Assessment in Mobile ad hoc Networks," Proc ACM Mobicom, 2001, pp 53-60.
5. B. Bui-Xuan, A. Ferreira, and A. Jarry, "Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks," Int'l. J. Foundations of Computer Science, vol. 14, no. 2, Apr. 2003, pp. 267-85.
6. A. Ferreira and A. Jarry, "Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem," Proc. WiOpt '04 - Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Cambridge, UK, March 2004.
7. B. Kotnyek, "An Annotated Overview of Dynamic Network Flows," Technical Report 4936, INRIA, 2003.
8. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, The MIT Press, 1990
9. S. Bhadra and A. Ferreira, "Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks," S. Pierre, M. Barbeau, and E. Kranakis, Eds., Proc. Ad Hoc Now'03, vol. 2865 of Lecture Notes in Computer Science, Montreal, Oct. 2003, Springer Verlag, pp 259-70.
10. W. T. Chen and N. F. Huang, "The Strongly Connecting Problem on Multihop Packet Radio Networks," IEEE Trans. Commun., vol 37, no 3, Oct. 1989, pp 203-95.
11. J. Wieselthier, G. Nguyen, and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Proc. IEEE Infocom, Tel Aviv, 2000, pp. 585-94.
12. A. Clementi et al., "On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs, 18th Annual Symp. Theoretical Aspects of Computer Science, LNCS 2010, 2001, pp. 121-31.
13. P. J. Wan et al., "Minimum Energy Broadcast Routing in Static Ad Hoc Wireless Networks," Wireless Networks, vol 8, 2002, pp 607-17.
14. I. Chlamtac, M. Conti, and J. J. N. Liu, "Mobile Ad Hoc Networking: Imperatives and Challenges," Ad Hoc Networks 1, 2003, pp. 13-64.