Building a reference combinatorial model for MANETs
Top Cited Papers
- 4 October 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 18 (5) , 24-29
- https://doi.org/10.1109/mnet.2004.1337732
Abstract
Wireless technologies and the deployment of mobile and nomadic services are driving the emergence of complex ad hoc networks that have a highly dynamic behavior. Modeling such dynamics and creating a reference model on which results could be compared and reproduced, was stated as a fundamental issue by a recent NSF workshop on networking. In this article we show how the modeling of time-changes unsettles old questions and allows for new insights into central problems in networking, such as routing metrics, connectivity, and spanning trees. Such modeling is made possible through evolving graphs, a simple combinatorial model that helps capture the behavior or dynamic networks over time.Keywords
This publication has 9 references indexed in Scilit:
- Mobile ad hoc networking: imperatives and challengesAd Hoc Networks, 2003
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKSInternational Journal of Foundations of Computer Science, 2003
- Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic NetworksPublished by Springer Nature ,2003
- On the construction of energy-efficient broadcast and multicast trees in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Handbook of Wireless Networks and Mobile ComputingPublished by Wiley ,2002
- Minimum-Energy Broadcasting in Static Ad Hoc Wireless NetworksWireless Networks, 2002
- MeritPublished by Association for Computing Machinery (ACM) ,2001
- The strongly connecting problem on multihop packet radio networksIEEE Transactions on Communications, 1989
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958